The Routing Strategy On Scale-free Network

Since 80s and 90s of the last century, spurred by the rapid development of information technology and computer data processing ability, more and more researches suggest that the topological property of many networks in our daily life , like the Internet, World Wide Web and online social networks, are neither regular nor random, but have some common statistical characteristics. Typical two of these characteristics are'small-world'effect and scale-free property. As the networks are closely related to our daily life, it is very importance to search proper methods to characterize basic properties and the evolution of a network's structure. This is such a challenging object that research has penetrated into all fields of science. In recent years, more and more attention from sociology, information science, statistical physics, mathematics, biology, ecology, etc, are attracted, and gradually formed a new interdisplinary field, which named 'Complex Networks' or 'network science'. As two groundbreaking research work published, which are by Watts and Strogatz in 1998 and Barabási and Albert in 1999 respectively, the boom in complex networks research was opened.Diffusion and transmission are two important processes taking place in various information networks, such as diffusion of news and new word in social network, transmission of packets among routers in the Internet, and so on. Then we will naturally think: What effect does the network topology in empirical research have on the transmission and diffusion process of information? Can we propose some strategies to optimize these processes after we take a deep understanding of the basic structure and the function of network?First of all, this paper introduces some topological characteristic quantity of complex networks, recent empirical research work of network topology and some classical network models. then we presents the research development on diffusion and transmission of information packet on the network, and describes a information traffic flow model which can portray the information transmission process in the real information network. After that, several effective routing strategies in this model are discussed.Finally, we propose an effective routing strategy in this article, which simply uses one parameterαto control the strategy. We found that the network capacity had a nonlinear relationship with the parameterα. When we took the optimal parameters ofα=0.1, traffic capacity can be remarkably promoted compared with that by the efficient routing strategy. Through the analysis of network load distribution, the increase in the system capacity may be due to the effective use of Hub nodes. Besides, it is also shown that the traffic capacity is almost invariable with time delay of updating neighbor nodes queue lengths, and the average packet number and travel time almost keep constant when the time delay are no more than 80. So we can say that our strategy is a efficient routing strategy, and it is quite practical.