Paper Info
Title
Balancing through signaling in decentralized routing
Abstract
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.
Year
DOI
Venue
2014
10.1109/CDC.2014.7039640
CDC
Keywords
Field
DocType
probability mass function,service stations,queueing theory,discrete-time decentralized routing problem,pmf,decentralized routing policy,discrete time systems,service times,decentralised control,service controllers
Probability mass function,Control theory,Mathematical optimization,Computer science,Queue,Service system,Average cost,Common knowledge,Infinite horizon
Conference
ISSN
Citations 
PageRank 
0743-1546
1
0.37
References 
Authors
8
2
Name
Order
Citations
PageRank
Yi Ouyang14310.16
Demosthenis Teneketzis261285.73