Sciweavers

343 search results - page 42 / 69
» Weighted distributed hash tables
Sort
View
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é
INFOCOM
2006
IEEE
14 years 5 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
14 years 11 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
INFOCOM
2006
IEEE
14 years 5 months ago
Improving Lookup Performance Over a Widely-Deployed DHT
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
Daniel Stutzbach, Reza Rejaie
IWNAS
2008
IEEE
14 years 5 months ago
POND: The Power of Zone Overlapping in DHT Networks
— Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan