A Comparison of Methods for Internet Traffic Sharing in Computer Network
Journal: International Journal of Advanced Networking and Applications (Vol.1, No. 03)Publication Date: 2009-11-02
Authors : Diwakar Shukla; Virendra Kumar Tiwari; Sanjay Thakur; Mohan Tiwari;
Page : 164-169
Keywords : Blocking probability; Call-by-call basis; Internet Service Provider [operators]; Internet access; Internet traffic; Markov chain model; Network congestion; Quality of service (QoS); Transition probability matrix; Users behavior;
Abstract
Naldi presented a Markov chain model based analysis for the user’s behaviour in a simple scenario of two competitors. The model is applied to predict influence of both parameters (blocking probability and initial preference) on the traffic
distribution between the operators. It is also shown that smaller blocking competitors can be benefited from call-by-call basis assumption. In this paper this criteria of Call-by-call attempt is converted into two call attempts and new mathematical results are derived. A comparative study between call-attempts is made with Naldi [1] expressions. It is found that, by twocall attempt model, the operator gains more traffic than one-call attempt.
Other Latest Articles
- Financial Statement Fraud Detection by Data Mining
- An Approach of MST Generation Algorithm Based on Node Weightage
- Reliability in MANET’s Using Enhanced Double Coverage Broadcasting (EDCB)
- A New Method for Load Balancing and QOS in On demand Protocols?In the MANET’s Perspective
- Enhancing security of Pass Points system using variable tolerance
Last modified: 2015-12-05 20:57:30