Sciweavers

346 search results - page 50 / 70
» Routing networks for distributed hash tables
Sort
View
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
MST
2006
136views more  MST 2006»
13 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
CLADE
2004
IEEE
13 years 11 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
ICPP
2007
IEEE
14 years 1 months ago
Achieving Reliability through Replication in a Wide-Area Network DHT Storage System
It is a challenge to design and implement a wide-area distributed hash table (DHT) which provides a storage service with high reliability. Many existing systems use replication to...
Jing Zhao, Hongliang Yu, Kun Zhang, Weimin Zheng, ...
CCGRID
2004
IEEE
13 years 11 months ago
Adaptive congestion control for hotspot management in structured peer-to-peer systems
Distributed Hash Tables (DHTs) bring the promise of increased availability of data to wide-area systems, under the assumption of uniform request load. However, they don't int...
Anne-Marie Bosneag, Yong Xi, Xinjie Li, Monica Bro...