Graphs and algorithms
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Internet Routing Architectures, Second Edition
Internet Routing Architectures, Second Edition
Bgp
Introduction to Algorithms
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Design principles of policy languages for path vector protocols
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
Increasing bisemigroups and algebraic routing
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Hybrid link-state, path-vector routing
Proceedings of the Sixth Asian Internet Engineering Conference
Reduction-based formal analysis of BGP instances
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
FSR: formal analysis and implementation toolkit for safe interdomain routing
IEEE/ACM Transactions on Networking (TON)
An automated system for emulated network experimentation
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
| Hi-index | 0.00 |
In the last ten years it has become clear that some Internet routing protocols do not compute globally optimal paths, but only locally optimal ones. This represents something rather novel in the context of the vast literature on routing protocols for data networking. This paper introduces the Stratified Shortest-Paths Problem as a tool for exploring the borderline between local and global optimality problems. The paper contains a tutorial overview of the algebraic concepts used.