scholarly journals Service Selection Algorithms for Composing Complex Services with Multiple QoS Constraints

2005 ◽  
pp. 130-143 ◽  
Author(s):  
Tao Yu ◽  
Kwei-Jay Lin
Keyword(s):  
Service Selection ◽  
Multiple Qos Constraints ◽  
Selection Algorithms ◽  
Multiple Qos

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

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.

Research of Multiple Constrained Qos Routing Based on Improved Ant Colony Algorithm

2014 ◽  
Vol 513-517 ◽  
pp. 994-998 ◽  
Author(s):  
Yue Gong ◽  
Jia Nan Wang
Keyword(s):  
Maximum Degree ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Ant Colony ◽  
Multiple Constraints ◽  
Simulation Experiments ◽  
Qos Routing Algorithm ◽  
Multiple Qos Constraints ◽  
Multiple Qos

This paper mainly discusses the Multiple Constrained Qos Routing Algorithm, in the analysis of the basic on the basis of mathematical model of Qos routing. It has proposed a routing model with an objective function, integrated optimization of multiple Qos constraints. Finally, the optimization of ant colony algorithm applied to solve the problem of multiple constraints Qos. Through simulation experiments proved that the algorithm to find the path to maximum degree meets Qos requirements.

Disjoint path and protection with multiple QoS constraints based on traffic grooming

2005 ◽  
Author(s):  
Yu Hua ◽  
Chanle Wu ◽  
Yong Wang ◽  
Zhi Zhou ◽  
Jun Du
Keyword(s):  
Traffic Grooming ◽  
Disjoint Path ◽  
Multiple Qos Constraints ◽  
Multiple Qos
Sign in / Sign up

Export Citation Format

Share Document