Abstract
To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in time-constrained flash dissemination scenarios, e.g. earthquake early warning, where time is of the essence, the tree-based ALM has a single point of failure; its reliable extensions using ack-based failure recovery protocols cannot support reliable dissemination in the timeframe needed. In this paper, we exploit path diversity, i.e. exploit the use of multiple data paths, to achieve fast and reliable data dissemination. First, we design a forest-based M2M (Multiple parents-To-Multiple children) ALM structure where every node has multiple children and multiple parents. The intuition is to enable lower dissemination latency through multiple children, while enabling higher reliability through multiple parents. Second, we design multidirectional multicasting algorithms that effectively utilize the multiple data paths in the M2M ALM structure. A key aspect of our reliable dissemination mechanism is that nodes, in addition to communicating the data to children, also selectively disseminate the data to parents and siblings. As compared to trees using traditional multicasting algorithm, we observe an 80% improvement in reliability under 20% of failed nodes with no significant increase in latency for over 99% of the nodes.
Download to read the full chapter text
Chapter PDF
References
Modelnet, http://issg.cs.duke.edu/modelnet.html
Inet, heep://topology.eecs.umich.edu/inet/
Chu, Y., Rao, S.G., Seshan, S., Zhang, H.: A Case for End System Multicast. In: Proc. of ACM Sigmetrics (2000)
Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable Application Layer Multicast. In: Proc. of SIGCOMM 2002 (2002)
Tran, D.A., Hua, K.A., Do, T.T.: ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming. In: Proc. of INFOCOM (2003)
Rowstron, A., Kermarrec, A., Castro, M., Druschel, P.: Scribe: The design of a large-scale event notification infrastructure. In: Networked Group Communication, pp. 30–43 (2001)
Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: SplitStream: High-bandwidth multicast in a cooperative environment. In: Proc. of SOSP 2003 (2003)
Kosti, C.D., Rodriguez, A., Albrecht, J., Vahdat, A.: Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh. In: Proc. of SOSP 2003 (2003)
Pai, V., Kumar, K., Tamilmani, K., Sambamurthy, V., Mohr, A.E.: Chainsaw: Eliminating Trees from Overlay Multicast. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 127–140. Springer, Heidelberg (2005)
Cohen, B.: BitTorrent (2001), http://www.bitconjurer.org/BitTorrent/
Deshpande, M., Xing, B., Lazardis, I., Hore, B., Venkatasubramanian, N., Mehrotra, S.: CREW: A Gossip-based Flash-Dissemination System. In: Proc. of ICDCS 2006 (2006)
Deshpande, M., Amit, A., Chang, M., Venkatasubramanian, N., Mehrotra, S.: Flashback: A Peer-to-Peer Webserver for Handling Flash Crowds. In: Proc. of ICDCS 2007 (2007)
Snoeren, A.C., Conley, K., Gifford, D.K.: Mesh-Based Content Routing using XML. In: Proc. of SOSP 2001 (2001)
Bansal, M., Zakhor, A.: Path Diversity Based Techniques for Resilient Overlay Multimedia Multicast. In: Proc. of PCS 2004 (2004)
Tian, R., Zhang, Q., Xiang, Z., Xiong, Y., Li, X., Zhu, W.: Robust and efficient path diversity in application-layer multicast for video streaming. IEEE Transactions on Circuits and Systems for Video Technology 15(8) (2005)
Frey, D., Murphy, A.L.: Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks. In: Proc. of P2P 2008 (2008)
Rodrigues, R., Liskov, B.: High Availability in DHTs: Erasure Coding vs. Replication. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 226–239. Springer, Heidelberg (2005)
Padmanabhan, V.N., Wang, H.J., Chow, P.A.: Resilient Peer-to-Peer Streaming. In: Proc. of ICNP 2003 (2003)
Venkataraman, V., Francisy, P., Calandrinoz, J.: Chunkyspread: Multitree Unstructured PeertoPeer Multicast. In: Proc. of IPTPS 2006 (2006)
Yang, M., Yang, Y.: A Peer-to-Peer Tree Based Reliable Multicast Protocol. In: Proc. of Globecom 2006 (2006)
Rong, B., Khalil, I., Tari, Z.: Making Application Layer Multicast Reliable is Feasible. In: Proc. of LCN 2006 (2006)
Zhang, J., Liu, L., Pu, C., Ammar, M.: Reliable Peer-to-peer End System Multicasting through Replication. In: Proc. of P2P 2004 (2004)
Kusumoto, T., Kunichika, Y., Katto, J., Okubo, S.: Tree-Based Application Layer Multicast using Proactive Route Maintenance and its Implementation. In: Proc. of P2PMMS 2005 (2005)
Birrer, S., Bustamante, F.: Resilient Peer-to-Peer Multicast without the Cost. In: Proc. of MMCN 2005 (2005)
El-Ansary, S., Alima, L.O., Brand, P., Haridi, S.: Efficient Broadcast in Structured P2P Networks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 304–314. Springer, Heidelberg (2003)
Ciavattone, L., Morton, A., Ramachandran, G.: Standardized Active Measurements on a Tier 1 IP Backbone. IEEE Communications (June 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kim, K., Mehrotra, S., Venkatasubramanian, N. (2010). FaReCast: Fast, Reliable Application Layer Multicast for Flash Dissemination. In: Gupta, I., Mascolo, C. (eds) Middleware 2010. Middleware 2010. Lecture Notes in Computer Science, vol 6452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16955-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-16955-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16954-0
Online ISBN: 978-3-642-16955-7
eBook Packages: Computer ScienceComputer Science (R0)