Graphs and algorithms
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Internet Routing Architectures, Second Edition
Internet Routing Architectures, Second Edition
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of the MED Oscillation Problem in BGP
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Efficient Algorithms for Path Problems with Gernal Cost Citeria
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On the convergence time of a path-vector protocol
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
A Model of Internet Routing Using Semi-modules
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
The stratified shortest-paths problem
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Pathfinding through congruences
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Towards an algebra of routing tables
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
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.