Skip to main content

A Model of Internet Routing Using Semi-modules

  • Conference paper
Relations and Kleene Algebra in Computer Science (RelMiCS 2009)

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

Included in the following conference series:

  • 461 Accesses

Abstract

Current Internet routing protocols exhibit several types of anomalies that can reduce network reliability. In order to design more robust protocols we need better formal models to capture the complexities of Internet routing. In this paper we develop an algebraic model that clarifies the distinction between routing tables and forwarding tables. We hope that this suggests new approaches to the design of routing protocols.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gondran, M., Minoux, M.: Graphs, Dioids, and Semirings: New Models and Algorithms. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  2. Day, J.: Patterns in Network Architectures: A return to fundamentals. Prentice Hall, Englewood Cliffs (2008)

    Google Scholar 

  3. Le, F., Xie, G., Zhang, H.: Understanding route redistribution. In: Proc. Inter. Conf. on Network Protocols (2007)

    Google Scholar 

  4. Le, F., Xie, G., Pei, D., Wang, J., Zhang, H.: Shedding light on the glue logic of the internet routing architecture. In: Proc. ACM SIGCOMM (2008)

    Google Scholar 

  5. Le, F., Xie, G., Zhang, H.: Instability free routing: Beyond one protocol instance. In: Proc. ACM CoNext (December 2008)

    Google Scholar 

  6. Carré, B.: Graphs and Networks. Oxford University Press, Oxford (1979)

    MATH  Google Scholar 

  7. Rekhter, Y., Li, T.: A Border Gateway Protocol. RFC 1771 (BGP version 4) (March 1995)

    Google Scholar 

  8. Moy, J.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1998)

    Google Scholar 

  9. Moy, J.: OSPF version 2. RFC 2328 (1998)

    Google Scholar 

  10. Farinacci, D., Fuller, V., Meyer, D., Lewis, D.: Locator/ID separation protocol (LISP). draft-ietf-lisp-02.txt. Work In Progress (2009)

    Google Scholar 

  11. Halabi, S., McPherson, D.: Internet Routing Architectures, 2nd edn. Cisco Press (2001)

    Google Scholar 

  12. Sobrinho, J.L.: An algebraic theory of dynamic network routing. IEEE/ACM Transactions on Networking 13(5), 1160–1173 (2005)

    Article  Google Scholar 

  13. Griffin, T.G., Gurney, A.J.T.: Increasing bisemigroups and algebraic routing. In: 10th International Conference on Relational Methods in Computer Science (RelMiCS10) (April 2008)

    Google Scholar 

  14. Gurney, A.J.T., Griffin, T.G.: Lexicographic products in metarouting. In: Proc. Inter. Conf. on Network Protocols (October 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Billings, J.N., Griffin, T.G. (2009). A Model of Internet Routing Using Semi-modules. In: Berghammer, R., Jaoua, A.M., Möller, B. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2009. Lecture Notes in Computer Science, vol 5827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04639-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04639-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04638-4

  • Online ISBN: 978-3-642-04639-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics