A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Dynamics of hot-potato routing in IP networks
Proceedings of the joint international conference on Measurement and modeling of computer systems
Optimizing cost and performance for multihoming
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
Negotiation-based routing between neighboring ISPs
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Multihoming route control among a group of multihomed stub networks
Computer Communications
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Smoothed analysis: an attempt to explain the behavior of algorithms in practice
Communications of the ACM - A View of Parallel Computing
Smoothed Analysis of Multiobjective Optimization
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Limitations and possibilities of path trading between autonomous systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
On route selection for interdomain traffic engineering
IEEE Network: The Magazine of Global Internetworking
Improved smoothed analysis of multiobjective optimization
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The Border Gateway Protocol (BGP) serves as the main routing protocol of the Internet and ensures network reachability among autonomous systems (ASes). When traffic is forwarded between the many ASes on the Internet according to that protocol, each AS selfishly routes the traffic inside its own network according to some internal protocol that supports the local objectives of the AS. We consider possibilities of achieving higher global performance in such systems while maintaining the objectives and costs of the individual ASes. In particular, we consider how path trading, i.e. deviations from routing the traffic using individually optimal protocols, can lead to a better global performance. Shavitt and Singer ("Limitations and Possibilities of Path Trading between Autonomous Systems", INFOCOM 2010) were the first to consider the computational complexity of finding such path trading solutions. They show that the problem is weakly NP-hard and provide a dynamic program to find path trades between pairs of ASes. In this paper we improve upon their results, both theoretically and practically. First, we show that finding path trades between sets of ASes is also strongly NP-hard. Moreover, we provide an algorithm that finds all Pareto-optimal path trades for a pair of two ASes. While in principal the number of Pareto-optimal path trades can be exponential, in our experiments this number was typically small. We use the framework of smoothed analysis to give theoretical evidence that this is a general phenomenon, and not only limited to the instances on which we performed experiments. The computational results show that our algorithm yields far superior running times and can solve considerably larger instances than the previous dynamic program.