首页 | 本学科首页   官方微博 | 高级检索  
     

复杂网络与可扩展路由
引用本文:张连明.复杂网络与可扩展路由[J].中兴通讯技术,2009,15(6):5-8.
作者姓名:张连明
作者单位:湖南师范大学,物理与信息科学学院,湖南,长沙,410081
基金项目:中国博士后科学基金资助项目 
摘    要:互联网规模扩大,相应路由表大小呈指数增加,形成下一代互联网可扩展路由“瓶颈”。基于复杂网络和可扩展路由的相关理论与主要策略,文章对相关研究成果。如小世界效应所表现出来的特性、小世界和无标度网络模型,网格、层次及隐藏度量等3种可扩展路由网络模型,随机游走、贪婪、最大度、优先、本地介数、距离与度及相似性与度混合等多种路由策略等进行了分析与归纳。这些研究结果和方法为因互联网规模不断扩大所带来的路由系统可扩展性问题提供解决方案

关 键 词:复杂网络  可扩展路由  局部拓扑信息

Complex Network and Scalable Routing
ZHANG Lianming.Complex Network and Scalable Routing[J].ZTE Communications,2009,15(6):5-8.
Authors:ZHANG Lianming
Affiliation:ZHANG Lianming(College of Physics and Information Science, Hunan Normal University, Changsha, 410081, China)
Abstract:With the Internet' s expansion, its routing table size increases exponentially, which is a bottleneck of routing scalability in the next generation Intemet. In this paper, we sums up and analyzes the important theories and strategies for complex networks and scalable routing. For complex networks, the characteristics of small-world effect, small-world network models and scale-free network model are discussed. As for scalable routing, the models of grid, hierarchical and hidden metric are described. Moreover, the routing strategies of random walk, greedy, maximum degree, preferentia choice, local betweenness centrality, distance-degree and homophily-degree are analyzed. These research results and methods will provide a solution to the problem of scalable routing brought by the Internet' s expansion.
Keywords:complex network  scalable routing  local information of topology
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号