Sciweavers

50 search results - page 5 / 10
» On the Aggregatability of Router Forwarding Tables
Sort
View
CCR
2002
101views more  CCR 2002»
13 years 7 months ago
On routing table growth
The Internet has experienced explosive growth since its commercialization. The sizes of the routing tables have increased by an order of magnitude over the past six years. This dra...
Tian Bu, Lixin Gao, Donald F. Towsley
INFOCOM
2002
IEEE
14 years 12 days ago
Avoiding Instability during Graceful Shutdown of OSPF
Abstract—Many recent router architectures decouple the routing engine from the forwarding engine, so that packet forwarding can continue even when the routing process is not acti...
Aman Shaikh, Rohit Dube, Anujan Varma
INFOCOM
1998
IEEE
13 years 11 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
SIGCOMM
1999
ACM
13 years 11 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
ICPADS
2002
IEEE
14 years 12 days ago
Hardware-based IP Routing Lookup with Incremental Update
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...
Pi-Chung Wang, Chia-Tai Chan, Shuo-Cheng Hu, Yu-Ch...