Abstract
As today’s market forces the implementation of quality-of-service-enabled services spanned over multiple administrative domains, isolated and locally optimized interdomain routing decisions become increasingly inadequate. Instead, coordinated routing models are required together with joint optimization goals. Available papers and standardization documents focus on the description of technical means for deployment of interdomain transport services giving little (or no) attention to the problem of evaluating effective interdomain routing patterns. Our paper aims at closing this gap. It presents an iterative distributed process where domains cooperatively determine a (sub)optimal, with respect to a common utility function, flow of interdomain traffic. If all the cooperating domains adhere to the results of this process, they can reduce their operational costs, speed up operations, and increase profits. This paper is a continuation of Tomaszewski et al. (2007) and Pióro et al. (2007)—it introduces a modified problem formulation and analyzes the influence of aggregation of intradomain topology on speed and quality of the resolution process.
Similar content being viewed by others
References
Tomaszewski A, Pióro M, Mycek M (2007) A distributed scheme for inter-domain routing optimization. In: Proceedings of the 6th international workshop on design and reliable communication networks DRCN’2007, La Rochelle, 7–10 October 2007
Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Program 87(3):385–399
Feamster N, Borkenhagen J, Rexford J (2003) Guidlines for interdomain traffic engineering. ACM SIGCOM Comput Commun Rev 33(5):19–30
Held M, Wolfe P, Crowder H (1974) Validation of sub-gradient optimization. Math Program 6:62–88
Helmberg C (2005) Conic bundle 0.1. Technical report. Fakultät für Mathematik, Technische Universität Chemnitz
Larsson T, Liu Z (1989) A primal convergence result for dual subgradient optimization with application to multicommodity network flows. Research Report, Department of Mathematics, Linköping Institute of Technology, Sweden
Larsson T, Liu Z (2004) A Lagrangean relaxation scheme for structured linear programs with application to multicommodity network flows. Technical report, Department of Mathematics, Linköping Institute of Technology, Sweden
Lasdon L (1970) Optimization theory for large systems. MacMillan, New York
Minoux M (1986) Mathematical programming: theory and algorithms. Wiley, New York
Pióro M, Medhi D (2004) Routing, flow, and capacity design in communication and computer networks. Morgan Kaufmann, San Francisco
Pióro M, Tomaszewski A, Dzida M, Mycek M, Zagożdżon M (2007) A subgradient optimization approach to inter-domain routing in IP/MPLS networks. In: Proceedings of the IFIP Networking’2007, Atlanta, 14–18 May 2007
Pióro M, Tomaszewski A, Mycek M (2007) Distributed inter-domain link capacity optimization for inter-domain ip/mpls routing. In: Proceedings of the Globecom’2007, Washington, DC, 26–30 November 2007
Shapiro J (1979) Mathematical programming: structures and algorithms. Wiley, New York
Sherali H, Choi G (1996) Recovery of primal solutions when using subgradient optimization methods to solve Lagrangean duals of linear programs. Oper Res Lett 19:105–113
Shor N (1985) Minimization methods for nondifferentiable functions. Springer, Berlin
Shrimali G, Akella A, Mutapcic A (2007) Cooperative inter-domain traffic engineering using Nash bargaining and decomposition. In: Proceedings of the IEEE Conference on Computer Communication INFOCOM’2007, Anchorage, 6–12 May 2007
Tomaszewski A, Pióro M, Dzida M, Mycek M, Zagożdżon M (2007) Towards distributed inter-domain routing optimization for IP/MPLS networks. Technical report, Institute of Telecommunications, Warsaw University of Technology, Poland
Winnick J, Jamin S, Rexford J (2002) Trafffic engineering between neighboring domains. Technical report, http://www.cs.princeton.edu/~jrex/publications.html
Acknowledgements
The presented work was sponsored by Polish Ministry of Science and Higher Education (grant 3 T11D 001 27), by Swedish Research Council (grant 621-2006-5509), and by the EU projects Euro-FGI (FP6 NoE) and GRAAL (Cost 293).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tomaszewski, A., Pióro, M. & Mycek, M. A distributed scheme for optimization of interdomain routing between collaborating domains. Ann. Telecommun. 63, 631–638 (2008). https://doi.org/10.1007/s12243-008-0056-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-008-0056-z