Abstract
In Internet service market, at many places the competition occurs among internet service providers. The network suffers from congestion and users have priority to prefer that network having lowest congestion. During the repeated connecting attempt process the user has to maintain call-by-call effort. In this paper Markov chain model is used to establish a relationship between internet access traffic sharing and blocking probability of the network. The model based relationship has been simplified into the linear relationship. The accuracy of the fitting is examined through coefficient of determination. This process has eased up the multiple parameter based complicated relationship into a much simplified form. An average linear relationship is predicted for handy applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
