WAITING-TIMES IN DISCRETE-TIME CYCLIC-SERVICE SYSTEMS

被引：51

作者：

BOXMA, OJ ^{[1
]}

GROENENDIJK, WP ^{[1
]}

机构：

[1] TILBURG UNIV,OPERAT RES,5000 LE TILBURG,NETHERLANDS

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1988年 / 36卷 / 02期

关键词：

PROBABILITY - Queueing Theory - SWITCHING SYSTEMS;

D O I：

10.1109/26.2746

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Single-server, multiqueue systems with cyclic service in discrete time are considered. Nonzero switchover times between consecutive queues are assumed; the service strategies at the various queues may differ. A decomposition for the amount of work in such systems is obtained, leading to an exact expression for a weighted sum of the mean wating times at the various queues. The present paper is the companion paper to one by O. J. Boxma and W. P. Groenendijk (1987) in which the continuous-time case is treated.

引用

页码：164 / 170

页数：7

共 15 条

[1]

Boxma O. J., 1986, Performance Evaluation Review, V14, P254, DOI 10.1145/317531.317558

[2]

BOXMA OJ, 1986, OSR8606 CTR MATH COM

[3]

BOXMA OJ, 1987, J APPL PROB, V24

[4] EXACT RESULTS FOR NONSYMMETRIC TOKEN RING-SYSTEMS [J].