Lagrange relaxation based method for the QoS routing problem

2002 ◽  
Author(s):  
A. Juttner ◽  
B. Szviatovski ◽  
I. Mecs ◽  
Z. Rajko
Keyword(s):  
Qos Routing ◽  
Routing Problem ◽  
Lagrange Relaxation

scholarly journals Quantum Max-min Ant Colony Algorithm For QoS Routing Problem

2021 ◽  
Vol 1827 (1) ◽  
pp. 012163
Author(s):  
Yalong Li ◽  
Wang Wei ◽  
Sun Jing ◽  
Wan Jie
Keyword(s):  
Ant Colony Algorithm ◽  
Qos Routing ◽  
Ant Colony ◽  
Routing Problem

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.

scholarly journals A New QoS Routing Northbound Interface for SDN

2017 ◽  
Vol 5 (1) ◽  
pp. 92-115
Author(s):  
Siamak Layeghy ◽  
Farzaneh Pakzad ◽  
Marius Portmann
Keyword(s):  
Constraint Programming ◽  
Traffic Engineering ◽  
Qos Routing ◽  
Modelling Language ◽  
Routing Problem ◽  
Programming Techniques ◽  
Network Topologies ◽  
High Level ◽  
Basic Constraint ◽  
High Level Abstraction

In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new Software Defined Networking (SDN) Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint-programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high-level abstraction layer, consisting of 10 basic constraint-programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.

One QoS Routing Algorithm for Load Balancing in IP Backbone Networks: Design and Simulation

2013 ◽  
Vol 427-429 ◽  
pp. 2664-2667
Author(s):  
Zhi Qiang Cai ◽  
Rong Sheng Lv ◽  
Shi Wen Sun
Keyword(s):  
Load Balancing ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Traffic Load ◽  
Network Simulator ◽  
Network Resources ◽  
Routing Problem ◽  
Backbone Networks ◽  
Qos Routing Algorithm

Quality of Service (QoS) routing is intent to find feasible routes according to QoS constraints and optimize utilization of whole network resources. In order to solve bandwidth-guaranteed QoS routing problem, a simple but effective routing algorithm based on precomputation scheme with load balancing consideration, is proposed. The algorithm is implemented and simulated using Network Simulator (NS2). Research results showed that the proposal can keep some links free from becoming bottlenecks earlier, avoid congestion caused by unbalanced traffic load distribution, and improve performance of IP backbone networks.

Sign in / Sign up

Export Citation Format

Share Document