2008/03/23 by Igor V. Lerner, Lerner, I. V., I. V. Yurkevich A. S. Stepanenko +3
Business, Management and Accounting · Computer Science · #Advanced Queuing Theory Analysis #FOS: Computer and information sciences #FOS: Physical sciences #Network Time Synchronization Technologies #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI) #Statistical Mechanics (cond-mat.stat-mech)
paper · doi:10.48550/arxiv.0803.3314
openalex publication_date 2008/03/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider data losses in a single node of a packet-switched Internet-like network. We employ two distinct models, one with discrete and the other with continuous one-dimensional random walks, representing the state of a queue in a router. Both models have a built-in critical behavior with a sharp transition from exponentially small to finite losses. It turns out that the finite capacity of a buffer and the packet-dropping procedure give rise to specific boundary conditions which lead to strong loss rate fluctuations at the critical point even in the absence of such fluctuations in the data arrival process.