Quality Of Service Routing Scheme Research Articles

QoS Improvement in MANET using Self Organized Balanced Optimization

The provision of quality of service (QoS) for routing in MANET (mobile ad hoc networks) is a major challenge due to the topology, bandwidth sharing and resource scarcity in wireless nodes. Another key aspect of distributing QoS is security, as malicious nodes pose all variety of threats to MANETs. Although a variety of MANET defense measures have been suggested, most solutions are only successful for a particular form of attack or provide security at the risk of sacrificing QoS. A trust-based, secure QoS routing scheme is proposed in this paper by incorporating trust between social and QoS. The key solution of the proposed scheme focuses on minimizing nodes that show different abuses of packet forwarding and finding the way that through the trust mechanism, safe communication is ensured. The performances are compared in in terms of QoS parameters, as channel quality, residual energy, link quality, etc.

QROUTE: An Efficient Quality of Service (QoS) Routing Scheme for Software-Defined Overlay Networks

Many computer network applications impose constraints for multiple quality of service (QoS) metrics, e.g., delay, packet loss, bandwidth, and jitter. These QoS constraints cannot be guaranteed by the Internet due to its best-effort service model. Overlay networks have been an effective technique at the application layer to support multiple QoS constraints of networking applications. In software-defined overlay networks, software-defined networking (SDN) paradigm is introduced in the overlay networks to enable centralized and efficient routing of traffic in the overlay networks, thus, enabling better QoS. One of the main challenges in software-defined overlay networks is the fast-changing overlay link QoS characteristics. However, the existing routing algorithms for satisfying multiple QoS constraints in software-defined overlay networks involve high route computation time and thus these routing algorithms cannot adapt to the fast-changing overlay link QoS characteristics. Moreover, as we scale the size of overlay networks, the size of forwarding tables increases exponentially. This is because the existing routing schemes for ensuring multiple QoS constraints use both the source and the destination address for data-plane forwarding. This leads to pushing a huge amount of forwarding table entries by the controller through the network and thus limiting the size of the overlay network. We propose an efficient routing scheme, QROUTE, for satisfying multiple QoS constraints in software-defined overlay networks. QROUTE consists of a control plane routing algorithm which has significantly low route computation time because of employing a novel directed-acyclic-graph (DAG) based approach. QROUTE also reduces the forwarding entries in the data plane by using a QoS-metric-based forwarding scheme. We extensively evaluate QROUTE using traces from a global overlay service provider. We also examine QROUTE on a testbed of P4-BMv2 switches controlled by the ONOS controller using P4Runtime protocol. We find that QROUTE outperforms other state-of-the-art QoS routing schemes in route computation time, size of the forwarding tables and meeting the QoS requirements of various applications.

Cluster-based Distributed Compressed Sensing for QoS Routing in Cognitive Video Sensor Networks

Compressed sensing based in-network compression methods to minimize the data redundancy are critical to cognitive video sensor networks (CVSNs). However, most existing methods require a large number of sensors for each measurement, resulting in significant performance degradation in energy efficiency and quality-of-service (QoS) satisfaction. CDCS, a cluster-based distributed compressed sensing approach for QoS routing is proposed to efficiently deliver visual information in CVSNs. To begin with, the correlation among adjacent video sensors is utilized to determine the suitable set of video sensors that participate in a cluster. On this basis, a sequential compressed sensing approach is applied to determine whether enough measurement have been obtained to limit the reconstruction error between decoded signals and original signals under a specified reconstruction threshold, thereby maximizing the removal of redundant traffic without sacrificing video quality. Lastly, the compressed data is transmitted by a distributed QoS routing scheme, with an objective to minimize energy consumption subject to delay and reliability constraints. Simulation results demonstrate that compared with exiting QoS routing schemes, CDCS can achieve energy-efficient data delivery and reconstruction accuracy of visual information.

Intelligent Quality of Service Routing in Software-Defined Satellite Networking

Software-Defined Satellite Networking (SDSN) has emerged as a new paradigm that offers the programmability required to dynamically manage a satellite network. However, the characteristics of SDSN bring several important issues to be solved in the routing scheme. First, interface protocols of the controller incur nonnegligible overhead, which affects the general traffic. Second, more than one controller is required to ensure the reliability of SDSN, which means that they should cooperate with each other to realize the routing function. Third, how to make full use of the advantage of SDSN's centralized management for routing algorithm is worth studying. In this paper, we first propose an SDSN architecture to realize flexible centralized management. Based on this architecture, Intelligent Quality of Service (QoS) Routing scheme is proposed and evaluated. Intelligent QoS Routing (IQR) scheme is composed of overhead balancing strategy, controller cooperation strategy, and IQR algorithm. Overhead balancing strategy effectively reduces the impact of overhead on general traffic, which improves the performance of IQR algorithm. Controller cooperation strategy adopts the ensemble Support Vector Regression (SVR) from artificial intelligence tools to enhance the consistency of different controllers' network views under low frequency situation, which will provide a more accurate reference for IQR algorithm and other management strategies. IQR algorithm takes full advantage of SDSN's centralized control and rich data to offer fine-grained QoS guarantee intelligently. Simulation results show that IQR scheme achieves better overhead balancing performance, more effective controller cooperation, and better QoS guarantee compared with the existing methods.

A cache-aware social-based QoS routing scheme in Information Centric Networks

Due to the rapid expansion of Internet and the huge proliferation of users, Internet has evolved from a host-centric model to a content-oriented model. This implies the in-adaptation of current TCP/IP architecture providing the best performance to end-users and the urgency of researching future Internet architecture. In future Internet, the named data rather than traditional IP address may become the thin waist of the hourglass model of networking. Therefore, in this paper, we propose a cache-aware social-based Quality of Service (QoS) routing scheme for Named Data Networking (NDN) in Information Centric Network (ICN). Three kinds of social relationships, namely neighbors (NB), interest friends (IF) and response friends (RF) are devised to describe the relationships among nodes. Thus, when there is a failure in doing Pending Interest Table (PIT) scheme, a forwarding scheme based on social relationships is done before doing Forwarding Information Base (FIB) scheme. Moreover, a caching policy and its corresponding replacement policy based on content popularity, cache space and neighbor caching information are proposed. Results from simulation experiments demonstrate that our proposed scheme has better performance, including a higher routing success ratio, than NDN routing mechanism.

An Efficient Trust-Based Scheme for Secure and Quality of Service Routing in MANETs

Due to the dynamism of topology, sharing of bandwidth and constraint of resources in wireless nodes, the provision of quality of service (QoS) for routing in mobile ad hoc networks (MANETs) presents a great challenge. Security is another crucial aspect of providing QoS since the existence of malicious nodes present all kinds of threats to MANETs. Although a number of mechanisms have been proposed for protecting MANETs, most of the solutions are only effective for a particular kind of attacks or provide security at the cost of sacrificing QoS. In this paper, we propose a trust-based secure QoS routing scheme by combining social and QoS trust. The primary approach of the proposed scheme relies on mitigating nodes that exhibit various packet forwarding misbehavior and on discovering the path that ensures reliable communication through the trust mechanism. The scheme would select the best forwarding node based on packet forwarding behavior as well as capability in terms of QoS parameters, such as residual energy, channel quality, link quality, etc. We will present an adversary model for packet dropping attack against which we evaluate the proposed scheme. Simulation experiment using Network Simulator-2 (NS2) and under various network conditions show that mixing social and QoS trust parameters can greatly improve security and quality of service routing in terms of overhead, packet delivery ratio and energy consumption.

Virtual Strategy QoS routing in satellite networks

Satellite network users want to unify different satellites to enhance the quality-of-service (QoS) stability of the satellite networks and select feasible paths through different networks to feed different applications. Unfortunately, the state of affairs is that different applications need to use several different application programming interfaces and to design different protocols on how and when to use a specific network. This is troublesome and error-prone as the application programming interfaces vary a lot. In this paper, we design a Virtual Strategy in satellite network based on which a QoS routing service scheme is then proposed. We analyze why applications should use and benefit from Virtual Strategy. This Virtual Strategy is a middleware solution that enables seamless usage of services from different satellite network parts. And then, the supporting QoS routing solution enables the committed QoS services over Virtual Strategy. Finally, we provide a comparison between the previous satellite networks and our work. The simulation results show that our Virtual Strategy QoS routing scheme demonstrates dominated performances under complex architecture.

Performance Analysis of Statistical QoS Routing Schemes for Multihop Wireless Ad Hoc Networks

The quality of service (QoS) standard in Mobile Ad-hoc Networks (MANET's) is much more challenging compared to the wired networks. In the last decade there was a lot of attention in the area of integration of QoS standard in MANET protocols. QoS-based routing protocols are integral part of any QoS solution, because their function is to check whether the nodes in the network are able to provide services to network applications. These protocols play a key role in controlling the information received and delivered from data transfer sessions. The purpose of this paper is to study and review the QoS routing schemes designed for IEEE 802.11 standard in Multihop Ad-hoc networks. Moreover, the paper simulates a routing scheme and shows results for an effective end-to-end communication.

Context aware adaptive fuzzy based QoS routing scheme for streaming services over MANETs

The need for an adaptive with support for context service aware Quality of Service routing scheme is always a major research challenge. The complexities of Mobile Ad hoc Networks are well surveyed, but traditional routing protocols do not focus on the context aware nature of services, which is highly required for dynamic change in service requirements. Context Aware Adaptive Fuzzy (COAAF) is a `context aware' protocol, which is adaptive for variable services and network traffic intensity. The behaviour of streaming services is found to be highly variable; hence, fuzzy approach is adopted. COAAF is simulated over NS-2 and its performance analyzed in comparison with AODV, DYMO and GPSR routing schemes.

Elitist Distance Based Pareto Genetic Unicast Routing Scheme with Always Best Connected Support

In this paper, an ABC (Always Best Connected) supported QoS (Quality of Service) unicast routing scheme is proposed. In the proposed scheme, in order to overcome difficulties on accurately measuring network link parameter values and exactly expressing user QoS requirements, the knowledge of the fuzzy mathematics and probability theory is introduced, and the range is used to describe these parameters; both of the users utility and the network providers utility are computed, and gaming analysis is taken to deal with profits of both the user and the network provider; EDPGA (Elitist Distance-based Pareto Genetic Algorithm) is used to find the specific QoS unicast path with Pareto optimum under Nash Equilibrium among all parties utilities achieved or approached. While comparing with unicast routing scheme based on Dijkstra and the game theory based fuzzy unicast QoS routing scheme, simulation results show that this proposed scheme is both feasible and effective.

Agent-based QoS Routing for Polar-Orbit LEO Satellite IP Networks

Current QoS (quality of service) routing schemes for Polar-orbit low earth orbit (LEO) satellites IP networks has high computation complexity to achieve end-to-end delay guarantee. As a remedy, agentbased QoS routing (AQR) is proposed. AQR is a source-based routing protocol. Once connection requests arrive, QoS mobile agents are dispatched from ingress satellite to explore candidate paths, and which migrate using probability routing table. Moreover, probability routing table is updated considering both the varying population density and the topology characteristic. Furthermore, the survival time of candidate path is utilized to select data-forwarding path. Simulation results show AQR achieves guaranteed end-to-end delay bound with lower call blocking probability, delay jitter and signaling overhead compared with the previously proposed scheme.

Multi-postpath-based lookahead multiconstraint QoS routing

Multiconstraint QoS (quality of service) routing is an essential mechanism for QoS-guaranteed services. Unfortunately, the multiconstraint QoS routing problem is NP-complete. In this paper, we propose a heuristic multiconstraint QoS routing scheme, MPLMR (multi-postpath-based lookahead multiconstraint routing). MPLMR is a routing scheme using an extended shortest-path algorithm. As in previous schemes such as TAMCRA and H_MCOP, MPLMR stores a limited number of subpaths between the source node and each intermediate node, and extends these subpaths toward the destination node. However, MPLMR uses an improved “lookahead” method to estimate the path length of the full path to which each subpath is extended. MPLMR then selects and stores the subpaths that have higher likelihood than other subpaths to be extended to feasible paths. We show via simulation that MPLMR has a smaller probability of missing a feasible path than competing schemes in the literature.

A novel and effective multi-constrained QoS routing scheme in WMNs

Multi-constrained quality of service (QoS) routing aims at finding an optimal path that satisfies a set of QoS parameters, as an NP complete problem, which is also a big challenge for wireless mesh networks (WMNs). Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions, most of which suffered either from excessive computational complexities or from low performance, were proposed only for wired networks and cannot be used directly in wireless mesh networks. In this paper, we propose a novel routing scheme based on mean field annealing (MFA-RS) to solve this problem. MFA-RS first uses a function of two QoS parameters, wireless link’s delay and transmission success rate as the cost function, and then seeks to find a feasible path by MFA. Because MFA-RS uses a set of deterministic equations to replace the stochastic process in simulated annealing (SA) and uses saddle point approximation in the calculation of the stationary probability distribution at equilibrium, the convergence time is much less than the routing scheme based on SA (SA-RS). Simulation results demonstrate that MFA-RS is an effective algorithm and is very fit for WMNs.

Statistical QoS routing for IEEE 802.11 multihop ad hoc networks

In this paper, we propose a model-based quality-of-service (QoS) routing scheme for IEEE 802.11 ad hoc networks. Unlike most of QoS routing schemes in the literature, the proposed scheme provides stochastic end-to-end delay guarantees, instead of average delay guarantees, to delay-sensitive bursty traffic sources. Via a cross-layer design approach, the scheme selects the routes based on a geographical on-demand ad hoc routing protocol and checks the availability of network resources by using traffic source and link-layer channel modeling, taking into consideration the IEEE 802.11 characteristics and node interactions. Our scheme extends the well developed effective bandwidth theory and its dual effective capacity concept to multihop IEEE 802.11 ad hoc networks. Extensive computer simulations demonstrate that the proposed scheme is effective in satisfying the end-to-end delay bound to a probabilistic limit.

A New QoS Routing Scheme Based on Bandwidth Consumption for MANETs

Quality of Service (QoS) routing in Mobile Ad hoc NETworks (MANETs) is hard to achieve because the network topology tends to change constantly in a dynamic network. In this paper, we propose an effective QoS routing scheme to satisfy the required service demand and adapt to the dynamic changes in network resources. This novel approach of Application-Level QoS Routing Scheme (ALRS) comprises three significant features: (1) Estimation of consumed bandwidth on each node by using 2-hop neighbors' traffic information, (2) Route construction combined with admission control on each application session with (1), and (3) Route maintenance based on (1) and (2). By using our proposed ALRS scheme the availability of bandwidth is greatly improved for high-load communications, such as multimedia applications. By computer simulation we confirmed that ALRS increases the delivery ratio by up to 50% and decreases delay by less than one-fourth of the existing traditional method.

On QoS routing and path establishment in the presence of imprecise state information

In large networks, maintaining precise global network state information is impossible. The imprecise network state information has significant impacts on Quality-of-Service (QoS) routing and path establishment. In this paper, we develop analytical models for investigating the QoS routing schemes that are designed to tolerate imprecise network state information, and study the performance of various QoS routing schemes, including randomized routing, multi-path routing, and probability based routing, using both the models and simulations. We further propose a new mechanism, called local rerouting, that improves the effectiveness of QoS path establishment in the presence of imprecise global net- work state information. Local rerouting is orthogonal to existing schemes for dealing with imprecise state information and can be used in conjunction with them to alleviate the impacts of the im- precise information. The results of our performance study indicate that local rerouting is robust and effective.

An Optimization-Based Approach for QoS Routing in High-Bandwidth Networks

In this paper, we propose an optimization-based approach for Quality of Service (QoS) routing in high-bandwidth networks. We view a network that employs QoS routing as an entity that distributively optimizes some global utility function. By solving the optimization problem, the network is driven to an efficient operating point. In earlier work, it has been shown that when the capacity of the network is large, this optimization takes on a simple form, and once the solution to this optimization problem is found, simple proportional QoS routing schemes will suffice. However, this optimization problem requires global information. We develop a distributed and adaptive algorithm that can efficiently solve the optimization online. Compared with existing QoS routing schemes, the proposed optimization-based approach has the following advantages: 1) the computation and communication overhead can be greatly reduced without sacrificing performance; 2) the operating characteristics of the network can be analytically studied; and 3) the desired operating point can be tuned by choosing appropriate utility functions.

A position-based QoS routing scheme for UWB mobile ad hoc networks

Ultra-wideband (UWB) wireless communication is a promising spread-spectrum technology that supports very high data rates and provides precise position information of mobile users. In this paper, we present a position-based quality-of-service (QoS) routing scheme for UWB mobile ad hoc networks. The scheme applies call admission control and temporary bandwidth reservation for discovered routes, taking into consideration the medium access control interactions. Via cross-layer design, it exploits UWB advantages at the network layer by using the position information in routing and bandwidth reservation and by supporting the multirate capability. Simulation results demonstrate that the proposed routing scheme is effective in end-to-end QoS support.

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

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

Precomputation schemes for QoS routing

Precomputation-based methods have recently been proposed as an instrument to facilitate scalability, improve response time, and reduce computation load on network elements. The key idea is to effectively reduce the time needed to handle an event by performing a certain amount of computations in advance, i.e., prior to the event's arrival. Such computations are performed as background processes, thus enabling to promptly provide a solution upon a request, through a simple, fast procedure.In this paper, we investigate precomputation methods in the context of Quality-of-Service (QoS) routing. Precomputation is highly desirable for QoS routing schemes due to the high computation complexity of selecting QoS paths on the one hand, and the need to promptly provide a satisfactory path upon a request on the other hand. We consider two major settings of QoS routing. The first is the case where the QoS constraint is of the bottleneck type, e.g., a bandwidth requirement, and network optimization is sought through hop minimization. The second is the more general setting of QoS constraints (e.g., delay) and general link costs.This paper mainly focuses on the first setting. First, we show that, by exploiting the typical hierarchical structure of large-scale networks, one can achieve a substantial improvement in terms of computational complexity. Next, we consider networks with topology aggregation. We indicate that precomputation is a necessary element for any QoS routing scheme and establish a precomputation scheme appropriate for such settings. Finally, we consider the case of additive QoS constraints (e.g., delay) and general link costs. As the routing problem becomes NP-hard, we focus on e-optimal approximations and derive a precomputation scheme that offers a major improvement over the standard approach.