Abstract
The Internet protocol used today for global routing - the Border Gateway Protocol (BGP) - evolved in a rather organic manner without a clear theoretical foundation. This has stimulated a great deal of recent theoretical work in the networking community aimed at modeling BGP-like routing protocols. This paper attempts to make this work more accessible to a wider community by reformulating it in a purely algebraic setting. This leads to structures we call increasing bisemigroups, which are essentially non-distributive semirings with an additional order constraint. Solutions to path problems in graphs annotated over increasing bisemigroups represent locally optimal Nash-like equilibrium points rather than globally optimal paths as is the case with semiring routing. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Griffin, T. G., & Gurney, A. J. T. (2008). Increasing bisemigroups and algebraic routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4988 LNCS, pp. 123–137). Springer Verlag. https://doi.org/10.1007/978-3-540-78913-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
