Abstract

The focus of this work is on how the congestion experienced on the GSM network can be minimized. The voice calls is broken into sub-classes of services and a level of priority is established among the classes so that the most urgent and important service will have access to the channel by preempting the lower priority services during congestion. The voice communications over the GSM network using the different classes of subscribers were analyzed with Markov chain’s model. The steady state probabilities for voice services were derived. The blocking and dropping probabilities models for the different services were developed using the Multi-dimensional Erlang B. To give a new call a fair sharing of the channel, TimeThreshold scheme is employed. This scheme classifies handoff call as either prioritised call or new call according to its associated elapsed real time value. The models were implemented based on the blocking and dropping probabilities models to show how the congestion can be minimised for different subscribers based on their priority levels. The work shows that the models used gave significant reduction in congestion when compared to the traditional Erlang-B model used in GSM.

Full Text
Paper version not known

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 call

Disclaimer: 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.