TY - GEN
T1 - Polling systems with correlated arrivals
AU - Levy, Hanoch
AU - Sidi, Moshe
PY - 1989
Y1 - 1989
N2 - In this paper we analyze polling systems with correlated arrivals, namely, the arrival processes of customers to the queues are not assumed to be independent. We consider cyclic polling systems with N queues, general service time distribution in each queue and general switch-over times. For both the exhaustive and the gated service disciplines we derive the necessary equations for computing the N expected waiting time figures. A "pseudo" conservation law for these systems is also derived. The analysis approach can be applied to other polling systems with correlated arrivals.
AB - In this paper we analyze polling systems with correlated arrivals, namely, the arrival processes of customers to the queues are not assumed to be independent. We consider cyclic polling systems with N queues, general service time distribution in each queue and general switch-over times. For both the exhaustive and the gated service disciplines we derive the necessary equations for computing the N expected waiting time figures. A "pseudo" conservation law for these systems is also derived. The analysis approach can be applied to other polling systems with correlated arrivals.
UR - http://www.scopus.com/inward/record.url?scp=0024860920&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.1989.101541
DO - 10.1109/INFCOM.1989.101541
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0024860920
SN - 0818619201
SN - 9780818619205
T3 - Proceedings - IEEE INFOCOM
SP - 907
EP - 913
BT - IEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies
T2 - 8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89
Y2 - 23 April 1989 through 27 April 1989
ER -