Sciweavers

456 search results - page 30 / 92
» On Routing in Distributed Hash Tables
Sort
View
CONEXT
2009
ACM
13 years 11 months ago
BUFFALO: bloom filter forwarding architecture for large organizations
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
Minlan Yu, Alex Fabrikant, Jennifer Rexford
INFOCOM
2005
IEEE
14 years 3 months ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...
IPPS
2007
IEEE
14 years 4 months ago
Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs
With the continuous advances in optical communications technology, the link transmission speed of Internet backbone has been increasing rapidly. This in turn demands more powerful...
Dong Lin, Yue Zhang 0006, Chengchen Hu, Bin Liu, X...
MINENET
2005
ACM
14 years 3 months ago
Identifying BGP routing table transfers
BGP routing updates collected by monitoring projects such as RouteViews and RIPE have been a vital source to our understanding of the global routing system. The updates logged by ...
Beichuan Zhang, Vamsi Kambhampati, Mohit Lad, Dani...
ICPP
2008
IEEE
14 years 4 months ago
Bounded LSH for Similarity Search in Peer-to-Peer File Systems
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...
Yu Hua, Bin Xiao, Dan Feng, Bo Yu