Exact Algorithm for Delay-Constrained Capacitated Minimum Spanning Tree Network

Download Now
Provided by: Institution of Engineering and Technology
Topic: Networking
Format: PDF
The Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem of finding several broadcast trees from a source node is discussed. While the traditional CMST problem deals with only the traffic capacity constraint served by a port of the source node, and Delay-Constrained Minimum Spanning Tree (DCMST) considers only the maximum end-to-end delay constraint, the DC-CMST problem deals with both the mean network delay and traffic capacity constraints. The DC-CMST problem consists of finding a set of minimum cost spanning trees to link end-nodes to a source node satisfying the traffic requirements at end-nodes and the required mean delay of the network.
Download Now

Find By Topic