A distributed scheme for optimization of interdomain routing between collaborating domains

Summary, in English

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.

• Author: Artur Tomaszewski; Michal Pioro; Mariusz Mycek
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2008
• Language: English
• Pages: 631-638
• Publication/Series: Annales des Télécommunications
• Volume: 63
• Links: http://dx.doi.org/10.1007/s12243-008-0056-z
• Document type: Journal article
• Publisher: Springer
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Keywords: Interdomain routing; Distributed optimization; Lagrangean relaxation
• Status: Published
• Research group: Networking
• ISBN/ISSN/Other: ISSN: 1958-9395