Approximating the Probability of Traffic Sharing by Numerical Analysis Techniques between Two Operators in a Computer Network

Many authors have derived the expressions for the probability of traffic sharing between two operators in computer networking environment. The mathematical expressions for these probabilities are generally in quadratic function of blocking probabilities of computer network along with the probability of initial choice of customer. The expressions are not easily integrated and, therefore, effort is difficult to obtain the total bounded area under the probability curve. It is a challenging problem to obtain the probability density computation of the traffic sharing parameter. This paper presents a methodology to obtain the approximate bounded area and probability computation using methods of numerical analysis. The main focus is on utilization of Simpson 1/3 rule and Weddle rule along with the mutual comparisons.

Author(s): Diwakar Shukla, Kapil Verma, Sharad Gangele

Abstract | PDF

Share This Article