Sciweavers

366 search results - page 56 / 74
» A routing underlay for overlay networks
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
On the Effectiveness of Measurement Reuse for Performance-Based Detouring
— For both technological and economic reasons, the default path between two end systems in the wide-area Internet can be suboptimal. This observation has motivated a number of sy...
David R. Choffnes, Fabian E. Bustamante
NCA
2006
IEEE
14 years 1 months ago
Congestion Control for Distributed Hash Tables
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer
OPODIS
2007
13 years 9 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
P2P
2006
IEEE
120views Communications» more  P2P 2006»
14 years 1 months ago
Risk Driven Semantic P2P Service Retrieval
In this paper, we present a novel approach, named RS2D, to risk driven semantic service query routing in unstructured, so called pure P2P networks. Following the RS2D protocol, ea...
Matthias Klusch, Ulrich Basters
INFOCOM
2007
IEEE
14 years 1 months ago
Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree
— The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interc...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo