Balancing through signaling in decentralized routing

A discrete-time decentralized routing problem in a service system consisting of two service stations and two controllers is investigated. Each controller is affiliated with one station. Each station has an infinite size buffer. Exogenous customer arrivals at each station occur with rate λ. Service times at each station have rate μ. At any time, a controller can route one of the customers waiting in its own station to the other station. Each controller knows perfectly the queue length in its own station and observes the exogenous arrivals to its own station as well as the arrivals of customers sent from the other station. At the beginning, each controller has a probability mass function (PMF) on the number of customers in the other station. These PMFs are common knowledge between the two controllers. A decentralized routing policy that minimizes an infinite horizon average cost per unit time is explicitly determined.

[1]  Demosthenis Teneketzis,et al.  A simple load balancing problem with decentralized information , 1996, Math. Methods Oper. Res..

[2]  Aditya Mahajan,et al.  Optimal Decentralized Control of Coupled Subsystems With Control Sharing , 2011, IEEE Transactions on Automatic Control.

[3]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[4]  Sabato Manfredi,et al.  Decentralized Queue Balancing and Differentiated Service Scheme Based on Cooperative Control Concept , 2014, IEEE Transactions on Industrial Informatics.

[5]  D. Teneketzis,et al.  Routing in queueing networks under imperfect information: stochastic dominance and thresholds , 1989 .

[6]  D. McDonald,et al.  Join the shortest queue: stability and exact asymptotics , 2001 .

[7]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[8]  Aditya Gopalan,et al.  On distributed scheduling with heterogeneously delayed network-state information , 2012, Queueing Syst. Theory Appl..

[9]  Ger Koole,et al.  On the Optimality of the Generalized Shortest Queue Policy , 1990, Probability in the Engineering and Informational Sciences.

[10]  P. R. Kumar,et al.  Optimal control of a queueing system with two heterogeneous servers , 1984 .

[11]  Ger Koole,et al.  On the Assignment of Customers to Parallel Queues , 1992, Probability in the Engineering and Informational Sciences.

[12]  Osman T. Akgun,et al.  Understanding the marginal impact of customer flexibility , 2012, Queueing Syst. Theory Appl..

[13]  Benjamin Van Roy,et al.  An approximate dynamic programming approach to decentralized control of stochastic systems , 2006 .

[14]  Khashayar Khorasani,et al.  A novel Hα control strategy for design of a robust dynamic routing algorithm in traffic networks , 2008, IEEE Journal on Selected Areas in Communications.

[15]  Yi Ouyang,et al.  Signaling for decentralized routing in a queueing network , 2014, Annals of Operations Research.

[16]  Xun-lin Zhu,et al.  A Decentralized Routing Control Scheme for Data Communication Networks , 2013 .

[17]  Anurag Kumar,et al.  Optimal control of arrivals to queues with delayed queue length information , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[18]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[19]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[20]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..

[21]  Lei Ying,et al.  On Throughput Optimality With Delayed Network-State Information , 2008, IEEE Transactions on Information Theory.

[22]  Yi Ouyang,et al.  A routing problem in a simple queueing system with non-classical information structure , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[23]  Yu-Chi Ho.  Team decision theory and information structures , 1980, Proceedings of the IEEE.

[24]  R. Weber,et al.  Optimal control of service rates in networks of queues , 1987, Advances in Applied Probability.

[25]  B. Hajek.  Optimal control of two interacting service stations , 1982, 1982 21st IEEE Conference on Decision and Control.

[26]  Richard F. Serfozo,et al.  Optimality of routing and servicing in dependent parallel processing systems , 1991, Queueing Syst. Theory Appl..