Sciweavers

53 search results - page 4 / 11
» A Fast IP Routing Lookup Scheme
Sort
View
AINA
2009
IEEE
14 years 2 months ago
A Pipelined IP Forwarding Engine with Fast Update
IP address lookup is one of the most important functionalities in the router design. To meet the requirements in high speed routers consisting of linecards with 40Gbps transfer ra...
Yeim-Kuan Chang, Yen-Cheng Liu, Fang-Chen Kuo
CIAC
2003
Springer
85views Algorithms» more  CIAC 2003»
14 years 26 days ago
XOR-Based Schemes for Fast Parallel IP Lookups
Gian Carlo Bongiovanni, Paolo Penna
TC
2010
13 years 6 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
CN
2007
97views more  CN 2007»
13 years 7 months ago
A longest prefix first search tree for IP lookup
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen
INFOCOM
1998
IEEE
13 years 12 months ago
Routing Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets pe...
Pankaj Gupta, Steven Lin, Nick McKeown