Abstract
Active networking aims at minimizing the functionality that is built into a data network: Programmable nodes inside the network enable the deployment of new services at run-time. In a bottom-up approach we presume a network void from any functionality and study the problem of deploying and providing a basic, externally defined and non-trivial distributed service. As a test case we use the robust election of a coordinator. Based on the bully algorithm, we implemented an election service that is fully based on active packets. It deploys itself to every reachable active network segment, continuously scans for newly attached nodes and networks and provides a segment wide election service for all attached nodes. The implementation was carried out in the M0 messenger environment and tested in a worldwide active networks testbed. The complete and self-contained initial ‘election service germ’ fits in less than 1’200 Bytes and asserts the ubiquitous presence of this service.
Part of this work was done while at the Computer Science Department of the University of Zurich, Switzerland.
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
Alexander, D., Braden, B., Gunter, C., Jackson, A., Keromytis, A., Minden, G. and Wetherall, D.: Active Network Encapsulation Protocol (ANEP), July 1997. http://www.cis.upenn.edu/switchware/ANEP/docs/ANEP.txt
Bonabeau, E., Henaux, F., Guérin, S., Snyers, D., Kuntz, P. and Théraulaz, G.: Routing in Telecommunication Networks with “Smart” Ant-Like Agents. In Proc Second Int. Workshop on Intelligent Agents for Telecommunication Applications IATA’98, Lectures Notes in AI, Vol 1437, 1998.
Bhattacharjee, S., Calvert, K., and Zegura, E.: Self-Organizing Wide-Area Network Caches. In Proc Infocom’1998, San Francisco, CA, March 1998.
Dorigo, M.: The “Ant Colony Optimization”. http://iridia.ulb.ac.be/dorigo/ACO/ACO.html
Friedman, R., Keidar, I., Malki, D., Birman, K., and Dolev, D.: Deciding in Partitionable Networks. Technical Report, CS Department, Cornell, Nov. 1995. TR 95-1554.
Garcia-Molina, H.: Elections in a Distributed Computing System. IEEE Transactions on Computers, Jan 1982.
Herman, T.: Comprehensive Self-Stabilization Bibliography. Working Paper, University of Iowa, Aug. 1998. http://www.cs.uiowa.edu/ftp/selfstab/bibliography
Liquid software home page. http://www.cs.arizona.edu/liquid/index.html
Minar, N., Kramer, K. and Maess, P.: Cooperating Mobile Agents for Mapping Networks. Proc 1st First Hungarian National Conference on Agent Based Computing, May 1998. http://www.media.mit.edu/nelson/research/routes-coopagents/
Tschudin, C.: The Messenger Environment M0 — a Condensed Description. In Vitek, J. and Tschudin, C. (Eds), Mobile Object Systems — Towards the Programmable Internet. LNCS 1222, Springer, April 1997.
Tschudin, C.: ANON: A minimal overlay network for active networks experiments. Technical report, CS Department, University of Zurich, Aug. 1998. TR 98-10.
Tschudin, C.: Apoptosis—the Programmed Death of Distributed Services. In Vitek, J. and Jensen, C. (Eds), Secure Internet Programming — Security issues for distributed and mobile objects. LNCS, Springer, to appear 1999.
Spafford, E.: The Internet Worm Program: An Analysis. SIGCOMM, Jan 1989.
Wetherall, D., Guttag, J. and Tennenhouse, D.: ANTS: A toolkit for building and dynamically deploying network protocols. In IEEE OpenArch 98, San Francisco, April 1998. http://www.tns.lcs.mit.edu/publications/openarch98.html
Zhang, L., Michel, S., Nguyen, K. and Rosenstein, A.: Adaptive Web Caching: Towards a New Caching Architecture. 3rd WWWcaching workshop, Manchester, England, June 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tschudin, C.F. (1999). A Self-Deploying Election Service for Active Networks. In: Ciancarini, P., Wolf, A.L. (eds) Coordinatio Languages and Models. COORDINATION 1999. Lecture Notes in Computer Science, vol 1594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48919-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-48919-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65836-8
Online ISBN: 978-3-540-48919-1
eBook Packages: Springer Book Archive