Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Calculating Cost Distributions of a Multiservice Loss System

Version 1 : Received: 25 April 2021 / Approved: 27 April 2021 / Online: 27 April 2021 (12:32:37 CEST)

How to cite: Jormakka, J.; Ghosh, S. Calculating Cost Distributions of a Multiservice Loss System. Preprints 2021, 2021040712. Jormakka, J.; Ghosh, S. Calculating Cost Distributions of a Multiservice Loss System. Preprints 2021, 2021040712.


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.


Pricing, loss networks, Markov decision processes, blocking probability.


Computer Science and Mathematics, Algebra and Number Theory

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.