Asymptotic Behavior of the Number of Lost Messages

Abstract

The goal of the paper is to study asymptotic behavior of the number of lost messages. Long messages are assumed to be divided into a random number of packets which are transmitted independently of one another. An error in transmission of a packet results in the loss of the entire message. Messages arrive to the $M/GI/1$ finite buffer model and can be lost in two cases as either at least one of its packets is corrupted or the buffer is overflowed. With the parameters of the system typical for models of information transmission in real networks, we obtain theorems on asymptotic behavior of the number of lost messages. We also study how the loss probability changes if redundant packets are added. Our asymptotic analysis approach is based on Tauberian theorems with remainder.

18 pages, The list of references and citations slightly differ from these appearing in the journal

References in corpus (1)

• Asymptotic analysis of the GI/M/1/n loss system as n increases to infinity

Cited by in corpus (9)

• Optimal control of a large dam
• Takacs' asymptotic theorem and its applications: A survey
• Statistical analysis of single-server loss queueing systems
• Optimal control of a large dam, taking into account the water costs
• The effective bandwidth problem revisited
• Continuity theorems for the $M/M/1/n$ queueing system
• Losses in M/GI/m/n Queues
• Optimal control of a large dam, taking into account the water costs [New Edition]
• Bounds for the loss probability in large loss queueing systems