Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Parallel asynchronous algorithms for discrete data
Journal of the ACM (JACM)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
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)
Cooperative Management Framework for Inter-domain Routing System
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
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
ROFL: routing as the firewall layer
Proceedings of the 2008 workshop on New security paradigms
Wheel + ring = reel: the impact of route filtering on the stability of policy routing
IEEE/ACM Transactions on Networking (TON)
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
Evaluation Framework for Adaptive Multi-Path Inter-Domain Routing Protocols
International Journal of Adaptive, Resilient and Autonomic Systems
BGP-XM: BGP eXtended Multipath for transit Autonomous Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. Such an assumption is outpaced by today's common practice of non-deterministic,multi-path routing, which is crucial to traffic engineering, QoS routing, multicasting and virtual private networking. A pair of paths may be incomparable or equally preferred. In the presence of ambiguous preferences at pairs, or even multiple collections of paths, a challenge is to ensure robustness in the complex and sophisticated situations of policy-based routing where heterogeneous routing policies are allowed among routing systems. This paper presents an extensive study of policy-based routing with non-strict preferences, deriving sufficient conditions that ensure the existence, optimality and asynchronous convergence of stable routings.