A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges

Yang, Chunde and Zhao, Xin (2014) A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges. Communications and Network, 06 (01). pp. 43-47. ISSN 1949-2421

[thumbnail of CN_2014021315550957.pdf] Text
CN_2014021315550957.pdf - Published Version
Download (333kB)

Abstract

In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.

Item Type: Article
Subjects: STM Repository > Computer Science
Depositing User: Managing Editor
Date Deposited: 23 Mar 2023 06:11
Last Modified: 24 Apr 2024 09:02
URI: http://classical.goforpromo.com/id/eprint/2245

Actions (login required)

View Item
View Item