论文信息 - Investigation of Ethernet switches behavior in presence of contending flows at very high-speed

Investigation of Ethernet switches behavior in presence of contending flows at very high-speed

This paper examines the interactions between layer 2 (Ethernet) switches and TCP in high bandwidth delay product networks. First, the behavior of a range of Ethernet switches when two long lived connections compete for the same output port is investigated. Then, the report explores the impact of these behaviors on TCP protocol in long and fast networks (LFNs). Several conditions in which scheduling mechanisms introduce heavy unfair bandwidth sharing and loss burst which impact TCP performance are shown.

[1] Ryousei Takano,et al. Design and Evaluation of Precise Software Pacing Mechanisms for Fast Long-Distance Networks , 2005 .

[2] Thomas E. Anderson,et al. High-speed switch scheduling for local-area networks , 1993, TOCS.

[3] Nick McKeown,et al. A Quantitative Comparison of Iterative Scheduling Algorithms for Input-Queued Switches , 1998, Comput. Networks.

[4] David R. Kaeli,et al. Parallel maximum weight bipartite matching algorithms for scheduling in input-queued switches , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[5] Y. Raghu Reddy,et al. Web100: extended TCP instrumentation for research, education and diagnosis , 2003, CCRV.

[6] Injong Rhee,et al. Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

[7] Yuetsu Kodama,et al. GNET-1: gigabit Ethernet network testbed , 2004, 2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935).

[8] Hao Jiang,et al. The origin of TCP traffic burstiness in short time scales , 2004 .

[9] Nick McKeown,et al. The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[10] George Varghese,et al. Network Algorithmics-An Interdisciplinary Approach to Designing Fast Networked Devices , 2004 .

[11] Jonathan S. Turner,et al. Link buffer sizing: a new look at the old problem , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).