Sciweavers

Share
TON
2010
138views more  TON 2010»
9 years 1 months ago
SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
Fong Pong, Nian-Feng Tzeng
JSAC
2010
78views more  JSAC 2010»
9 years 5 months ago
Evolution of Internet Address Space Deaggregation: Myths and Reality
—Internet routing table size growth and BGP update churn are two prominent Internet scaling issues. There is widespread belief in a high and fast growing number of ASs that deagg...
Luca Cittadini, Wolfgang Mühlbauer, Steve Uhl...
CCR
2002
101views more  CCR 2002»
9 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
CN
2007
97views more  CN 2007»
9 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
MASCOTS
2004
9 years 8 months ago
Routing in an Internet-Scale Network Emulator
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
Jay Chen, Diwaker Gupta, Kashi Venkatesh Vishwanat...
CF
2008
ACM
9 years 9 months ago
Multi-terabit ip lookup using parallel bidirectional pipelines
To meet growing terabit link rates, highly parallel and scalable architectures are needed for IP lookup engines in next generation routers. This paper proposes an SRAM-based multi...
Weirong Jiang, Viktor K. Prasanna
DSN
2004
IEEE
9 years 11 months ago
FRTR: A Scalable Mechanism for Global Routing Table Consistency
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
Lan Wang, Daniel Massey, Keyur Patel, Lixia Zhang
CCGRID
2004
IEEE
9 years 11 months ago
Routing and resource discovery in Phoenix Grid-enabled message passing library
We describe design and implementation of a "Gridenabled" message passing library, in the context of Phoenix message passing model. It supports (1) message routing betwee...
Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa
SIGCOMM
1997
ACM
9 years 11 months ago
Scalable High Speed IP Routing Lookups
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
Marcel Waldvogel, George Varghese, Jonathan S. Tur...
INFOCOM
1999
IEEE
9 years 11 months ago
High Performance IP Routing Table Lookup using CPU Caching
Wire-speed IP (Internet Protocol) routers require very fast routing table lookup for incoming IP packets. The routing table lookup operation is time consuming because the part of ...
Tzi-cker Chiueh, Prashant Pradhan
books