A necessary and sufficient condition for the existence of a complete stable matching
Journal of Algorithms
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Journal of Combinatorial Theory Series B
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
SIAM Journal on Discrete Mathematics
Expected convergence properties of BGP
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
SIAM Journal on Computing
Hi-index | 0.00 |
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradomain routing protocols such as RIP are basically distributed algorithms for solving shortest path problems, the graph theoretic problem that BGP is trying to solve is called the stable paths problem (SPP). Unfortunately, unlike shortest path problems, it has been shown that instances of SPP can fail to have a solution and so BGP can fail to converge. We define a fractional version of SPP and show that all such instances of fractional SPP have solutions. We also show that while these solutions exist they are not necessarily half-integral.