Providing End-to-End Quality of Service with Optimal Least Weight Routing in Next-Generation Multiservice High-Speed Networks

Routing algorithms play a critical role in meeting both the stringent quality of service (QoS) requirements of guaranteed services and the certain QoS requirement of assured services over next-generation multiservice high-speed networks. In this paper, we propose the use of optimal least weight routing (OLWR) algorithm for routing QoS flows in high-speed networks. The main principle of our algorithm is that the choice of the most appropriate route is based on a set of parameters (least weight parameters) that estimate and consider the impact that the acceptance and routing decision of a call request belonging to a specific class would have on the network and other classes of service. Effective bandwidth, bandwidth and trunk reservation techniques, along with load balancing and packing trade-off considerations, are also introduced in the proposed routing algorithm. The performance evaluation of our algorithm is achieved via modeling and simulation of multiclass service routing in various network topologies. The performance results demonstrated that OLWR outperforms both the multihop least-loaded routing algorithms and the multihop most-loaded routing algorithms in terms of both revenue and carried load.     

Delay characterization and performance evaluation of cluster-based WSN with different deployment distributions

Provisioning of quality of service (QoS) is the ultimate goal for any wireless sensor network (WSN). Several factors can influence this requirement such as the adopted cluster formation algorithm. Almost all WSNs are structured based on grouping the sensors nodes into clusters. Not all contemporary cluster formation and routing algorithms (e.g. LEACH) were designed to provide/sustain certain QoS requirement such as delay constraint. Another fundamental design issue is that, these algorithms were built and tested under the assumption of uniformly distributed sensor nodes. However, this assumption is not always true. In some industrial applications and due to the scope of the ongoing monitoring process, sensors are installed and condensed in certain areas, while they are widely separated in other areas. Also unlike the random deployment distributions, there are many applications that need deterministic deployment of sensors like grid distribution. In this work, we investigated and characterized the impact of sensor node deployment distributions on the performance of different flavors of LEACH routing algorithm. In particular, we studied via extensive simulation experiments how LEACH cluster formation approach affects the delay (inter and intra-cluster delay) and energy efficiency expressed in terms of packet/joule for different base station locations and data loads. In this study, we consider four deployment distributions: grid, normal, exponential and uniform. The results showed the significant impact of nodes distribution on the network energy efficiency, throughput and delay performance measures. These findings would help the architects of real time application wireless sensor networks such as secure border sensor networks to design such networks to meet its specifications effectively and fulfill their critical mission.     

EMSC: a joint multicast routing,scheduling, and call admission control in multi–radio multi–channel WMNs

This paper deals with the problem of joint multicast routing, scheduling, and call admission control in multiradio multi-channel wireless mesh networks. To heuristically solve this problem, we propose a cross-layer algorithm named “extended MIMCR with scheduling and call admission control phases (EMSC)”. Our model relies on the ondemand quality of service (QoS) multicast sessions, where each admitted session creates a unique tree with a required bandwidth. The proposed scheme extends the MIMCR algorithm to fairly schedule multiple non-interfering transmissions in the same time slot. It also exploits a call admission control mechanism to protect the QoS requirements of the multicast traffics. EMSC reduces the number of occupied time slots, with consideration of spatial reuse, both Intra-flow and Inter-flow interferences, and selecting the minimuminterference minimum-cost paths. This subsequently leads to better radio resource utilization and increases the network throughput. Simulation results show that the proposed algorithm outperforms the other algorithms and improves the network performance.     

Complexity and design of QoS routing algorithms in wireless mesh networks

Quality of service (QoS) provisioning in wireless mesh networks (WMNs) is an open issue to support emerging multimedia services. In this paper, we study the problem of QoS provisioning in terms of end-to-end bandwidth allocation in WMNs. It is challenging due to interferences in the networks. We consider widely used interference models and show that except a few special cases, the problem of finding a feasible path is NP-complete under the models. We propose a k-shortest path based algorithmic framework to solve this problem. We also consider the problem of optimizing network performance by on-line dynamic routing, and adapt commonly used conventional QoS routing metrics to be used in WMNs. We find the optimal solutions for these problems through formulating them as optimization models. A model is developed to check the existence of a feasible path and another to find the optimal path for a demand; moreover, an on-line optimal QoS routing algorithm is developed. Comparing the algorithms implemented by the proposed framework with the optimization models shows that our solution can find existing feasible paths with high probability, efficiently optimizes path lengths, and has a comparable performance to the optimal QoS routing algorithm. Furthermore, our results show that contrary to wireline networks, minimizing resource consumption should be preferred over load distribution even in lightly loaded WMNs.     

一种业务驱动的多媒体传感器网络路由算法

针对多媒体传感器网络承载业务（视频图像业务、音频业务以及数据业务）的差异性和不同业务对QoS的差异性,基于蚁群算法和混沌理论,抽象业务驱动的QoS路由模型,提出了一种业务驱动的路由算法SDR（Service-Driver Routing）。依据各类业务对QoS的差异性选择相应路由策略,达到充分利用网络资源、提高网络承载业务性能的目标。采用NS2对该算法进行实验仿真,实验结果表明,与其他路由算法相比,该算法可提供区分业务的QoS保障。     

Fuzzy Logic-Based Multicast Routing in Multiradio Multichannel Wireless Mesh Networks

The availability of bandwidth in wireless mesh networks (WMNs) introduces it as a prominent choice for implementing bandwidth sensitive services. Multicast services such as teleconferencing, push-based systems, multiplayer games, etc., can be implemented in an efficient way in such networks. Moreover, the severe performance degradations that can result from the interference generated by concurrent data transmissions and environmental noises call for the development of interference-aware routing mechanisms. This paper investigates the impact of wireless interference on network performance for multicast transmission in WMNs. We show that by taking wireless interference into consideration in the design of routing mechanisms, better resource usage can be achieved. Hence, a fuzzy logic–based approach is proposed to choose optimal routes from source to the multicast group in multichannel case. Three fuzzy variables are considered in route selection phase, which are interference, available bandwidth, and hop count. Extensive simulations are conducted aiming at verifying the high performance of the proposed algorithm. Simulation results demonstrated that our proposed algorithm outperforms Link-Controlled Multi-Rate Multi-Channel (LC-MRMC) and Channel Assignment with Multiple Factor (CAMF) algorithms in terms of throughput, packet delivery ratio, and end-to-end delay.     

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.     

定向天线卫星网络空间重用的带宽预留算法

基于无线网络中设计提供服务质量(quality of service,QoS)的路由协议是一项具有挑战性的工作,提出无线卫星网络中基于定向天线的服务质量保证的空间重用的带宽预留算法。卫星网络中许多音/视频会议、远程教育等重要应用,需要服务质量保证。无线网络中的定向天线技术提供了显著增加空间重用性的能力,提高无线网络中的数据传输效率。研究使用定向天线的无线卫星网络中基于时分多址的带宽预留算法,该算法给不同方向的地面终端分配相同时隙来提高带宽资源的空间重用性,提高通信效率。通过模拟实验分析研究证明,该算法在服务质量调用成功率、吞吐量和延迟方面有比较好的性能。     

Multi-Service Dynamic QoS Routing Schemes with Call Admission Control: A Comparative Study

In this paper we consider wide-area backbone networks where multiple connection-oriented guaranteed services with differing bandwidth/flow requirements are offered. Specifically, we consider the case where each service requires a quality-of-service (QoS) peak rate bandwidth/flow allocation (different rate for different services) for the duration of the connection in a loss network environment. We present several dynamic routing schemes in such multi-service settings along with an admission control policy. The routing schemes cover issues such as crankback, periodicity of computation of routing, what type of information is to be used in routing decision, and whether to use centralized or decentralized computation. We present results for various measures, i.e., in addition to well-known call blocking performance, we also address and quantify measures such as signaling loads impact due to alternate routing, crankback impact, and revenue impact, and provide a comparative evaluation of various dynamic routing schemes in multi-service settings.     

Testbed results of an opportunistic routing for multi-robot wireless networks

Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.     

一种基于DPSO的无线传感器网络QoS路由算法

针对无线传感器网络中不同业务对服务质量(QoS)的不同需求,提出一种基于离散粒子群优化(DPSO)的无线传感器网络QoS路由(DPSO-QR)算法。算法将路由建立过程抽象为多目标优化过程,以节点间通信的传播损耗、时延、带宽、丢包率为优化目标,利用DPSO算法实现多目标优化,为拥有不同QoS需求的网络业务提供满足其特有需求的优化路由。仿真实验表明:与SAR,EQR算法相比,DPSO-QR算法降低了网络平均端到端时延,减小了丢包率,延长了网络寿命。     

一种基于跨层功率控制的Ad hoc网络路由算法*

在无线Ad Hoc网络路由协议中引入功率控制不但可以降低网络能量消耗,同时还能改善网络的吞吐量、投递率等性能,已成为当前Ad Hoc网络的一个研究热点.本文提出了一种基于跨层功率控制的按需路由算法CPC-AODV(Cross-layer Power Control Ad hoc On-demand Distance Vector).算法按需建立多个不同功率级的路由,节点选择到目的节点最小功率级的路由来传递分组,并对网络层的数据分组、路由分组和MAC层控制帧的传输采用不同功率控制策略来降低能量消耗.仿真结果表明:算法有利于降低通信能量开销,延长网络寿命,提高网络投递率及改善网络时延.     

Design and performance analysis of an inductive QoS routing algorithm

Routing mechanism is key to the success of large-scale, distributed communication and heterogeneous networks. Consequently, computing constrained shortest paths is fundamental to some important network functions such as QoS routing and traffic engineering. The problem of QoS routing with multiple additive constraints is known to be NP-complete but researchers have been designing heuristics and approximation algorithms for multi-constrained paths algorithms to propose pseudo-polynomial time algorithms. This paper introduces a polynomial time approximation quality of service (QoS) routing algorithm and constructs dynamic state-dependent routing policies. The proposed algorithm uses an inductive approach based on trial/error paradigm combined with swarm adaptive approaches to optimize lexicographically various QoS criteria. The originality of our approach is based on the fact that our system is capable to take into account the dynamics of the network where no model of the network dynamics is assumed initially. Our approach samples, estimates, and builds the model of pertinent aspects of the environment which is very important in heterogeneous networks. The algorithm uses a model that combines both a stochastic planned pre-navigation for the exploration phase and a deterministic approach for the backward phase. Multiple paths are searched in parallel to find the K best qualified ones. To improve the overall network performance, a load adaptive balancing policy is defined and depends on a dynamic traffic path probability distribution function. We conducted a performance analysis of the proposed QoS routing algorithm using OPNET based on a platform simulated network. The obtained results demonstrate substantial performance improvements as well as the benefits of learning approaches over networks with dynamically changing traffic.     

Preemption-Aware Instantaneous Request Call Routing for Networks With Book-Ahead Reservation

This paper presents a new preemption-aware quality of service (QoS) routing algorithm for instantaneous request (IR) call connections in a QoS-enabled network where resources are shared between IR and book-ahead (BA) call connections. BA reservation, which confirms the availability of resources in advance, is a highly attractive technique for time sensitive applications that require high amount of bandwidth with guaranteed QoS. One of the major concerns for the implementation of BA reservation is the need for preemption of on-going IR calls to accommodate BA calls when resource scarcity arises. Preemption disrupts service continuity of on-going calls which is considered as severely detrimental from users' perceived QoS definition found in recent studies. Existing QoS routing algorithms focus on resource conservation or load balancing as the key objective to attain in addition to guaranteed QoS. No works have yet focused on the preemption problem of on-going IR calls at routing stage in the presence of BA calls. We present a mathematical formulation to compute the preemption probability of an incoming IR call at routing stage based on the current IR and future BA load information. We propose a routing strategy by formulating a link cost function comprising of the calculated preemption probability of the incoming IR call and hop count. Simulation results confirm that QoS routing based on the proposed link cost function significantly outperforms widely recommended shortest path and widest path routing algorithms in terms of IR call preemption and blocking rate. The proposed approach also yields higher network utilization and IR effective throughput.     

An efficient joint channel assignment and QoS routing protocol for IEEE 802.11 multi-radio multi-channel wireless mesh networks

With the emerging of video, voice over IP (VoIP) and other real-time multimedia services, more and more people pay attention to quality of service (QoS) issues in terms of the bandwidth, delay and jitter, etc. As one effective way of broadband wireless access, it has become imperative for wireless mesh networks (WMNs) to provide QoS guarantee. Existing works mostly modify QoS architecture dedicated for ad hoc or sensor networks, and focus on single radio and single channel case. Meanwhile, they study the QoS routing or MAC protocol from view of isolated layer. In this paper, we propose a novel cross-layer QoS-aware routing protocol on OLSR (CLQ-OLSR) to support real-time multimedia communication by efficiently exploiting multi-radio and multi-channel method. By constructing multi-layer virtual logical mapping over physical topology, we implement two sets of routing mechanisms, physical modified OLSR protocol (M-OLSR) and logical routing, to accommodate network traffic. The proposed CLQ-OLSR is based on a distributed bandwidth estimation scheme, implemented at each node for estimating the available bandwidth on each associated channel. By piggybacking the bandwidth information in HELLO and topology control (TC) messages, each node disseminates information of topology and available bandwidth to other nodes in the whole network in an efficient way. From topology and bandwidth information, the optimized path can be identified. Finally, we conduct extensive simulation to verify the performance of CLQ-OLSR in different scenarios on QualNet platform. The results demonstrate that our proposed CLQ-OLSR outperforms single radio OLSR, multi-radio OLSR and OLSR with differentiated services (DiffServ) in terms of network aggregate throughput, end-to-end packet delivery ratio, delay and delay jitter with reasonable message overheads and hardware costs. In particular, the network aggregate throughput for CLQ-OLSR can almost be improved by 300% compared with the single radio case.     

无线Mesh网络链路非相关多径发现算法

非相关路径的使用对于提高网络性能有极其重要的作用,但当前无线Mesh网络的路由协议都不支持链路非相关多径的寻找.在分析DSR协议不足的基础上,提出了一种基于DSR改进的链路非相关多径寻找算法EDSR（enhancedDSR）.其核心思想是在DSR路由寻找完成后,利用网络节点的路由缓存发现和寻找源节点与目的节点间的链路非相关路径.通过非相关路径的使用,提高网络吞吐率,从而达到提高网络性能的目的.仿真结果表明,EDSR算法能以较少的代价获取非相关路径,提高网络性能.     

无线网状网的QoS研究

作为下一代无线通信网络的关键技术,无线网状网能够融合异构网络,满足多类型的业务需求,因此必须提供一定的服务质量(QoS)保证.对目前各种QoS体系结构进行了分析,讨论了无线网状网的QoS体系结构.针对无线网状网网络层以下各层的QoS问题,对近年来国内外在功率控制、无线环境感知、支持QoS的MAC协议、QoS路由以及跨层QoS设计等方向所取得的研究成果进行了全面的概括总结和比较分析.最后对未来的研究发展趋势提出了自己的观点.     

Quality of Service Support in RPL Networks: Standing State and Future Prospects

The development of IP-based Internet of Things (IoT) networks would facilitate more effective end-to-end IP network architectures, but it remains a challenge. Network routing needs to be effectively addressed in the IoT environments of scarce computational and energy resources. Accordingly, the Internet Engineering Task Force (IETF) has specified the IPv6 Routing Protocol for Low Power and Lossy Network (RPL) to provide a bespoke IPv6-based routing framework for IoT networks. However, RPL comes with no Quality of Service (QoS) support which is an essential requirement for many IoT applications. The network research community has introduced a number of research proposals enhancing RPL with different QoS solutions. This paper presents a review of these proposed solutions and aims to establish a firm understanding of recent QoS developments for RPL and possible areas for future IoT routing research. The focus is on comprehending the protocol and networking properties that can affect QoS performance in RPL networks. Consideration is also given to different objective functions developed for addressing varying QoS aspects such as throughput, delay, and packet loss. RPL is also extended in a number of QoS solutions following different approaches at the MAC, network, and application layers. However, there is still a need for further developments to address effective QoS support, particularly for dynamic RPL networks.     

Performance evaluation of an intelligent CAC and routing framework for multimedia applications in broadband networks

In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for the Call Admission Control (CAC) of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. However, we only considered the time delay for the routing. The QoS and Congestion Control (CC) parameters were considered as indicators of QoS satisfication and congestion. In this work, we extend our previous work by proposing and implementing new algorithms based on Fuzzy Logic (FL) and Genetic Algorithm (GA) which use for CAC and routing many QoS parameters. The simulation results show that proposed framework has a good performance and is a promising method for QoS routing and CAC decision.     

基于SDN分级分域架构的QoS约束路由算法

传统分布式的网络架构制约路由算法的创新,软件定义网络的出现为路由算法的优化提供了新思路。已有研究中,启发式算法广泛应用于服务质量路由,但由于计算复杂度高而无法在大型网络中应用。而其他算法均存在不同程度的问题,要么复杂度较高,要么算法性能较差,如最短路径算法。基于 SDN 分级分域架构,提出了 LC-LD 路由算法,综合时延条件和代价度量约束并在计算复杂度和算法性能之间保持平衡。仿真分析表明,LC-LD路由算法在有较低的计算复杂度的同时还有较高的服务质量路由选路性能。