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.
%0 Book Section
%1 Kalyanasundaram20011175
%A Kalyanasundaram, Suresh
%A Chong, Edwin K.P.
%A Shroff, Ness B.
%B Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7
%D 2001
%E Jorge Moreira de Souza, Nelson L.S. da Fonseca
%E de Souza e Silva, Edmundo A.
%I Elsevier
%K itc itc17
%P 1175 - 1186
%R http://dx.doi.org/10.1016/S1388-3437(01)80201-8
%T Optimal resource allocation in multiclass networks with user-specified utility functions
%V 4
%X 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.
@incollection{Kalyanasundaram20011175,
abstract = {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. },
added-at = {2016-07-12T14:53:52.000+0200},
author = {Kalyanasundaram, Suresh and Chong, Edwin K.P. and Shroff, Ness B.},
biburl = {https://www.bibsonomy.org/bibtex/2ed4326638d07cd351899811a4cf95672/itc},
booktitle = {Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7},
doi = {http://dx.doi.org/10.1016/S1388-3437(01)80201-8},
editor = {Jorge Moreira de Souza, Nelson L.S. da Fonseca and de Souza e Silva, Edmundo A.},
interhash = {e418ca0cd1de7d86dfc78c73fbaccbed},
intrahash = {ed4326638d07cd351899811a4cf95672},
issn = {1388-3437},
keywords = {itc itc17},
pages = {1175 - 1186},
publisher = {Elsevier},
series = {Teletraffic Science and Engineering },
timestamp = {2020-04-30T18:17:29.000+0200},
title = {Optimal resource allocation in multiclass networks with user-specified utility functions },
volume = 4,
year = 2001
}