The stable paths problem and interdomain routing

By T. Griffin, F. B. Shepherd, G. Wilfong. TNET, 2002

602 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures (2007, methodology): “Other recent results also show how to reverse engineer Border Gateway Protocols (BGP) as a solution to the Stable Path Problem [44], and contention-based Medium Access Control (MAC) protocols as a game-theoretic selfish utility maximization [75], [132].”
A General Approach to Network Configuration Verification (2017, background): “[16], who showed that network control planes (BGP in particular) solve the stable paths”
On Removing Routing Protocol from Future Wireless Networks: A Real-time Deep Learning Approach for Intelligent Traffic Control (2018, methodology): “The existing routing protocols used in such Fengxiao Tang, Bomin Mao, Zubair Md. Fadlullah, and Nei Kato wired networks that rely on calculating the shortest path from a source to its destination Kimihiro Mizutani are with Nippon Telegraph and Telephone based on distance vectors or link costs [2–5].”
Detecting BGP configuration faults with static analysis (2005, background): “lation of policy), determinism (whether a router’s preference for routes depends on the presence or absence of other routes), and safety (whether the protocol converges) [21].”
MIRO: multi-path interdomain routing (2006, background): “Pr evious work has shown that certain combinations of routing poli cies can cause BGP to oscillate [22].”