NL-DHT: A non-uniform locality sensitive DHT architecture for massively multi-user virtual environment applications

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn , Issue , 2008, Pages 793-798

  Ratti, Saurabh ^a   Hariri, Behnoosh ^a   Shirmohammadi, Shervin ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FAST DYNAMICS; HILBERT CURVES; HILBERT SPACE-FILLING CURVES; LATENCY-AWARE; MAPPING COMPLEXITY; MULTI-USER VIRTUAL ENVIRONMENTS; NON-UNIFORM;

LOCATION; THREE DIMENSIONAL; VIRTUAL REALITY;

COMPUTATIONAL COMPLEXITY;

EID: 60649085191     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2008.32     Document Type: Conference Paper

References (15)

1. Moon, B., Jagadish, H. V., Faloutsos, C., Saltz, J. H.: Analysis of the Clustering Properties of the Hilbert Space-Filling Curve. In IEEE Trans. Knowledge and Data Engineering. pp. 124 - 141, 2001.
2. Knoll, M., Weis, T.: Optimizing Locality for Self-organizing Context-Based Systems, Self-Organizing Systems, LNCS, vol. 4124, pp. 62 - 73, Spinger
3. C. Schmidt and M. Parashar, Analyzing the Search Characteristics of Space Filling Curve-based Indexing within the Squid P2P Data Discovery System, - Technical Report TR-276, CAIP, Rutgers University, December 2004
4. Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, Anthony LaMarca, Scott Shenker, Joseph Hellerstein, A case study in building layered DHT applications, ACM SIGCOMM Computer Communication Review, v. 35 n. 4, October 2005
5. M. Cai, M. Frank, J. Chen, and P. Szekely. Maan: A multi-attribute addressable network for grid information services. In GRID '03: Proc. of the 4th Int. Workshop on Grid Computing, page 184, Washington, DC, USA, 2003. IEEE Computer Society.
6. A. Crainiceanu, P. Linga, J. Gehrke, J. Shanmugasundaram, P-tree: a p2p index for resource discovery applications, in: WWW Alt'04: Proc. of the 13th Int. World Wide Web Conference on Alternate Track Papers & Posters, ACM Press, New York, NY, USA, 2004.
7. A. Andrzejak, Z. Xu, Scalable, efficient range queries for grid information services, in: P2P '02: Proc. of the Second Int. Conf. on Peer-to-Peer Computing, IEEE Computer Society, Washington, DC, USA, 2002.
8. P. Ganesan, B. Yang, H. Garcia-Molina, One torus to rule them all: multi-dimensional queries in p2p systems, in: WebDB '04: Proc. of the 7th Int. Workshop on the Web and Databases, ACM Press, New York, NY, USA, 2004.
9. Z. Xu, M. Mahalingam, M. Karlsson, Turning heterogeneity into an advantage in overlay routing, in: Proc. of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, 2003.
10. R. Tian, Y. Xiong, Q. Zhang, B. Li, B.Y. Zhao, X. Li, Hybrid overlay structure based on random walks, in: Proc. of the Fourth Int. Workshop on Peer-to-Peer Systems (IPTPS 2005), vol. 3640 of Lecture Notes in Computer Science, Springer-Verlag, 2005, pp. 152-162.
11. T. Bially. Space-Filling Curves: Their Generation and Their Application to Bandwidth Reduction. IEEE Trans. on Information Theory, IT-15(6):658-664, Nov 1969.
12. A.R. Butz. Alternative Algorithm for Hilbert's Space-Filling Curve. IEEE Trans. on Computers, 20:424-426, April 1971.
13. Jin, G. and Mellor-Crummey, J.M., SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion. ACM Trans. on Math. Software. v31 i1. 120-148.
14. J. Lawder, P. King, Querying multi-dimensional data indexed using the Hilbert space-filling curve, SIGMOD Record 30 (1) (2001) 19-24
15. P. Druschel and A. Rowstron, "Pastry: Scalable, distributed object location and routing for large-scale peer-to peer systems,"