Sciweavers

1080 search results - page 138 / 216
» Distributed Hash Tables
Sort
View
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
15 years 11 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
NPC
2004
Springer
15 years 11 months ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
NCA
2003
IEEE
15 years 11 months ago
Scalable Protocol for Content-Based Routing in Overlay Networks
In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alte...
Raphaël Chand, Pascal Felber
CF
2008
ACM
15 years 8 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
ACMIDC
2009
15 years 4 months ago
Developing a media space for remote synchronous parent-child interaction
While supporting family communication has traditionally been a domain of interest for interaction designers, few research initiatives have explicitly investigated remote synchrono...
Svetlana Yarosh, Stephen Cuzzort, Hendrik Mül...