QoS Routing Research Articles

Fuzzy searching and routing in unstructured mobile peer-to-peer networks

Peer-to-Peer (P2P) networks offer a scalable solution for efficient query searching and sharing across the unstructured networks. With an increased overhead due to large amount of object searching and routing in unstructured P2P networks, it is a challenge to continue QoS routing among different mobile peers. Most existing mobile P2P protocols focus on inflexible techniques to route queries and discover objects of interest. Such common techniques incur a relatively high search time due to remarkable network traffic and duplication of query messages. The correlation between routing and mobility is crucial to efficiently search and route the query object in an overlay to avoid unnecessary consumption of network resources. Our previous fuzzy search controller model (Shah and Kim in 12th IEEE international conference on dependable, autonomic and secure computing (DASC), 2014) reduced the search time query processing in P2P networks, but it caused low hit rate and a high overhead due to peer mobility. Thus, this article proposes a scalable fuzzy controller based on probabilistic walk for unstructured mobile P2P networks to reduce the search time with controlled mobility. The search time is reduced by jumping a query walker to a 2-hop away ultrapeer, selected through a fuzzy scheme. Furthermore, each mobile ultrapeer shares its pong cache with its directly connected ultrapeer in order to increase the hit rate and reduce the network overhead. Simulations show that the fuzzy search controller gives better performance than the competing protocols in terms time 10% reduction in response time and 15% increase in hit rate in different mobility scenarios.

A Pheromone-Aided Multipath QoS Routing Protocol and its Applications in MANETs

In this paper, we present an ant-based multipath QoS routing protocol that utilizes a single link metric combiningmultiple weighted criteria. The metric is applied to the proposed energy efficient multipath algorithm that considers both energy and latency. Energy efficiency is an important issue in mobile ad hoc networks (MANETs) since node energy supplies are stored in batteries. In order to increase the network lifetime it is important to maximize the minimum node energy along a path. As the network topology changes, failures may occur on active routes,resulting in the need for new route discoveries if only singleroutes per flow are maintained. Frequent new route discovery would, however, increase routing overhead and increase mean and peak packet latency. Using multiple routes simultaneously per flow can be a solution to these problems. Also, a special case of the multipath QoS routing protocol that considers throughput is applied to a security context. A compromised node can obstruct network communication by simply dropping packets that are supposed to be forwarded. In our approach, messages aredistributed over multiple paths between source and destination using ant-based QoS routing. In proportion to the throughput of each path, a pheromone-aided routing table is updated and, subsequently, paths that contain malicious nodes are naturally avoided.

Algebra and algorithms for multipath QoS routing in link state networks

The diversity of quality-of-service (QoS) requirements of Internet applications motivates various QoS routing algorithms that take different QoSmetrics into consideration. Routing algebra has been proposed as a framework to study the fundamental properties of QoS routing algorithms, such as their optimality and loopfreeness. However, for multipath QoS routing, little has been done in these aspects. Existing multipath QoS routing algorithms often take a rather conservative approach to guarantee loop-freeness, at the cost of efficiency. On the other hand, simply adapting existing efficient multipath routing algorithms to support various QoS metrics cannot guarantee correctness. In face of that, we propose a routing metric algebra for multipath QoS routing in link state networks, where a key property of the routing metrics called isotonicity, which plays an important role. To let routers efficiently and correctly find multiple next-hops for each destination, we also develop two distributed multipath QoS routing algorithms. The algorithms are run locally and independently, without exchanging messages other than the basic link states. They are specifically tailored for algebras with strict or non-strict isotonicity, and their correctness is formally proved.

Optimized Multi-Constrained Quality-of-Service Multipath Routing Approach for Multimedia Sensor Networks

Modern multimedia sensor networks impose strict constraints on both the delay and energy consumption when time-critical data must be reported to the sink within a limited bandwidth without any loss. Failure to transmit an event to the sink occurs for many reasons, including inherence limitations of sensors, power consumption, and reliability. We propose a mathematical model for a novel quality-of-service (QoS) routing-determination method. The proposed scheme enables determining the optimal path to provide appropriate shared radio satisfying the QoS for a wide range of real-time intensive media. The mathematical model is based on the Lagrangian relaxation method, to control adaptive switching of hop-by-hop QoS routing protocols. The embedded criteria for each objective function are used to decide which path from source to sink will be selected. Simulation results show that, compared with existing routing protocols, the approach proposed in this paper significantly improves the packet received ratio, energy consumption, and average end-to-end delay of the sensor node.

A New QoS Routing Northbound Interface for SDN

In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new Software Defined Networking (SDN) Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint-programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high-level abstraction layer, consisting of 10 basic constraint-programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.

A New QoS Routing Northbound Interface for SDN

In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new Software Defined Networking (SDN) Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint-programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high-level abstraction layer, consisting of 10 basic constraint-programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.

Interference‐aware QoS routing for neighbourhood area network in smart grid

Communication networks in smart grid collect and transfer various information between smart meters and control centre to support different quality of service (QoS) requirements of smart grid applications. However, there are many factors which could affect high reliability and QoS communication such as electromagnetic interference, equipment noise and multi-path effects. To address these challenges, a new routing metric is proposed in this study. The proposed metric takes into account the impacts caused by inter- and intra-flow interference, yielding reliable and high capacity links for neighbourhood area network communications in smart grid. In addition, it differentiates traffic flows into four different classes and makes packets compete for accessing a channel according to their priorities. Based on the metric, an interference aware QoS routing protocol, named interference-aware expected transmission time routing (IAEETR), is further proposed to provide reliable and real-time data transmission. Extensive simulation results demonstrate that high-priority traffic in the network is with small delay, and low-priority traffic can also have chance to compete for a wireless channel to transmit information. Furthermore, IAEETR protocol can improve end-to-end delay and packet delivery ratio with multiple simultaneous connections, even with a higher flow rate of mesh nodes.

Multi Criterion Multicast Routing Algorithm Comparison for Large Networks

Abstract QoS enabled multicast routing is known to be of non-polynominal complexity, which leads to the necessity of using heuristic algorithms to find sub-optimal solutions to the problems of this class. The evaluation of such algorithms requires the use of the simulation techniques as the heuristics’ results are of stochastic nature. Because of the problem complexity the simulation times increase significantly in the function of the network size, therefore the results presented in the literature are often limited to only small models. In this article the results of the evaluation of different multicast QoS routing algorithms (further referred to as the Multi-Constrained Minimum Steiner Tree Problem - MCMST) have been presented for a wide range of network sizes reaching thousands of nodes.

Enhance the Quality of Service in Mobile Ad Hoc Networks by Using Fuzzy Based NTT–DYMO

The dynamic nature of Mobile Ad hoc Networks (MANETs) demands a new-fangled set of communication strategies to enhance the performance of Quality of Service (QoS). It is very difficult to find viable QoS routes in MANETs due to its environment. AODV version 2 is called Dynamic MANET On-demand (DYMO) Routing protocol. Drawback of AODV is, it does not support larger networks. DYMO supports both medium and larger networks. To enhance the performance of DYMO, this paper proposes FBNTT DYMO by applying dynamic Node Traversal Time (NTT) in place of defacto NTT using fuzzy logic and Matlab. Fuzzy concept is used by taking network size and mobility is inputs and NTT as output. NTT plays a vital role in improving QoS in MANETs. For the Existing DYMO the default NTT value is 90 ms in QualNet simulator, however in a lively and dynamic environment we should not depend on the static values during protocol configuration. This paper implements FBNTT DYMO using QualNet simulator. The QoS metrics used are: throughput, delay, jitter and First packet received. The experimental result reveals that FBNTT DYMO radically improves the QoS as compared with defacto NTT–DYMO.

A Survey on Routing Protocols and QoS in Mobile Ad Hoc Networks (MANETs)

Objective: MANET is a collection of wireless mobile devices, mobility and scalable network. These key details are behind the fame of MANETs. A good survey is done on QoS and routing protocols. This study presents merits and demerits of some of the QoS routing protocols. Also, a thorough investigation has been carried out on the current problems and feature trials that are in the field of MANETs. Findings: Every routing protocol must provide Quality of Service (QoS): With intent to improve bandwidth, delay, jitter, and energy consumption. The purpose of any ad-hoc network routing protocol is to meet these challenges. Therefore, it becomes an essential parameter for MANETs to develop a proficient routing and QoS procedures. Some QoS routing-protocols are proposed newly by various characteristics. A similar survey is done on QoS and routing protocols. It has been observed that Maximizing accuracy, Minimizing overhead, Maintaining route, Reserving resources, reducing power utilization, reliability are unsolved issues. Applications: The designing of these routing protocols is an interesting task because of mobility, the dynamic behavior of the Mobile Ad-hoc Networks. This study is helpful for designing new routing protocols with improved QoS in MANETs.

A new efficient cross-layer relay node selection model for Wireless Community Mesh Networks

Current networking technologies are not perfectly equipped to support Quality of Service (QoS), which is vital for real-time multimedia applications in Wireless Community Mesh Networks (WCNs). Therefore, there is a need to devise innovative routing algorithms to support QoS on top of existing standards. Thus, this paper presents a cross layer relay node selection model for routing protocols in order to offer optimal routes to real-time applications. To the best of our knowledge, our two proposed routing metrics, Packet Priority-Oriented routing metric (PPO) and Packet Priority-oriented QoS routing metric (PP-QoS), are the first to provide differentiated priorities and service levels to applications with different needs. PPO considers the application priority. Moreover, PP-QoS also considers the channel busy level to improve the performance of path selection. The simulation confirms the superiority of the proposed model against a number of existing counterparts.

Recent advances in QoS provisioning in wireless ad hoc networks

With rapid increase in multimedia and other real time applications, incorporating quality of service (QoS) requirements like end to end delay, bandwidth, jitter and energy in MANET is necessary. MANET has some unique features such as self-organising and easy deployment. It has great potential in many applications such as military and civil. Existing QoS aware routing protocols designed for wired networks cannot be directly applied to wireless ad hoc networks due to its dynamic topological scenario and error prone nature of these wireless links. Best-effort QoS routing protocols are needed to ensure optimum network operation in an unpredictable wireless environment. Besides, QoS routing also ensures that a network performance should not be degraded in the event of disruption of links, failure of mobile devices and short residual connectivity time. In this paper, comprehensive description of QoS routing along with its taxonomy is presented and different QoS routing proposals are analysed in terms of its performance and limitations.

Fast Converging Evolutionary Strategy for Multi-Constraint QoS Routing in Computer Networks Using New Decoding Mechanism

In recent years, real-time multimedia applications' demands such as Voice-on-IP (VoIP) and video conference are extremely increased which require QoS routing. This type of routing has been considered as an NP-Complete problem since it requires satisfying multiple constraints. Many solutions have been proposed to solve it, but most of them are complex and time consuming. In this paper, a novel multi-constraints QoS routing algorithm is proposed based on Evolutionary Strategies (ES). The algorithm preserves simplicity and offers a feasible solution in a few numbers of generations. This is due to a novel gene decoding mechanism that is used in the algorithm; and consequently more simple evolutionary operators can be applied. The simulation results show that our method outperforms previous algorithms in terms of speed and performance, so that it is 2.6 and 11.3 times faster, and its success ratio is also better.

QoS Routing for Multimedia Communication over Wireless Mobile Ad Hoc Networks

A lot of intensive research has been carried out in the direction of providing multimedia communication over wireless mobile ad hoc network (MANET). In MANET, various QoS problems exist such as inefficient routing, handling node mobility, power conservation, limited processing capabilities of network devices, high error rates. Wireless routing introduces new challenges as applying basic routing algorithms directly on MANET could lead to large power consumption, interference, and load-balancing problems. Many routing algorithms have been proposed as extensions to the basic routing algorithms to enhance their performance in MANETs. This paper summarizes existing solutions on QoS routing and resource reservation mechanisms in order to provide multimedia communication over MANET. It also considers the limitations of existing QoS models with regard to satisfying QoS in serving multimedia over MANET. The newest QoS architectures give much better results in providing QoS support. However, more refinements must be proposed in order to enhance further their performance in MANETs.

A Critical Review of Quality of Service Models in Mobile Ad hoc Networks

Quality of service (QoS) provisioning in mobile ad hoc networks (MANETs) consists of providing a complex functionality in a harsh environment where resources are scarce. Thus, it is very challenging to build an efficient solution to address this issue. The proposed solutions in the literature are broadly classified into four categories, namely: QoS routing protocols, QoS signalling, QoS-aware MAC protocols and QoS models, which are the main concern of our study. The contribution of this paper is threefold: Firstly, we propose a set of guidelines to deal with the challenges facing QoS models design in ad hoc networks. Secondly, we propose a new taxonomy for QoS models in ad hoc networks. Finally, we provide an in-depth survey and discussion of the most relevant proposed frameworks.

A QoS Guaranteed Technique for Cloud Applications Based on Software Defined Networking

Due to the centralized control, network-wide monitoring and flow-level scheduling of software-defined-networking (SDN), it can be utilized to achieve quality of service (QoS) for cloud applications and services, such as voice over IP, video conference, and online games. However, most existing approaches stay at the QoS framework design and test level, while few works focus on studying the basic QoS techniques supported by SDN. In this paper, we enable SDN with QoS guaranteed abilities, which could provide end-to-end QoS routing for each cloud user service. First of all, we implement an application identification technique on SDN controller to determine required QoS levels for each application type. Then, we implement a queue scheduling technique on SDN switch. It queues the application flows into different queues and schedules the flows out of the queues with different priorities. At last, we evaluate the effectiveness of the proposed SDN-based QoS technique through both theoretical and experimental analysis. Theoretical analysis shows that our methods can provide differentiated services for the application flows mapped to different QoS levels. Experiment results show that when the output interface has sufficiently available bandwidth, the delay can be reduced by 28% on average. In addition, for the application flow with the highest priority, our methods can reduce 99.99% delay and increase 90.17% throughput on average when the output interface utilization approaches to the maximum bandwidth limitation.

QOS routing protocol to detect maximum available bandwidth in WMCs

QOS routing protocol to detect maximum available bandwidth in WMCs

QOS routing protocol to detect maximum available bandwidth in WMCs

Wi-Fi mesh community has turned out to be an important area community to offer internet to challenge the thrown domains and wireless link in metropolitan environments. In this paper, the hassle of figuring out the most available bandwidth direction is targeted, which is an essential problem in helping pleasant-of-carrier in WMCs. Due to the concept of interference, bandwidth, which is a familiar challenging metric in restive networks, a new direction is validated in which the weight captures the available route bandwidth statistics. It is also proved that the hop using the hop routing procedure based on the new path weight completely satisfies the consistency and loop-freeness necessities. The property of consistency ensures that each node follows a proper packet forwarding choice, in order that a statistics packet traverses over the supposed path. The experimental results additionally show that our proposed work on direction weight outperforms all the other existing direction metrics in figuring out excessive-throughput paths.

Research on Distributed QoS Routing Algorithm Fallback++ Based on Transaction and Multiobjective Programming

Transaction classification and QoS parameter Constraints are first researched. Then distributed QoS routing algorithm Fallback++ based on transaction and multiobjective programming is designed. Finally the time complexity and space complexity of the algorithm are analyzed. Simulation results show that Fallback++ is more efficient than Fallback and Fallback+.

Analysis of clustered QoS routing protocol for distributed wireless sensor network

A wireless network is a collection of wireless nodes within decentralized and distributed network architecture. This distributed architecture gives rise to issues concerning resilience, node mobility, link failure, routing overhead and drop rate. To avoid these issues and satisfy QoS requirements, a new routing protocol known as clustered QoS routing protocol (CQRP) is proposed. This routing protocol creates a cluster with a grouping of nodes and assigns a cluster head. This cluster head is used to assign an available link for the wireless node to avoid issues with resilience and link failure. Cluster members communicate with data packets through the cluster head. Through the use of this cluster head, quality of service requirements for a distributed network can be met. Experimental results show that the performance of the proposed clustered QoS routing protocol CQRP increases throughput, delivery rate and network efficiency, and decreases the drop rate, delay and routing overhead.