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 条

[11] WORKLOADS AND WAITING-TIMES IN SINGLE-SERVER SYSTEMS WITH MULTIPLE CUSTOMER CLASSES [J].

BOXMA, OJ .

MATHEMATICAL THEORY OF QUEUEING SYSTEMS, 1989, 5 :185-214

[12]

BOXMA OJ, 1989, WAITING TIMES POLLIN

[13]

BOXMA OJ, IN PRESS IEEE T COMM

[14]

BOXMA OJ, PERFORMANCE 84, P409

[15] DYNAMIC PRIORITY RULES FOR CYCLIC-TYPE QUEUES [J].

BROWNE, S ;

YECHIALI, U .

ADVANCES IN APPLIED PROBABILITY, 1989, 21 (02) :432-450

[16] LOCAL-AREA SUB-NETWORKS - A PERFORMANCE COMPARISON [J].

BUX, W .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (10) :1465-1473

[17] THE C-MU RULE REVISITED [J].

BUYUKKOC, C ;

VARAIYA, P ;

WALRAND, J .

ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :237-238

[18] TREE ALGORITHMS FOR PACKET BROADCAST CHANNELS [J].

CAPETANAKIS, JI .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (05) :505-515

[19] SIMPLIFIED ANALYSIS OF SCAN TIMES IN AN ASYMMETRICAL NEWHALL LOOP WITH EXHAUSTIVE SERVICE [J].

CARSTEN, RT ;

NEWHALL, EE ;

POSNER, MJM .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (09) :951-957

[20]

Coffman E., 1987, P 12 IFIP WG 7 3 INT, P227

← 1 2 3 4 5 6 7 8 →