Client assignment in content dissemination networks for dynamic data

VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases

Volumn 2, Issue , 2005, Pages 673-684

  Shah, Shetal ^a   Ramamritham, Krithi ^a   Ravishankar, Chinya ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b University of California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT ASSIGNMENT; CLIENT-REPOSITORY ASSIGNMENT; CONTENT DISSEMINATION; DYNAMIC DATA;

COSTS; DATABASE SYSTEMS; INFORMATION DISSEMINATION; OPTIMIZATION; PROBLEM SOLVING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33745586084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. RelaxIV: www.di.unipi.it/di/groups/optimize/ORGroup.html.
2. S. Cribble A. Fox, Y. Chawate and E. Brewer. Adapting to network and client variations using active proxies: Lessons and perspectives. IEEE Personal Communications, August 1998.
3. S. Acharya, M. Franklin, and S. Zdonik. Balancing push and pull for data broadcast. In Proceedings of the ACM SIGMOD Conference, May 1997.
4. S. Agrawal, K. Ramamritham, and S. Shah. Construction of a coherency preserving dynamic data dissemination network. IEEE International Real-time Systems Symposium, 2004.
5. G. Banavar, T. Chandra, B. Mukherjee, I. Nagarajarao, R. E. Strom, and D. C. Sturman. An efficient multicast protocol for content-based publish-subscribe systems. In International Conference on Distributed Computing System, 1999.
6. D. Bertsekas and P. Tseng. Relaxation methods for minimum cost ordinary and generalized network flow problems. Operation Research Journal, 36:93-114, 1988.
7. A. Bestavros. Speculative data dissemination and service to reduce server load, network traffic and service time in distributed information systems. In International Conference on Data Engineering, March 1996.
8. M. Bhide, P. Deolasee, A. Katkar, A. Panchbudhe, K. Ramamritham, and P. Shenoy. Adaptive push pull: Disseminating dynamic web data. IEEE transactions on Computers special issue on Quality of Service, 2002.
9. P. Cao and S. Irani. Cost-aware www proxy caching algorithms. Proceedings of the USENIX Symposium on Internet Technologies and Systems, December 1997.
10. J. Chen, D. Dewitt, F. Tian, and Y. Wang. NiagraCQ: A scalable continuous query system for internet databases. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 16-18 2000.
11. D. Dias, W. Kish, R. Mukherjee, and R. Tewari. A scalable and highly available server. In Proceedings of the IEEE Computer Conference (COMPCON), March 1996.
12. V. Duvvuri, P. Shenoy, and R. Tewari. Adaptive leases: A strong consistency mechanism for the world wide web. Infocom, March 2000.
13. A. Fei, G. Pei, and L. Zhang. Measurements on delay and hop-count of the internet. IEEE GLOBECOM'98 - Internet Mini-Conference, 1998.
14. P. Francis. Yallcasf. Extending the internet multicast architecture. http://www.yallcast.com, September 1999.
15. M. Garey and D. Johnson. Computer and Intractability. W. H. Freeman and Company, 1979.
16. R. Gupta, A. Pun, and K. Ramamritham. Executing incoherency bounded continuous queries at web data aggregators. In WWW, 2005.
17. J. Gwertzman and M. Seltzer. The case for geographical push caching. In Proceedings of the Fifth Annual Workshop on Hot Operating Systems, 1995.
18. Arun Iyengar and Jim Challenger. Improving web server performance by caching dynamic data. In USENIX Symposium on Internet Technologies and Systems, 1997.
19. C. Liu and P. Cao. Maintaining strong cache consistency in the world wide web. In Proceedings of ICDCS, May 1997.
20. G. Malan, F. Jahanian, and S. Subramanian. Salamander: A push based distribution substrate for internet applications. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, December 1997.
21. C. Olston and J.Widom. Best effort cache synchronization with source cooperation. In Proceedings of the ACM SIGMOD Conference, June 2002.
22. C. Olston, B. Loo, and J.Widom. Adaptive precision setting for cached approximate values. In Proceedings of the ACM SIGMOD Conference, 2001.
23. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization Algorithms and Complexity. Prentice Hall, 1982.
24. M. Raunak, P. Shenoy, P. Goyal, and K. Ramamritham. Implications of proxy caching for provisioning networks and servers. Proceedings of ACM SiG-METHICS conference, pages 66-77, 2000.
25. P. Rodriguez, K. Ross, and E. Biersack. Improving the WWW: caching or multicast? Computer Networks and ISDN Systems, 1998.
26. S. Shah, K. Ramamritham, and P. Shenoy. Resilient and coherency preserving dissemination of dynamic data using cooperating peers. IEEE Transactions on Knowledge and Data Engineering, 16(7):799-812, July 2004.
27. R. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.
28. R. Tewari, M. Dahlin, H. Vin, and J. Kay. Beyond hierarchies: Design considerations for distributed caching on the internet. In IEEE International Conference on Distributed Computing Systems, 1999.
29. Douglas West. Introduction to Graph Theory. Prentice-Hall, India, 1999.
30. J. Yin, L. Alvisi, M. Dahlin, and C. Lin. Hierarchical cache consistency in a WAN. In USENIX Symposium on Internet Technologies and Systems, 1999.
31. J. Yin, L. Alvisi, M. Dahlin, C. Lin, and A. Iyengar. Engineering server driven consistency for large scale dynamic web services. Proceedings of the WWWI0, 2001.
32. H. Yu and A. Vahdat. Design and evaluation of a continuous consistency model for replicated services. In Proceedings of OSDI, October 2000.
33. S. Zhu and C. Ravishankar. Stochastic consistency, and scalable pull-based caching for erratic data sources. In Proceedings of the 30th Conference on VLDB, August 2004.