DOI QR코드

DOI QR Code

Models for Internet Traffic Sharing in Computer Network

  • Alrusaini, Othman A. (Department of Engineering and Applied Sciences, Umm Al-Qura University) ;
  • Shafie, Emad A. (Department of Engineering and Applied Sciences, Umm Al-Qura University) ;
  • Elgabbani, Badreldin O.S. (Department of Engineering and Applied Sciences, Umm Al-Qura University)
  • 투고 : 2021.08.05
  • 발행 : 2021.08.30

초록

Internet Service Providers (ISPs) constantly endeavor to resolve network congestion, in order to provide fast and cheap services to the customers. This study suggests two models based on Markov chain, using three and four access attempts to complete the call. It involves a comparative study of four models to check the relationship between Internet Access sharing traffic, and the possibility of network jamming. The first model is a Markov chain, based on call-by-call attempt, whereas the second is based on two attempts. Models III&IV suggested by the authors are based on the assumption of three and four attempts. The assessment reveals that sometimes by increasing the number of attempts for the same operator, the chances for the customers to complete the call, is also increased due to blocking probabilities. Three and four attempts express the actual relationship between traffic sharing and blocking probability based on Markov using MATLAB tools with initial probability values. The study reflects shouting results compared to I&II models using one and two attempts. The success ratio of the first model is 84.5%, and that of the second is 90.6% to complete the call, whereas models using three and four attempts have 94.95% and 95.12% respectively to complete the call.

키워드

참고문헌

  1. M. Naldi, "Internet access traffic sharing in a multi-operator environment," Computer Networks, vol. 38, no. 6, pp. 809-824, 2002. https://doi.org/10.1016/S1389-1286(01)00307-3
  2. D. Shukla, V. Tiwari, S. Thakur, and M. Tiwari, "A comparison of methods for internet traffic sharing in computer network," International Journal of Advanced Networking and Applications (IJANA), vol. 1, no. 3, pp. 164-169, 2009.
  3. D. Shukla, V. Tiwari, and P. A. Kareem, "All Comparison Analysis in Internet Traffic Sharing Using Markov Chain Model in Computer Networks," Computer Science & Telecommunications, vol. 2009, no. 6, 2009.
  4. D. Shukla, K. Verma, S. Bhagwat, and S. Gangele, "Curve fitting analysis of internet traffic sharing management in computer network under cyber crime," International Journal of Computer Applications, vol. 975, p. 8887, 2012.
  5. Markov Chains. Brilliant.org. Retrieved 15:05, December19, 2020, from https://brilliant.org/wiki/markov-chains/
  6. D. Shukla, V. Tiwari, and S. Thakur, "Effects of disconnectivity analysis for congestion control in internet traffic sharing," in National Conference on Research and Development Trends in ICT (RDTICT-2010), Lucknow University, Lucknow, 2010.
  7. S. Gangele and S. Patil, "Internet traffic distribution analysis in case of multi-operator and multi-market environment of computer network," International Journal of Computer Applications, vol. 975, p. 8887, 2015.
  8. D. Shukla, S. Gangele, K. Verma, and M. Trivedi, "Elasticity variation under rest state environment in case of internet traffic sharing in computer network," International Journal of Computer Technology and Application (IJCTA) Vol, vol. 2, pp. 2052-2060, 2011.
  9. S. More and D. Shukla, "Review on Internet Traffic Sharing Using Markov Chain Model in Computer Network," in Data Science and Big Data Analytics: Springer, 2019, pp. 81-98.
  10. Y. Wang and H. Feng, "Optimization and Simulation of Carsharing under the Internet of Things," Mathematical Problems in Engineering, vol. 2020, 2020.