Distribution of the number of retransmissions of bounded documents

DOI10.1239/AAP/1435236982MaRDI QIDQ5262448zbMATHOpenAlexFDO

Authors Predrag R. Jelenković, Evangelia D. Skiani

Publication date 15 July 2015

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.8421

zbMATH Keywords

power lawgamma distributioncommunication networksrestartheavy-tailed distributiontruncated distributionretransmissionlight-tailed distributionchannel with failure

Mathematics Subject Classification ID

Large deviations (60F10) Communication theory (94A05) Limit theorems in probability theory (60F99) Special processes (60K99) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Abstract: Retransmission-based failure recovery represents a primary approach in existing communication networks that guarantees data delivery in the presence of channel failures. Recent work has shown that, when data sizes have infinite support, retransmissions can cause long (-tailed) delays even if all traffic and network characteristics are light-tailed. In this paper we investigate the practically important case of bounded data units 0 <= L_b <= b under the condition that the hazard functions of the distributions of data sizes and channel statistics are proportional. To this end, we provide an explicit and uniform characterization of the entire body of the retransmission distribution Pr[N_b > n] in both n and b. Our main discovery is that this distribution can be represented as the product of a power law and Gamma distribution. This rigorous approximation clearly demonstrates the coupling of a power law distribution, dominating the main body, and the Gamma distribution, determining the exponential tail. Our results are validated via simulation experiments and can be useful for designing retransmission-based systems with the required performance characteristics. From a broader perspective, this study applies to any other system, e.g., computing, where restart mechanisms are employed after a job processing failure.

Recommendations

• Characterizing heavy-tailed distributions induced by retransmissions
• Instability of sharing systems in the presence of retransmissions
• Asymptotic Behavior of Total Times for Jobs That Must Start Over if a Failure Occurs
• A competitive analysis for retransmission timeout
• scientific article; zbMATH DE number 1301871

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 3513051 (Why is no real title available?)
• scientific article; zbMATH DE number 4000257 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• Asymptotic Behavior of Total Times for Jobs That Must Start Over if a Failure Occurs
• Characterizing heavy-tailed distributions induced by retransmissions
• Distribution of the number of retransmissions of bounded documents
• Implicit renewal theorem for trees with general weights
• Modulated branching processes, origins of power laws, and queueing duality

Cited in

(7)

• Markov Renewal Methods in Restart Problems in Complex Systems
• Instability of sharing systems in the presence of retransmissions
• Time inhomogeneity in longest gap and longest run problems
• Characterizing heavy-tailed distributions induced by retransmissions
• Staffing many-server systems with admission control and retrials
• On preemptive-repeat LIFO queues
• Distribution of the number of retransmissions of bounded documents

This page was built for publication: Distribution of the number of retransmissions of bounded documents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262448)