Probabilistic Multicast Trees
Keywords:Application -level multicast, Reliable Multicast, Adaptive tree selection, Content distribution
Delivery of the same data content to many clients simultaneously over the Internet continues to be a challenging problem. Multicasting using a single tree structure for data distribution has been shown to be an effective methodology for distribution of data. Using the tree structure to distribute data relieves the source node from the burden of trying to unicast to each client and is efficient because the data delivery burden is distributed over all the participating client nodes. Using multiple tree multicasting further distributes the transmission burden over more participating client nodes and it improves the efficiency of the data distribution. Multiple multicast trees can also be used to manage dynamic behavior of the underlying network. We introduce a methodology which improves data delivery latency and efficiency upon current multiple tree multicast methods. This methodology incorporates a feedback mechanism, randomness and a weighted tree selection mechanism to determine the most efficient multicast tree for multicasting
 Birrer, S. Bustamante, F.E, Magellan: performance-based, cooperative multicast, 10th International Workshop on Web Content Caching and Distribution WCW 2005, Publication Date: 12-13 Sept. 2005, pp: 133- 143
 Birrer, Stefan, Bustamante, Fabian E., Resilient peer-to-peer multicast without the cost , Proc. of MMCN, January 2005.
 Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A. and Singh, A., Splitstream: High-bandwidth multicast in cooperative environments, Proc. of the 19th ACM SOSP, October 2003.
 Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A., SCRIBE: a large-scale and decentralized application-level multicast infrastructure, IEEE Journal on Selected Areas in Communications, 20 (8) (2002),pp: 1489–1499.
 Chu, Yang-hua, Rao, Sanjay G., Seshan, Srinivasan, Zhang, Hui, A case for end system multicast, IEEE Journal on Selected Areas in Communications, Vol 20, Issue 8, Oct 2002
 Goyal,V.K. Multiple Description Coding: Compression meets the Network. IEEE Signal Processing Magazine, Sept 2001, Volume 18, Issue 5 pp: 74-93
 Johnston, D., McIntyre, D., Wolff, F., Papachristou, C. Optimizing Application Level Multicast Trees over Wireless Networks, IEEE NAECON 2011, July 20 - 22, 2011, Dayton, Ohio
 Koutsonikolas, Dimitrios, Hu, Y. Charlie, The case for FEC-based reliable multicast in wireless mesh networks, Proc. of 37th Annual International Conference on Dependable Systems and Networks Washington DC, USA, 2007, pp 491 – 501
 Rowstron, Antony, Druschel, Peter, Pastry: Scalable, decentralized object location and routing for large-scale peer to peer systems., Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, (Middleware 2001), Heidelberg, Germany, November 2001
 Saltzer, J.H., Reed, D.P., and Clark, D.D., End-to-end arguments in system design, M.I.T. Laboratory for Computer Science, ACM Transactions on Computer Systems, Vol 2, Issue 4, Nov 1984, pp 277-288
 To, K.K., Lee, Jack Y.B., Parallel overlays for high data-rate multicast data transfer, Computer Networks 51, (2007), pp 31-42
 Venkataraman, Vidhyashankar, Yoshida, Kaoru, Francis, Paul, Chunkyspread: Heterogeneous unstructured end system multicast, Proceedings of 14th IEEE International Conference on Network Protocols,November 2006
 Yi, Jun, Poellabauer, Christian, Real-time multicast for wireless multihop networks, Journal of Computers and Electrical Engineering Vol. 36, Issue 2, March 2010
 Zakhor, Avideh, Wei, Wei, Multiple Tree Video Multicast over Wireless Ad Hoc Networks, Proc. of IEEE International Conference on Image Processing, Oct. 2006, pp 1665 - 1668
 Zegura, E.W., Calvert, K.L., Bhattacharjee, S, How to Model and Internetwork, Proc of IEEE INFOCOM, Mar 1996
 Free Pastry Simulation http://www.freepastry.org/FreePastry/