Date of Publication :7th February 2016
Abstract: The publish/subscribe(pub/sub) is a widespread communication paradigm, which has been paid more attention in distributed applications such as online gaming, social networking , business intelligence because it offers the time, space and synchronization decoupling properties. These applications are typically characterized by a large number of participants which are communicate by exchanging messages on a wide area network (WAN), such as the Internet. However, while this kind of paradigm fits the generic asynchrony and scalability requirements of large scale complex critical infrastructures (LCCIs), it completely or partially lacks the support of quality-of-service (QoS) guarantees. The maximum flow path is needed to achieve maximum data rate/ packet delivery for multicasting to several sinks. The proposed system uses a techniques network coding in a maximum flow network. And also uses a mechanism to choose gossip partners during the recovery phase of the protocol.
Reference :
-
- Christian Esposito, Marco Platania, and Roberto Beraldi "Reliable and Timely Event Notification for Publish/Subscribe Services Over the Internet" IEEE/ACM Transactions on Networking, Vol 22,No1,February 2014.
- P. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec "The many faces of publish/subscribe," ACM Computing Surveys (CSUR), vol. 35, no. 2, pp. 114-131, June 2003.
- C. Fragouli, J. L. Boudec, and J. Widmer "Network coding: an instant primer,"Computer Communication Review, vol. 36, no.1, p. 63, 2006
- C. Esposito, S. Russo, R. Beraldi, and M. Platania "On the benefit of network coding for timely and reliable event dissemination in WAN," in Proc. 1st Int. Workshop Netw. Resilience, Oct. 2011, pp. 8489
- Paolo Costa, Matteo Migliavacca, Gian Pietro Picco, and Gianpaolo Cugola "Introducing Reliability in Content Based Publish/Subscribe through Epidemic Algorithms," 20133 Milano, Italy.
- S. Li, R. Yeung, and N. Cai "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
- https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkers on_algorithm
- C. Fragouli, J. Widmer, and J.-Y. L. Boudec. ”The benefits of coding over routing in a randomized setting”, International Symposium on Information Theory (ISIT), page 442, July 2003.
- P. Sanders, S. Egner, and L. Tolhuizen.” Polynomial time algorithms for network information flow,” Proc. 15th ACM Symposium on Parallel Algorithms and Architectures, 2003.
- Y. Wu, P. A. Chou, and K. Jain.” A comparison of network coding and tree packing”. ISIT 2004, 2004.