Abstract
Distributed and real time collaborative applications are developing at a trememdous speed. People now can effortlessly collaborate with each other in a relatively small scale and location. But there are still numerous challenges to extend the application to a large scale, for example, tens of thousands of users distribute all over the world. Effective and efficient data and object location is one of the most critical issues. In this paper, we presented a Resilient Mechanism for Data and object Location and routing (RDLM), a self-organizing, scalable, robust wide-area infrastructure that efficiently routes requests to content in the presence of heavy load and network faults. Simulation experiments show that RDLM has a satisfying performance especially under heavy network traffic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Awerbuch, B., Peleg, D.: Concurrent online tracking of mobile users. In: Proc. of SIGCOMM 1991, Italy, pp. 221–233 (1991)
Bolosky, W.J., et al.: Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In: Proc. of ACM SIGMETRICS 2000, Santa Clara, CA, pp. 34–43 (2000)
Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math 52, 46–52 (1985)
Castro, M., et al.: Secure routing for structured peer-to-peer overlay networks. In: Proc. 5th Symposium on Operating Systems Design and Implementation (2002)
Clarke, I., et al.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)
Cowen, L.J.: Compact routing with minimum stretch. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 255–260 (1999)
Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Comp. Column 32(1), 36–52 (2001)
Gopal, B., Manber, U.: Integrating content-based access mechanisms with hierarchical file systems. In: Proc. ACM OSDI, pp. 265–278 (1999)
Karger, D., Ruhl, M.: Find nearest neighbors in growth-restricted metrics. In: Proc. 34th Annual ACM Symp. on Theory of Comp., pp. 741–750 (2002)
Li, X., Plaxton, C.G.: On name resolution in peer-to-peer networks. In: Proc. Second ACM International Workshop on Principles of Mobile Computing, pp. 82–89 (2002)
Oram, A. (ed.): Peer-to-Peer, Harnessing the Power of Disruptive Technologies. O’Reilly, Sebastopol (2001)
Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. In: Proc. 21th Annual ACM Symp. on Theory of Comp., pp. 43–52 (1989)
Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. 9th Annual Symp. on Parallel Algorithms and Architectures, pp. 311–320 (1997)
Rajaraman, R., et al.: A data tracking scheme for general networks. In: Proc. 13th Annual ACM Symposium on Parallel Algorithms and Architecture, Crete Island, Greece, pp. 247–254 (2001)
Thorup, M., Zwick, U.: Approximate Distance Oracles. In: Proc. 33rd Annual ACM Symp. on Theory of Comp., Hersonissos, Crete, Greece, pp. 183–192 (2001)
Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. SIGCOMM, pp. 149–160 (2001)
Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to model an internet work. In: Proc. IEEE INFOCOM, vol. 2, San Francisco, CA, pp. 594–602 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ye, W., Gu, N. (2007). Robust Data Location Infrastructure in Distributed Collaborative Environment. In: Shen, W., Luo, J., Lin, Z., Barthès, JP.A., Hao, Q. (eds) Computer Supported Cooperative Work in Design III. CSCWD 2006. Lecture Notes in Computer Science, vol 4402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72863-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-72863-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72862-7
Online ISBN: 978-3-540-72863-4
eBook Packages: Computer ScienceComputer Science (R0)