On a loss storage network with finite capacity
Abstract
Our goal in this paper is to investigate the fluid picture associated with an open large scale storage network of non-reliable file servers with finite capacity. In this storage system, new files can be added and a file with only one copy can be lost or duplicated. The Skorokhod problem with oblique reflection in a bounded convex domain is used to identify the fluid limits. Such analysis involves the study of three different regimes, the under-loaded, the critical and the overloaded regime. The overloaded regime is of particular importance. To identify the fluid limits, new martingales are obtained and an averaging property is established.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.