TCP-NC的吞吐量分析模型

Xiang Lan, Shuang Li, Rui Zhang, Chunnan Han, Sanfeng Zhang
{"title":"TCP-NC的吞吐量分析模型","authors":"Xiang Lan, Shuang Li, Rui Zhang, Chunnan Han, Sanfeng Zhang","doi":"10.1109/WCNC.2014.6952828","DOIUrl":null,"url":null,"abstract":"Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is the novel definition for the states of Markov chain. It substantially reduces related states and much lower complexity is obtained. Our work helps understand the factors that affect TCP-NC's performance and lay the foundation of optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analytic throughput model for TCP-NC\",\"authors\":\"Xiang Lan, Shuang Li, Rui Zhang, Chunnan Han, Sanfeng Zhang\",\"doi\":\"10.1109/WCNC.2014.6952828\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is the novel definition for the states of Markov chain. It substantially reduces related states and much lower complexity is obtained. Our work helps understand the factors that affect TCP-NC's performance and lay the foundation of optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.\",\"PeriodicalId\":220393,\"journal\":{\"name\":\"2014 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2014.6952828\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2014.6952828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

网络编码提高了TCP在有损无线网络中的性能。然而,网络编码TCP (TCP- nc)复杂的拥塞窗口演变给端到端吞吐量分析带来了挑战。本文分析了TCP-NC对有损链路的演化过程。应用二维马尔可夫链建立了解析模型。该分析模型以最大窗口大小、端到端擦除率和冗余参数为输入参数,能够准确地反映窗口的演变,计算出TCP-NC的端到端吞吐量。该模型的关键是对马尔可夫链状态的新定义。它大大减少了相关状态,大大降低了复杂性。我们的工作有助于了解影响TCP-NC性能的因素,为优化奠定基础。在NS2上的大量仿真表明,解析模型具有较高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Analytic throughput model for TCP-NC
Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is the novel definition for the states of Markov chain. It substantially reduces related states and much lower complexity is obtained. Our work helps understand the factors that affect TCP-NC's performance and lay the foundation of optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Performance analysis of general order selection in decentralized cognitive radio networks Performance of maximum-largest weighted delay first algorithm in long term evolution-advanced with carrier aggregation Distributed space-time codes for amplify-and-forward relaying networks Novel modulation detection scheme for underwater acoustic communication signal through short-time detailed cyclostationary features Relay selection and power allocation with minimum rate guarantees for cognitive radio systems
×
引用
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