Telecommunications: local area networks
I'm interested in the performance evaluation of token-ring local area networks. These networks have often been modeled by ``polling systems" in which a single server moves cyclically between queues; the average throughput, delay, cycle time duration etc. for polling systems have been analyzed for Poisson input processes. Local-area networks are, however, more complex. They involve time constraints for asynchronous traffic, and the Poisson assumption on the arrival process is often unrealistic. This poses an interesting challenge in the analysis of local area networks based on token-ring protocols.
E. Altman and Z. Liu
,
Improving the stability characteristics of asynchronous traffic in FDDI token rings
,
Performance Evaluation,
Vol. 26, pp. 219-234, 1996.
E. Altman, S. Foss, E. Riehl, S. Stidham,
Sample path analysis of token rings,
The Fundamental Role of Teletraffic in the
Evolution of Telecommunications Networks,
Proceedings of the 14th International Teletraffic Congress
,
Antibes Juan-les-Pins, France, June,
pp. 811-820, 1994.
E. Altman,
Analysing timed-token ring protocols using the Power Series Algorithm,
The Fundamental Role of Teletraffic in the
Evolution of Telecommunications Networks, Proceedings of the 14th International Teletraffic Congress
,
Antibes Juan-les-Pins, France, June,
pp. 961-971, 1994.
E. Altman and D. Kofman,
Bounds for Performance Measures of Token Rings,
IEEE/ACM Transactions on Networking, pp. 292-299,
April, 1996.
O. Sharon and E. Altman,
On efficient polling MAC for wireless LANs,
IEEE/ACM Transactions on Networking,
Volume 9, Number 4, August, 2001.
Polling systems
Back to my Web page .