Abstract
The MPLS platform enables the implementation of advanced multipath and multicast routing schemes. This work develops and analyses the performance of a new bi-criteria minimum spanning tree model intended for routing broadcast messages in MPLS networks or constructing tree-based overlay networks. The aim of the model is to obtain spanning trees which are compromise solutions with respect to two important traffic engineering metrics: load balancing cost and average delay bound. An exact solution to the formulated bi-criteria optimization problem is presented, which is based on an algorithm that enables the computation of the set of supported non-dominated spanning trees. An application model and a set of experiments on randomly generated Internet type topologies will also be presented. Finally a network performance analysis of the model considering three network performance metrics will be shown.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call