The week's pick
Random Articles
Reseach Article
Optimal Policy of Data Dissemination in CDNs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 73 - Number 17 |
| Year of Publication: 2013 |
| Authors: Gadiraju Mahesh, Vatsavayi Valli Kumari |
10.5120/12835-0072
|
Gadiraju Mahesh, Vatsavayi Valli Kumari . Optimal Policy of Data Dissemination in CDNs. International Journal of Computer Applications. 73, 17 ( July 2013), 34-41. DOI=10.5120/12835-0072
Abstract
A dynamic data dissemination network is a content delivery network (CDN) implemented with a hierarchical network of data aggregators (repositories) for disseminating dynamic data like stock quotes, number of votes polled for a political party in an election in different regions and environmental parameters. Continuous aggregate query is a query with aggregation operations and is repeatedly requested by the user. Executing continuous aggregate queries in dynamic data dissemination networks/ CDNs is the essence of our work. There are two major tasks of data dissemination networks. First one is effectively providing data to clients from sources through the network of data aggregators by assigning optimal data aggregators to clients. The second one is propagating the updates of dynamic data to clients. There are different algorithms like enhanced greedy algorithm with withdrawals and primal dual parallel algorithm for accomplishing the first task. The second task can be performed using policies like push, pull, push-or-pull, and push-and-pull. The existing algorithms for dissemination of data and policies for distributing the updates of data are explored in this paper. Then a policy for consistently propagating the updates of dynamic data and an algorithm for optimally assigning data aggregators to clients for disseminating data in CDNs are extracted.
References
- Datta, A. , Dutta, K. , Thomas, H. , VanderMeer, D. , & Ramamritham, K. 2004. Proxy-based acceleration of dynamically generated content on the world wide web: An approach and implementation. ACM Transactions on Database Systems (TODS), 29(2).
- Dilley, J. , Maggs, B. , Parikh, J. , Prokop, H. , Sitaraman, R. , & Weihl, B. 2002. Globally distributed content delivery. IEEE Internet Computing, 6(5).
- Gupta, R. , & Ramamritham, K. 2007. Optimized query planning of continuous aggregation queries in dynamic data dissemination networks. In Proceedings of the 16th international conference on World Wide Web. ACM.
- Shah, S. , Ramamritham, K. , & Shenoy, P. 2002. Maintaining coherency of dynamic data in cooperating repositories. In Proceedings of the 28th international conference on Very Large Data Bases. VLDB Endowment.
- Ramamritham, K. 2010. Maintaining coherent views over dynamic distributed data. In Proceedings of the 6th international conference on Distributed Computing and Internet Technology. Springer Berlin Heidelberg.
- Hochbaum, D. S. 1996. Approximation algorithms for NP-hard problems. PWS Publishing Co.
- Deolasee, P. , Katkar, A. , Panchbudhe, A. , Ramamritham, K. , & Shenoy, P. 2001. Adaptive push-pull: disseminating dynamic web data. In Proceedings of the 10th international conference on World Wide Web. ACM.
- Ninan, A. G. , Kulkarni, P. , Shenoy, P. , Ramamritham, K. , & Tewari, R. 2003. Scalable consistency maintenance in content distribution networks using cooperative leases. IEEE Transactions on Knowledge and Data Engineering, 15(4).
- Srinivasan, R. , Liang, C. , & Ramamritham, K. 1998. Maintaining temporal coherency of virtual data warehouses. In Proceedings of Real-Time Systems Symposium. IEEE.
- Gray, C. , & Cheriton, D. 1989. Leases: An efficient fault-tolerant mechanism for distributed file cache consistency. ACM, 23( 5).
- Shah, S. , Ramamritham, K. , & Shenoy, P. 2004. Resilient and coherence preserving dissemination of dynamic data using cooperating peers. IEEE Transactions on Knowledge and Data Engineering, 16(7).
- Gadiraju, M. , & Kumari, V. V. 2010. Distribution of continuous queries over data aggregators in dynamic data dissemination networks. In Information and Communication Technologies. Springer Berlin Heidelberg.
- Mahesh Gadiraju, V. Valli Kumari. "Primal-dual parallel algorithm for continuous aggregate query dissemination", Submitted to ICACCI2013, Mysore, India.
- Hassin, R. , & Levin, A. 2005. A better-than-greedy approximation algorithm for the minimum set cover problem. SIAM Journal on Computing, 35(1).
- Khuller, S. , Vishkin, U. , & Young, N. 1994. A primal-dual parallel approximation technique applied to weighted set and vertex covers. Journal of Algorithms, 17(2).
Index Terms
Keywords