Sciweavers

456 search results - page 54 / 92
» On Routing in Distributed Hash Tables
Sort
View
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
14 years 8 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...
MDM
2007
Springer
131views Communications» more  MDM 2007»
14 years 5 months ago
Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access t...
Michele Albano, Stefano Chessa, Francesco Nidito, ...
IWDC
2005
Springer
117views Communications» more  IWDC 2005»
14 years 4 months ago
Oasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...
Pankaj Ghanshani, Tarun Bansal
INFOCOM
1998
IEEE
14 years 3 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
MOBIHOC
2007
ACM
14 years 10 months ago
Surviving attacks on disruption-tolerant networks without authentication
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...
John Burgess, George Dean Bissias, Mark D. Corner,...