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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

13 Citations (Scopus)
176 Downloads (Pure)


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.
Original languageUndefined
Title of host publicationProceedings of the 22nd International Teletraffic Congress (ITC)
Place of PublicationUSA
Number of pages7
ISBN (Print)978-1-4244-8837-7
Publication statusPublished - 2010
Event22nd International Teletraffic Congress 2010 - Science Park Amsterdam, Amsterdam, Netherlands
Duration: 7 Sept 20109 Sept 2010
Conference number: 22

Publication series

PublisherIEEE Communications Society


Conference22nd International Teletraffic Congress 2010
Abbreviated titleITC 2010
Internet address


  • METIS-271097
  • Capacity allocation
  • IR-74326
  • Cost allocation
  • EWI-18667
  • Co-operation
  • Tandem queue
  • MSC-60K25
  • Game Theory

Cite this