Random Walks in Local Dynamics of Network Losses
Abstract
We suggest a model for data losses in a single node of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. The model shows critical behavior with an abrupt transition from exponentially small to finite losses as the data arrival rate increases. The critical point is characterized by strong fluctuations of the loss rate. Although we consider the packet arrival being a Markovian process, the loss rate exhibits non-Markovian power-law correlations in time at the critical point.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.