Stability of Decentralized Queueing Networks Beyond Complete Bipartite Cases

Hu Fu, Qun Hu, Jia'nan Lin

Abstract: Gaitonde and Tardos [3, 4] recently studied a model of queueing networks where queues compete for servers and re-send returned packets in future rounds. They quantify the amount of additional processing power that guarantees a decentralized system’s stability, both when the queues adapt their strategies from round to round using no-regret learning algorithms, and when they are patient and evaluate the utility of a strategy over long periods of time.