Distributed scheduling via pricing in a communication network

Abstract

This paper addresses the issue of pricing-based distributed resource allocation via scheduling in a communication network. Introducing the temporal aspect in the resource allocation problem presents new challenges e.g. in accounting for the durations and deadlines of the resource requests. Dynamic real-time pricing concepts are discussed for the decentralized sharing of network resources. A numerical example illustrates the benefit of congestion based pricing in a dynamic communication network. The quality of service that results from decentralized resource allocation is studied from the point of view of a power-controlled wireless network. The model is based on a dynamic noncooperative game and is related to recent work on centrally optimal (Pareto-optimal) distributed dynamic resource allocation.

Original document

The different versions of the original document can be found in:

• https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_69.pdf

• http://link.springer.com/content/pdf/10.1007/3-540-47906-6_69,

http://dx.doi.org/10.1007/3-540-47906-6_69

• https://link.springer.com/chapter/10.1007%2F3-540-47906-6_69,

https://dblp.uni-trier.de/db/conf/networking/networking2002.html#Heikkinen02,

https://www.scipedia.com/public/Heikkinen_2007a,

https://rd.springer.com/chapter/10.1007/3-540-47906-6_69,

https://academic.microsoft.com/#/detail/142536348