Skip to main content
SpringerLink
Log in

Optimizing Locality for Self-organizing Context-Based Systems

  • Conference paper
Self-Organizing Systems (EuroNGI 2006, IWSOS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4124))

Abstract

Running context-based systems with a fixed infrastructure involves substantial investments. There have been efforts to replace those systems with self-organizing ones. Therefore, recent systems use peer-to-peer (P2P) technology as a basis. Context-information is bound to a specific location and thus should be stored on a nearby node. Common P2P algorithms use one-dimensional ID spaces. However, locations have at least two coordinates, namely x and y. We use space-filling curves to map the two-dimensional area onto the one-dimensional ID space. In this paper we discuss the suitability of different space-filling curves for the average case and for stochastic scenarios.

The presented work has been funded by DFG Excellence Center 627 “Nexus” and DFG SPP “Organic Computing”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Lehmann, O., Bauer, M., Becker, C., Nicklas, D.: From home to world - supporting context-aware applications through world models. In: PERCOM 2004: Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom 2004), Washington, DC, USA, p. 297. IEEE Computer Society, Los Alamitos (2004)

    Chapter  Google Scholar 

  3. Grossmann, M., Bauer, M., Hönle, N., Käppeler, U.P., Nicklas, D., Schwarz, T.: Efficiently Managing Context Information for Large-scale Scenarios. In: Proceedings of the 3rd IEEE Conference on Pervasive Computing and Communications (PerCom 2005). IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  4. Dudkowski, D., Schwarz, T.: The neXus Homepage (2005), http://www.nexus.uni-stuttgart.de

  5. Knoll, M., Weis, T.: A P2P-Framework for Context-based Information. In: 1st International Workshop on Requirements and Solutions for Pervasive Software Infrastructures (RSPSI) at Pervasive 2006, Dublin, Ireland (2006)

    Google Scholar 

  6. Furuti, C.A.: Map projections (2006), http://www.progonos.com/furuti/MapProj/CartIndex/cartIndex.html

  7. Gotsman, C., Lindenbaum, M.: On the metric properties of discrete space-filling curves. IEEE Transactions of Image Processing 5(5) (1996)

    Google Scholar 

  8. Niedermeier, R., Reinhardt, K., Sanders, P.: Towards optimal locality in mesh-indexings. In: Fundamentals of Computation Theory, pp. 364–375 (1997)

    Google Scholar 

  9. Wierum, J.M.: Logarithmic path-length in space-filling curves. In: Wismath, S. (ed.) Proceedings of the 14th Canadian Conference on Computational Geometry, Lethbridge, pp. 22–26 (2002)

    Google Scholar 

  10. Sagan, H.: Space-Filling Curves. Springer, New York (1994)

    MATH  Google Scholar 

  11. Nielsen, B.: Lindenmayer systemer (in Danish) (2006), http://www.246.dk/lsystems.html

  12. Pögl, M.: Entwicklung eines cache-optimalen 3D Finite-Elemente-Verfahrens für große Probleme. Ph.D thesis, Technische Universität München, Munich, Germany (2004)

    Google Scholar 

  13. Peitgen, H.O., Saupe, D. (eds.): The Science of Fractal Images. Springer, New York (1988)

    MATH  Google Scholar 

  14. Alfonseca, M., Ortega, A.: Representation of fractal curves by means of l systems. In: APL 1996: Proceedings of the conference on Designing the future, pp. 13–21. ACM Press, New York (1996)

    Chapter  Google Scholar 

  15. Abelson, H., di Sessa, A.: Turtle Geometry: The Computer as a Medium for Exploring Mathematics. The MIT Press, Cambridge (1981)

    MATH  Google Scholar 

  16. Tipler, P.A., Mosca, G., Pelte, D.: Physik, 2nd edn. Spektrum Akademischer Verlag (in German) (2004)

    Google Scholar 

  17. Gutowski, M.W.: Smooth genetic algorithm. Journal of Physics A: Mathematical and General 27(23) (1994)

    Google Scholar 

  18. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6), 440–442 (1998)

    Article  Google Scholar 

  19. Watts, D.J.: Small Worlds. Princeton University Press, Princeton (1999)

    Google Scholar 

  20. Ratnasamy, S.P.: A Scaleable Content-Adressable Network. Ph.D thesis, University of California, Berkeley, CA, USA (2002)

    Google Scholar 

  21. Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An Architecture for Global-scale Persistent Storage. In: Proceedings of ACM ASPLOS. ACM, New York (2000)

    Google Scholar 

  22. Kubiatowicz, J.: The OceanStore Project (2005), http://oceanstore.cs.berkeley.edu/

  23. Schmidt, C., Parashar, M.: Flexible information discovery in decentralized distributed systems. In: 12th IEEE International Symposium on High Performance Distributed Computing (HPDC-12 2003), p. 226. IEEE Computer Science, Los Alamitos (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Context-based Systems Group, Universität Stuttgart,  

    Mirko Knoll & Torben Weis

Authors
  1. Mirko Knoll
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torben Weis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of IT-Security and Security Law, University of Passau, Germany

    Hermann de Meer

  2. Communications and networking Systems laboratory Information Telecommunication Technology Center, Lancaster University, 145 Nichols Hall, 66045-7612, Lawrance, Kansas, USA

    James P. G. Sterbenz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knoll, M., Weis, T. (2006). Optimizing Locality for Self-organizing Context-Based Systems. In: de Meer, H., Sterbenz, J.P.G. (eds) Self-Organizing Systems. EuroNGI IWSOS 2006 2006. Lecture Notes in Computer Science, vol 4124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11822035_7

Download citation

  • DOI: https://doi.org/10.1007/11822035_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37658-3

  • Online ISBN: 978-3-540-37669-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation