Close category search window
 

A single-server discrete-time queueing system: with and without priorities

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)
Kim, B.G. ; Dept. of Comput. Sci., Lowell Univ., MA, USA

Studies queue length distributions in a discrete-time system with general arrival processes and with priorities (nonpreemptive and preemptive resume) as well as without priorities (FCFS). For a FCFS system, queue lengths at various measurement instants are compared: at random, service beginning and service departure instants. It is shown that the expected queue lengths at departure and random instants are not identical in general

Published in:
Global Telecommunications Conference, 1988, and Exhibition. 'Communications for the Information Age.' Conference Record, GLOBECOM '88., IEEE

Date of Conference: 28 Nov-1 Dec 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.