自适应显式拥塞通知

Zici Zheng, R. Kinicki
{"title":"自适应显式拥塞通知","authors":"Zici Zheng, R. Kinicki","doi":"10.1109/ISCC.2002.1021773","DOIUrl":null,"url":null,"abstract":"Using ns-2 simulations, this paper evaluates an adaptive explicit congestion notification (AECN) router. By receiving round-trip time (RTT) source hints from each TCP flow, AECN divides flows into flow groups based on RTT ranges. AECN uses distinct flow group drop probabilities and a mark front scheme to provide higher goodput and better fairness than random early detection (RED) and explicit congestion notification (ECN) routers.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Adaptive explicit congestion notification\",\"authors\":\"Zici Zheng, R. Kinicki\",\"doi\":\"10.1109/ISCC.2002.1021773\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Using ns-2 simulations, this paper evaluates an adaptive explicit congestion notification (AECN) router. By receiving round-trip time (RTT) source hints from each TCP flow, AECN divides flows into flow groups based on RTT ranges. AECN uses distinct flow group drop probabilities and a mark front scheme to provide higher goodput and better fairness than random early detection (RED) and explicit congestion notification (ECN) routers.\",\"PeriodicalId\":261743,\"journal\":{\"name\":\"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2002.1021773\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2002.1021773","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

利用ns-2仿真,对一种自适应显式拥塞通知(AECN)路由器进行了评估。AECN通过接收每个TCP流的往返时间(RTT)源提示,根据RTT范围将流划分为流组。与随机早期检测(RED)和显式拥塞通知(ECN)路由器相比,AECN使用不同的流组丢弃概率和标记前端方案提供更高的商品投放和更好的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Adaptive explicit congestion notification
Using ns-2 simulations, this paper evaluates an adaptive explicit congestion notification (AECN) router. By receiving round-trip time (RTT) source hints from each TCP flow, AECN divides flows into flow groups based on RTT ranges. AECN uses distinct flow group drop probabilities and a mark front scheme to provide higher goodput and better fairness than random early detection (RED) and explicit congestion notification (ECN) routers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
End-to-end quality of service in multi-class service high-speed networks via optimal least weight routing Using distributed component model for active service deployment Tunable fiber Bragg grating-based a pair of m-sequence coding for optical CDMA An integrated architecture for the scalable delivery of semi-dynamic Web content Scheduling constant bit rate flows in data over cable networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1