Research: An exact analysis of an asymmetric polling system with mixed service discipline and general service order

Authors:
Lain-Chyr Hwang;Chung-Ju Chang
Affiliations:
Department of Communication Engineering and Center for Telecommunications Research, National Chiao Tung University, Hsinchu, Taiwan 300, Republic of China;Department of Communication Engineering and Center for Telecommunications Research, National Chiao Tung University, Hsinchu, Taiwan 300, Republic of China
Venue:
Computer Communications
Year:
1997

Citing 3
Cited 1

Expected waiting time for nonsymmetric cyclic queueing systems—exact results and applications

Management Science
The use of service limits for efficient operation of multistation single-medium communication systems

IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

A New Scheduler for AF and EF in a DS Node

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper derives the exact mean waiting time for an asymmetric polling system with general service order and mixed service discipline. The mixed service discipline means that the service discipline of each stage (a turn in the service order sequence) for the same station can be gated or exhaustive. The general service order denotes that each station can be polled more than once in a polling cycle. We use the mean age and the mean excess of a cumulative time to obtain the mean waiting times for stages and stations, where the cumulative time for a stage is defined as the total arrival time period of all customers that are served at one visit of the server to the stage. The accuracy of our analysis is verified by comparisons with previously published results and simulation results. We also use a genetic algorithm (GA) to search for an optimal pattern of service order and service discipline for the asymmetrical polling system. The results of the paper can be applied to the design of computer communication networks with polling schemes.