Minimization methods for non-differentiable functions
Minimization methods for non-differentiable functions
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Convex Optimization
Network sensitivity to hot-potato disruptions
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A clean slate 4D approach to network control and management
ACM SIGCOMM Computer Communication Review
Stable Egress Route Selection for Interdomain Traffic Engineering: Model and Analysis
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
On the Stability of Rational, Heterogeneous Interdomain Route Selection
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Practical and efficient internet routing with competing interests
Practical and efficient internet routing with competing interests
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Negotiation-based routing between neighboring ISPs
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Interdomain ingress traffic engineering through optimized AS-Path prepending
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing
IEEE Journal on Selected Areas in Communications
On route selection for interdomain traffic engineering
IEEE Network: The Magazine of Global Internetworking
CIPT: using tuangou to reduce IP transit costs
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Sharing the cost of backbone networks: cui bono?
Proceedings of the 2012 ACM conference on Internet measurement conference
| Hi-index | 0.00 |
We present a novel approach to interdomain traffic engineering based on the concepts of Nash bargaining and dual decomposition. Under this scheme, ISPs use an iterative procedure to jointly optimize a social cost function, referred to as the Nash product. We show that the global optimization problem can be separated into subproblems by introducing appropriate shadow prices on the interdomain flows. These subproblems can then be solved independently and in a decentralized manner by the individual ISPs. Our approach does not require the ISPs to share any sensitive internal information, such as network topology or link weights. More importantly, our approach is provably Pareto-efficient and fair. Therefore, we believe that our approach is highly amenable to adoption by ISPs when compared to past approaches. We also conduct simulation studies of our approach over several real ISP topologies. Our evaluation shows that the approach converges quickly, offers equitable performance improvements to ISPs, is significantly better than unilateral approaches (e.g., hot-potato routing) and offers the same performance as a centralized solution with full knowledge.