Abstract
Content caching at the Internet edge is becoming very popular because of flash crowd problem. Content Delivery Networks (CDN) was evolved for content caching with a complete solution for network reliability, scalability and performance enhancement. A number of researches have been focused on CDN issues like replica server placement, content caching, request routing and accounting management. But still some more issues are yet to be solved. This paper focuses on the concept of Broadcast Storm Problem (BSP) in CDN due to content distribution and request routing. Several approaches are available for content distribution and content caching. When there is any update in any surrogate, the same has to be communicated to all other servers over the network to avoid data inconsistency. Simple flooding or gossiping is generally used for the same, but these approaches are accompanied with BSP. Numerous BSP algorithms have been evolved, but the main concern is the wireless sensor networks. In this paper a comparison among several BSP algorithms has been shown which reveals that counter-based approach is much simpler and can be applied to any network. In addition to the comparative analysis, the counter-based scheme gets modified for CDN.
This is a preview of subscription content, log in via an institution to check access.
References
H. Yin, X. Liu, G. Min, and C. Lin, “Content Delivery Networks: a Bridge between emerging applications and Future IP Networks,” IEEE Network, vol. 24, no. 4, pp. 52–56, July–August 2010.
Darothi Sarkar, Nitin Rakesh, Krishna Kumar Mishra, “Problems in Replica Server Placement (RSP) over Content Delivery Networks (CDN)”, In proceeding of 6th ACM International Conference on Computer and Communication Technology, pp. 175–179, 2015.
V. Gehlen, A. Finamore, M. Mellia, M. M. Munafò, “Uncovering the big players of the web”, in proc. of 4th Int. Conf. TMA, pp. 15–28, 2012.
L. Han, M. Punceva, B. Nath, S. Muthukrishnan, L. Iftode, “Socialcdn: Caching techniques for distributed social networks”, in Proceedings of the 12th IEEE International Conference on Peer-to-Peer Computing (P2P), pp. 191–202, 2012.
M. H. Al-Shayeji, S. Rajesh, M. Alsarraf, and R. Alsuwaid, “A Comparative Study on Replica Placement Algorithms for Content Delivery Networks,” in proc. of IEEE Second International Conference on Advances in Computing, Control and Telecommunication Technologies, pp. 140–142, 2010.
M. Pathan, R. Buyya, “A Taxonomy of CDNs”, in Content Delivery Networks, R. Buyya, M. Pathan, A. Vakali, Eds. Berlin: Springer, 2008, pp. 33–77.
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, “The broadcast storm problem in a mobile ad hoc network”, In Proceedings of the IEEE/ACM MOBICOM, pp. 151–162, 1999.
E.P. Markatos and C.E. Chironaki, “A Top 10 Approach for Prefetching the Web,” Proc. INET ’98: Internet Global Summit, July 1998.
B. Williams and T. Camp, “Comparisons of Broadcasting Techniques for Mobile Ad hoc Networks”, In Proceeding of third ACM International Symposium on Mobile Ad hoc Networking and Computing (MOBIHOC), pp. 194–205, 2002.
C. Ho, K. Obraczka, G. Tsudik and K. Viswanath, “Flooding for reliable multicast in multi- hop ad hoc networks”, In Proceeding of the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIALM), pages 64–71, 1999.
Z. J. Haas, J. Y. Halpern and L. Li, “Gossip-based ad hoc routing”, IEEE/ACM Transaction of Networking., vol. 14, no. 3, pp. 479–491, 2006.
A. S. Kumar, K. S. Ramaswami, “A New Density Based Probabilistic Counter Scheme for Solving Broadcast Storm in Mobile Ad Hoc Networks”, Journal of Theoretical and Applied Information Technology, Vol. 29, No. 2, pp. 451– 459, 2014.
C. Chen, C.-K. Hsu and H.-K. Wang “A distance-aware counter-based broadcast scheme for wireless ad hoc networks,” Military Communications Conference. IEEE, vol. 2, pp. 1052–1058, 2005.
A. Mohammed, M. Ould-Khaoua, L. Mackenzie and J. D. Abdulai, “Dynamic Probabilistic Counter-Based Broadcasting in Mobile Ad Hoc Networks”, in Proceedings of Second International Conference on Adaptive Science Technology (ICAST ‘,09), pp. 120–127, 2009.
O. Tonguz, N. Wisitpongphan, J. Parikh, F. Bai, P. Mudalige and V. Sadekar, “On the Broadcast Storm Problem in Ad Hoc Wireless Networks”, in Proceedings of Third International Conference on Broadband Comm., Networks and Systems (BROADNETS’,06) pp. 1–11, Oct. 2006.
H. Lim and C. Kim., “Multicast tree construction and flooding in wireless ad hoc networks”, in Proceedings of the ACM International Workshop on Modelling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), pp. 61–68, 2000.
W. Peng and X. Lu., “On the reduction of broadcast redundancy in mobile ad hoc networks”, In Proceeding of first ACM International Symposium on Mobile Ad hoc Networking and Computing (MOBIHOC), pp. 129–130, 2000.
W. Lou and J. Wu, “Toward broadcast reliability in mobile ad hoc networks with double coverage”, IEEE Transaction on Mobile Computing, vol. 6, no. 2, pp. 148–163, 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sarkar, D., Rakesh, N., Mishra, K.K. (2018). Broadcast Storm Problem—A Hidden Consequence of Content Distribution in Content Delivery Networks. In: Perez, G., Mishra, K., Tiwari, S., Trivedi, M. (eds) Networking Communication and Data Knowledge Engineering. Lecture Notes on Data Engineering and Communications Technologies, vol 3. Springer, Singapore. https://doi.org/10.1007/978-981-10-4585-1_13
Download citation
DOI: https://doi.org/10.1007/978-981-10-4585-1_13
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-4584-4
Online ISBN: 978-981-10-4585-1
eBook Packages: EngineeringEngineering (R0)