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.
| Original language | Undefined |
|---|---|
| Title of host publication | Proceedings of the 22nd International Teletraffic Congress (ITC) |
| Place of Publication | USA |
| Publisher | IEEE Communications Society |
| Pages | 1-7 |
| Number of pages | 7 |
| ISBN (Print) | 978-1-4244-8837-7 |
| DOIs | |
| Publication status | Published - 2010 |
| Event | 22nd International Teletraffic Congress 2010 - Science Park Amsterdam, Amsterdam, Netherlands Duration: 7 Sep 2010 → 9 Sep 2010 Conference number: 22 http://www.itc22.com/ |
Publication series
| Name | |
|---|---|
| Publisher | IEEE Communications Society |
Conference
| Conference | 22nd International Teletraffic Congress 2010 |
|---|---|
| Abbreviated title | ITC 2010 |
| Country/Territory | Netherlands |
| City | Amsterdam |
| Period | 7/09/10 → 9/09/10 |
| Internet address |
Keywords
- METIS-271097
- Capacity allocation
- IR-74326
- Cost allocation
- EWI-18667
- Co-operation
- Tandem queue
- MSC-60K25
- Game Theory