DocumentCode
3457594
Title
A single-server discrete-time queueing system: with and without priorities
Author
Kim, Byung G.
Author_Institution
Dept. of Comput. Sci., Lowell Univ., MA, USA
fYear
1988
fDate
28 Nov-1 Dec 1988
Firstpage
522
Abstract
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
Keywords
discrete time systems; queueing theory; arrival processes; measurement instants; preemptive resume; priorities; queue length distributions; queueing theory; random instants; service beginning; service departure instants; single-server discrete-time queueing system; Computer science; Data communication; Length measurement; Markov processes; Packet switching; Queueing analysis; Resumes; Statistics; Traffic control; Transportation;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1988, and Exhibition. 'Communications for the Information Age.' Conference Record, GLOBECOM '88., IEEE
Conference_Location
Hollywood, FL
Type
conf
DOI
10.1109/GLOCOM.1988.25896
Filename
25896
Link To Document