Stochastic Workload Scheduling for Uncoordinated Datacenter Clouds with Multiple QoS Constraints

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.

Download Full-text

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

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.513-517.994 ◽

2014 ◽

Vol 513-517 ◽

pp. 994-998 ◽

Cited By ~ 1

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.

Download Full-text

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

10.1117/12.574441 ◽

2005 ◽

Author(s):

Yu Hua ◽

Chanle Wu ◽

Yong Wang ◽

Zhi Zhou ◽

Jun Du

Keyword(s):

Traffic Grooming ◽

Disjoint Path ◽

Multiple Qos Constraints ◽

Multiple Qos

Download Full-text

An Efficient Approximation Scheme for the Multiple QoS Constraints Routing

2014 Tenth International Conference on Computational Intelligence and Security ◽

10.1109/cis.2014.84 ◽

2014 ◽

Author(s):

Weijun Yang ◽

Yan Yang ◽

Xiaodong Wang ◽

Liang Yang

Keyword(s):

Approximation Scheme ◽

Multiple Qos Constraints ◽

Efficient Approximation ◽

Multiple Qos

Download Full-text

Multi-path selection based on fractional cuckoo search algorithm for QoS aware routing in MANET

Sensor Review ◽

10.1108/sr-08-2017-0170 ◽

2019 ◽

Vol 39 (2) ◽

pp. 218-232 ◽

Cited By ~ 1

Author(s):

Rama Rao A. ◽

Satyananda Reddy ◽

Valli Kumari V.

Keyword(s):

Ad Hoc ◽

Search Algorithm ◽

Life Time ◽

Cuckoo Search ◽

Cuckoo Search Algorithm ◽

Path Selection ◽

Content Type ◽

Time Distance ◽

Multiple Qos Constraints ◽

Multiple Qos

Purpose Multimedia applications such as digital audio and video have stringent quality of service (QoS) requirement in mobile ad hoc network. To support wide range of QoS, complex routing protocols with multiple QoS constraints are necessary. In QoS routing, the basic problem is to find a path that satisfies multiple QoS constraints. Moreover, mobility, congestion and packet loss in dynamic topology of network also leads to QoS performance degradation of protocol. Design/methodology/approach In this paper, the authors proposed a multi-path selection scheme for QoS aware routing in mobile ad hoc network based on fractional cuckoo search algorithm (FCS-MQARP). Here, multiple QoS constraints energy, link life time, distance and delay are considered for path selection. Findings The experimentation of proposed FCS-MQARP is performed over existing QoS aware routing protocols AOMDV, MMQARP, CS-MQARP using measures such as normalized delay, energy and throughput. The extensive simulation study of the proposed FCS-based multipath selection shows that the proposed QoS aware routing protocol performs better than the existing routing protocol with maximal energy of 99.1501 and minimal delay of 0.0554. Originality/value This paper presents a hybrid optimization algorithm called the FCS algorithm for the multi-path selection. Also, a new fitness function is developed by considering the QoS constraints such as energy, link life time, distance and delay.

Download Full-text