Core selection algorithm for multicast routing under multiple QoS constraints

2000 ◽  
Vol 36 (4) ◽  
pp. 378 ◽  
Author(s):  
Sung Mo Chung ◽  
Chan-Hyun Youn
Keyword(s):  
Multicast Routing ◽  
Selection Algorithm ◽  
Core Selection ◽  
Multiple Qos Constraints ◽  
Multiple Qos

A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 553-558
Author(s):  
Ze Shun Zhou ◽  
Yi Xu ◽  
Jun Jie Yan ◽  
Zhong Wei Nie ◽  
La Yuan Li
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Multicast Tree ◽  
Global Network ◽  
Wireless Sensor ◽  
Hop Count ◽  
Routing Problem ◽  
Multiple Qos Constraints ◽  
Multiple Qos

Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.

A dynamic multicast routing satisfying multiple QoS constraints

2003 ◽  
Vol 13 (5) ◽  
pp. 321-335 ◽  
Author(s):  
Debasish Chakraborty ◽  
Goutam Chakraborty ◽  
Norio Shiratori
Keyword(s):  
Multicast Routing ◽  
Dynamic Multicast ◽  
Multiple Qos Constraints ◽  
Multiple Qos

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

scholarly journals M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

ETRI Journal ◽  
2005 ◽  
Vol 27 (6) ◽  
pp. 733-746 ◽  
Author(s):  
Daniel W. Hong ◽  
Choong Seon Hong ◽  
Gil-Haeng Lee
Keyword(s):  
Traffic Engineering ◽  
Routing Scheme ◽  
Multiple Qos Constraints ◽  
Multiple Qos
Sign in / Sign up

Export Citation Format

Share Document