The Use of Efficient Cost Allocation Mechanisms for Congestion Pricing in Data Networks with Priority Service Models

The Use of Efficient Cost Allocation Mechanisms for Congestion Pricing in Data Networks with Priority Service Models

Fernando Beltran, Cesar Garcia-Diaz
Copyright: © 2005 |Pages: 17
DOI: 10.4018/jbdcn.2005010103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This paper demonstrates the application of two efficient cost allocation mechanisms on a simple FIFO network model in order to find congestion-based prices for network access services. It is shown that it is possible to obtain congestion-dependent prices in data networks (such as the Internet), establishing simultaneously different service quality levels among the users. The rationale behind these efficient distribution mechanisms is an axiomatic framework that determines a set of basic principles, highlighting the need for a fair allocation. Due to the characteristics of the price mechanisms and the possibilities of the parameter space in which these mechanisms might be applied, it is also shown that, in some cases, such mechanisms need additional weighting schemes in order to establish coherent differences among the service quality levels. In conclusion, even though the axiomatic framework guarantees efficient allocation, checking coherency in its use is left to the network manager.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2025): Forthcoming, Available for Pre-Order
Volume 19: 1 Issue (2024)
Volume 18: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 17: 2 Issues (2021)
Volume 16: 2 Issues (2020)
Volume 15: 2 Issues (2019)
Volume 14: 2 Issues (2018)
Volume 13: 2 Issues (2017)
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing