Skip to main content
SpringerLink
Log in

Towards an Algebra of Routing Tables

  • Conference paper
Relational and Algebraic Methods in Computer Science (RAMICS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6663))

Abstract

We use well-known algebraic concepts like semirings and matrices to model and argue about Wireless Mesh Networks. These networks are used in a wide range of application areas, including public safety and transportation. Formal reasoning therefore seems to be necessary to guarantee safety and security. In this paper, we model a simplified algebraic version of the AODV protocol and provide some basic properties. For example we show that each node knows a route to the originator of a message (if there is one).

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. AODV-UU: An implementation of the AODV routing protocol (IETF RFC 3561), http://sourceforge.net/projects/aodvuu/ (accessed February 26, 2011)

  2. Backhouse, R.: Closure Algorithms and the Star-Height Problem of Regular Languages. Ph.D. thesis, Imperial College, London (1975)

    Google Scholar 

  3. Backhouse, R., Carré, B.A.: Regular algebra applied to path-finding problems. Journal of the Institute of Mathematics and Applications (1975)

    Google Scholar 

  4. Carré, B.A.: Graphs and Networks. Oxford Applied Mathematics & Computing Science Series. Oxford University Press, Oxford (1980)

    MATH  Google Scholar 

  5. Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Boca Raton (1971)

    MATH  Google Scholar 

  6. Desharnais, J., Möller, B., Struth, G.: Modal Kleene algebra and applications — A survey. Journal of Relational Methods in Computer Science 1, 93–131 (2004)

    MATH  Google Scholar 

  7. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fernandes, T., Desharnais, J.: Describing data flow analysis techniques with Kleene algebra. SCP 65, 173–194 (2007)

    MathSciNet  MATH  Google Scholar 

  9. Griffin, T.G., Gurney, A.J.T.: Increasing bisemigroups and algebraic routing. In: Berghammer, R., Möller, B., Struth, G. (eds.) RelMiCS/AKA 2008. LNCS, vol. 4988, pp. 123–137. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Griffin, T.G., Sobrinho, J.: Metarouting. SIGCOMM Comp. Com. Rev. 35, 1–12 (2005)

    Article  Google Scholar 

  11. Hoare, C.A.R., Möller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 399–414. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Höfner, P.: Database for automated proofs of Kleene algebra, http://www.kleenealgebra.de (accessed February 26, 2011)

  13. Höfner, P., Struth, G.: Automated reasoning in kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 279–294. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Kozen, D.: The Design and Analysis of Algorithms. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  15. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2), 366–390 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. McCune, W.W.: Prover9 and Mace4, http://www.cs.unm.edu/~mccune/prover9 (accessed February 26, 2011)

  17. McIver, A.K., Gonzalia, C., Cohen, E., Morgan, C.C.: Using probabilistic Kleene algebra pKA for protocol verification. J. Logic and Algebraic Programming 76(1), 90–111 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Möller, B.: Dijkstra, Kleene, Knuth. Talk at WG2.1 Meeting, slides available online, at http://web.comlab.ox.ac.uk/jeremy.gibbons/wg21/meeting61/MoellerDijkstra.pdf (accessed February 26, 2006)

  19. Möller, B., Struth, G.: WP is WLP. In: MacCaull, W., Winter, M., Düntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 200–211. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Perkins, C., Belding-Royer, E., Das, S.: Ad hoc on-demand distance vector (AODV) routing. RFC 3561 (Experimental) (July 2003), http://www.ietf.org/rfc/rfc3561.txt

  21. Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. SCP 75, 440–469 (2010)

    MathSciNet  MATH  Google Scholar 

  22. Sobrinho, J.: Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. IEEE/ACM Trans. Networking 10(4), 541–550 (2002)

    Article  Google Scholar 

  23. Sobrinho, J.: Network routing with path vector protocols: Theory and applications. In: Applications, Technologies, Architectures, and Protocols for Computer Communications. SIGCOMM 2003, pp. 49–60. ACM Press, New York (2003)

    Google Scholar 

  24. Takai, T., Furusawa, H.: Monodic tree kleene algebra. In: Schmidt, R.A. (ed.) RelMiCS/AKA 2006. LNCS, vol. 4136, pp. 402–416. Springer, Heidelberg (2006) (accessed February 26, 2011) Errata available at http://www.sci.kagoshima-u.ac.jp/~furusawa/person/Papers/correct_ monodic_kleene_algebra.pdf

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg, Germany

    Peter Höfner

  2. Department of Computing, Macquarie University, Australia

    Annabelle McIver

  3. National ICT Australia Ltd. (NICTA), Australia

    Peter Höfner & Annabelle McIver

Authors
  1. Peter Höfner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Annabelle McIver
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Philosophy, Tilburg University, P.O. Box 90153, 5000, Tilburg, LE, The Netherlands

    Harrie de Swart

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Höfner, P., McIver, A. (2011). Towards an Algebra of Routing Tables. In: de Swart, H. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2011. Lecture Notes in Computer Science, vol 6663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21070-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21070-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21069-3

  • Online ISBN: 978-3-642-21070-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation