TY - JOUR
T1 - The Use of Efficient Cost Allocation Mechanisms for Congestion Pricing in Data Networks with Priority Service Models
AU - Beltran, Fernando
AU - Garcia-Diaz, Cesar
PY - 2005/1
Y1 - 2005/1
N2 - 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.
AB - 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.
KW - Aumann-Shapley pricing
KW - data networks
KW - efficient congestion-based pricing
KW - nonpre-emptive priorities Shapley value
UR - http://www.scopus.com/inward/record.url?scp=85001849145&partnerID=8YFLogxK
U2 - 10.4018/jbdcn.2005010103
DO - 10.4018/jbdcn.2005010103
M3 - Article
AN - SCOPUS:85001849145
SN - 1548-0631
VL - 1
SP - 33
EP - 49
JO - International Journal of Business Data Communications and Networking (IJBDCN)
JF - International Journal of Business Data Communications and Networking (IJBDCN)
IS - 1
ER -