By Topic

Analysis of an open tandem queueing network with population constraint and constant service times

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yong Rhee ; Center for Commun. & Signal Process., North Carolina State Univ., Raleigh, NC, USA ; Perros, H.G.

We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network cannot exceed a given value K. Customers arriving at the queueing network when there are more than K customers are forced to wait in an external queue. The arrival process to the queueing network is assumed to be arbitrary. We show that this queueing network can be transformed into a simple network involving only two nodes. We obtain an upper and lower bound on the mean waiting time. Validations against simulation data establish the tightness of these bounds

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1995. MASCOTS '95., Proceedings of the Third International Workshop on

Date of Conference:

18-20 Jan 1995