POLLING SYSTEMS - APPLICATIONS, MODELING, AND OPTIMIZATION

被引：194

作者：

LEVY, H ^{[1
]}

SIDI, M ^{[1
]}

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1990年 / 38卷 / 10期

关键词：

D O I：

10.1109/26.61446

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

The cyclic polling model, its enhancement by customer routing, and the replacement of a fixed polling order by a random polling order are reviewed. Modeling of polling systems, performance improvement, and system optimization issues are discussed. Examples are given that include token rings, ARQ and time-sharing schemes, random-access protocols, robotics, and manufacturing systems. Emphasis is not on the analytical derivations of polling systems but rather on the description of the capabilities and limitations of the different polling models.

引用

页码：1750 / 1760

页数：11

共 77 条

[1]

ABRAMSON N, 1970, 1970 P FALL JOINT CO, P17

[2]

ALFORD M, 1975, 4TH TEX C COMP SYST

[3] POLLING WITH A GENERAL-SERVICE ORDER TABLE [J].

BAKER, JE ;

RUBIN, I .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1987, 35 (03) :283-288

[4] K COMPETING QUEUES WITH GEOMETRIC SERVICE REQUIREMENTS AND LINEAR COSTS - THE MU-C-RULE IS ALWAYS OPTIMAL [J].

BARAS, JS ;

MA, DJ ;

MAKOWSKI, AM .

SYSTEMS & CONTROL LETTERS, 1985, 6 (03) :173-180

[5] 2 COMPETING QUEUES WITH LINEAR COSTS AND GEOMETRIC SERVICE REQUIREMENTS - THE MU-C-RULE IS OFTEN OPTIMAL [J].

BARAS, JS ;

DORSEY, AJ ;

MAKOWSKI, AM .

ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :186-209

[6]

BLANC JPC, 1990, IN PRESS QUEUEING SY, V6

[7]

Boxma O.J., 1989, OPTIMIZATION POLLING

[8] WAITING-TIME APPROXIMATIONS FOR CYCLIC-SERVICE SYSTEMS WITH SWITCHOVER TIMES [J].

BOXMA, OJ ;

MEISTER, BW .

PERFORMANCE EVALUATION, 1987, 7 (04) :299-308

[9]

BOXMA OJ, 1990, PERFORMANCE 90, P349

[10] PSEUDO-CONSERVATION LAWS IN CYCLIC-SERVICE SYSTEMS [J].

BOXMA, OJ ;

GROENENDIJK, WP .

JOURNAL OF APPLIED PROBABILITY, 1987, 24 (04) :949-964

← 1 2 3 4 5 6 7 8 →