论文信息 - Blocking, reordering, and the throughput of a series of servers

Blocking, reordering, and the throughput of a series of servers

A sequence of jobs is to be processed by a series of servers. The lengths of successive jobs are independent random variables, and the service time of a given job is the same at each server and equal to the job's length. There is no storage space available between servers, and so blockages may arise. This paper investigates the effect of reordering the sequence of jobs on the throughput of the system.

Frank Kelly | F. Kelly

[1] J. Kingman. Subadditive Ergodic Theory , 1973 .

[2] Tayfur M. Altiok,et al. Approximate analysis of exponential tandem queues with blocking , 1982 .

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] S. Calo. Message Delays in Repeated-Service Tandem Connections , 1981, IEEE Trans. Commun..

[5] O. J. Boxma,et al. Two identical communication channels in series with a finite intermediate buffer and overflow , 1984 .

[6] F. Kelly. The throughput of a series of buffers , 1982, Advances in Applied Probability.

[7] James Pickands,et al. Moment Convergence of Sample Extremes , 1968 .