And classifies the multicast routing algorithms with QoS constraints which have been put forward, especially analyzes Steiner Tree Algorithms with IP QoS constraint, emphasizes the least cost multicast routing with delay constraint problem and algorithms.
The issue of the delay-constrained multicast routing under dynamic environment was addressed firstly, and then a delay-constrained dynamic greedy algorithm (DCDG) was proposed to construct a serial of dynamic multicast trees based on the greedy strategy.
Taking example for DCLC (delay-constrained least-cost) problem that belongs to PCPO problem, according to TSQR algorithm, source node sends two kinds of probing messages (MinCProbe1/MinDProbe1, MinCProbe2/MinDProbe2) to destination node based on the minimum-cost path and the least-delay path between them, and these two kinds of probing messages correspond to two kinds of path-selection operations;
Simulation and experiment results show that the successful ratio constructing shared multicast tree with our algorithm is not only higher than that of RANDDCSHARED,MINMAXDDCSHARD,DCINITIALDCSHARED,can also ensure the delay constrained between the multi-source node and member node of a multicast group.
仿真实验表明,该算法所构造的组播树的成功率要高于RAND DCSHARED,M INMAXD CSHARD,DC IN IT IALDCSHARED等算法,同时也能保证多个源结点到成员结点之间的时延约束。
To support different QoS requirements in terms of bandwidth and delay constraints imposed by heterogeneous and dynamic joining receivers, this paper proposes an algorithm named QDMR-LD (QoS-based dynamic multicast routing for streaming layered data).
A good multicast routing algorithm should not only take delay constraints and delay variation constraints into account but also manage the network resources efficiently and reduce the cost of multicast trees for interactive real-time application.
It calculates the maximum number of sessions in a network with an end-to-end delay constraint based on the adjacency matrix and the link-delay matrix of the network.
Effective multicasting algorithm for dynamic membership with delay constraint
For streaming video, a big buffer is used as the associated delay constraint of the application is moderate and a very small buffer is used for conversational video to ensure that the forwarding delay of every packet is limited.
To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth.
The objective of the algorithms is to maximize the user-defined utility function value while meeting the end-to-end delay constraint.
This paper proposes an effective heuristic algorithm for dynamic multicast routing with delay-constrained DDMR.
A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained
The protocol finds a least-cost, delay-constrained path for real-time data in terms of link cost that captures nodes' energy reserve, transmission energy, error rate and other communication parameters.
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
In this paper, we propose a new dynamic delay-constrained least-cost multicast routing algorithm (DDCLCMR) to support these applications.
Due to memory and delay constraints in practical coding schemes, convolutional codes often are either terminated or decoded by a window decoder.
Routing results show that the proposed algorithm consistently produces the better results than other previously proposed routers while offering flexibility for future incorporation of noise and delay constraints.
The distributed network monitoring model with bounded delay constraints
By simplifying the expressions for the delay constraints and applying previously developed heuristics for the single-level problem , we are able to derive closed-form expressions for the inventory control parameters.
An improved heuristic is proposed for one-machine scheduling problem with delay constraints, thus an open problem raised by Wikumet al.