Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks

2001 ◽  
Vol 61 (9) ◽  
pp. 1307-1336 ◽  
Author(s):  
Tawfig Alrabiah ◽  
Taieb Znati
Keyword(s):  
Multicast Routing ◽  
Low Cost ◽  
Multimedia Networks

Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees

2015 ◽  
Vol 24 (4) ◽  
pp. 479-489
Author(s):  
Muhammad Atif Tahir ◽  
Asif Jamshed ◽  
Habib-ur Rehman ◽  
Yassine Daadaa
Keyword(s):  
Quality Of Service ◽  
Tabu Search ◽  
Multicast Routing ◽  
Low Cost ◽  
Multicast Tree ◽  
Source Node ◽  
Delay Constraint ◽  
Routing Problem ◽  
Dynamic Multicast

AbstractIn a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.

scholarly journals Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Huanlin Liu ◽  
Hongyue Dai ◽  
Fei Zhai ◽  
Yong Chen ◽  
Chengying Wei
Keyword(s):  
Cost Control ◽  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Low Cost ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
Multicast Tree ◽  
Control Factor ◽  
Wavelength Channel ◽  
Longest Path

Limited by the sparse light-splitting capability in WDM networks, some nodes need to reroute the optical packet to different destination nodes with the high cost of routing for reducing packet loss possibility. In the paper, the longest path reroute optimization algorithm is put forward to jointly optimize the multicast routing cost and wavelength channel assignment cost for sparse splitting WDM networks. Based on heuristic algorithms, the longest path reroute routing algorithm calls multiple longest paths in existing multicast tree to reroute the path passing from the nodes which are violating the light-splitting constraint to the nodes which are not violating light-splitting constraint with few wavelength channels and low rerouting cost. And a wavelength cost control factor is designed to select the reroute path with the lowest cost by comparing the multicast rerouting path cost increment with the equivalent wavelength channel required cost increment. By adjusting wavelength cost control factor, we can usually get the optimized multicast routing according to the actual network available wavelength conversion cost. Simulation results show that the proposed algorithm can get the low-cost multicast tree and reduce the required number of wavelength channels.

QoS–aware Mesh-based Multicast Routing Protocols in Edge Ad Hoc Networks: Concepts and Challenges

2022 ◽  
Vol 22 (1) ◽  
pp. 1-27
Author(s):  
Gaurav Singal ◽  
Vijay Laxmi ◽  
Manoj Singh Gaur ◽  
D. Vijay Rao ◽  
Riti Kushwaha ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Low Cost ◽  
Data Communication ◽  
Multimedia Data ◽  
Multicast Communication ◽  
Multicast Routing Protocols ◽  
Hoc Networks

Multicast communication plays a pivotal role in Edge based Mobile Ad hoc Networks (MANETs). MANETs can provide low-cost self-configuring devices for multimedia data communication that can be used in military battlefield, disaster management, connected living, and public safety networks. A Multicast communication should increase the network performance by decreasing the bandwidth consumption, battery power, and routing overhead. In recent years, a number of multicast routing protocols (MRPs) have been proposed to resolve above listed challenges. Some of them are used for dynamic establishment of reliable route for multimedia data communication. This article provides a detailed survey of the merits and demerits of the recently developed techniques. An ample study of various Quality of Service (QoS) techniques and enhancement is also presented. Later, mesh topology-based MRPs are classified according to enhancement in routing mechanism and QoS modification. This article covers the most recent, robust, and reliable QoS-aware mesh based MRPs, classified on the basis of their operational features, and pros and cons. Finally, a comparative study has been presented on the basis of their performance parameters on the proposed protocols.

Sign in / Sign up

Export Citation Format

Share Document