Abstract
Abstract A Fat-Tree topology has multiple paths between any pair of hosts. The delay for the multiple paths with an equal number of hops depends mainly on the queuing delay. However, most of the existing load-balancing schemes do not sufficiently exploit the characteristics of Fat-Tree. In most schemes load-balancing is performed at a flow level. Packet-level load-balancing schemes usually require the availability of special transport layer protocols to address packet reordering. In this paper, we propose a new packet-level load-balancing scheme which can enhance network utilization while minimizing packet reordering in Fat-Trees. Simulation results show that the proposed scheme provides as high TCP throughput as a randomized flow-level Valiant load balancing scheme for a best case. Key Words : data center network, fat-tree, TCP, packet reordering, load balancing * 정회원, 홍익대학교 컴퓨터정보통신공학과접수일자 : 2013년 2월 15일, 수정완료 : 2013년 3월 15일게재확정일자 : 2013년 4월 12일Received: 15 February 2013 / Revised: 15 March 2013 /Accepted: 12 April 2013
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
