標題: Performance enhancement of IP forwarding by reducing routing table construction time
作者: Wang, PC
Chan, CT
Chen, YC
資訊工程學系
Department of Computer Science
關鍵字: gigabit networking;Internet;IP address lookup
公開日期: 1-May-2001
摘要: In previous work, Lampson et al, proposed an IP lookup algorithm which performs binary search on prefixes (BSP) [3], The algorithm is attractive for IPv6 because of its bounded worst-case memory requirement. Although for the sake of fast forwarding, the cost paid for the slowing down insertion is reasonable, the performance of routing-table reconstruction in BGP is too time-consuming to handle the frequent route updates. In this letter, we propose a fast forwarding-table construction algorithm which can handle more than 3600 route updates per second, Moreover, it is simple enough to fulfill the need of fast packet forwarding.
URI: http://dx.doi.org/10.1109/4234.922769
http://hdl.handle.net/11536/29691
ISSN: 1089-7798
DOI: 10.1109/4234.922769
期刊: IEEE COMMUNICATIONS LETTERS
Volume: 5
Issue: 5
起始頁: 230
結束頁: 232
Appears in Collections:Articles


Files in This Item:

  1. 000168659000016.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.