A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Resilient multicast using overlays
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An analysis of multicast forwarding state scalability
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Resilient and underlay-aware P2P live-streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Even though overlay streaming is an inherently fault tolerant and stable system architecture, careful neighbor selection is a significant task. Inappropriate routing decisions can lead to an unstable topology with only a few very important nodes on which a large set of succeeding nodes depend. The presented algorithm selects streaming neighbors based on local information, passing knowledge to parent nodes only. Similar to SplitStream [Castro, M., P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron and A. Singh, SplitStream: High-bandwidth content distribution in a cooperative environment, in: Proceedings of (IPTPS'03), 2003, pp. 298-313], it creates inner-node disjoint multicast trees. The created topologies are broad and have short paths, thus improving the resistance to node failure and intentional attacks. A malicious node can neither gain any knowledge about different regions of the topology other than its own successors nor deliberately move to a more important position in the hierarchy. The characteristics of the created topologies are revised in a static simulation study calculating the vertex connectivity and packet loss on node disconnections.