Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akella, A., Maggs, B., Seshan, S., Shaikh, A., Sitaraman, R.: A measurement-based analysis of multihoming. In: SIGCOMM, pp. 353–364 (2003)
Beier, R., Röglin, H., Vöcking, B.: The smoothed number of pareto optimal solutions in bicriteria integer optimization. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 53–67. Springer, Heidelberg (2007)
Dai, R., Stahl, D.O., Whinston, A.B.: The economics of smart routing and quality of service. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds.) NGC 2003 and ICQT 2003. LNCS, vol. 2816, pp. 318–331. Springer, Heidelberg (2003)
Goldenberg, D.K., Qiu, L., Xie, H., Yang, Y.R., Zhang, Y.: Optimizing cost and performance for multihoming. In: SIGCOMM, pp. 79–82 (2004)
Knuth, D.: The Art of Computer Programming, 3rd edn. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1997)
Liu, Y., Reddy, A.L.N.: Multihoming route control among a group of multihomed stub networks. Computer Comm. 30(17), 3335–3345 (2007)
Mahajan, R., Wetherall, D., Anderson, T.: Negotiation-based routing between neighboring ISPs. In: NSDI, pp. 29–42 (2005)
Nemhauser, G.L., Ullmann, Z.: Discrete dynamic programming and capital allocation. Management Science 15(9), 494–505 (1969)
Quoitin, B., Bonaventure, O.: A cooperative approach to interdomain traffic engineering. In: EuroNGI (2005)
Röglin, H., Teng, S.-H.: Smoothed Analysis of Multiobjective Optimization. In: FOCS, pp. 681–690 (2009)
Sevcik, P., Bartlett, J.: Improving user experience with route control. Technical Report NetForecast Report 5062, NetForecast, Inc. (2002)
Shavitt, Y., Shir, E.: DIMES: let the Internet measure itself. ACM SIGCOMM Computer Communication Review 35(5), 71–74 (2005)
Shavitt, Y., Singer, Y.: Limitations and Possibilities of Path Trading between Autonomous Systems. In: INFOCOM (2010)
Shrimali, G., Akella, A., Mutapcic, A.: Cooperative interdomain traffic engineering using nash bargaining and decomposition. In: INFOCOM, pp. 330–338 (2007)
Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. Journal of the ACM 51(3), 385–463 (2004)
Spielman, D.A., Teng, S.-H.: Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Communic. of the ACM 52(10), 76–84 (2009)
Teixeira, R., Shaikh, A., Griffin, T., Rexford, J.: Dynamics of hot-potato routing in IP networks. In: SIGMETRICS, pp. 307–319 (2004)
Winick, J., Jamin, S., Rexford, J.: Traffic engineering between neighboring domains. Technical report (2002)
Yang, Y.R., Xie, H., Wang, H., Silberschatz, A., Krishnamurthy, A., Liu, Y., Li, E.L.: On route selection for interdomain traffic engineering. IEEE Network 19(6), 20–27 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, A., Röglin, H., van der Zwaan, R. (2011). Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-20662-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20661-0
Online ISBN: 978-3-642-20662-7
eBook Packages: Computer ScienceComputer Science (R0)