Networks for computer scientists and engineers
Networks for computer scientists and engineers
Topology Discovery by Active Probing
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
The Delay-Constrained Minimum Spanning Tree Problem
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem
Computer Communications
| Hi-index | 0.00 |
In this paper, we present the delay-bound capacitated minimum spanning tree (DB-CMST) problem, which consists of finding a set of minimum cost spanning trees to satisfy the traffic requirements at end-nodes and the mean delay requirements of each tree simultaneously. We formulate the DB-CMST problem using analytical model and present the least cost heuristic algorithm for solution. Experimental results show that the proposed algorithm can produce, in a very short computation time, better results than the previous CMST algorithm modified to solve the DB-CMST problem. The proposed heuristic algorithm can be applied to the construction of least cost trees for broadcasting in local computer network and for data aggregation in wireless sensor network.