Sciweavers

22 search results - page 3 / 5
» A Novel Level-Based IPv6 Routing Lookup Algorithm
Sort
View
ICCCN
2007
IEEE
13 years 11 months ago
Reduce IP Address Fragmentation through Allocation
— The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting el...
Mei Wang, Larry Dunn, Wei Mao, Tao Chen
SIGCOMM
2009
ACM
13 years 11 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
ANCS
2005
ACM
13 years 11 months ago
A novel reconfigurable hardware architecture for IP address lookup
IP address lookup is one of the most challenging problems of Internet routers. In this paper, an IP lookup rate of 263 Mlps (Million lookups per second) is achieved using a novel ...
Hamid Fadishei, Morteza Saheb Zamani, Masoud Sabae...
SIGCOMM
2005
ACM
13 years 11 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...
IEEEARES
2006
IEEE
13 years 11 months ago
Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
Matthew Leslie, Jim Davies, Todd Huffman