Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
A multicast scheme for parallel software-only video effects processing
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
pgmcc: a TCP-friendly single-rate multicast congestion control scheme
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A Rate-Based End-to-End Multicast Congestion Control Protocol
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Multicast transport protocols: a survey and taxonomy
IEEE Communications Magazine
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.24 |
Although IP multicast has been proposed and investigated for years, there are major problems inherent in the IP multicasting technique, e.g. difficulty to scale up the system, difficulty in allocating a globally unique multicast address, complexity in supporting higher level features such as reliable data transfer and congestion/flow control, more importantly, difficulty to deploy on the current Internet infrastructure due to necessity to change many core routers. Recently, end-system multicast (ESM) has been proposed as an alternative solution so that multicasting services can be quickly deployed. In this paper, we consider the'architectural' and 'optimization' issues on designing an ESM-tree. Specifically, we present a distributed algorithm on how to create and maintain an ESM-tree. We propose a distributed algorithm to perform tree optimization (TO) so that an ESM-tree can dynamically adapt to the changing network condition (e.g. drop in transfer bandwidth) so that the nodes within an ESM-tree can receive data more efficiently. The distributed algorithm has the important theoretical properties that at all times, a tree topology can be maintained and any node joining, leaving, as well as any TO operation will not 'partition' the underlying ESM-tree. Therefore, our work can be used to provide an efficient architectural infrastructure for ESM services. We have implemented a prototype ESM system and carried out experiments to illustrate the effectiveness and the performance gains of our ESM optimization protocol.