CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Review for Event Delivering Techniques in Publish/Subscribe Scheme

by Lajitha H., Ratheesh S., Neevan R.
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 132 - Number 16
Year of Publication: 2015
Authors: Lajitha H., Ratheesh S., Neevan R.
10.5120/ijca2015907659

Lajitha H., Ratheesh S., Neevan R. . Review for Event Delivering Techniques in Publish/Subscribe Scheme. International Journal of Computer Applications. 132, 16 ( December 2015), 1-5. DOI=10.5120/ijca2015907659

@article{ 10.5120/ijca2015907659,
author = { Lajitha H., Ratheesh S., Neevan R. },
title = { Review for Event Delivering Techniques in Publish/Subscribe Scheme },
journal = { International Journal of Computer Applications },
issue_date = { December 2015 },
volume = { 132 },
number = { 16 },
month = { December },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume132/number16/23675-2015907659/ },
doi = { 10.5120/ijca2015907659 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:29:33.794489+05:30
%A Lajitha H.
%A Ratheesh S.
%A Neevan R.
%T Review for Event Delivering Techniques in Publish/Subscribe Scheme
%J International Journal of Computer Applications
%@ 0975-8887
%V 132
%N 16
%P 1-5
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Most of the challenges in the creation of a publish/subscribe scheme is an effective delivery of message in bounded time and reliability of transmission. Because of the communication in WAN may be affected by the uncertain behavior of the network, in which messages can be lost or delayed. To enforces both reliability and timeliness in a publish/subscribe scheme requires two different approaches: Network Coding and Gossiping. This paper presents the concepts associates with these approaches in the publish/subscribe environment. The objective of this paper is to analyze how these approaches works and what are the impacts after applying it.

References
  1. 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.
  2. 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. 114131, June 2003.
  3. R. Baldoni, M. Contenti, S. Piergiovanni, and A. Virgillito ”Modeling publish/subscribe communication systems: Towards a formal approach,” in Proc. 8th IEEE Int. Workshop Object-Oriented Real-Time Depend. Syst., 2003, pp. 304311.
  4. C. Fragouli, J. L. Boudec, and J. Widmer ”Network coding: an instant primer,” Computer Communication Review, vol. 36, no. 1, p. 63, 2006.
  5. C. Esposito, S. Russo, R. Beraldi, and M. Platania ”On the benefit of network coding for timely and reliable event dissemination inWAN,” in Proc. 1st Int.Workshop Netw. Resilience, Oct. 2011, pp. 8489.
  6. Paolo Costa, Matteo Migliavacca, Gian Pietro Picco, and Gianpaolo Cugola ”Introducing Reliability in ContentBased Publish/ Subscribe through Epidemic Algorithms,” 20133 Milano, Italy.
  7. S. Li, R. Yeung, and N. Cai ”Linear network coding,” IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371381, Feb. 2003.
  8. C. Esposito, S. Russo, R. Beraldi, M. Platania, and R. Baldoni. ”Achieving reliable and timely event dissemination over wan” in Proc. 13th ICDCN, 2012, pp. 265280.
  9. 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.
  10. Y. Wu, P. A. Chou, and K. Jain.” A comparison of network coding and tree packing”. ISIT 2004, 2004.
  11. P. Sanders, S. Egner, and L. Tolhuizen.” Polynomial time algorithms for network information flow,” Proc. 15th ACM Symposium on Parallel Algorithms and Architectures, 2003.
  12. A.-M. Kermarrec, L-Massoulie, and A. J. Ganesh, ”Probabilistic Reliable Dissemination in Large-Scale Systems,” IEEE Transactions on Parallel and Distributed Systems (TPDS), vol. 14, no. 2, pp. 111,February 2003
Index Terms

Computer Science
Information Sciences

Keywords

Network Coding Gossipping

Powered by PhDFocusTM