紧凑路由研究.pdfVIP

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@ Journal of Frontiers of Computer Science and Technology 1673-9418/2011/05(03)-0193-15 Tel: +86-10 DOI: 10.3778/j.issn.1673-9418.2011.03.001 * 1,2+ 1 2 唐明董 , 刘建勋 , 张国清 1. 湖南科技大学 知识处理与网络化制造湖南省教育厅重点实验室, 湖南 湘潭 411201 2. 中国科学院 计算技术研究所, 北京 100190 * A Survey on Compact Routing 1,2+ 1 2 TANG Mingdong , LIU Jianxun , ZHANG Guoqing 1. Key Laboratory of Knowledge Processing Networked Manufacturing, Hunan University of Science and Tech- nology, Xiangtan, Hunan 411201, China 2. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China + Corresponding author: E-mail: mdtang@126.com TANG Mingdong, LIU Jianxun, ZHANG Guoqing. A survey on compact routing. Journal of Frontiers of Computer Science and Technology, 2011, 5(3): 193-207. Abstract: In generic shortest-path routing, each node has to maintain routing information for all other nodes, thus the local routing table grows rapidly as network size increases. Compact routing can reduce the growth speed of routing table. The basic idea is to relax the constraint of shortest-path routing, i.e., non-shortest paths are permitted when forwarding packets, so that less routing information is maintained at each node, resulting in a better tradeoff between path stretch and routing table size. Thus far, many studies have proposed compact routing schemes for uni- versal networks or networks with specific types of topology, aiming to jointly optimize routing parameters such as routing table s