An Efficient Model for the Multilayer Network Planning of IP-over-WDM Networks

Abstract We present "the stair function", a characteristic function corresponding to a routing and grooming (RG) algorithm and a topology. It allows to obtain bounds and to estimate the results of the network planning over a vast scope of traffic matrixes, to evaluate RG algorithms independently from a traffic scenario, to conclude on the universality of results obtained by an RG algorithm over a given scenario