TY - GEN
T1 - Efficient analysis of polling systems
AU - Konheim, Alan G.
AU - Levy, Hanoch
PY - 1992
Y1 - 1992
N2 - A large variety of computer communications systems, in particular the token ring network, are modeled and analyzed as polling systems. The authors present the descendant set approach as a general efficient algorithm for deriving all moments of packet delay (in particular, mean delay) in these systems. The method can apply to a very large variety of model variations including: the exhaustive, gated, and fractional service policies; the cyclic visit order; arbitrary periodic visit orders, (polling tables); random polling orders; and customer routing. For most variations the method significantly outperforms the algorithms commonly used.
AB - A large variety of computer communications systems, in particular the token ring network, are modeled and analyzed as polling systems. The authors present the descendant set approach as a general efficient algorithm for deriving all moments of packet delay (in particular, mean delay) in these systems. The method can apply to a very large variety of model variations including: the exhaustive, gated, and fractional service policies; the cyclic visit order; arbitrary periodic visit orders, (polling tables); random polling orders; and customer routing. For most variations the method significantly outperforms the algorithms commonly used.
UR - http://www.scopus.com/inward/record.url?scp=0026973505&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.1992.263522
DO - 10.1109/INFCOM.1992.263522
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0026973505
SN - 0780306023
SN - 9780780306028
T3 - Proceedings - IEEE INFOCOM
SP - 2325
EP - 2331
BT - Proceedings - IEEE INFOCOM'92
T2 - 11th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'92
Y2 - 6 May 1992 through 8 May 1992
ER -