An Efficient Algorithm for Delay and Delay- Variation Bounded Core Based Tree Generation | Zendy

Manoj Kumar Patel | Zendy; Manas Ranjan Kabat | Zendy; C. R. Tripathy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Efficient Algorithm for Delay and Delay- Variation Bounded Core Based Tree Generation

Author(s) -

Manoj Kumar Patel,

Manas Ranjan Kabat,

C. R. Tripathy

Publication year - 2010

Publication title -

international journal of computer and communication technology

Language(s) - English

Resource type - Journals

eISSN - 2231-0371

pISSN - 0975-7449

DOI - 10.47893/ijcct.2010.1045

Subject(s) - multicast , computer science , elmore delay , tree (set theory) , network delay , heuristic , variation (astronomy) , bounded function , quality of service , upper and lower bounds , end to end delay , algorithm , distributed computing , computer network , propagation delay , mathematics , delay calculation , mathematical analysis , physics , astrophysics , artificial intelligence , network packet

Many multimedia group applications require the construction of multicast tree satisfying the quality of service (QoS) requirements. To support real time communication, computer networks need to optimize the Delay and Delay-Variation Bounded Multicast Tree (DVBMT). The problem is to satisfy the end-to-end delay and delay-variation within an upper bound. The DVBMT problem is known to be NP complete. In this paper, we propose an efficient core selection algorithm for satisfying the end-to-end delay and delay-variation within an upper bound. The efficiency of the proposed algorithm is validated through the simulation. The simulation results reveal that our algorithm performs better than the existing heuristic algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research