Towards an algebra of routing tables

Peter Höfner; Annabelle McIver

doi:10.1007/978-3-642-21070-9_17

Towards an algebra of routing tables

Peter Höfner^*, Annabelle McIver

^*Corresponding author for this work

Department of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

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 language	English
Title of host publication	Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings
Editors	Harrie de Swart
Place of Publication	Heidelberg, Germany
Publisher	Springer, Springer Nature
Pages	212-229
Number of pages	18
Volume	6663 LNCS
ISBN (Print)	9783642210693
DOIs	https://doi.org/10.1007/978-3-642-21070-9_17
Publication status	Published - 2011
Event	12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011 - Rotterdam, Netherlands Duration: 30 May 2011 → 3 Jun 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6663 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011
Country	Netherlands
City	Rotterdam
Period	30/05/11 → 3/06/11

Access to Document

10.1007/978-3-642-21070-9_17

Link to publication in Scopus

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

Cite this

Höfner, P., & McIver, A. (2011). Towards an algebra of routing tables. In H. de Swart (Ed.), Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings (Vol. 6663 LNCS, pp. 212-229). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6663 LNCS). Heidelberg, Germany: Springer, Springer Nature. https://doi.org/10.1007/978-3-642-21070-9_17

Höfner, Peter ; McIver, Annabelle. / Towards an algebra of routing tables. Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings. editor / Harrie de Swart. Vol. 6663 LNCS Heidelberg, Germany : Springer, Springer Nature, 2011. pp. 212-229 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f02a9f255b564adab21cc0f2cf24134f,

title = "Towards an algebra of routing tables",

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

author = "Peter H{\"o}fner and Annabelle McIver",

year = "2011",

doi = "10.1007/978-3-642-21070-9_17",

language = "English",

isbn = "9783642210693",

volume = "6663 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "212--229",

editor = "{de Swart}, Harrie",

booktitle = "Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings",

address = "United States",

}

Höfner, P & McIver, A 2011, Towards an algebra of routing tables. in H de Swart (ed.), Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings. vol. 6663 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6663 LNCS, Springer, Springer Nature, Heidelberg, Germany, pp. 212-229, 12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011, Rotterdam, Netherlands, 30/05/11. https://doi.org/10.1007/978-3-642-21070-9_17

Towards an algebra of routing tables. / Höfner, Peter; McIver, Annabelle.

Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings. ed. / Harrie de Swart. Vol. 6663 LNCS Heidelberg, Germany : Springer, Springer Nature, 2011. p. 212-229 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6663 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

TY - GEN

T1 - Towards an algebra of routing tables

AU - Höfner, Peter

AU - McIver, Annabelle

PY - 2011

Y1 - 2011

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

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

UR - http://www.scopus.com/inward/record.url?scp=79958226277&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-21070-9_17

DO - 10.1007/978-3-642-21070-9_17

M3 - Conference proceeding contribution

SN - 9783642210693

VL - 6663 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 212

EP - 229

BT - Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings

A2 - de Swart, Harrie

PB - Springer, Springer Nature

CY - Heidelberg, Germany

ER -

Höfner P, McIver A. Towards an algebra of routing tables. In de Swart H, editor, Relational and Algebraic Methods in Computer Science - 12th International Conference, RAMICS 2011, Proceedings. Vol. 6663 LNCS. Heidelberg, Germany: Springer, Springer Nature. 2011. p. 212-229. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-21070-9_17