Sciweavers

502 search results - page 7 / 101
» Partial Lookup Service
Sort
View
P2P
2009
IEEE
114views Communications» more  P2P 2009»
14 years 2 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
CONEXT
2008
ACM
13 years 9 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
NSDI
2004
13 years 9 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
ISCAS
2006
IEEE
113views Hardware» more  ISCAS 2006»
14 years 1 months ago
High speed routing lookup IC design for IPv6
— With the growth of Internet users and services, the IP address has been exhausted. In order to solve this problem, the short term solution was presented, i.e., CIDR (Classless ...
Yuan-Sun Chu, Hui-Kai Su, Po-Feng Lin, Ming-Jen Ch...
IFIP
2009
Springer
14 years 2 months ago
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
Domenic Teuchert, Simon Hauger