###
DOI:
Journal of Software:2010.21(10):2524-2541

互联网可扩展路由
唐明董,张国清,杨景,张国强
(中国科学院 计算技术研究所,北京 100190 湖南科技大学 知识处理与网络化制造湖南省普通高校重点实验室,湖南 湘潭 411201 中国科学院 研究生院,北京 100049;中国科学院 计算技术研究所,北京 100190 中国移动通信研究院,北京 100053)
Scalable Routing for the Internet
TANG Ming-Dong,ZHANG Guo-Qing,YANG Jing,ZHANG Guo-Qiang
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 5797   Download 6692
Received:December 20, 2009    Revised:June 28, 2010
> 中文摘要: 全球路由表的高速膨胀,使互联网路由系统的可扩展性面临着严峻的挑战.为了缩减路由表,很多研究提出了新的路由解决方案.在介绍了互联网路由系统现状之后,从较高层次上将存在的解决方案分为短期方案、路由架构和可扩展路由算法3部分.着重介绍了路由算法和路由架构这两类工作,对经典的可扩展路由算法和路由架构进行了深入的分析和比较.最后讨论了有待解决的关键问题和未来的研究方向.
Abstract:The Internet routing system is facing a serious scaling challenge due to the rapid growth of the global routing table. For the purpose of reducing routing table size, many studies have developed a lot of new routing solutions. After the paper introduces the background of the Internet routing system, a classification of new routing solutions is presented. Then, a typical scalable routing algorithms and architectures become the focus, and their basic ideas and characteristics are deeply analyzed and compared. Finally, some key issues and ideas for future research are discussed.
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the National Natural Science Foundation of China under Grant Nos.60673168, 90818004 (国家自然科学基金) Supported by the National Natural Science Foundation of China under Grant Nos.60673168, 90818004 (国家自然科学基金)
Foundation items:
Reference text:

唐明董,张国清,杨景,张国强.互联网可扩展路由.软件学报,2010,21(10):2524-2541

TANG Ming-Dong,ZHANG Guo-Qing,YANG Jing,ZHANG Guo-Qiang.Scalable Routing for the Internet.Journal of Software,2010,21(10):2524-2541