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.

A New Localized Multi-Constraint QoS Routing Algorithm

2017 ◽  
Author(s):  
Tran Minh Anh ◽  
Nguyen Chien Trinh
Keyword(s):  
Routing Algorithm ◽  
Qos Routing ◽  
Routing Algorithms ◽  
Source Node ◽  
Global Network ◽  
Traffic Patterns ◽  
State Information ◽  
Alternative Approach ◽  
Qos Routing Algorithm

The scheme of Quality of Service (QoS) routing algorithms based on local state information has recently been proposed as an alternative approach to the traditional QoS routing algorithms. By implementing this localized QoS routing algorithm, each source node predetermines and maintains a set of candidate paths for each destination. These sets of paths will help the source node to decide the most appropriate path for a connection request. Hence, it helps to avoid the problems associated with the maintenance of the global network state information. In this paper, we propose a new and effective localized QoS routing algorithm, compare its performance with those of other localized algorithms and a traditional QoS routing algorithm under the same type of network topology, QoS requirements and traffic patterns. The simulations results show that our proposed algorithm can perform better than other routing algorithms. DOI: 10.32913/rd-ict.vol3.no14.258

scholarly journals Influence of Self-Similar Traffic Type on Performance of QoS Routing Algorithms

2016 ◽  
Vol 62 (1) ◽  
pp. 81-87 ◽  
Author(s):  
Michał Czarkowski ◽  
Sylwester Kaczmarek ◽  
Maciej Wolff
Keyword(s):  
Routing Algorithm ◽  
Routing Algorithms ◽  
Point Of View ◽  
Telecommunication Networks ◽  
Quality Of Services ◽  
Network Resources ◽  
Performance Point ◽  
New Type ◽  
Self Similar

Abstract Providing a Quality of Services (QoS) into current telecommunication networks based on packet technology is a big challenge nowadays. Network operators have to support a number of new services like voice or video which generate new type of traffic. This traffic serviced with QoS in consequence requires access to appropriate network resources. Additionally, new traffic type is mixed with older one, like best-effort. Analysis of these new and mixed traffic types shows that this traffic is self-similar. Network mechanisms used for delivery of quality of services may depend on traffic type especially from the performance point of view. This paper presents a feasibility study done into the effect of traffic type influence on performance of routing algorithm while the routing algorithm is treated as one of the mechanisms to support QoS in the network.

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 An Energy Efficient Qos Routing Protocol Based On Red Deer Algorithm In MANET

2021 ◽  
Vol 12 (5) ◽  
pp. 1461-1471
Author(s):  
S. Arivarasan, Et. al.
Keyword(s):  
Energy Efficient ◽  
Red Deer ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Major Drawback ◽  
Manet Routing ◽  
Hoc Networks ◽  
Application Requirements

MANETs (Mobile ad hoc networks) are overloaded with their heavy usage choking traffic. Recent studies have been attempting to find feasibility of routes in these networks. Most proposed schemes have failed to consider the network traffic or MANET requirements. MANET routing done by RPs (Routing Protocols) would perform better when they adhere to QoS (Quality of Service) or application requirements. As a result, RPs must satisfy numerous QoS metrics at a time where soft computing algorithm based RPs are a solution to QoS routing problems. Evolutionary algorithm based routing do not achieve enough energy efficiency which is a major drawback. To overcome this drawback, this work, proposes Red Deer algorithm (RDA) based energy efficient QoS routing for MANETs called (RDA-EQRP). The proposed RDA based routing algorithm discovers the shortest path from a source to a destination which can consumes less energy while supporting the metrics such of reliability, bandwidth, SRC (Static Resource Capacity), Quality and delay. Simulation results show that proposed rotting scheme RDA-EQRP consumes lesser energy in MANET routing.

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.

Improving NSGA-II for Multi-Constrained QoS Routing

2021 ◽  
pp. 2150252
Author(s):  
Xin Liu ◽  
Jingyuan Zhao ◽  
Lin Zheng ◽  
Liying Li ◽  
Li Liu ◽  
...  
Keyword(s):  
Quality Of Service ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Selection Strategy ◽  
Multiple Constraints ◽  
Nsga Ii ◽  
Mutation Operators ◽  
Qos Routing Algorithm ◽  
Crossover And Mutation

With the development of 5G technology, the traffics which need multiple quality of service (QoS) constraints greatly increase. The existing QoS routing algorithms either support a single QoS constraint or support multiple constraints are mixed with fixed weights. The latter is essentially a single-constrained QoS algorithm. Few studies can provide the quality of service guaranteed under the true sense of multiple constraints, by which only one solution can be provided. In this paper, we propose NSGAII-MCR: a multi-constrained QoS routing algorithm based on non-dominated sorting genetic algorithm II (NSGA-II). In NSGAII-MCR, three representative constraints are selected: delay, bandwidth, and packet loss rate. The validity of the routing is guaranteed by a designed encoding and decoding scheme and a novel individual generation method. Meantime, the original NSGA-II crossover and mutation operators are modified. We further enhance the selection strategy to improve the diversity of solutions and the robustness of NSGAII-MCR. At last, multiple optional routes in the Pareto-optimal front are obtained. The experiment demonstrates that the proposed NSGAII-MCR can achieve high success rate by up to 95%. Compared with the benchmarking methods, NSGAII-MCR can support more constraints and finds more multi-constrained routes.

Sign in / Sign up

Export Citation Format

Share Document