@inproceedings{oai:muroran-it.repo.nii.ac.jp:00008898,
 author = {WANG, Fuguang and QIAN, Zhuzhong and ZHANG, Sheng and DONG,  Mianxiong and 董, 冕雄 and LU, Sanglu},
 book = {2015 IEEE International Conference on Communications (ICC)},
 month = {},
 note = {application/pdf, To improve users' experience, TCP short flows that are heavily used in interactive services should be completed as soon as possible. In current data centers, large flows and head-of-line blocking in switches hinder short flows from completion, which leads to long-tailed flow completion times (FCT). Replicating short flows with multiple equal-cost paths is a promising way to reduce FCT. However, the original flow and its replicated one are quite likely to be routed to the same path (ECMP hash collision), which increases both the mean and 99-percentile FCT significantly. What's more, inadequate replication leaves many other less-congested equal-cost paths unused and limits the performance while excess replication degrades throughput of large flows. To solve these problems, we propose SmartRep, a scheme consisting of an efficient and effective traceroute based hash collision avoidance method and an algorithm to decide the optimal number of replicated flows for different short flows. SmartRep can be easily implemented in software and readily deployed in data centers. Extensive NS2 simulations show that our approach improves previous replication-based work by 25%-50% in both mean and 99th percentile FCT, and meanwhile imposes negligible impact on large flows., Date of Conference: 8-12 June 2015, Conference Location: London},
 pages = {460--465},
 publisher = {IEEE},
 title = {SmartRep: Reducing Flow Completion Times with Minimal Replication in Data Centers},
 year = {2015},
 yomi = {トウ, メンユウ}
}