This paper derives equations. Assume the Internet operates as /Pareto// queues, the flow blocking probability is , where is the arrival rate, is the first busy period (i.e. mean of Pareto), is the -th busy period, and denotes the probability of having customers in the /Pareto// queue.

The generating function for is obtained from the M/G/1 analysis:

with is the Laplace transform of the Pareto pdf , where , , mean equals to . However, using this method is computationally intensive and the paper proposed the following approximation:

Bibliographic data

@inproceedings{
   title = "Internet Flow Blocking Probability Calculation",
   author = "Helen Y Tang and Steed J Huang and H.-M. Fred Chen",
   booktitle = "Proc. Canadian Conference on Electrical and Computer Engineering",
   volume = "2",
   pages = "659--663",
   month = "Mar 7-10",
   year = "2000",
   address = "Halifax, NS, Canada",
}