Sciweavers

447 search results - page 42 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
ICDE
2010
IEEE
379views Database» more  ICDE 2010»
15 years 11 months ago
Osprey: Implementing MapReduce-Style Fault Tolerance in a Shared-Nothing Distributed Database
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
Christopher Yang, Christine Yen, Ceryen Tan, Samue...
ICN
2009
Springer
15 years 6 months ago
Distributed Information Object Resolution
The established host-centric networking paradigm is challenged due to handicaps related with disconnected operation, mobility, and broken locator/identifier semantics. This paper...
Kostas Pentikousis
PIMRC
2008
IEEE
15 years 6 months ago
A Distributed IP Mobility Approach for 3G SAE
—Future generations of mobile operator networks, based on an all-IP-based flat architecture and a multitude of different access technologies, require a proper IP-based mobility ...
Mathias Fischer, Frank-Uwe Andersen, Andreas K&oum...
WETICE
2005
IEEE
15 years 5 months ago
GRACE: Enabling collaborations in wide-area distributed systems
The globalization of businesses and the cooperation between organizations have brought on an ever increased need for providing support for distributed collaborations. In this pape...
Anne-Marie Bosneag, Monica Brockmeyer
AINA
2007
IEEE
15 years 6 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...