International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

A Comparison of Methods for Internet Traffic Sharing in Computer Network


Affiliations
1 Department of Mathematics and Statistics, Sagar University, Sagar-470003, M.P., India
2 Department of Computer Science & Applications, Sagar University, Sagar-470003, M.P., India
3 Department of Physics & Electronics, Sagar University, Sagar-470003, M.P., India
 

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 expressions. It is found that, by two-call attempt model, the operator gains more traffic than one-call attempt.

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.
User
Notifications
Font Size

Abstract Views: 347

PDF Views: 0




  • A Comparison of Methods for Internet Traffic Sharing in Computer Network

Abstract Views: 347  |  PDF Views: 0

Authors

Diwakar Shukla
Department of Mathematics and Statistics, Sagar University, Sagar-470003, M.P., India
Virendra Kumar Tiwari
Department of Computer Science & Applications, Sagar University, Sagar-470003, M.P., India
Sanjay Thakur
Department of Computer Science & Applications, Sagar University, Sagar-470003, M.P., India
Mohan Tiwari
Department of Physics & Electronics, Sagar University, Sagar-470003, M.P., India

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 expressions. It is found that, by two-call attempt model, the operator gains more traffic than one-call attempt.

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.