Mariusz Mycek

Cooperative multi-provider routing optimization and income distribution

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 mechanism for reliable cooperative optimization of flow reservation levels introduced, by considering the fundamental issue of fair income distribution. The proposed idea of fair income distribution mechanism has been adopted from the theory of cooperative games (Shapley value). We show the benefits of adopting the proposed income distribution scheme by numerical simulations.

Distributed Inter-Domain Link Capacity Optimization for Inter-Domain IP/MPLS Routing

Our goal is to present a mathematical model useful for distributed optimization of traffic routing in multi-domain Internet networks. In such environments each domain is operated autonomously and has access to limited information about the rest of the network. Our model reflects this through an appropriate problem decomposition with respect to individual domains. The decomposition aims at supporting a distributed process of routing optimization that could be run in the control plane of the network using existing EGP routing protocols. The usefulness of the decomposition is investigated and illustrated with numerical examples.

A distributed scheme for inter-domain routing optimization

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 of a near optimal primal solution is discussed. Effectiveness of the method for the case of synchronized local intra-domain computations is tested using two different subgradient optimization algorithms: a divergent series algorithm and a proximal bundle algorithm. The issue of implementing such a method in a distributed networkwide process of routing optimization which could be run in the control plane of the network using the existing EGP protocols is considered. Two schemes for such decomposed optimization involving only partial synchronization of local intra-domain computations are discussed.

A subgradient optimization approach to inter-domain routing in IP/MPLS networks

We present a mathematical model for a distributed process of routing optimization that could be run in the control plane of the Internet using existing EGP routing protocols. A more detailed description of the results presented in this paper is given in [1].

On cost of the uniformity in FTTH network design

The research aims in estimating the impact of various levels of administratively imposed structural regularities and equipment uniformities on FTTH network designs. We enhance our FTTH network optimization platform with algorithms that allow imposing additional constraints on the returned solutions. We use the platform to compare, in terms of CAPEX, obtained FTTH network designs. Additionally, we use available methods to minimize CAPEX generated during network deployment, which is only possible when adequate levels of flexibility of designs are held. The research is intended to show advantages and drawbacks related to imposing administrative constraints on flexibility of FTTH network designs.