TY - JOUR

T1 - A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems

AU - Levy, Hanoch

PY - 1991/8

Y1 - 1991/8

N2 - Several numerical methods have been proposed in the past for calculating the expected delay in non-symmetric polling systems. However, despite the size of the corresponding numerical problems, very little effort has been devoted to analyzing the overall computational complexity of these methods. As a result, the range of practical applicability of these methods and their relative efficiency are unknown. In this note we analyze Swartz's method for computing the expected delay in the discrete time, cyclic polling, exhaustive service system. We show that the method forms a contraction mapping and, therefore, the number of iterations it requires is logarithmic in the accuracy required. The overall complexity of the method to compute the expected delay for one station is O(N logα2 ε), where N is the number of stations, ε is the accuracy required and α2 depends on the system parameters. The results suggest that, for a wide range of parameters, the approach is the best one known today for computing the expected delay in polling systems, especially if not all N expected delay figures are required. Practical experience shows that the method can be easily used to solve systems with 500 stations or more. Unfortunately, the approach has been used only to analyze a single polling system. We therefore conclude that it is desirable to apply the approach to other variations of polling systems.

AB - Several numerical methods have been proposed in the past for calculating the expected delay in non-symmetric polling systems. However, despite the size of the corresponding numerical problems, very little effort has been devoted to analyzing the overall computational complexity of these methods. As a result, the range of practical applicability of these methods and their relative efficiency are unknown. In this note we analyze Swartz's method for computing the expected delay in the discrete time, cyclic polling, exhaustive service system. We show that the method forms a contraction mapping and, therefore, the number of iterations it requires is logarithmic in the accuracy required. The overall complexity of the method to compute the expected delay for one station is O(N logα2 ε), where N is the number of stations, ε is the accuracy required and α2 depends on the system parameters. The results suggest that, for a wide range of parameters, the approach is the best one known today for computing the expected delay in polling systems, especially if not all N expected delay figures are required. Practical experience shows that the method can be easily used to solve systems with 500 stations or more. Unfortunately, the approach has been used only to analyze a single polling system. We therefore conclude that it is desirable to apply the approach to other variations of polling systems.

KW - cyclic polling

KW - delay computation

UR - http://www.scopus.com/inward/record.url?scp=50749135582&partnerID=8YFLogxK

U2 - 10.1016/0167-6377(91)90009-E

DO - 10.1016/0167-6377(91)90009-E

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:50749135582

SN - 0167-6377

VL - 10

SP - 363

EP - 368

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -