Sciweavers

456 search results - page 47 / 92
» On Routing in Distributed Hash Tables
Sort
View
INFOCOM
2008
IEEE
14 years 5 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
IPPS
1998
IEEE
14 years 3 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
IMC
2007
ACM
14 years 16 days ago
A global view of kad
Distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
14 years 5 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
MONET
2010
125views more  MONET 2010»
13 years 9 months ago
GTPP: General Truncated Pyramid Peer-to-Peer Architecture over Structured DHT Networks
— Hierarchical Distributed Hash Table (DHT) architectures have been among the most interesting research topics since the birth of flat DHT architecture. However, most of the prev...
Zhonghong Ou, Erkki Harjula, Timo Koskela, Mika Yl...