We consider large fluctuations and overload of servers in a network with dynamic routing of messages. The servers form a circle. The number of input flows is equal to the number of servers; the messages of a flow are distributed between two neighboring servers; upon its arrival, a message is directed to the least loaded of these servers. Under the condition that at least two servers are overloaded, the number of overloaded servers in such a network depends on the rate of input flows. In particular, there exists a critical level of the input rate above which all servers are most probably overloaded.
Problems of Information Transmission – Springer Journals
Published: Jan 24, 2009
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud