使用ACC方案的ecmp上的流量分割

Wei Lin, Yi Tang, Bin Liu
{"title":"使用ACC方案的ecmp上的流量分割","authors":"Wei Lin, Yi Tang, Bin Liu","doi":"10.1109/CHINACOM.2006.344703","DOIUrl":null,"url":null,"abstract":"In order to reduce network congestion, when equal-cost-multi-paths (ECMPs) are between a forwarding node and a destination subnet, traffic should be balanced among ECMPs and packets of the same TCP flow should reach destination host in the same order. An algorithm called ARC-based caching with counting (ACC) is proposed. Packet length differentiation is considered to achieve load balance. UDP packets are only concerned to achieve load balance. Furthermore, flow access recency and frequency are considered when redirecting a flow to a new path. Simulation shows that when delay differentiation among ECMPs is not significant, storage requirement is small, only one cycle is needed for each cache lookup, load balance is near optimal, and only 1% of packets are out of order.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Traffic Splitting over ECMPs using ACC Scheme\",\"authors\":\"Wei Lin, Yi Tang, Bin Liu\",\"doi\":\"10.1109/CHINACOM.2006.344703\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to reduce network congestion, when equal-cost-multi-paths (ECMPs) are between a forwarding node and a destination subnet, traffic should be balanced among ECMPs and packets of the same TCP flow should reach destination host in the same order. An algorithm called ARC-based caching with counting (ACC) is proposed. Packet length differentiation is considered to achieve load balance. UDP packets are only concerned to achieve load balance. Furthermore, flow access recency and frequency are considered when redirecting a flow to a new path. Simulation shows that when delay differentiation among ECMPs is not significant, storage requirement is small, only one cycle is needed for each cache lookup, load balance is near optimal, and only 1% of packets are out of order.\",\"PeriodicalId\":408368,\"journal\":{\"name\":\"2006 First International Conference on Communications and Networking in China\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 First International Conference on Communications and Networking in China\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CHINACOM.2006.344703\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 First International Conference on Communications and Networking in China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CHINACOM.2006.344703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了减少网络拥塞,当转发节点和目的子网之间存在ecmp (equal-cost-multi-paths)时,要求流量在ecmp之间均衡,使同一TCP流的报文以相同的顺序到达目的主机。提出了一种基于arc的缓存计数算法(ACC)。数据包长度区分被认为是实现负载均衡。只关注UDP报文,实现负载均衡。此外,在将流重定向到新路径时,还考虑了流访问的近时性和频率。仿真结果表明,当ecmp之间的延迟差异不显著时,存储需求较小,每次缓存查找只需要一个周期,负载平衡接近最优,只有1%的数据包是无序的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Traffic Splitting over ECMPs using ACC Scheme
In order to reduce network congestion, when equal-cost-multi-paths (ECMPs) are between a forwarding node and a destination subnet, traffic should be balanced among ECMPs and packets of the same TCP flow should reach destination host in the same order. An algorithm called ARC-based caching with counting (ACC) is proposed. Packet length differentiation is considered to achieve load balance. UDP packets are only concerned to achieve load balance. Furthermore, flow access recency and frequency are considered when redirecting a flow to a new path. Simulation shows that when delay differentiation among ECMPs is not significant, storage requirement is small, only one cycle is needed for each cache lookup, load balance is near optimal, and only 1% of packets are out of order.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信