2006/07/28 by I. V. Yurkevich, Igor V. Lerner, I. V. Lerner +3
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Opinion Dynamics and Social Influence #Stochastic processes and statistical mechanics #cond-mat.dis-nn #cond-mat.stat-mech
paper · pdf · doi:10.1103/physreve.74.046120
published as Phys. Rev. E 74, 046120 (2006) · 4 pages, 2 figures
arxiv created 2006/07/28 · openalex publication_date 2006/10/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We suggest a model for data losses in a single node (memory buffer) of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. By construction, the model has critical behavior with a sharp transition from exponentially small to finite losses with increasing data arrival rate. We show that for a finite-capacity buffer at the critical point the loss rate exhibits strong fluctuations and non-Markovian power-law correlations in time, in spite of the Markovian character of the data arrival process.