Sciweavers

109 search results - page 7 / 22
» A Small IP Forwarding Table Using Hashing
Sort
View
AIRS
2004
Springer
14 years 1 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
ITIIS
2010
140views more  ITIIS 2010»
13 years 2 months ago
RGF: Receiver-based Greedy Forwarding for Energy Efficiency in Lossy Wireless Sensor Networks
Greedy forwarding is the key mechanism of geographic routing and is one of the protocols used most commonly in wireless sensor networks. Greedy forwarding uses 1-hop local informa...
In Hur, Moonseong Kim, Jaewan Seo, Hyunseung Choo
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
14 years 1 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
GLOBECOM
2007
IEEE
14 years 1 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan
ANCS
2009
ACM
13 years 5 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...