Rajmohan Rajaraman
ABSTRACT
Consider an arbitrary distributed network in which large numbers of objects are continuously being created, replicated, and destroyed. A basic problem arising in such an environment is that of organizing a data tracking scheme for locating object copies. In this paper, we present a new tracking scheme for locating nearly copies of replicated objects in arbitrary distributed environments.
Our tracking scheme supports efficient accesses to data objects while keeping the local memory overhead low. In particular, our tracking scheme achieves an expected polylog(n)-approximation in the cost of any access operation, for an arbitrary network. The memory overhead incurred by our scheme is Ο(polylog(n)) times the maximum number of objects stored at any node, with high probability. We also show that our tracking scheme adapts well to dynamic changes in the network.
- 1.T. E. Anderson, M. D. Dahlin, J. N. Neefe, D. A. Patterson, D. S. Rosselli, and R. Y. Wang. Serverless network file systems. In Proceedings of the 15th Symposium on Operating Systems Principles, pages 109-126, 1995. Google Scholar
Digital Library
- 2.B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 164-173, May 1993. Google ScholarDigital Library
- 3.B. Awerbuch, Y. Bartal, and A. Fiat. Distributed paging for general networks. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 574-583, January 1996. Google ScholarDigital Library
- 4.B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear cost sequential and distributed constructions. In Proceedings of the Thirty-Fourth Annual Symposium on Foundations of Computer Science, pages 638-647, 1993.Google Scholar
- 5.B. Awerbuch and D. Peleg. Routing with polynomial communication space tradeoff. SIAM Journal on Discrete Mathematics, 5:151-162, 1990. Google ScholarDigital Library
- 6.B. Awerbuch and D. Peleg. Sparse partitions. In Proceedings of the Thirty-First Annual IEEE Symposium on Foundations of Computer Science, pages 503-513, October 1990.Google ScholarDigital Library
- 7.B. Awerbuch and D. Peleg. Online tracking of mobile users. Journal of the ACM, 42(5):1021-1058, September 1995. Google ScholarDigital Library
- 8.Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the Thirty-Seventh Annual IEEE Symposium on Foundations of Computer Science, pages 184-193, October 1996. Google ScholarDigital Library
- 9.Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 161-168, 1998. Google ScholarDigital Library
- 10.Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. Journal of Computer and System Sciences, 51:341-358, 1995. Google ScholarDigital Library
- 11.T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms, chapter 18. MIT Press/McGraw-Hill, Cambridge, MA, 1990. Google ScholarDigital Library
- 12.J. L. Carter and M. N. Wegman. Universal Classes of Hash Functions. Journal of Computer and System Sciences, 18:143-154, 1979.Google ScholarCross Ref
- 13.J. D. Guyton and M. F. Schwartz. Locating nearby copies of replicated Internet servers. In Proceedings of ACM SIGCOMM, pages 288-298, 1995. Google ScholarDigital Library
- 14.S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L.Zhang, The placement ofInternet instrumentation, In Proceedings of IEEE INFOCOMM, 2000.Google ScholarCross Ref
- 15.D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 654-663, May 1997. Google ScholarDigital Library
- 16.G. Konjevod, R. Ravi, and F. S. Salman. On approximating planar metrics by tree metrics. Submitted for publication in J. Algorithms, July 1997.Google Scholar
- 17.J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of the Ninth International Conference onArchitectural Support for Programming Languages and Operating Systems (ASPLOS), 2000. Google ScholarDigital Library
- 18.F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992. Google ScholarDigital Library
- 19.B. M. Maggs, F. Meyer auf der Heide, B. V.ocking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth. In Proceedings of the Thirty-Eighth Annual Symposium on Foundations of Computer Science, pages 284-293, October 1997. Google ScholarDigital Library
- 20.F. Meyer auf der Heide, B. Vocking, and M. Westermann. Caching in networks. In Proceedings of the Eleventh Symposium on Discrete Algorithms, pages 430-439, 2000. Google ScholarDigital Library
- 21.C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241-180, 1999. A preliminary version of this paper appeared in Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 311-320, June 1997. Google ScholarDigital Library
- 22.M. van Steen, F. J. Hauck, and A. S. Tanenbaum. A model for worldwide tracking of distributed objects. In Proceedings of the 1996 Conference on Telecommunications Information Networking Architecture (TINA 96), pages 203-212, September 1996.Google Scholar
- 23.B. Wu, G. Lancia, V. Bafna, K. Chao, R. Ravi, and C. Tang", A polynomial time approximation scheme for Minimum Routing Cost Spanning Trees In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 21-32, January 1998. Google ScholarDigital Library
- 24.O. Wolfson, S. Jajodia, and Y. Huang An adaptive data replication algorithm ACM Transactions on Database Systems, 22:255-314, 1997. Google ScholarDigital Library
Index Terms
- A data tracking scheme for general networks
Recommendations
A general packet replication scheme for multicasting in interconnection networks
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1Multicasting in broadband packet switches and metropolitan networks can be achieved by first replicating the packets and then routing them to their destinations. This paper studies a very simple but general replication scheme that can be applied to ...
Branch replication scheme: A new model for data replication in large scale data grids
Data replication is a practical and effective method to achieve efficient and fault-tolerant data access in grids. Traditionally, data replication schemes maintain an entire replica in each site where a file is replicated, providing a read-only model. ...
A Novel Memory Block Management Scheme for PCM Using WOM-Code
HPCC-CSS-ICESS '15: Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conf on Embedded Software and SystemsPhase Change Memory (PCM) is a promising DRAM replacement in embedded systems due to its attractive characteristics including low static power consumption and high density. However, long write latency is one of the major drawbacks in current PCM ...
Comments