Abstract
In this paper, we have proposed to use Polya and Pareto distribution to describe peaked arrival processes in telecommunication networks. We have started the work with traffic measurements and analyses. After seeing that the mean, variance, and probability density function of inter–arrival time and packet length change significantly we decided to apply Polya distribution in the system. With this arrival processes, it is possible to analyse the real loss systems in telecommunication and information networks where the access to the multiple communication channels and servers is dynamic. We study a version of the 'classical' Erlang's loss model M/G/n/0 called Polya/G/n/0. This is a full accessible loss system with Polya input flow (negative binomial distributed number of arrivals in a fixed time interval), general distributed service time and 'n' servers. This model is evaluated by simulation with Pareto distributed inter–arrival time. An algorithm for calculation the state probabilities and blocking is presented. It is shown that the variance of the input stream changes significantly the characteristics of the loss systems.
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 callMore From: International Journal of Reasoning-based Intelligent Systems
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.
