Multiple Tree Multicast in a Dynamic Environment

Multiple multicast trees have been shown to increase the performance of data distribution when compared with single tree multicast. Node loss and congestion changes the performance characteristics of the multicast trees. Multicast tree performance feedback can be used to determine the optimal tree to use based on the feedback. We further examine an optimizing methodology, Probabilistic Multicast Trees (PMT), for multiple multicast trees which makes use of the performance feedback, generates a probability of usage for each multicast tree based on that feedback and then makes intelligent choices about which multicast tree to use for a given packet in the presence of node loss and congestion.

[1]  Dimitrios Koutsonikolas,et al.  The Case for FEC-Based Reliable Multicast in Wireless Mesh Networks , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[2]  Kien A. Hua,et al.  ZIGZAG: an efficient peer-to-peer scheme for media streaming , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  D. Johnston,et al.  Optimizing application level multicast trees over wireless networks , 2011, Proceedings of the 2011 IEEE National Aerospace and Electronics Conference (NAECON).

[4]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[5]  Fabián E. Bustamante,et al.  Resilient peer-to-peer multicast without the cost , 2005, IS&T/SPIE Electronic Imaging.

[6]  Paul Francis,et al.  Chunkyspread: Heterogeneous Unstructured End System Multicast , 2006 .

[7]  Jerome H. Saltzer,et al.  End-to-end arguments in system design , 1984, TOCS.

[8]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[9]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[10]  Aravind Srinivasan,et al.  Resilient multicast using overlays , 2003, IEEE/ACM Transactions on Networking.

[11]  Zongming Fei,et al.  A Proactive Tree Recovery Mechanism for Resilient Overlay Multicast , 2007, IEEE/ACM Transactions on Networking.

[12]  David R. McIntyre,et al.  Probabilistic multicast trees , 2012 .

[13]  Nick Feamster,et al.  Measuring the effects of internet path faults on reactive routing , 2003, SIGMETRICS '03.

[14]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[15]  Jack Y. B. Lee,et al.  Parallel overlays for high data-rate multicast data transfer , 2007, Comput. Networks.

[16]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[17]  F.E. Bustamante,et al.  Magellan: performance-based, cooperative multicast , 2005, 10th International Workshop on Web Content Caching and Distribution (WCW'05).

[18]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[19]  Vivek K. Goyal,et al.  Multiple description coding: compression meets the network , 2001, IEEE Signal Process. Mag..

[20]  Hirozumi Yamaguchi,et al.  A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks , 2006, Systems and Computers in Japan.