论文信息 - Performance comparison of CSMA/RI and CSMA/CD with BEB

Performance comparison of CSMA/RI and CSMA/CD with BEB

We analyze our previously proposed protocol, CSMA/RI, and its closest related protocol, CSMA/CD. Our models include the widely used retransmission algorithm-the truncated binary exponential backoff (BEB) algorithm. The analysis is performed under two realistic traffic scenarios-the saturation and the disaster scenarios. The performance comparison of CSMA/RI and CSMA/CD is also presented. The analytic results are verified by simulations and are found to be accurate.

Moshe Zukerman | Chuan Heng Foh | M. Zukerman | C. Foh

[1] M. Molle. A New Binary Logarithmic Arbitration Method for Ethernet , 1994 .

[2] Walter Willinger,et al. On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[3] J. Little. A Proof for the Queuing Formula: L = λW , 1961 .

[4] Shang Zhi,et al. A proof of the queueing formula: L=λW , 2001 .

[5] Gordon Bell,et al. Ethernet: Distributed Packet Switching for Local Computer Networks , 1976 .

[6] Fouad A. Tobagi,et al. Performance Analysis of Carrier Sense Multiple Access with Collision Detection , 1980, Comput. Networks.

[7] Simon S. Lam,et al. A Carrier Sense Multiple Access Protocol for Local Networks , 1979, Comput. Networks.

[8] Moshe Zukerman,et al. Improving the efficiency of CSMA using reservations by interruptions , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.