• Dr. Jorma Jormakka Aalto University
  • Sourangshu Ghosh Indian Institute of Technology Kharagpur
Keywords: Pricing, loss networks, Markov decision processes, blocking probability


Congestion pricing has received lots of attention in the scientific discussion. Congestion pricing means that the operator increases prices at the time of congestion and the traffic demand is expected to decrease. In a certain sense, shadow prices are an optimal way of congestion pricing: users are charged shadow prices, i.e., the expectations of future losses because of blocked connections. The shadow prices can be calculated exactly from Howard’s equation, but this method is difficult. The paper presents simple approximations to the solution of Howard’s equation and a way to derive more exact approximations. If users do not react by lowering their demand, they will receive higher bills to pay. Many users do not react to increased prices but would want to know how the congestion pricing mechanism affects the bills. The distribution of the price of a connection follows from knowing the shadow prices and the probability of a congestion state. There is another interesting distribution. The network produces profit to the operator, or equivalently, blocked connections produce a cost to the operator.  The average cost rate can be calculated from Howard’s equation, but the costs have some distribution. The distribution gives the risk that the actual costs exceed the average costs, and the operator should include this risk to the prices. The main result of this paper shows how to calculate the distribution of the costs in the future for congestion pricing by shadow prices and for congestion pricing with a more simple pricing scheme that produces the same average costs.


Download data is not yet available.


F. P. Kelly, “Charging and rate control for elastic traffic,” Eur. Trans. Telecommun., vol. 8, pp. 3-37, 1997.

F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate control for communication networks: Shadow prices, proportional fairness and stability, “ J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.

R. J. Gibbens and F. P. Kelly, (1999) Resource pricing and the evolution of congestion control, [Online.]. Avaible: http//

H. Yaiche, R. R. Mazumdar, and C. Rosenberg, “A Game Theoretical Framework for Bandwidth Allocation and Pricing in Broadband Networks,” IEEE/ACM Tr. on Networking, Vol. 8. No. 5, pp. 667-678, 2000.

X.-R. Cau, H.-X. Shen, R. Milito, and P. Wirth, ”Internet Pricing With Game Theoretical Approach, Concepts and Examples,” IEEE/ACM Tr. on Networking, Vol. 10. No. 2, pp. 208-216, 2002.

I. Ch. Paschalidis, and Y. Liu, “Pricing in Multiservice Loss Networks: Static Pricing, Asymptotic Optimality, and Demand Substitution Effects,” IEEE/ACM Tr. on Networking, Vol. 10. No. 3, pp. 425-438, 2002.

H. Rummukainen and J. Virtamo. “Polynomial Cost Approximations in Markov Decision Theory Based Call Admission Control,” IEEE Trans. on Networking, Vol. 9, No 6, pp. 769-779, 2001,.

K. W. Ross, Multiservice Loss Models for Broadband Telecommunication Networks, New York: Springer-Verlag, 1995.

F. P. Kelly, Reversibility and Stochastic Networks, New York: Wiley, 1979.

K. R. Krishnan and F. de Bucs, “Admission control and state-dependent routing for multirate circuit-switched traffic,” in Proc. 15th ITC, V. Ramaswami and P. E. Wirth, Eds.: Elsevier Science B. V., pp. 1043-1055, 1997.

Z. Dziong, K.-Q. Lio, L. Mason, and N. Tetreault, “Bandwidth management in ATM-networks,” in Proc. 13th ITC, A. Jensen and V. B. Iversen, Eds., pp. 821-827, 1991.

P. Marbach and J. N. Tsitsiklis, “A neuro-dynamic programming approach to call admission control in integrated service networks: The single-link case, “ MIT, Cambridge, MA., Techn. Rep. Lab. Inform. Decision Syst. Rep. LIDS-P-2402. [Online.]

Available:, Nov, 1997.

J. Riordan, Combinatorial Identities, New York: Krieger, 1979.

Y. Kogan, “Exact analysis for a class of simple, circuit-switched networks with blocking,” Adv. Appl. Probabil., vol. 21, pp. 952-955, 1989.

C. Y. Li, P. K. A. Wai, and V. O. K. Li, “The Decomposition of a Blocking Model for Connection-Oriented Networks,” IEEE/ACM Tr. on Networking, Vol. 12. No. 3, pp. 549-558, June 2004.

D. Mitra, and Q. Wang, “Stochastic Traffic Engineering for Demand Uncertainty and Risk-Aware Network Revenue Management,” IEEE/ACM Tr. on Networking, Vol. 13. No. 2, pp. 221-233, 2005.

T. K. Nayak, and K. N. Sivarajan, “Dimensioning Optical Networks Under Traffic Growth Models,” IEEE/ACM Tr. on Networking, Vol. 11. No. 6, pp. 935-947, 2004.

Y. d’Halluin, P. A. Foryth, and K. R. Vetzal, “Managing Capacity for Telecommunications Networks Under Uncertainty,” IEEE/ACM Tr. on Networking, Vol. 10. No. 4, pp. 579-588, 2002

How to Cite
Jormakka, J., & Ghosh, S. (2021). CALCULATING COST DISTRIBUTIONS OF A MULTISERVICE LOSS SYSTEM. COMPUSOFT: An International Journal of Advanced Computer Technology, 10(7), 3978-3992. Retrieved from