By Topic

An approximation method for feedforward queueing networks with finite buffers a manufacturing perspective

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

1 Author(s)
Buyukkoc, C. ; AT&T Bell Laboratories Holmdel, N.J.

Queueing networks in wich the stations have finite buffers are found in models of complicated communications and manufacturing systems where an exact analysis is often formidable. We consider various queueing medels that can be used as building blocks in the approximate amlysis of some feed forward queueing networks. The basic model is a tandem configuration of queues with finite buffers in between. The arrivals to the first queue are a Poisson stream and the service times at the queues are expoentially distributed. There are finite buffers in between the queues and hence a blocking mechanism has to be enforced. We obtain approximatiom for average queue lengths at each queue and the stability condition for the network, We then consider severed extenions. Numerical examples comparing the approximate solutions to those obtained via simulation and exact methods show that the approximation is good for a broad range of parameters.

Published in:

Robotics and Automation. Proceedings. 1986 IEEE International Conference on  (Volume:3 )

Date of Conference:

Apr 1986