The Research On Call Blocking Performance And Bandwidth Management Of Traffic Model With Integrated Service

In recent years, the network application becomes prevalent and communication services increase sharply. New services like data transport and video becomes hotspot in the development of communication. Since the network become more and more busy, It's very significative to analyze the performance of integrated service network. Assuring the quality of service (QoS) of each user becomes very important according to the increase of the bearer services of network. Call blocking probability (CBP) is very important to determine the QoS of each user.For a long time, traffic modeling and performance analysis is based on Poisson distribution and Markov process. But recently measures of network traffic have shown the self-similar nature of network traffic. And this property can't be described by traditional models. The characteristic of traffic has a great effect on the analysis, design, control, and performance evaluation of computer networks. The formula of Kaufman is speculated to hold for any system with Poisson arrival and general service time distribution. And the Laplace transform of service time distribution must be a rational function. But rigorous proof is absent to illuminate that whether the Kaufman formula can be applied to calculate the CBP of queuing system with integrated service. In this thesis, several mathematical definitions of self-similarity are given and some of their features are described. The simulation of integrated service system with Pareto service time distribution has been implemented. The simulation result coincides well with Kaufman formula. This lays the foundation of further research on using simulation methods to study the performance of networks with self-similarity traffic.With the scale of networks boosting in modern times, the resource and traffic management faces new challenges. It'll take long time to calculate the CBP of large-scale networks with integrated service because of the complicated networks. And the traditional algorithm is not effective. In this thesis, an integrated service network is abstracted to a queuing system with integrated service. And a new algorithm is proposed to calculate the capacity of the queuing system based on an algorithm which calculates the CBP of quasi-independent system fast. As the instance showed, the algorithm is effective and short-time consuming. This lays the foundation of further research on programming network capacity under real and complicated background.