Sciweavers

6 search results - page 1 / 2
» Heuristic Relay Node Selection Algorithm for One-Hop Overlay...
Sort
View
ICDCSW
2008
IEEE
14 years 1 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
INFOCOM
2006
IEEE
14 years 1 months ago
Placing Relay Nodes for Intra-Domain Path Diversity
Abstract— To increase reliability and robustness of missioncritical services in the face of routing changes, it is often desirable and beneficial to take advantage of path diver...
Meeyoung Cha, Sue B. Moon, Chong-Dae Park, Aman Sh...
JPDC
2006
133views more  JPDC 2006»
13 years 7 months ago
Locality in structured peer-to-peer networks
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing fe...
Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Gr...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
CCS
2009
ACM
14 years 2 months ago
As-awareness in Tor path selection
Tor is an anonymous communications network with thousands of router nodes worldwide. An intuition reflected in much of the literature on anonymous communications is that, as an a...
Matthew Edman, Paul F. Syverson