ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints

Abstract

SUMMARYWith the spread of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements becomes a problem of prime importance. A principal factor of these real-time applications is to optimize the delay-and delay variation-bounded multicast tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as an NP-complete problem. The representative algorithms are the DVMA, the DDVCA, and the ECS algorithm. In this paper, we show that the proposed ESC algorithm outperforms the DDVCA and the ECS algorithm. The efficiency of our algorithm is verified through performance evaluation and the enhancement is up to about 19.6% in terms of normalized surcharge for multicast delay variation. The time complexity of our algorithm is O(mn 2 ), which is comparable to the well-known DDVCA.

Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing

“…The algorithm Kim et al propose, estimation (ESC), finds shortest paths from the source to all nodes in the network and from every node in M to all nodes in the network. After setting the interdestination delay variation of every node satisfying the Δ constraint to reach all members, the minimum interdestination delay variation value ( d v m i n ) is selected.…”

“…In ESC, the estimation value is set for a small subset of candidate core nodes, the ones having the lowest interdestination delay variation value. When the location of all these considered candidate nodes in trees constructed by ESC conforms with cases 1 or 3, the end‐to‐end delay and interdestination delay variation values of the tree are different than the ones set during the execution of the algorithm, as the nodes receive the message directly from the source . Thus, it is possible that a higher quality core node existed but was not checked for candidacy.…”

On-demand QoS and Stability Based Multicast Routing in Mobile Ad Hoc Networks

“…The "Cell Replication While Routing" is used as a packet routing technique, and the "full multicast" mode as transmission policy is employed in all the MINs under study. The work presented in [27], estimates and selects core for reducing multicast delay variation for delay sensitive applications in Delay Variation Bounded Multicast Tree (DVBMT). Adaptive Demand-Driven Multicast Routing protocol (ADMR) presented in [28], supports source specific multicast joins and to route along shortest paths, and uses no periodic network-wide floods of control packets, periodic neighbor sensing, or periodic routing table exchanges, and requires no core.…”

An OAM function to improve the packet loss in MPLS‐TP domains for prioritized QoS‐aware services

“…In essence, the aim of MPLS-TP is to develop MPLS extensions where necessary in order to meet classical transport network requirements, such as scalability, multi-service, cost efficiency, high level of availability, and extensive operations, administration, and maintenance (OAM) capabilities [12]. Packet loss measurement (PLM) is one of these OAM MPLS-TP functions, being a key challenge for many service providers, as the service level agreements depend on the ability to measure and monitor performance metrics for packet loss or delay [13].…”