论文信息 - A single-server discrete-time queueing system: with and without priorities

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

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.<<ETX>>

ByungGuk Kim | B. Kim

[1] Hisashi Kobayashi,et al. Queueing Models for Computer Communications System Analysis , 1977, IEEE Trans. Commun..

[2] Donald F. Towsley,et al. On discrete-time queueing systems , 1979 .

[3] U. Narayan Bhat,et al. On Single-Server Bulk-Queuing Processes with Binomial Input , 1964 .

[4] T. Meisling. Discrete-Time Queuing Theory , 1958 .

[5] B. A. Powell,et al. Queuing Systems with Enforced Idle Time , 1967, Oper. Res..

[6] John S. Griffin,et al. A Discrete Queueing Problem with Variable Service Times , 1962, IBM J. Res. Dev..

[7] D. C. Kleinecke,et al. Discrete Time Queues at a Periodic Traffic Light , 1964 .

[8] Marcel F. Neuts,et al. A SINGLE SERVER QUEUE IN DISCRETE TIME. , 1969 .

[9] Do Le Minh,et al. The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution , 1978, Journal of Applied Probability.

[10] Carl M. Harris,et al. Approximation with generalized hyperexponential distributions: Weak convergence results , 1986, Queueing Syst. Theory Appl..

[11] D. W. Balmer. A single server queue in discrete time with customers served in random order , 1972 .

[12] B. Avi-Itzhak,et al. Car Pool Systems in Railroad Transportation: Mathematical Models , 1967 .