Configuration of overloaded servers with dynamic routing

Authors:
N. D. Vvedenskaya
Affiliations:
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2011

Citing 3
Cited 0

On the stability of a partially accessible multi-station queue with state-dependent routing

Queueing Systems: Theory and Applications
Circle of interacting servers: Spontaneous collective behavior in the case of large fluctuations

Problems of Information Transmission
A Large Deviation Principle for Join the Shortest Queue

Mathematics of Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider overload of servers in a network with dynamic routing of messages. The system consists of k servers and 驴 independent Poisson input flows. Messages from each flow are directed to m servers, and each message is directed to a server that is the least loaded at the moment of its arrival. In such a system, configuration of overloaded servers depends on the intensity of input flows. A similar effect was considered in [1] for a system with another geometry.