Shortest Multilayered Path for Dimensioning in Two-Layer Connection-Oriented Networks

Multilayered model of network describes recent computers networks compounded of different layers of resources where different topologies in each layer are possible. It raises many new questions and changes most of well understood optimization problems on a single layer network into far from trivial. In this paper we focus attention on flow allocation in a multilayer network and we investigate dimensioning of network involving two layers of resources. In dimensioning problem, Flat Cost strategy allows to reconstruct network consists of many layers to single layer-like network. However considering modularization of capacity in adjacent layers, we indicate that depending on the volume of demand, strategies based on Shortest Multilayered Path and Temporary Flat Cost provide improved results.