Design of an Economical Multidrop Network Topology with Capacity Constraints

An Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree Problem

“…This heuristic is still used as a benchmark against which other techniques are evaluated. Sharma [20] and McGregor at al. [15] propose algorithms based on a clustering (grouping) approach.…”

“…Th notion of determining groupings (or nodes in a subtree) has been used previously by some researchers for the CMST problem [1,2,15,19,20]. Observe that, in the case of the CMST problem, interconnecting nodes that belong to the same subtree is quite simple as it is the Minimum Spanning Tree problem.…”

Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

“…Table 1 depicts the comparison of four different algorithms, including the Least-Cost DC-CMST Heuristic. It should be noted that the algorithms in [5,8,20] deal only with the CMST problem which does not consider the mean delay time constraint. In order to compare the performance of the four algorithms, we modified the algorithms in [5,8,20] by applying MDLCAA (used in the Least-Cost DC-CMST Heuristic) so that they can satisfy the mean delay constraint required for the solution of the DC-CMST problem.…”

“…It should be noted that the algorithms in [5,8,20] deal only with the CMST problem which does not consider the mean delay time constraint. In order to compare the performance of the four algorithms, we modified the algorithms in [5,8,20] by applying MDLCAA (used in the Least-Cost DC-CMST Heuristic) so that they can satisfy the mean delay constraint required for the solution of the DC-CMST problem. In the table, modified algorithm [20] can be applied only when the locations of nodes are given by the coordinates of plane, and every traffic requirement is one.…”

“…Topology discovery is required to find all the trees in a local network, which satisfy the traffic constraints. In the literature, issues related to topology discovery for local networks have been classified into two problems: Capacitated Minimum Spanning Tree (CMST) and Delay-Constrained Minimum Spanning Tree (DCMST) problems; they have been solved using heuristic [5,8,20] and exact [4,6,7,11] algorithms.…”