133 search results - page 14 / 27 » A k-anonymous communication protocol for overlay networks |
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The success of Internet telephony services like Skype illustrates the feasibility of utilizing unstructured Peer-to-Peer (P2P) networks as an economical platform for supp...
INFOCOM
2003
IEEE
14 years 24 days ago
2003
IEEE
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly ...
SIGCOMM
2003
ACM
14 years 23 days ago
2003
ACM
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...