To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

A Revenue Maximization M… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

A Revenue Maximization Model for Call Admission Control Problem of Media on Demand Service Providers

Conference paper
Authors Matin Bagherpour
Mehdi Sharifyazdi
Øivind Kure
Published in Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN), 2011
Pages 7
ISBN 978-1-4577-0637-0
ISSN 1095-2055
Publication year 2011
Published at Department of Mathematical Sciences
Department of Mathematical Sciences, Mathematics
Pages 7
Language en
Keywords Call Admission Control, Markov Chain, Revenue Management, Media on Demand, Quality of Service
Subject categories Optimization, systems theory, Other electrical engineering, electronics and photonics, Other industrial engineering and economics


This paper formulates the call admission control problem for media on demand (audio and video) requests in the form of a mathematical optimization model. This model allocates proper portions of the available capacity to the customers of various service classes in order to maximize service provider's revenue, resource utilization, and customer satisfaction. Upon receiving a media request, the provider decides (based on the estimated available bandwidth) whether to accept it in the requested class or to offer a service in another service class. A Markov chain model is employed to formulate admission control strategies, and the limiting probabilities are used to construct a revenue maximization formulation of the problem. We use both an analytical model and computer simulation to investigate effect of offer-based admission control for media services on providers' revenue and customer satisfaction measured by call rejection probability.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?