Transition from Heavy to Light Tails in Retransmission Durations

Jian Tan, N. Shroff
{"title":"Transition from Heavy to Light Tails in Retransmission Durations","authors":"Jian Tan, N. Shroff","doi":"10.1109/INFCOM.2010.5461910","DOIUrl":null,"url":null,"abstract":"Retransmissions serve as the basic building block that communication protocols use to achieve reliable data transfer. Until recently, the number of retransmissions were thought to follow a light tailed (in particular, a geometric) distribution. However, recent work seems to suggest that when the distribution of the packets have infinite support, retransmission-based protocols may result in heavy tailed delays and even possibly zero throughput. While this result is true even when the distribution of packet sizes are light-tailed, it requires the assumption that the packet sizes have infinite support. However, in reality, packet sizes are often bounded by the Maximum Transmission Unit (MTU), and thus the aforementioned result merits a deeper investigation. To that end, in this paper, we allow the distribution of the packet size L to have finite support. This packet is sent over an on-off channel {(A_i,U_i)} with alternating available A_i and unavailable U_i periods. If L≥A_i, the transmission fails and we wait for the next period A_(i+1) to retransmit the packet. The transmission duration is thus measured from the first attempt to a point when a channel available period larger than L. Under mild conditions, we show that the transmission duration distribution exhibits a transition from a power law main body to an exponential tail with Weibull type distributions between the two. The time scale to observe the power law main body is roughly equal to the average transmission duration of the longest packet. Both the power law main body and the exponential tail could dominate the overall performance. For example, the power law main body, if significant, may cause the channel throughput to be very close to zero. On the other hand, the exponential tail, if more evident, may imply that the system operates in a benign environment. These theoretical findings provide an understanding on why some empirical measurements suggest heavy tails and light tails for others (e.g., wireless networks). We use these results to further highlight the engineering implications from distributions with power law main bodies and light tails by analyzing two cases: (1) The throughput of on-off channels with retransmissions, where we show that even when packet sizes have small means and bounded support the variability in their sizes can greatly impact system performance. (2) The distribution of the number of jobs in an M/M/∞ queue with server failures. Here we show that retransmissions can cause long-range dependence and quantify the impact of the maximum job sizes on the long-range dependence.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Proceedings IEEE INFOCOM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2010.5461910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

Abstract

Retransmissions serve as the basic building block that communication protocols use to achieve reliable data transfer. Until recently, the number of retransmissions were thought to follow a light tailed (in particular, a geometric) distribution. However, recent work seems to suggest that when the distribution of the packets have infinite support, retransmission-based protocols may result in heavy tailed delays and even possibly zero throughput. While this result is true even when the distribution of packet sizes are light-tailed, it requires the assumption that the packet sizes have infinite support. However, in reality, packet sizes are often bounded by the Maximum Transmission Unit (MTU), and thus the aforementioned result merits a deeper investigation. To that end, in this paper, we allow the distribution of the packet size L to have finite support. This packet is sent over an on-off channel {(A_i,U_i)} with alternating available A_i and unavailable U_i periods. If L≥A_i, the transmission fails and we wait for the next period A_(i+1) to retransmit the packet. The transmission duration is thus measured from the first attempt to a point when a channel available period larger than L. Under mild conditions, we show that the transmission duration distribution exhibits a transition from a power law main body to an exponential tail with Weibull type distributions between the two. The time scale to observe the power law main body is roughly equal to the average transmission duration of the longest packet. Both the power law main body and the exponential tail could dominate the overall performance. For example, the power law main body, if significant, may cause the channel throughput to be very close to zero. On the other hand, the exponential tail, if more evident, may imply that the system operates in a benign environment. These theoretical findings provide an understanding on why some empirical measurements suggest heavy tails and light tails for others (e.g., wireless networks). We use these results to further highlight the engineering implications from distributions with power law main bodies and light tails by analyzing two cases: (1) The throughput of on-off channels with retransmissions, where we show that even when packet sizes have small means and bounded support the variability in their sizes can greatly impact system performance. (2) The distribution of the number of jobs in an M/M/∞ queue with server failures. Here we show that retransmissions can cause long-range dependence and quantify the impact of the maximum job sizes on the long-range dependence.
重传持续时间从重尾到轻尾的转换
重传是通信协议用来实现可靠数据传输的基本构件。直到最近,重传的数量被认为遵循轻尾(特别是几何)分布。然而,最近的研究似乎表明,当数据包的分发具有无限支持时,基于重传的协议可能导致严重的尾部延迟,甚至可能导致零吞吐量。虽然这个结果即使在包大小的分布是轻尾的情况下也是正确的,但它需要假设包大小有无限的支持。然而,在现实中,数据包的大小通常受到最大传输单元(MTU)的限制,因此上述结果值得更深入的研究。为此,在本文中,我们允许包大小L的分布具有有限的支持。该数据包通过一个开关通道{(A_i,U_i)}发送,交替使用可用的A_i和不可用的U_i周期。如果L≥A_i,传输失败,我们等待下一个周期A_(i+1)重新传输数据包。因此,从第一次尝试到信道可用周期大于l的点测量传输持续时间,在温和条件下,我们表明传输持续时间分布表现出从幂律主体到指数尾部的过渡,两者之间具有威布尔型分布。主体观察幂律的时间尺度大致等于最长数据包的平均传输时间。幂律主体和指数尾都能主导整体性能。例如,幂律主体,如果显著,可能导致信道吞吐量非常接近于零。另一方面,如果指数尾部更明显,则可能意味着系统在良性环境中运行。这些理论发现提供了一种理解,为什么一些经验性的测量结果显示了重尾和轻尾(例如,无线网络)。通过分析两种情况,我们利用这些结果进一步强调了具有幂律主体和轻尾分布的工程含义:(1)具有重传的开关通道的吞吐量,我们表明,即使数据包大小具有较小的平均值和有限的支持,其大小的可变性也会极大地影响系统性能。(2) M/M/∞中工作数量的分布;服务器故障队列。这里我们展示了重传会导致远程依赖,并量化了最大作业大小对远程依赖的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信