Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Dynamics of hot-potato routing in IP networks
Proceedings of the joint international conference on Measurement and modeling of computer systems
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
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Trading potatoes in distributed multi-tier routing systems
Proceedings of the 3rd international workshop on Economics of networked systems
Cooperative content distribution and traffic engineering in an ISP network
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Mutually controlled routing with independent ISPs
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
An overview of routing optimization for internet traffic engineering
IEEE Communications Surveys & Tutorials
On route selection for interdomain traffic engineering
IEEE Network: The Magazine of Global Internetworking
Path trading: fast algorithms, smoothed analysis, and hardness results
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
| Hi-index | 0.01 |
When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot-potato routing. As a result, paths in the Internet are suboptimal from a global perspective. For peering ASes who exchange traffic without payments, path trading - complementary deviations from hot-potato routing - appears to be a desirable solution to deal with these inefficiencies. In recent years, path trading approaches have been suggested as means for interdomain traffic engineering between neighboring ASes, as well as between multiple ASes to achieve global efficiency. Surprisingly, little is known on the computational complexity of finding path trading solutions, or the conditions which guarantee the optimality or even approximability of a path trading protocol. In this paper we explore the computational feasibility of computing path trading solutions between ASes. We first show that finding a path trading solution between a pair of ASes is NP-complete, and that path-trading solutions are even NPhard to approximate. We continue to explore the feasibility of implementing policies between multiple ASes and show that, even if the bilateral path trading problem is tractable for every AS pair in the set of trading ASes, path trading between multiple ASes is NP-hard, and NP-hard to approximate as well. Despite the above negative results, we show a pseudopolynomial algorithm to compute path trading solutions. Thus, if the range of the instances is bounded, we show one can compute solutions efficiently for peering ASes. We evaluate the path trading algorithm on pairs of ASes using real network topologies. Specifically, we use real PoP-level maps of ASes in the Internet to show that path trading can substantially mitigate the inefficiencies associated with hot-potato routing.