Graphs and algorithms
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Neighbor-specific BGP: more flexible routing policies while improving global stability
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
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
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Two observations in dioid based model refinement
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Hi-index | 0.00 |
Congruences of path algebras are useful in the definition and analysis of pathfinding problems, since properties of an algebra can be related to properties of its quotient. We show that this relationship can apply even when the algebraic objects involved satisfy weaker forms of the semiring or path algebra axioms. This is useful, since it is just these algebras and their quotients which we need to analyze pathfinding problems characterized by the need to obtain multiple paths even when path preferences are inconsistent, and paths can be filtered out arbitrarily, as in Internet routing.