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
Cooperative interdomain traffic engineering using Nash bargaining and decomposition
IEEE/ACM Transactions on Networking (TON)
Limitations and possibilities of path trading between autonomous systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Path trading: fast algorithms, smoothed analysis, and hardness results
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
| Hi-index | 0.00 |
In this article we investigate a model of route selection for interdomain traffic engineering where routing to multiple destinations can be coordinated. We identify potential routing instability and inefficiency problems, and derive a set of practical guidelines to guarantee stability without global coordination. Using a realistic Internet topology, we show that route oscillations can happen even when a small number of ASes coordinate route selection for just a small number of destinations if the coordination does not follow our guidelines. Wc further extend our model so that ASes can adopt any route selection algorithms in a class of algorithms we call rational route selection algorithms; and the local ranking of routes of an AS can depend on ingress traffic patterns. We show that persistent route oscillations can happen in certain network settings even if the ASes strictly follow the constraints imposed by business considerations, and adopt any rational route selection algorithms.