Optimal resource allocation in multi-class networks with user-specified utility functions

In this work, we consider the problem of resource allocation in multi-class networks, where users specify the value they attach to obtaining different amounts of resource by means of a utility function. We develop a resource allocation scheme that maximizes the average aggregate utility per unit tim...

Full description

Saved in:
Bibliographic Details
Published inComputer networks (Amsterdam, Netherlands : 1999) Vol. 38; no. 5; pp. 613 - 630
Main Authors Kalyanasundaram, Suresh, Chong, Edwin K.P., Shroff, Ness B.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 05.04.2002
Elsevier Sequoia S.A
Subjects
Communications networks
Complete partitioning
Greedy scheme
Markov analysis
Markov decision processes
Networks
Pricing
Pricing policies
Resource allocation
Studies
Utility functions
Markov decision processes
Greedy scheme
Utility functions
Resource allocation
Pricing
Complete partitioning
Online AccessGet full text

Cover

More Information
Summary:In this work, we consider the problem of resource allocation in multi-class networks, where users specify the value they attach to obtaining different amounts of resource by means of a utility function. We develop a resource allocation scheme that maximizes the average aggregate utility per unit time. We formulate this resource allocation problem as a Markov decision process. We present numerical results that illustrate that our scheme performs better than the greedy resource allocation policy. We also discuss the implications of deliberate lying by users about their utility functions and develop a pricing scheme that prevents such lying.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1389-1286
1872-7069
DOI:10.1016/S1389-1286(01)00275-4