Sciweavers

456 search results - page 60 / 92
» On Routing in Distributed Hash Tables
Sort
View
NSDI
2004
14 years 16 days ago
Untangling the Web from DNS
The Web relies on the Domain Name System (DNS) to resolve the hostname portion of URLs into IP addresses. This marriage-of-convenience enabled the Web's meteoric rise, but th...
Michael Walfish, Hari Balakrishnan
MOBICOM
2006
ACM
14 years 5 months ago
Double rulings for information brokerage in sensor networks
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork...
Rik Sarkar, Xianjin Zhu, Jie Gao
ANCS
2007
ACM
14 years 3 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan
SPAA
1996
ACM
14 years 3 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
EUROPAR
2009
Springer
14 years 2 months ago
Enabling High Data Throughput in Desktop Grids through Decentralized Data and Metadata Management: The BlobSeer Approach
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé