Skip to main content Accessibility help
×
Home

Characterizing Heavy-Tailed Distributions Induced by Retransmissions

  • Predrag R. Jelenković (a1) and Jian Tan (a2)

Abstract

Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel availability dynamic is modeled as an independent and identically distributed sequence {A, A i } i≥1 that is independent of L. During each period of time that the channel becomes available, say A i , we attempt to transmit the data unit. If L <A i , the transmission is considered successful; otherwise, we wait for the next available period A i+1 and attempt to retransmit the data from the beginning. We investigate the asymptotic properties of the number of retransmissions N and the total transmission time T until the data is successfully transmitted. In the context of studying the completion times in systems with failures where jobs restart from the beginning, it was first recognized by Fiorini, Sheahan and Lipsky (2005) and Sheahan, Lipsky, Fiorini and Asmussen (2006) that this model results in power-law and, in general, heavy-tailed delays. The main objective of this paper is to uncover the detailed structure of this class of heavy-tailed distributions induced by retransmissions. More precisely, we study how the functional relationship ℙ[L>x]-1 ≈ Φ (ℙ[A>x]-1) impacts the distributions of N and T; the approximation ‘≈’ will be appropriately defined in the paper based on the context. Depending on the growth rate of Φ(·), we discover several criticality points that separate classes of different functional behaviors of the distribution of N. For example, we show that if log(Φ(n)) is slowly varying then log(1/ℙ[N>n]) is essentially slowly varying as well. Interestingly, if log(Φ(n)) grows slower than e√(logn) then we have the asymptotic equivalence log(ℙ[N>n]) ≈ - log(Φ(n)). However, if log(Φ(n)) grows faster than e√(logn), this asymptotic equivalence does not hold and admits a different functional form. Similarly, different types of distributional behavior are shown for moderately heavy tails (Weibull distributions) where log(ℙ[N>n]) ≈ -(log Φ(n))1/(β+1), assuming that log Φ(n) ≈ nβ, as well as the nearly exponential ones of the form log(ℙ[N>n]) ≈ -n/(log n)1/γ, γ>0, when Φ(·) grows faster than two exponential scales log log (Φ(n)) ≈ n γ.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Characterizing Heavy-Tailed Distributions Induced by Retransmissions
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Characterizing Heavy-Tailed Distributions Induced by Retransmissions
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Characterizing Heavy-Tailed Distributions Induced by Retransmissions
      Available formats
      ×

Copyright

Corresponding author

Postal address: Department of Electrical Engineering, Columbia University, New York, NY 10027, USA.
∗∗ Postal address: IBM T. J. Watson Research, Yorktown Heights, NY 10598, USA. Email address: tanji@us.ibm.com

Footnotes

Hide All

This work was supported by the NSF grant CCF-0915784.

Footnotes

References

Hide All
[1] Asmussen, S. et al. (2008). Asymptotic behavior of total times for Jobs that must start over if a failure occurs. Math. Operat. Res. 33, 932944.
[2] Bertsekas, D. P. and Gallager, R. (1992). Data Networks, 2nd edn. Prentice Hall.
[3] Bingham, N. H., Goldie, C. M. and Teugels, J. L. (1987). Regular Variation. Cambridge University Press.
[4] Fiorini, P. M., Sheahan, R. and Lipsky, L. (2005). On unreliable computing systems when heavy-tails appear as a result of the recovery procedure. In ACM SIGMETRICS Performance Evaluation Rev. 33, 1517.
[5] Jelenković, P. and Momčilović, P. (2003). Large deviation analysis of subexponential waiting times in a processor-sharing queue. Math. Operat. Res. 28, 587608.
[6] Jelenković, P. R. and Momčilović, P. (2004). Large deviations of square root insensitive random sums. Math. Operat. Res. 29, 398406.
[7] Jelenković, P. R. and Tan, J. (2007). Is ALOHA causing power law delays? In Managing Traffic Performance in Converged Networks (Lecture Notes Comput. 4516), Springer, Berlin, pp. 11491160.
[8] Jelenković, P. R. and Tan, J. (2007). Can retransmissions of superexponential documents cause subexponential delays? In Proc. IEEE INFOCOM '07(New York, May 2007), pp. 892900.
[9] Jelenković, P. R. and Tan, J. (2007). Characterizing heavy-tailed distributions induced by retransmissions. Preprint. Available at http://arxiv.org/abs/0709.1138v2.
[10] Kulkarni, V. G., Nicola, V. F. and Trivedi, K. S. (1987). The completion time of a Job on a multimode system. Adv. Appl. Prob. 19, 932954.
[11] Nagaev, S. V. (1979). Large deviations of sums of independent random variables. Ann. Prob. 7, 745789.
[12] Ross, S. M. (2002). A First Course in Probability, 6th edn. Prentice Hall.
[13] Sheahan, R., Lipsky, L., Fiorini, P. M. and Asmussen, S. (2006). On the completion time distribution for tasks that must restart from the beginning if a failure occurs. In ACM SIGMETRICS Performance Evaluation Rev. 34, 2426.

Keywords

MSC classification

Characterizing Heavy-Tailed Distributions Induced by Retransmissions

  • Predrag R. Jelenković (a1) and Jian Tan (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.