How to share the cost of cooperating queues in a tandem network?


Timmer, Judith and Scheinhardt, Werner (2010) How to share the cost of cooperating queues in a tandem network? In: 22nd International Teletraffic Congress, ITC 2010, 7-9 Sept 2010, Amsterdam, The Netherlands (pp. pp. 1-7).

open access
Abstract:We consider networks of queues in which the different operators of individual queues may cooperate to reduce the amount of waiting. More specifically, as a first step we focus on Jackson tandem networks in which the total capacity of the servers can be redistributed over all queues in any desired way. If we associate a cost to waiting that is linear in the queue lengths, it is not difficult to see that the long run total cost is minimized when the operators equally share the available service capacity. The main question we try to answer is whether or not (the operators of) the individual queues will indeed cooperate in this way, and if so, how they will share the cost in the new situation. We find answers to this question for two- and three-node networks.
Item Type:Conference or Workshop Item
Copyright:© 2010 IEEE
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page