Towards an algebra of routing tables

Peter Höfner*, Annabelle McIver

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

4 Citations (Scopus)

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).

Original languageEnglish
Title of host publicationRelational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings
EditorsHarrie de Swart
Place of PublicationHeidelberg, Germany
PublisherSpringer, Springer Nature
Pages212-229
Number of pages18
Volume6663 LNCS
ISBN (Print)9783642210693
DOIs
Publication statusPublished - 2011
Event12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011 - Rotterdam, Netherlands
Duration: 30 May 20113 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6663 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011
Country/TerritoryNetherlands
CityRotterdam
Period30/05/113/06/11

Fingerprint

Dive into the research topics of 'Towards an algebra of routing tables'. Together they form a unique fingerprint.

Cite this