1807 search results - page 228 / 362 » Resilient Overlay Networks |
125
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
133
click to vote
INFOSCALE
2007
ACM
15 years 5 months ago
2007
ACM
Several caching techniques have been used to reduce the bandwidth consumption and to provide faster answers in P2P systems. In this paper, we address the problem of reducing unnec...
168
click to vote
IC
2010
15 years 2 months ago
2010
Network services play an important role in the Internet today. They serve as data caches for websites, servers for multiplayer games and relay nodes for Voice over IP (VoIP) conver...
130
click to vote
ICCNMC
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previo...
156
click to vote
IJAHUC
2008
15 years 4 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...