Call capacity model and QoS routing algorithms on multi-channel multi-radio wireless meshes

2012 ◽  
Author(s):  
Sunghun Kim ◽  
Myungln Ji ◽  
Joong Sao Ma
Keyword(s):  
Qos Routing ◽  
Routing Algorithms ◽  
Capacity Model ◽  
Call Capacity

Quality of Service for Multimedia and Real-Time Services

2010 ◽  
Vol 5 (4) ◽  
pp. 1-22
Author(s):  
F. W. Albalas ◽  
B. A. Abu-Alhaija ◽  
A. Awajan ◽  
A. Awajan ◽  
Khalid Al-Begain
Keyword(s):  
Decision Making ◽  
Quality Of Service ◽  
Real Time ◽  
Qos Routing ◽  
Routing Algorithms ◽  
Complete Problem ◽  
Filtering Technique ◽  
Np Complete ◽  
Multiple Metrics

New web technologies have encouraged the deployment of various network applications that are rich with multimedia and real-time services. These services demand stringent requirements are defined through Quality of Service (QoS) parameters such as delay, jitter, loss, etc. To guarantee the delivery of these services QoS routing algorithms that deal with multiple metrics are needed. Unfortunately, QoS routing with multiple metrics is considered an NP-complete problem that cannot be solved by a simple algorithm. This paper proposes three source based QoS routing algorithms that find the optimal path from the service provider to the user that best satisfies the QoS requirements for a particular service. The three algorithms use the same filtering technique to prune all the paths that do not meet the requirements which solves the complexity of NP-complete problem. Next, each of the three algorithms integrates a different Multiple Criteria Decision Making method to select one of the paths that have resulted from the route filtering technique. The three decision making methods used are the Analytic Hierarchy Process (AHP), Multi-Attribute Utility Theory (MAUT), and Kepner-Tregoe KT. Results show that the algorithms find a path using multiple constraints with a high ability to handle multimedia and real-time applications.

scholarly journals Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation

2018 ◽  
Vol 20 (1) ◽  
pp. 388-415 ◽  
Author(s):  
Jochen W. Guck ◽  
Amaury Van Bemten ◽  
Martin Reisslein ◽  
Wolfgang Kellerer
Keyword(s):  
Performance Evaluation ◽  
Qos Routing ◽  
Routing Algorithms ◽  
Comprehensive Survey ◽  
And Performance

Propose a new algorithm of routing with information collected locally

2016 ◽  
Vol 2 (1) ◽  
pp. 70
Author(s):  
Tran Minh Anh ◽  
Nguyen Chien Trinh
Keyword(s):  
Routing Algorithm ◽  
Qos Routing ◽  
Local Information ◽  
Routing Algorithms ◽  
Source Node ◽  
Quality Of Services ◽  
Global State ◽  
State Information ◽  
Near Future

The type of algorithm which uses local information collected from source node for Quality of Service (QoS) routing has recently been researched as an alternative to QoS routing algorithms that traditionally use global state information. This algorithm, collecting information from source node only, helps flow routing better and assures more flexibly QoS for network. This trend leads to a new solution for satisfying the higher and higher demand of telecom market in the near future. In this paper, we introduce a new algorithm of routing like that type for assuring the quality of network as well as quality of services. The simulations at last section show the advantages over some other localized routing algorithms and global routing algorithm.

Quality of Service for Multimedia and Real-Time Services

2012 ◽  
pp. 241-262
Author(s):  
F. W. Albalas ◽  
B. A. Abu-Alhaija ◽  
A. Awajan ◽  
A. Awajan ◽  
Khalid Al-Begain
Keyword(s):  
Decision Making ◽  
Quality Of Service ◽  
Real Time ◽  
Qos Routing ◽  
Routing Algorithms ◽  
Complete Problem ◽  
Filtering Technique ◽  
Np Complete ◽  
Multiple Metrics

New web technologies have encouraged the deployment of various network applications that are rich with multimedia and real-time services. These services demand stringent requirements are defined through Quality of Service (QoS) parameters such as delay, jitter, loss, etc. To guarantee the delivery of these services QoS routing algorithms that deal with multiple metrics are needed. Unfortunately, QoS routing with multiple metrics is considered an NP-complete problem that cannot be solved by a simple algorithm. This paper proposes three source based QoS routing algorithms that find the optimal path from the service provider to the user that best satisfies the QoS requirements for a particular service. The three algorithms use the same filtering technique to prune all the paths that do not meet the requirements which solves the complexity of NP-complete problem. Next, each of the three algorithms integrates a different Multiple Criteria Decision Making method to select one of the paths that have resulted from the route filtering technique. The three decision making methods used are the Analytic Hierarchy Process (AHP), Multi-Attribute Utility Theory (MAUT), and Kepner-Tregoe KT. Results show that the algorithms find a path using multiple constraints with a high ability to handle multimedia and real-time applications.

Sign in / Sign up

Export Citation Format

Share Document