Algorithm for multi-constrained path selection based on experimental analysis

Implementing the dynamic couple of searching paths and resource allocation becomes increasingly important in the research of Quality of Service (QoS) routing. In this paper, we formulate the problem of dynamic QoS routing with resource allocation based on Worst-case Fair Weighted Fair Queuing (WF2Q) packet scheduling style. We propose an algorithm using the proved results -- the optimal path resource allocation algorithm (OPRA2), which can allow intelligent choice of the maximized reliability and minimized delay path according to the types of applications and adapt QoS parameters and allocated resources related to WF2Q in process of routing. It can find an optimal path which satisfies different QoS requirements and compute the amount of bandwidth and buffer resources needed at each node. We provide the simulation results to illustrate the effect of buffers and bandwidths according to the values of control parameters.

Researchers dealing with game theoretic issues are well aware that the definition of a model capturing some physical behaviours such as the routing, the pricing, the flow and congestion control, the admission control just to mention some examples in the telecommunication field, is a difficult task, but it is only half of the overall effort. As a matter of fact, a key aspect is the analysis of the equilibrium (or equilibria) towards which the game will (hopefully) converge. The existence, the uniqueness, the efficiency and the structure of the equilibrium are some of the typical properties which are investigated. In this article, we propose a game theoretic model for quality of service (QoS) routing in networks implementing a Differentiated Service model for the QoS support. In particular, we focus on a parallel link network model and we consider a non-cooperative joint problem of QoS routing and dynamic capacity allocation. For this model, we demonstrate that the Nash equilibrium exists, so overcoming a typical problem in the existence proofs appeared in many papers in the area of routing game since 1990s, and we explicitly obtain a suitable set of relations characterising its structure. Moreover, we prove that Nash equilibrium uniqueness cannot be guaranteed in general.

Design and performance analysis of an inductive QoS routing algorithm

With the Development of mobile ad hoc network (MANET), Quality of Service (QoS) routing and power-aware routing become more and more important. In the past, QoS guarantee and power control issues were treated separately. In this paper, we propose a novel on-demand QoS routing protocol, PMQR (power-aware multi-path QoS routing) in TDMA-based MANETs. Our protocol combines QoS routing and power-aware routing, which can provide QoS guarantee and achieve energy conservation by taking into account both the transmission power and the remaining energy at the intermediate nodes between a source and a destination. PMQR also can establish multiple paths, even for a single call, when the route search cannot find a path that meets the QoS requirements. Simulation results show that PMQR has good network performance and balances the energy consumption of mobile hosts.

The quality-of-service (QoS) communication that supports mobile applications to guarantee bandwidth utilization is an important issue for Bluetooth wireless personal area networks (WPANs). In this paper, we address the problem of on-demand QoS routing with interpiconet scheduling in Bluetooth WPANs. A credit-based QoS (CQ) routing protocol is developed which considers different Bluetooth packet types because of different types of Bluetooth packets have different bandwidth utilization levels. This work improves the bandwidth utilization of Bluetooth scatternets by providing a new interpiconet scheduling scheme. Centralized and distributed algorithms are investigated in this work to improve the bandwidth utilization for the on-demand QoS routing protocol The performance analysis illustrates that our credit-based QoS routing protocol achieves enhanced performances, compared to existing QoS routing protocols.

We consider the problem of quality of service (QoS) routing in multi-hop wireless networks where data are transmitted from a source node to a destination node via multiple hops. The routing component of a QoS-routing algorithm essentially involves the link and path metric calculation which depends on many factors such as the physical and link layer designs of the underlying wireless network, transmission errors due to channel fading and interference, etc. The task of link metric calculation basically requires us to solve a tandem queueing problem which is the focus of this paper. We present a unified tandem queue framework which is applicable for many different physical layer designs. We present both exact and approximated decomposition approaches. Using the queueing framework, we can derive different performance measures, namely, end-to-end loss rate, end-to-end average delay, and end-to-end delay distribution. The proposed decomposition approach is validated and some interesting insights into the system performance are highlighted. We then present how to use the decomposition queueing approach to calculate the link metric and incorporate this into the route discovery process of the QoS routing algorithm. The extension of the queueing and QoS routing framework to wireless networks with class-based queueing for QoS differentiation is also presented.

Protocols responsible for quality of service (QoS) routing are characterized by limited scalability and considerable complexity and traffic overhead. QoS routing implies resource reservation to support the application requirements. The QoS routing and resource reservation require the implementation of a signaling mechanism. Performing QoS routing and resource reservation at different network layers will cause redundant signaling. In this paper we propose a simple extension to the reservation protocol RSVP signaling mechanism that supports the simultaneous implementation of QoS probing routing and resource reservation. The extended RSVP uses only the IP protocol and eliminates the need of additional signaling mechanism in the network layer. We formalize and verify the signaling mechanism using color Petri net. A network simulator is constructed using the same tool to measure the performance of the proposed extended RSVP.

The development of efficient quality of service (QoS) routing algorithms in a high-speed networking or the next generation IP networking environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently, a heuristic algorithm H/spl I.bar/MCOP, which is based on a nonlinear Lagrange relaxation (NLR) technique, has been proposed to resolve the contradiction between the time complexity and the quality of solution. Even though H/spl I.bar/MCOP has demonstrated outstanding capability for finding feasible solutions to the multi-path constrained (MCP) problem, it has not exploited the full capability that an NLR-based technique could offer. In this paper, we propose a new NLR-based heuristic, in which the search process is interpreted from a probability perspective. Simulation results indicate that, in comparison with H/spl I.bar/MCOP, the proposed heuristic can achieve a significant performance improvement when it is used as a basic step for solving more complicated QoS routing problems.

In Mobile Ad-Hoc Networks (MANET), the increasing demand for multimedia application is more challenging and the existing routing protocols are not adequate owing to the complex design requirements of Quality of Service (QoS) routing. This paper proposes a stateless position-based solution for QoS routing issues and offers an efficient end-to-end communication guarantee. The proposed Stateless QoS (SQoS) routing protocol is based on adaptive compass greedy routing to determine a qualified path which satisfies the QoS requirements and the void handling scheme overcomes the local maximum issue. In addition, the SQoS routing utilises the node overhearing capacity to obtain the link quality measurement to provide a guarantee for efficient end-to-end transmission through the identification of high-quality links for multimedia streams. The performance of the proposed SQoS routing protocol is compared with existing QoS-GPSR. Finally, the performance evaluation proves that the SQoS routing protocols outperform the existing protocols.

Quality of Service (QoS) routing is one of the key enabling techniques for multimedia wireless sensor networks (WSNs). However, the multi-constraints QoS routing problem is an NP-hard problem, and the computational complexity of an exhaustive search over all the paths is too high for large scale multimedia WSNs. In this paper, a novel parallel elite clonal quantum evolutionary algorithm is proposed to solve the multi-constraints QoS routing problem. The proposed algorithm minimizes the energy consumption, while guaranteeing QoS performance, including delay, bandwidth, delay jitter and packet loss rate, in multimedia WSNs. The algorithm is tested by extensive simulations and its performance is compared with the genetic algorithm and ant colony optimization. Simulation results demonstrate that the proposed algorithm achieves lower energy consumption at a faster convergence rate than the other two evolutionary algorithms.

Software-Defined Networking (SDN) is a new efficiently idea of programmable networks that separates the control plane from data plane of all network devices. Internet service provider is responsible for all the control decisions and communication among the forwarding elements from centralized controller. SDN provides the various optimized services. Quality of service (QoS) routing is a path computation method that is suitable for the different traffics generated by several applications, while utilization of network resources has increased. This agreement of service is defined by QoS requirements such as throughput, delay, jitter and packet loss etc. Multimedia applications often require assured from multi QoS constrained, causing the NP-complete problem which cannot be simply solved in polynomial time and high management complexity in the transition network. SDN is able to reduce complexity and it is used to efficiently implement traffic, hence SDN significantly values to development QoS routing. In this paper, we propose QoS routing algorithm called Quantized Level Balance (QLB) for SDN that considers one or many QoS parameters relating to the network application. To satisfy the requirements, QLB selects QoS parameters depending to the level of appropriate application service quality. We have replicated our algorithm on simulate topology with Scalable Video-streaming Evaluation Framework (SVEF). We measure the Peak Signal-to-Noise Ratio (PSNR) and Mean Opinion Score (MOS) of Scalable Video Coding (SVC) at the receiver. Our propose algorithm is improved than single-metric approach that may choose poor QoS parameter paths.

Quality of service (QoS) routing between domains is indispensable for deploying QoS in the Internet. State aggregation is a technique that makes QoS routing scalable to large networks. As the impreciseness in the advertised aggregate adversely affects the performance of the QoS routing process, it is important to investigate the accuracies of various aggregation schemes. In this paper, we study the efficacy of a new bandwidth aggregation scheme, and compare our scheme's performance with that of the existing schemes. Our analytical and experimental studies show that for active networks, the proposed aggregation scheme is more accurate, and gives a better routing performance than the current schemes.

Localised quality of service (QoS) routing has recently been proposed as a viable alternative approach to traditional QoS routing algorithms that use global state information. In this approach, problems associated with maintaining global state information are avoided by having the source nodes to infer the network QoS state based on flow blocking statistics collected locally, and perform flow routing using this localised view of the network QoS state. A credit based routing algorithm (CBR) which is a simple yet effective localised QoS routing algorithm is introduced. Its performance is compared against the localised proportional sticky routing (PSR) algorithm using different types of network topologies, QoS requirements and traffic patterns and under a wide range of traffic loads. Extensive simulations show that the algorithm outperforms the PSR scheme while maintaining the same level of adaptivity and stability. Its performance is also compared against the global widest-shortest path algorithm (WSP) and it is shown that CBR gives a comparable performance with better time complexity and very low communication overhead.

Exceptionally dynamic networks are Mobile Ad hoc Networks.Quality of Service (QoS) routing in such Networks are frequently limited by the network split due to either energy depletion or node mobility of the mobile nodes.In addition, to fulfill specific quality parameters, existence of multiple node-disjoint paths becomes essential.Such paths assist in the optimal traffic distribution and consistency in case of path breakages.Thus, to accommodate such problem, we present a node-disjoint multipath protocol.The metric system of measurement used to select the paths takes into account the stability of the nodes and the equivalent links.

In the context of modern high-speed Internet network, routing is often complicated by the notion of guaranteed quality of service (QoS), which can either be related to time, packet loss or bandwidth requirements: constraints related to various types of QoS make some routing inacceptable. Due to emerging real-time and multimedia applications, efficient routing of information packets in dynamically changing communication network requires that as the load levels, traffic patterns and topology of the network change, the routing policy also adapts. We focused in this paper on QoS based routing by developing a neuro-dynamic programming to construct dynamic state-dependent routing policies. In this paper, we propose an approach based on adaptive algorithm for packet routing using reinforcement learning called N best optimal path Q routing algorithm (NOQRA) which optimizes two criteria: cumulative cost path (or hop count if each link cost =1) and end-to-end delay. A load balancing policy depending on a dynamical traffic path probability distribution function is also defined and embodied in NOQRA to characterize the distribution of the traffic over the N Best Paths. Numerical results obtained with OPNET simulator for different levels of traffic's load show that NOQRA gives better results compared to standard optimal path routing and Q-routing algorithm based on Q-learning paradigm.