By Topic

Teaching M/G/1 theory with extension to priority queues

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 $31
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)
Harrison, P.O. ; Dept. of Comput., Imperial Coll. of Sci., Technol. & Med., London, UK

The derivation of sojourn time distribution is easily understood in M/M/1 queues in terms of numbers of service completions, using the random observer property. The same approach does not generalise directly to the M/G/1 queue because of a subtle dependence between the random variables involved, and an entirely different approach is usually taught in most courses on queueing theory. The M/M/1 approach to the M/G/1 case is applied by accounting for the dependence explicitly. The method then extends simply to M/G/1 queues with priority classes. Although the results themselves are not new, it is believed that the approach used is illuminating, constructive to consistent teaching of the subject and facilitates a concise treatment of priority queues

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:147 ,  Issue: 1 )