.png){kind=icon}
Return
Open Flow Based Flow Slice Load Balancing
.png){kind=icon}
PRE
AI
DOI：10.1109/CC.2014.7019842.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Today's data center networks are designed using densely interconnected hosts in the data center. There are multiple paths between source host and destination server. Therefore, how to balance traffic is key issue with the fast growth of network applications. Although lots of load balancing methods have been proposed, the traditional approaches cannot fully satisfy the requirement of load balancing in data center networks. The main reason is the lack of efficient ways to obtain network traffic statistics from each network device. As a solution, the Open Flow protocol enables monitoring traffic statistics by a centralized controller. However, existing solutions based on Open Flow present a difficult dilemma between load balancing and packet reordering. To achieve a balance between load balancing and packet reordering, we propose an Open Flow based flow slice load balancing algorithm. Through introducing the idea of differentiated service, the scheme classifies Internet flows into two categories: the aggressive and the normal, and applies different splitting granularities to the two classes of flows. This scheme improves the performance of load balancing and also reduces the number of reordering packets. Using the trace-driven simulations, we show that the proposed scheme gains over 50% improvement over previous schemes under the path delay estimation errors, and is a practical and efficient algorithm.
Keywords:
Open Flow
traffic splitting
load balancing
packet reordering
splitting granularity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
1.9K
Citations:
5.0K