Diameter Constrained Network

These The Diameter-Constrained Minimum Spanning Tree Problem is about finding a minimum cost spanning tree, subjected to pre-defined constraints on the number of edges that can integrate the path between any pair of nodes. This problem typically models network design applications where all vertices must communicate with each other at a minimum cost, while meeting a given quality requirement. This is the typical situation addressed in an environment of Mufti-Protocol Label Stitching networks over Wavelength Division Multiplexing network design, in which an IP travelling puck goes through a delay queuing, proportional to the number of Label Switching Routers that it crosses. In this paper we describe different types of heuristics that were implemented in order to find optimal or near-optimal solutions to solve this problem.