Data networks
Elements of network protocol design
Elements of network protocol design
IEEE/ACM Transactions on Networking (TON)
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stable Internet routing without global coordination
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Internet Routing Architectures
Internet Routing Architectures
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Stabilization of maximal metric trees
ICDCS '99 Workshop on Self-stabilizing Systems
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
An architecture for stable, analyzable Internet routing
IEEE Network: The Magazine of Global Internetworking
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
Towards a logic for wide-area Internet routing
FDNA '03 Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Practical verification techniques for wide-area routing
ACM SIGCOMM Computer Communication Review
On the convergence time of a path-vector protocol
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A model of BGP routing for network engineering
Proceedings of the joint international conference on Measurement and modeling of computer systems
Locating BGP missing routes using multiple perspectives
Proceedings of the ACM SIGCOMM workshop on Network troubleshooting: research, theory and operations practice meet malfunctioning reality
Safe compositional specification of networking systems
ACM SIGCOMM Computer Communication Review
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks and ISDN Systems
Implications of autonomy for the expressiveness of policy routing
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)
An analysis of convergence delay in path vector routing protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Building an AS-topology model that captures route diversity
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement study on the impact of routing events on end-to-end internet path performance
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Policy-based routing with non-strict preferences
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On-demand computation of policy based routes for large-scale network simulation
WSC '04 Proceedings of the 36th conference on Winter simulation
Advanced concepts in large-scale network simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Computer Networks: The International Journal of Computer and Telecommunications Networking
Subjective-cost policy routing
Theoretical Computer Science
Detecting BGP configuration faults with static analysis
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Network-wide prediction of BGP routes
IEEE/ACM Transactions on Networking (TON)
In search for an appropriate granularity to model routing policies
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Resolving inter-domain policy disputes
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Investigating prefix propagation through active BGP probing
Microprocessors & Microsystems
Path-independent load balancing with unreliable machines
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A stable weight-based on-demand routing protocol for mobile ad hoc networks
Information Sciences: an International Journal
On guidelines for safe route redistributions
Proceedings of the 2007 SIGCOMM workshop on Internet network management
The complexity of fixed point models of trust in distributed networks
Theoretical Computer Science
A fractional model of the border gateway protocol (BGP)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Implications of autonomy for the expressiveness of policy routing
IEEE/ACM Transactions on Networking (TON)
ACM SIGCOMM Computer Communication Review
Consensus routing: the internet as a distributed system
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Netkit: easy emulation of complex networks on inexpensive hardware
Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities
Rationality and traffic attraction: incentives for honest path announcements in bgp
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
An exercise in selfish stabilization
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
Network Formation and Routing by Strategic Agents Using Local Contracts
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Proceedings of the International Conference on Advances in Computing, Communication and Control
Instability free routing: beyond one protocol instance
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Inter-domain routing using topology information
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
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
NetReview: detecting when interdomain routing goes wrong
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
On understanding transient interdomain routing failures
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
ROFL: routing as the firewall layer
Proceedings of the 2008 workshop on New security paradigms
A reliable QoS aware routing protocol with slot assignment for mobile ad hoc networks
Journal of Network and Computer Applications
An analysis of convergence delay in path vector routing protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design for configurability: rethinking interdomain routing policies from the ground up
IEEE Journal on Selected Areas in Communications - Special issue on network infrastructure configuration
Understanding incentives for prefix aggregation in BGP
Proceedings of the 2009 workshop on Re-architecting the internet
On the feasibility of static analysis for BGP convergence
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Interactions in Transport Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Implications for QoS provisioning based on traceroute measurements
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A stabilizing solution to the stable path problem
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
Rethinking thresholds-based rate adaptation algorithms: a reverse engineering perspective
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DTIA: an architecture for inter-domain routing
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Threshold optimization for rate adaptation algorithms in IEEE 802.11 WLANs
IEEE Transactions on Wireless Communications
The stratified shortest-paths problem
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
How secure are secure interdomain routing protocols
Proceedings of the ACM SIGCOMM 2010 conference
Impact of routing parameters on route diversity and path inflation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Putting BGP on the right path: a case for next-hop routing
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Architectures for the future networks and the next generation Internet: A survey
Computer Communications
YAMR: yet another multipath routing protocol
ACM SIGCOMM Computer Communication Review
Layering as optimization decomposition: questions and answers
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
A distributed method for dynamic resolution of BGP oscillations
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The Complexity of Restricted Variants of the Stable Paths Problem
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
On the convergence condition and convergence time of BGP
Computer Communications
On the structure of weakly acyclic games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Enhancing the trust of internet routing with lightweight route attestation
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Expected convergence properties of BGP
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed computing with rules of thumb
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Journal of Parallel and Distributed Computing
Toward a practical approach for BGP stability with root cause check
Journal of Parallel and Distributed Computing
Maintaining safety in interdomain routing with hierarchical path-categories
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Pathfinding through congruences
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Let the market drive deployment: a strategy for transitioning to BGP security
Proceedings of the ACM SIGCOMM 2011 conference
FSR: formal analysis and implementation toolkit for safe inter-domain routing
Proceedings of the ACM SIGCOMM 2011 conference
Routing policies in named data networking
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Analyzing BGP instances in Maude
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Wheel + ring = reel: the impact of route filtering on the stability of policy routing
IEEE/ACM Transactions on Networking (TON)
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Convergence method, properties and computational complexity for Lyapunov games
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data
ACM SIGCOMM Computer Communication Review
Semantic overlay based services routing between MPLS domains
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Subjective-Cost policy routing
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Path-vector routing stability analysis
ACM SIGMETRICS Performance Evaluation Review
Comprehensive solution for anomaly-free BGP
IPOM'05 Proceedings of the 5th IEEE international conference on Operations and Management in IP-Based Networks
MPLS inter domain services routing architecture and model based on p2p semantic grid
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
End-user perspectives of Internet connectivity problems
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Pathsift: a library for separating the effects of topology, policy, and protocols on IP routing
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Brief announcement: network-destabilizing attacks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
Inter-Domain route diversity for the internet
IFIP'12 Proceedings of the 2012 international conference on Networking
AutoNetkit: simplifying large scale, open-source network experimentation
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Icebergs in the clouds: the other risks of cloud computing
HotCloud'12 Proceedings of the 4th USENIX conference on Hot Topics in Cloud Ccomputing
Computational complexity of traffic hijacking under BGP and S-BGP
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Declarative distributed computing
Correct Reasoning
A theory for the connectivity discovered by routing protocols
IEEE/ACM Transactions on Networking (TON)
AutoNetkit: simplifying large scale, open-source network experimentation
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Routing regardless of network stability
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
FSR: formal analysis and implementation toolkit for safe interdomain routing
IEEE/ACM Transactions on Networking (TON)
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
The design space of probing algorithms for network-performance measurement
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Best-response dynamics out of sync: complexity and characterization
Proceedings of the fourteenth ACM conference on Electronic commerce
BGP security in partial deployment: is the juice worth the squeeze?
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
PoiRoot: investigating the root cause of interdomain path changes
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Distributed state machines: a declarative framework for the management of distributed systems
Proceedings of the 8th International Conference on Network and Service Management
Improving network agility with seamless BGP reconfigurations
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
The security appliance to BIRD software router
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
An economic analysis of routing conflict and its resolution
Performance Evaluation
A survey of interdomain routing policies
ACM SIGCOMM Computer Communication Review
A game-theoretic approach to stable routing in max-min fair networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.01 |
Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the shortest paths problem. The border gateway protocol (BGP) is currently the only interdomain routing protocol deployed in the Internet. BGP does not solve a shortest paths problem since any interdomain protocol is required to allow policy-based metrics to override distance-based metrics and enable autonomous systems to independently define their routing policies with little or no global coordination. It is then natural to ask if BGP can be viewed as a distributed algorithm for solving some fundamental problem. We introduce the stable paths problem and show that BGP can be viewed as a distributed algorithm for solving this problem. Unlike a shortest path tree, such a solution does not represent a global optimum, but rather an equilibrium point in which each node is assigned its local optimum.We study the stable paths problem using a derived structure called a dispute wheel, representing conflicting routing policies at various nodes. We show that if no dispute wheel can be constructed, then there exists a unique solution for the stable paths problem. We define the simple path-vector protocol (SPVP), a distributed algorithm for solving the stable paths problem. SPVP is intended to capture the dynamic behavior of BGP at an abstract level. If SPVP converges, then the resulting state corresponds to a stable paths solution. If there is no solution, then SPVP always diverges. In fact, SPVP can even diverge when a solution exists. We show that SPVP will converge to the unique solution of an instance of the stable paths problem if no dispute wheel exists.