Sciweavers

26 search results - page 4 / 6
» DHT Routing Using Social Links
Sort
View
PODC
2004
ACM
14 years 3 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
JSAC
2007
87views more  JSAC 2007»
13 years 9 months ago
Hidden-Action in Network Routing
— In communication networks, such as the Internet or mobile ad-hoc networks, the actions taken by intermediate nodes or links are typically hidden from the communicating endpoint...
Michal Feldman, John Chuang, Ion Stoica, Scott She...
SAC
2010
ACM
13 years 10 months ago
TransPeer: adaptive distributed transaction monitoring for Web2.0 applications
In emerging Web2.0 applications such as virtual worlds or social networking websites, the number of users is very important (tens of thousands), hence the amount of data to manage...
Idrissa Sarr, Hubert Naacke, Stéphane Gan&c...
PDCAT
2005
Springer
14 years 3 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu