Pre-computation based selective probing (PCSP) scheme for distributed quality of service (QoS) routing with imprecise state information

2006 ◽  
Vol 8 (1) ◽  
pp. 70-84
Author(s):  
Won-Ick Lee ◽  
Byeong Gi Lee
Keyword(s):  
Quality Of Service ◽  
Qos Routing ◽  
State Information

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 MQoSR: A Multiobjective QoS Routing Protocol for Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Hind Alwan ◽  
Anjali Agarwal
Keyword(s):  
Wireless Sensor Networks ◽  
Quality Of Service ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Data Transmission ◽  
Qos Routing ◽  
Wireless Sensor ◽  
Data Delivery

With the growing demand for quality-of-service (QoS) aware routing protocol in wireless networks, QoS-based routing has emerged as an interesting research topic. Quality of service guarantee in wireless sensor networks (WSNs) is difficult and more challenging due to the fact that the available resources of sensors and the various applications running over these networks have different constraints in their nature and requirements. In this paper, we present a heuristic neighbor selection mechanism in WSNs that uses the geographic routing mechanism combined with the QoS requirements to provide multiobjective QoS routing (MQoSR) for different application requirements. The problem of providing QoS routing is formulated as link, and path-based metrics. The link-based metrics are partitioned in terms of reliability, delay, distance to sink, and energy, and the path-based metrics are presented in terms of end-to-end delay, reliability of data transmission, and network lifetime. The simulation results demonstrate that MQoSR protocol is able to achieve the delay requirements, and due to optimum path selection process, the achieved data delivery ratio is always above the required one. MQoSR protocol outperforms the existing model in the literature remarkably in terms of reliable data transmission, time data delivery, and routing overhead and underlines the importance of energy-efficient solution to enhance network lifetime.

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.

Guaranteeing Quality of Service in Mobile Ad Hoc Networks

2009 ◽  
pp. 587-594
Author(s):  
Noureddine Kettaf ◽  
Hafid Abouaissa ◽  
Thang VuDuong
Keyword(s):  
Quality Of Service ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Qos Routing ◽  
Service Differentiation ◽  
Mobile Ad Hoc ◽  
Demand Routing ◽  
Hoc Networks

This article describes how resources are managed in MANETs (mobile ad hoc networks) so that quality of service (QoS) can be achieved to enable service differentiation. The article introduces in detail a QoS routing protocol called admission control enabled on-demand routing (ACOR) protocol. The article also presents the Global framework for functional architecture analysis in telecommunications (GAT) that is used to model ACOR and show its capability to provide different class of service for different mobile customers. For QoS routing protocols, this fashion of modeling is novel and investigates in details the relation between the customer and its provider and the complexity of the domain of MANETs.

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.

Quality of Service (QoS) Routing in Mobile Ad Hoc Networks

2010 ◽  
pp. 464-496
Author(s):  
R. Asokan ◽  
A. M. Natarajan
Keyword(s):  
Quality Of Service ◽  
Ad Hoc ◽  
Qos Routing ◽  
Qos Provisioning ◽  
Mobile Nodes ◽  
Delay Jitter ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
End To End

A Mobile Ad hoc NETwork (MANET) consists of a collection of mobile nodes. They communicate in a multi-hop way without a formal infrastructure. Owing to the uniqueness such as easy deployment and self-organizing ability, MANET has shown great potential in several civil and military applications. As MANETs are gaining popularity day-by-day, new developments in the area of real time and multimedia applications are increasing as well. Such applications require Quality of Service (QoS) evolving with respect to bandwidth, end-to-end delay, jitter, energy etc. Consequently, it becomes necessary for MANETs to have an efficient routing and a QoS mechanism to support new applications. QoS provisioning for MANET can be achieved over different layers, starting from the physical layer up to the application layer. This chapter mainly concentrates on the problem of QoS provisioning in the perception of network layer. QoS routing aims at finding a feasible path, which satisfies QoS considering bandwidth, end-to-end delay, jitter, energy etc. This chapter provides a detailed survey of major contributions in QoS routing in MANETs. A few proposals on the QoS routing using optimization techniques and inter-layer approaches have also been addressed. Finally, it concludes with a discussion on the future directions and challenges in QoS routing support in MANETs.

Sign in / Sign up

Export Citation Format

Share Document