The Complexity of Routing Algorithm in Small-World Networks

Abstract

networks have been an active and common topic in many disciplines, including the social and natural sciences. In order to understand the Small-World phenomenon deeply, Klein berg proposed an augmented graph model and demonstrated six degrees of separation from an algorithmic perspective. Since then, the model has been an important issue which has been studied deeply. Based on our understanding of networks, a very generic framework is proposed for analysis and systematic study of such models. Most of networks can be embedded in this uniform framework which provides some insight into networks. Based on this model, the complexity of routing algorithm in networks is systematically studied and can be specified in a uniform and clear way. The main merits of this framework lie in its generality and openness.