Fast Mice And Slow Elephant Load Balancing Strategy For Datacenter Network
碩士 === 國立中央大學 === 資訊工程學系 === 107 === In modern datacenter network, mice flows are big part in overall traffic. Most load balancing algorithm give the same priority to mice flow and elephant flow while making load balance decision. Even mice flow have small flow completion time. Such equal priority s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/au42j9 |
| Summary: | 碩士 === 國立中央大學 === 資訊工程學系 === 107 === In modern datacenter network, mice flows are big part in overall traffic. Most load balancing algorithm give the same priority to mice flow and elephant flow while making load balance decision. Even mice flow have small
flow completion time. Such equal priority strategy let mice flow take more time to transmit a single packet than elephant flow. In this paper, we propose a fast mice and slow elephant load balancing algorithm which can first
locate elephant flow overuse uncongested route by factors affect flowlet size and elephant flows are abusing uncongested path are routed to congested path
to improve the imbalance between mice flow and elephant flow and further increase the throughput of mice flow.
|
|---|