Circle of interacting servers: Spontaneous collective behavior in the case of large fluctuations
Problems of Information Transmission
Importance Sampling for Weighted-Serve-the-Longest-Queue
Mathematics of Operations Research
Large Deviations of Max-Weight Scheduling Policies on Convex Rate Regions
Mathematics of Operations Research
Configuration of overloaded servers with dynamic routing
Problems of Information Transmission
Large-deviations analysis for energy-saving mechanisms in wireless networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Asymptotic behavior for MAP/PH/c queue with shortest queue discipline and jockeying
Operations Research Letters
Join the shortest queue among k parallel queues: tail asymptotics of its stationary distribution
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We consider a join-the-shortest-queue model, which is as follows. There are K single FIFO servers and M arrival processes. The customers from a given arrival process can be served only by the servers from a certain subset of all servers. The actual destination is the server with the smallest weighted queue length. The arrival processes are assumed to obey a large deviation principle while service is exponential. A large deviation principle is established for the queue-length process. The action functional is expressed in terms of solutions to mathematical programming problems. The large deviation limit point is identified as a weak solution to a system of idempotent equations. Uniqueness of the weak solution follows by trajectorial uniqueness.