Mariusz Mycek

Learn More
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(More)
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(More)
We present an optimization platform for Fiberto-the-Home network design. The platform is capable of minimizing the capital expenditures (CAPEX) of network deployment by optimizing locations of optical equipment, signal splitters and cable cabinets, optimizing cable routes and types of cables as well as the number and types of optical cards and splitters. We(More)
In this research, we analyse the impact of various uncertainty models describing clients' behaviour on optimal FTTH network designs. We introduce the models, optimize the network designs taking into account the introduced models, and evaluate those designs against different plausible scenarios of clients' behaviour. The research is intended to show(More)
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,(More)
The goal of the paper is to present a distributed scheme to resolving a single path routing problem in multidomain networks. The global problem is formulated as a mixed-integer program (MIP) and approached by means of branch-and-price (B&P). Problems associated with a B&P tree nodes are decomposed using the Dantzig-Wolfe method to a set of domain(More)
  • 1