Analysis of critical traffic and phase transitions on complex network

The critical traffic, which provides a guide for many technical decisions to perform network design and management, is an importance index in describing the capability of computer network. In the paper, a novel method for estimating the critical traffic is proposed based on Little theorem and the weight of betweenness centrality. Compared with other approximation means, the prominent merit of this method is its universality that can be applied to all kinds of network in despite of their different topology structure. The results of simulation on the regular network and scale-free network indicates the validity of this method and shows the fact that the critical traffic of scale-free network is lower than regular networkpsilas when their total number of node are equal. The fluctuations of the total number and the average latency of packets and throughput of system are analyzed under different traffic load .It is shown that the network traffic exhibits nontrivial the phase transition behaviors when the load close to the critical point.