Sciweavers

40 search results - page 6 / 8
» Overlay Node Placement: Analysis, Algorithms and Impact on A...
Sort
View
JNW
2006
145views more  JNW 2006»
14 years 9 months ago
A Comparison of Replication Strategies for Reliable Decentralised Storage
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the network...
Matthew Leslie, Jim Davies, Todd Huffman
114
Voted
IPPS
2003
IEEE
15 years 2 months ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
ACSAC
2007
IEEE
15 years 3 months ago
Routing in the Dark: Pitch Black
In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Often these networks ...
Nathan S. Evans, Chris GauthierDickey, Christian G...
INFOCOM
2008
IEEE
15 years 3 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 2 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan