The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of cooperative distributed routing optimization in multi-domain/multi-provider networks. The main object of our investigation are ASON/G-MPLS transport networks, still the results of our investigations could be extended to any multi-domain network where particular domains have limited mutual visibility of intra-domain resources. This paper refines a distributed decomposition...
All-optical packet switching designs have evolved in the last years. However, all-optical packet forwarding functionalities are still limited. Several label assignation methods have been studied in order to efficiently use the small label space of the designs. In this paper, we present a novel scheme for label switched path protection for networks with small label spaces, such as all-optical packet...
This tutorial is devoted to the notion of max-min fairness (MMF), associated optimization problems, and their applications to multi-commodity flow networks.We first introduce a theoretical background for a generic MMF optimization problem and discuss its relation to lexicographic optimization. We next present resolution algorithms for convex MMF optimization, and analyze their properties. In the second...
The goal of the paper is to present a decomposed approach to optimization of inter-domain routing in IP networks. A problem of maximizing the total amount of traffic carried in an inter-domain network is formulated as a linear programme. Using Lagrangean relaxation the problem is decomposed with respect to individual domains. A resolution method based on subgradient optimization combined with recovering...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.