Towards Autonomic Networking Using Overlay Routing Techniques

  • Kendy Kutzner
  • Kurt Cramer
  • Thomas Fuhrmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3432)


With an ever-growing number of computers being embedded into our surroundings, the era of ubiquitous computing is approaching fast. However, as the number of networked devices increases, so does system complexity. Contrary to the goal of achieving an “invisible computer”, the required amount of management and human intervention increases more and more, both slowing down the growth rate and limiting the achievable size of ubiquitous systems.

In this paper we present a novel routing approach that is capable of handling complex networks without any administrative intervention. Based on a combination of standard overlay routing techniques and source routes, this approach is capable of efficiently bootstrapping a routable network. Unlike other approaches that try to combine peer-to-peer ideas with ad-hoc networks, sensor networks, or ubiquitous systems, our approach is not based on a routing scheme. This makes the resulting system flexible and powerful with respect at application support as well as efficient with regard to routing overhead and system complexity.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.-C., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, October 1998, pp. 85–97 (1998)Google Scholar
  2. 2.
    Cramer, C., Fuhrmann, T.: On the Fundamental Communication Abstraction Supplied by P2P Overlay Networks. European Transactions on Telecommunications 16, 1–9 (2005)CrossRefGoogle Scholar
  3. 3.
    Eriksson, J., Faloutsos, M., Krishnamurty, S.: PeerNet: Pushing Peer-to-Peer Down the Stack. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Ford, B.: Unmanaged Internet Protocol. ACM SIGCOMM Computer Communications Review 34(1), 93–98 (2004)CrossRefGoogle Scholar
  5. 5.
    Krishna Gummadi, P., Gummadi, R., Gribble, S.D., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the ACM SIGCOMM Conference, Karlsruhe, Germany, August 2003, pp. 381–394 (2003)Google Scholar
  6. 6.
    Heer, T., Niedermayer, H., Petrak, L., Rieche, S., Wehrle, K.: On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios. In: Proceedings of the 34. Jahrestagung der Gesellschaft fur Informatik, Ulm, Germany, September 2004, vol. 2, pp. 239–244 (2004)Google Scholar
  7. 7.
    Hof, H.-J., Blaß, E.-O., Fuhrmann, T., Zitterbart, M.: Design of a Secure Distributed Service Directory for Wireless Sensornetworks. In: Proceedings of the 1st European Workshop on Wireless Sensor Networks, Berlin, Germany (January 2004)Google Scholar
  8. 8.
    Hu, Y.C., Pucha, H., Das, S.M.: Exploiting the synergy between peer-to-peer and mobile ad hoc networks. In: Proceedings of HotOS-IX: Ninth Workshop on Hot Topics in Operating Systems (May 2003)Google Scholar
  9. 9.
    Maymounkov, P., Mazieres, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp. 53–65. Springer, Heidelberg (2002)Google Scholar
  10. 10.
    Pei, G., Gerla, M., Chen, T.-W.: Fisheye state routing in mobile ad hoc networks. In: IGDGS Workshop on Wireless Networks and Mobile Computing, pp. D71-D78 (2000)Google Scholar
  11. 11.
    Perkins, C.E., Royer, E.M.: Ad hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, February 1999, pp. 90–100 (1999)Google Scholar
  12. 12.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the SIGCOMM 2001 conference, pp. 161–172. ACM Press, New York (2001)Google Scholar
  13. 13.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed 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)CrossRefGoogle Scholar
  14. 14.
    Schollmeier, R., Gruber, I., Niethammer, F.: Protocol for Peer-to-Peer Networking in Mobile Environments. In: Proceedings of the 12th International Conference on Computer Communications and Networks, Dallas, Texas, USA (October 2003)Google Scholar
  15. 15.
    Stoica, I., Adkins, D., Zhuang, S., Shenker, S., Surana, S.: Internet Indirection Infrastructure. In: Proceedings of the 2002 ACM SIGCOMM conference, Pittsburgh, PA, USA, pp. 73–86. ACM Press, New York (2002)Google Scholar
  16. 16.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of the SIGCOMM 2001 conference, pp. 149–160. ACM Press, New York (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kendy Kutzner
    • 1
  • Kurt Cramer
    • 1
  • Thomas Fuhrmann
    • 1
  1. 1.System Architecture GroupUniversität Karlsruhe (TH)KarlsruheGermany

Personalised recommendations