By Topic

Queue-length distributions for multi-priority queueing systems

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
$33 $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)
J. N. Daigle ; Mississippi Univ., MS, USA ; M. Roughan

The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queueing system with priorities. While the probability generating function (PGF) for the occupancy distribution of each traffic class can be readily obtained, the occupancy distributions have been obtainable only rarely. However, the occupancy distribution is of great importance, particularly in those cases where the moments are not all finite. We present a method of obtaining the occupancy distribution from the PGF and demonstrate its validity by obtaining the occupancy distributions for a number of cases, including those with regularly varying service time distributions

Published in:

INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:2 )

Date of Conference:

21-25 Mar 1999