Sciweavers

85 search results - page 2 / 17
» Small Forwarding Tables for Fast Routing Lookups
Sort
View
AINA
2004
IEEE
13 years 8 months ago
A Small IP Forwarding Table Using Hashing
As the demand for high bandwidth on the Internet increases, it is required to build next generation routers with the capability of forwarding multiple millions of packets per secon...
Yeim-Kuan Chang, Wen-Hsin Cheng
ICC
2000
IEEE
124views Communications» more  ICC 2000»
13 years 9 months ago
A Fast IP Routing Lookup Scheme
Abstract—A major issue in router design for the next generation Internet is the fast IP address lookup mechanism. The existing scheme by Huang et al. performs the IP address look...
Pi-Chung Wang, Yaw-Chung Chen, Chia-Tai Chan
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
13 years 10 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Filippo Geraci, Roberto Grossi
SIGCOMM
2005
ACM
13 years 10 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
HSNMC
2004
Springer
172views Multimedia» more  HSNMC 2004»
13 years 10 months ago
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao