The delay-constrained minimum spanning tree problem

Abstract

We formulate the problem of constructing broadcast trees for real-time traffic with delay constraints in networks with asymmetric link loads as a delay-constrained minimum spanning tree (DCMST) problem in directed networks. Then, we prove that this problem is NP-complete, and we propose an efficient heuristic to solve the problem based on Prim's algorithm for the unconstrained minimum spanning tree problem. Simulation results under realistic networking conditions show that our heuristic's performance is close to optimal. Delay-constrained minimum Steiner tree heuristics can be used to solve the DCMST problem. Simulation results indicate that the fastest delay-constrained minimum Steiner tree heuristic, DMCT, is not as efficient as the heuristic we propose, while the most efficient delayconstrained minimum Steiner tree heuristic, BSMA, is much slower than our proposed heuristic and does not construct delay-constrained broadcast trees of lower cost.

Secure Data Storage Over Distributed Nodes in Network Through Broadcast Techniques

“…Main aim has been to design solutions which only require local (one -hop neighborhood) knowledge, have low complexity, low overhead, and result in low energy consumption, low network load and high reliability. Salama et al [12] propose the delay-constrained minimum spanning tree problem. Basagni et al [13] present a mobility transparent broadcast scheme for mobile multihop radio networks.…”

Competitive Decision Algorithm for the Rooted Delay-constrained Minimum Spanning Tree

“…In the recent papers, the researches about solving methods of RDCMST problem developed rapidly [3][4][5][6][7][8][9]. Exact approaches to RDCMST problem have been examined by Gouveia et.al.…”

“…in [3], but it only can solve small graphs with less than 100 nodes. A constructive heuristic was presented in [4] based on Prim's algorithm to find a RDCMST. The performance will affected greatly by the cheap cost edge with large delay.…”

Scalability in adaptive multi-metric overlays

“…Each participant chooses a parent that allows it to satisfy performance criteria by comparing potential overlay edges. The sequential version of this problem when dealing with multiple metrics is typically NP-hard [20,22] even with global knowledge under non-realistic, static network conditions. As a result, many efforts consider only a single performance metric.…”