The proposed protocol establishes a QoSHMM multicast tree by the principle of "ring in the same tier of the hierarchy and tree in different tiers", and it formed one shortest-delay path and multiple paths with delay-constrained minimal-cost.
A novel delay-constrained retransmission scheme with timestamp TS-ARQ is provided, and the theoretic analysis of the scheme is given based on the network retransmission model. Using NS2, the effects of several key factors and the performance of UDP are discussed.
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.
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.