Analysis of network of biserial queues linked with a common server
by Seema Sharma; Deepak Gupta; Sameer Sharma
International Journal of Computing Science and Mathematics (IJCSM), Vol. 5, No. 3, 2014

Abstract: This paper is an attempt to study the steady state analysis of a complex network of queues in which a common server is linked in series with each of two parallel biserial servers. The arrival and service pattern follows Poisson law. The generating function technique, law of calculus and statistical tools have been used to find the various queue characteristics. The model finds its application in decision making, in process industry, in banking system, in communication networking, in supermarkets, in healthcare centre and in many administrative setups. An algorithm is proposed to find the mean queue length of customers/jobs, variance of queues and average waiting time of customers/jobs. The performance of algorithm is assessed by a numerical illustration.

Online publication date: Sat, 27-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email