Scholars Central

Research articlePublished 2015

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

Authors: Diwakar Shukla, Kapil Verma, Sharad Gangele

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalAmerican Journal of Computer Science and Information Technology
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Diwakar Shukla”
  • BylineArticles whose byline prints “Kapil Verma”
  • BylineArticles whose byline prints “Sharad Gangele”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels