Asymptotic Behavior of the Number of Lost Messages

dc.creatorAbramov, Vyacheslav M.
dc.date2005-05-27
dc.date.accessioned2026-07-07T05:20:19Z
dc.date.available2026-07-07T05:20:19Z
dc.descriptionThe 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.
dc.description18 pages, The list of references and citations slightly differ from these appearing in the journal
dc.identifierhttps://arxiv.org/abs/math/0505596
dc.identifierhttp://arxiv.org/abs/math/0505596
dc.identifierSIAM Journal on Applied Mathematics 64 (2004) 746-761
dc.identifierdoi:10.1137/S0036139902405250
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75340
dc.subjectProbability
dc.subjectClassical Analysis and ODEs
dc.subject60K25, 60K30, 40E05
dc.titleAsymptotic Behavior of the Number of Lost Messages
dc.typetext

Files

Collections