Adaptive Path Isolation for Elephant and Mice Flows by Exploiting Path Diversity in Datacenters
文献类型：期刊论文
| 作者 | Wang, Wei1,2,3; Sun, Yi2,4; Salamatian, Kave5; Li, Zhongcheng6 |
| 刊名 | IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT
 |
| 出版日期 | 2016-03-01 |
| 卷号 | 13期号:1页码:5-18 |
| 关键词 | Data center network multipath path partition flow scheduling |
| ISSN号 | 1932-4537 |
| DOI | 10.1109/TNSM.2016.2517087 |
| 英文摘要 | Resource competition and conflicts in datacenter networks (DCNs) are frequent and intense. They become inevitable when mixing elephant and mice flows on shared transmission paths, resulting in arbitration between throughput and latency and performance degradation. We propose a novel flow scheduling scheme, Freeway, that leverages on path diversity in the DCN topology to guarantee, simultaneously, mice flow completion within deadline and high network utilization. Freeway adaptively partitions the available paths into low latency and high throughput paths and provides different transmission services for each category. AM/G/1-based model is developed to theoretically obtain the highest value of average delay over the path that will guarantee for 99% of mice flows their completion time before the deadline. Based on this bound, Freeway proposes a dynamic path partitioning algorithm to adjust dynamically with varying traffic load the number of low latency and high throughput paths. While mice flows are transmitted over low latency paths using a simple equal cost multiple path (ECMP) scheduling, Freeway load balances elephant flows on different high-throughput paths. We evaluate Freeway in a series of simulation on a large scale topology and use real traces. Our evaluation results show that Freeway significantly reduces the mice flows completion time within deadlines, while achieving remarkable throughput compared with current schemes. It is remarkable that Freeway does not need any change of DCN switch fabrics or scheduling algorithms and can be deployed easily on any generic datacenter network with switches implementing VLANs and trunking. |
| WOS研究方向 | Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000372652600001 |
| 出版者 | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC |
| 源URL | [http://119.78.100.204/handle/2XEOYT63/8689]  |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 通讯作者 | Wang, Wei |
| 作者单位 | 1.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China 2.Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China 3.Univ Chinese Acad Sci, Beijing 100049, Peoples R China 4.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China 5.Univ Savoie, PolytechAnnecy Chambery Dept, F-74000 Annecy, France 6.Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Wang, Wei,Sun, Yi,Salamatian, Kave,et al. Adaptive Path Isolation for Elephant and Mice Flows by Exploiting Path Diversity in Datacenters[J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT,2016,13(1):5-18. |
| APA | Wang, Wei,Sun, Yi,Salamatian, Kave,&Li, Zhongcheng.(2016).Adaptive Path Isolation for Elephant and Mice Flows by Exploiting Path Diversity in Datacenters.IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT,13(1),5-18. |
| MLA | Wang, Wei,et al."Adaptive Path Isolation for Elephant and Mice Flows by Exploiting Path Diversity in Datacenters".IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 13.1(2016):5-18. |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。