Showing posts with label call-by-call basis. Show all posts
Showing posts with label call-by-call basis. Show all posts

Wednesday, 12 March 2025

Analyzing Traffic Share Loss in Competitive Internet Networks Using a Markov Chain Model | Chapter 4 | Mathematics and Computer Science: Contemporary Developments Vol. 10

In today's digital era, the internet has become an essential tool for information access and data communication, with a rapidly expanding user base globally. Concurrently, the proliferation of commercial Internet Service Providers (ISPs) has intensified competition and led to an increased load on network infrastructures. This rising demand has driven networks to operate near capacity, resulting in frequent congestion and a high probability of service blocking. This paper investigates the dynamics of internet traffic distribution in a competitive market environment, focusing on share loss when two ISPs compete across distinct markets with varying service quality. A Markov chain model is employed to perform share loss analysis, with iso-share curves illustrating how traffic share distribution shifts because of network congestion and service quality competition.

Through a comprehensive simulation study, the research reveals that blocking probabilities significantly impact an ISP's ability to retain initial traffic share, highlighting the role of Quality of Service (QoS) in user retention. The Markov chain approach effectively models user behaviors in scenarios where traffic congestion influences the shift in market share, particularly under high network demand conditions. This study underscores the critical importance of efficient traffic management and resource allocation in minimizing service interruptions and maintaining competitive QoS in multi-operator markets. The findings have implications for ISPs seeking to optimize resource distribution and manage network congestion, with a particular focus on enhancing the reliability and performance of internet services.

 

Author (s) Details

 

Virendra Kumar Tiwari|
Lakshmi Narain College of Technology (MCA), Bhopal, India.

 

Ashish Jain
LNCT University, Bhopal, India.

 

Ripusoodan Sharma
Lakshmi Narain College of Technology (MCA), Bhopal, India.

 

Dev Kumar Chouhan
LNCT University, Bhopal, India.

 

Pramod Kumar Saket
Lakshmi Narain College of Technology (MCA), Bhopal, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v10/3411  

Monday, 24 February 2025

A Comparative Study of Call-By-Call and Two-Call Traffic Distribution Models in Computer Networks | Chapter 8 | Mathematics and Computer Science: Research Updates Vol. 1

Naldi's Markov chain model offers an analytical framework to understand user behaviors in competitive environments involving two operators, such as Internet Service Providers (ISPs). The model investigates the influence of blocking probability and initial user preferences on traffic distribution between operators. In its original form, the model assumes a "call-by-call" basis, where users switch operators after a failed call attempt, favoring operators with lower blocking probabilities.

This paper extends the model by introducing a "two-call" attempt framework, allowing users to make two consecutive attempts with the same operator before switching. Results show that this modification significantly enhances traffic share for operators, particularly those with higher blocking probabilities, as it reduces immediate traffic loss following a single failure.

A comparative analysis between the call-by-call and two-call models reveals that the latter improves traffic retention, increases connection success rates, and decreases churn. This study underscores the critical impact of blocking probabilities on user behaviors and demonstrates how the two-call model mitigates these challenges to optimize traffic distribution.

The findings highlight the value of user behaviors modelling for network optimization, providing actionable insights for ISPs and operators. By adopting the two-call approach, operators can improve quality of service (QoS), manage congestion effectively, and retain users more successfully in competitive markets.

 

Author (s) Details

 

Virendra Kumar Tiwari
Department of Computer Applications, Lakshmi Narain College of Technology (MCA), Bhopal, M.P. 462022, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcsru/v1/3863