On the performance analysis of the minimum-blocking and bandwidth-reallocation channel-assignment (MBCA/BRCA) methods for quality-of-service routing support in mobile multimedia ad hoc networks

Quality-of-service (QoS) routing is the key to support multimedia services in wireless multihop networks. The goal of QoS routing is to find satisfactory paths that support the end-to-end QoS requirements of the multimedia flows. Previous work has demonstrated a framework for supporting QoS routing in mobile ad hoc networks, where two novel mechanisms for dynamic channel assignment, called the minimum-blocking and bandwidth-reallocation channel-assignment (MBCA/BRCA) algorithms, were proposed. MBCA/BRCA are on-demand channel assignment methods that reactively provide a differentiated service treatment to multimedia traffic flows at the link level using novel techniques for end-to-end path QoS maximization. Efficient QoS routing is then accomplished by giving the routing mechanism access to QoS information, thus coupling the coarse grain (routing) and fine grain (congestion control) resource allocation. In this paper, the specifics and individual mechanisms of the MBCA/BRCA algorithms are presented, whereas their effectiveness and the manner in which they interact in order to contribute to the overall protocol performance is examined and documented. The system performance is studied through simulations experiments under various QoS traffic flows and network scenarios. The protocol's behavior and the changes introduced by variations on some of the mechanisms that make up the protocol is further investigated. As demonstrated, the MBCA/BRCA methods are able to increase system's aggregate traffic by 2.8 Kb/s, on average, comparing to a non-MBCA/BRCA dynamic channel-allocation scheme.     

Design of an optimized traffic-aware routing algorithm using integer linear programming for software-defined networking

The number of internet users and connected devices has dramatically expanded due to the recent technological boom and the benefits that the internet of things offers to ease our lives. Network scheduling, quality of service, resource allocation, and security issues are now being addressed via software-defined networking (SDN). SDN has several benefits over traditional networks, including global centralized control, managing network traffic, and separating the forwarding and control plane. The work done in this paper aims to design and implement a traffic-aware routing framework based on routing optimization presented as an integer linear programming (ILP) to improve heterogeneous traffic flows' quality of service (QoS) in a simulated SDN environment. With the knowledge that the routing problem is a nondeterministic polynomial-time-hard problem, the proposed scheme aims to decrease the computational routing time to make the ILP-based routing system more suitable for real-time processing. The simulation results illustrate that the proposed framework reduces the computational time by 23% and 49% for Abilene and Goodnet topology, respectively. Additionally, with 1000 flows in the network, the suggested scheme reduces the number of network flows that violate the QoS by 9% and 22% (with Abilene topology) and 16% and 51% (with Goodnet topology) as compared to the existing shortest path delay and sway methods, respectively.     

Design and performance evaluation of active bandwidth brokers

With the arrivals of critical data transactions and multimedia applications, the needs of network services with different Quality of Service (QoS) guarantees increase rapidly. In order to ensure the delivery of information with a desired quality at the application layer, policy-based management (pbm) systems should be deployed at network service providers for configuring network devices properly. A policy-based management system is capable of resolving and enforcing policy rules in realizing end-to-end QoS for all kinds of network connections. In this paper, a novel design of policy-based management system based on active networks is proposed. Active network technology empowers network routers the ability to execute and move data and program code as needed. It is used in the proposed design (Active Bandwidth Broker architecture) to achieve the goals of system scalability and reliability. Moreover, policy control operations can be distributed among different active nodes. Thus, the architecture reduces the aggregate amount of policy control traffic in networks and expedites the response times on policy requests. Furthermore, the Policy Decision Point is a mobile agent that moves and avoids encountering network congestion situations. A system prototype has been constructed to implement the designed architecture. It has successfully demonstrated that the new design framework offers architecture flexibility, improves system reliability, and provides system scalability in handling a large number of service requests.     

一种基于带宽接入控制的AODV改进路由协议

无线自组网中的路由协议AODV没有提供流控和拥塞避免机制,当网络负载较重时,多媒体业务或产生较大的延时,或分组被大量丢弃,使网络性能下降.在AODV协议的基础上,提出一种基于带宽接入控制的改进协议BAC-AODV,对节点和路径的可用带宽进行估算,修改路由建立机制,使路径满足业务流对带宽的需求,保证网络的QoS质量.分析和仿真结果表明,改进后的协议相比原有AODV,能更有效地控制业务流量,提高吞吐量,降低延时.     

A novel multicast traffic engineering technique in SDN using TLBO algorithm

In recent years, multicast communication is widely used by network providers to deliver multimedia contents. Quality of service (QoS) provisioning is one of the most important issues while transmitting multimedia contents using multicast. Traditional IP multicasting techniques suffer from reliability, scalability and have limitations to provide appropriate QoS for multimedia applications based on service level agreement (SLA). Nowadays, the advent of software defined networking (SDN), enables network providers to manage their networks dynamically and guarantee QoS parameters for customers based on SLA. SDN provides capabilities to monitor network resources and allows to dynamically configure desired multicasting policies. In this paper, we proposed a novel multicasting technique to guarantee QoS for multimedia applications over SDN. To deliver multimedia contents in an efficient manner, our proposed method models multicast routing as a delay constraint least cost (DCLC) problem. As DCLC problem is NP-Complete, we proposed an approximation algorithm using teaching–learning-based optimization to solve this problem. We evaluated our proposed method under different topologies. Experimental results confirmed that our proposed method outperforms IP multicast routing protocol, and it achieves a gain of about 25% for peak signal-to-noise ratio.     

ECBRP: An Efficient Cluster-Based Routing Protocol for Real-Time Multimedia Streaming in MANETs

The dynamic characteristics of wireless networks and stringent QoS requirements of multimedia applications identify significant challenges for providing QoS guarantees for real-time multimedia streaming in such wireless environment. QoS routing protocols can decisively contribute to the QoS provision of network systems. This paper proposes an efficient cluster-based routing protocol (ECBRP) for real-time multimedia streaming in mobile ad hoc networks. First, to improve the stability of clusterheads, we introduce a new algorithm of cluster formation, in consideration of the node mobility and connectivity. Second, a link-broken detection mechanism is designed, which is able to distinguish whether packet loss is due to mobility or congestion, and to make proper reaction. This mechanism contributes to reduce route overhead, and to increase the decodable ratio of video frame at the application layer as well. Third, the routing protocol is enhanced via an adaptive packet salvage strategy, in order to alleviate the congestion in consideration of the characteristics of multimedia traffic. Our simulation experiment results demonstrate that the ECBRP leads to more stable cluster formation than the CBRP, and 80% decreases in the frequency of clusterhead changes against CBRP. As a result, the quality of real-time multimedia streaming is improved significantly, in terms of decodable frame ratio, delay and delay jitter, etc.     

在Ad Hoc网络中基于信息调度的QoS保证

提出一个以信息调度为基础的分布式的QoS(DQBI)体系结构。该结构可以在移动Ad Hoc网络中为实时传输和尽力而为传输提供QoS保证。DQBI模型改进了整个系统信息端到端的延迟性能,并且通过使用请求允许接入控制和拥塞控制机制来处理网络的拥塞。最后,仿真比较了MQRD结构和DQBI结构,发现DQBI结构可以更好地确保实时流和尽力而为流实现它们期望的服务水平。     

Enabling novel premium service classes in DiffServ over MPLS‐enabled network

Network resources dimensioning and traffic engineering influence the quality in provisioned services required by the Expedited Forwarding (EF) traffic in production networks established through DiffServ over MPLS‐enabled network. By modeling EF traffic flows and the excess of network resources reserved for it, we derive the range of delay values which are required to support these flows at DiffServ nodes. This enables us to develop an end‐to‐end (e2e) delay budget‐partitioning mechanism and traffic‐engineering techniques within a framework for supporting new premium QoS levels, which are differentiated based on e2e delay, jitter and loss. This framework enables ingress routers to control EF traffic flow admission and select appropriate routing paths, with the goal of EF traffic balancing, avoiding traffic congestion and getting the most use out of the available network resources through traffic engineering. As a result, this framework should enable Internet service providers to provide three performance levels of EF service class to their customers provided that their network is DiffServ MPLS TE aware. Copyright © 2008 John Wiley & Sons, Ltd.     

一种基于深度增强学习的智能路由技术

随着网络规模的不断增大以及网络复杂度的不断提高,传统路由算法面对网络流量在时空分布上的剧烈波动难以兼顾计算复杂度和算法效率.近年来,随着软件定义网络和人工智能技术的兴起,基于机器学习的自动路由策略生成逐渐受到关注.本文提出一种基于深度增强学习的智能路由技术SmartPath,通过动态收集网络状态,使用深度增强学习自动生成路由策略,从而保证路由策略能够动态适应网络流量变化.实验结果表明,本文所提出的方案能够不依赖人工流量建模动态更新网络路由,在测试环境下比当前最优方案减少至少10%的平均端到端传输时延.     

Proactive multipath routing with a predictive mechanism in software‐defined networks

With the growth of network traffic volume, link congestion cannot be avoided efficiently with conventional routing protocols. By utilizing the single shortest‐path routing algorithm from link state advertisement information, standard routing protocols lack of global awareness and are difficult to be modified in a traditional network environment. Recently, software‐defined network (SDN) provided innovative architecture for researchers to program their own network protocols. With SDN, we can divert heavy traffic to multiple paths in order to resolve link congestion. Furthermore, certain network traffics come in periodic fashion such as peak hours at working days so that we can leverage forecasting for resource management to improve its performance. In this paper, we propose a proactive multipath routing with a predictive mechanism (PMRP) to achieve high‐performance congestion resolution. PMRP has two main concepts: (a) a proactive mechanism where PMRP deploys M/M/1 queue and traffic statistics to simulate weighted delay for possible combinations of multipaths placement of all subnet pairs, and leverage genetic algorithm for accelerating selection of optimized solution, and (b) a predictive mechanism whereby PMRP uses exponential smoothing for demand traffic volumes and variance predictions. Experimental results show a 49% reduction in average delay as compared with single shortest routing, and a 16% reduction in average delay compared with utilization & topology‐aware multipath routing (UTAMP). With the predictive mechanism, PMRP can decrease an additional 20% average delay. Furthermore, PMRP reduces 93% of flow table usage on average as compared with UTAMP.     

软件定义卫星光网络蚁群优化波长路由技术

针对卫星光网络中网络拓扑动态时变和业务类型多样化的问题,研究了在软件定义网络架构下保障服务质量的路由技术,提出了一种基于多业务的卫星光网络蚁群优化波长路由算法。通过改进蚁群算法的启发函数,将波长空闲率、时延、时延抖动、丢包率作为蚂蚁选路的重要依据,为业务选择了满足多种服务质量的最优路径;采用分组波长分配方法对不同等级的业务进行了区分服务,为不同业务分配了不同的波长集。仿真结果表明:与CL-ACRWA算法和Dijkstra算法相比,降低了卫星光网络的平均时延、平均时延抖动、平均丢包率,提高了波长利用率,同时也降低了高优先级业务的网络拥塞概率。     

Policy-based QoS architecture in the IP multimedia subsystem of UMTS

The third-generation mobile system, or Universal Mobile Telecommunication System, will offer IP-based multimedia applications and services with end-to-end QoS guarantee. The key part providing these services is the policy-based QoS control architecture in the IP multimedia subsystem (IMS). In this tutorial we describe the network entities involved in the policy-based QoS architecture, their interactions to realize guaranteed QoS in the UMTS network, and the communication interfaces employed in the interactions.     

Multi-domain architecture for policy management inumts ip multimedia subsystem

The Universal Mobile Telecommunications System (UMTS) offers IP-based multimedia applications and services with end-to-end Quality of Service (QoS) guarantee. The key component providing these services is the IP Multimedia Subsystem (IMS) that uses Service-Based Local Policy (SBLP) management for QoS control. To support end-to-end QoS, the UMTS IMS network should be scalable, reliable and flexible in policy deployment and enforcement, characteristics that are not found in single-domain policy architecture. A hybrid policy architecture is proposed, in which a hierarchical architecture is applied to the multi-domain environment in a single operator UMTS IMS network, while a peering architecture is employed in a multi-operator UMTS IMS network. The proposed multi-domain policy architecture potentially minimizes the session setup delay and policy exchange traffic while maximizing network scalability.     

A framework for guaranteeing statistical QoS

Continuous-media traffic (i.e., audio and video) can tolerate some loss but have rigid delay constraints. A natural QoS requirement for a continuous-media connection is a prescribed limit on the fraction of traffic that exceeds an end-to-end delay constraint. We propose and analyze a framework that provides such a statistical QoS guarantee to traffic in a packet-switched network. Providing statistical guarantees in a network is a notoriously difficult problem because traffic flows lose their original statistical characterizations at the outputs of queues. Our scheme uses bufferless statistical multiplexing combined with cascaded leaky buckets for smoothing and traffic contracting. This scheme along with a novel method for bounding the loss probability gives a tractable framework for providing end-to-end statistical QoS. Using MPEG video traces, we present numerical results that compare the connection-carrying capacity of our scheme with that of guaranteed service schemes (i.e., no loss) using GPS and RCS. Our numerical work indicates that our scheme can support significantly more connections without introducing significant traffic loss     

Centralized congestion control routing protocol based on multi-metrics for low power and lossy networks

Owing to the unreliability of wireless link and the resource constraints of embedded devices in terms of energy, processing power, and memory size in low power and lossy networks (LLNs), network congestion may occur in an emergency and lead to significant packet loss and end-to-end delay. To mitigate the effect of network congestion, this paper proposes a centralized congestion control routing protocol based on multi-metrics (CCRPM). It combines the residual energy of a node, buffer occupancy rate, wireless link quality, and the current number of sub-nodes for the candidate parent to reduce the probability of network congestion in the process of network construction. In addition, it adopts a centralized way to determine whether the sub-nodes of the congested node need to be switched based on the traffic analysis when network congestion occurs. Theoretical analysis and extensive simulation results show that compared with the existing routing protocol, the performance of CCRPM is improved significantly in reducing the probability of network congestion, prolonging average network lifetime, increasing network throughput, and decreasing end-to-end delay.     

A consistent QoS routing strategy for video streaming services in SDN networks

The software‐defined networking (SDN) paradigm proposes to decouple the control plane (decision‐making process) and the data plane (packet forwarding) to overcome the limitations of traditional network infrastructures, which are known to be difficult to manage, especially at scale. Although there are previous works focusing on the problem of quality of service (QoS) routing in SDN networks, only few solutions have taken into consideration the network consistency, which reflects the adequacy between the decisions made and the decisions that should be taken. Therefore, we propose a network architecture that guarantees the consistency of the decisions to be taken in an SDN network. A consistent QoS routing strategy is then introduced in a way that avoids any quality degradation of prioritized traffic while optimizing resources usage. Thus, we proposed a traffic dispersion heuristic in order to achieve this goal. We compared our approach with several existing framework in terms of best‐effort flows average throughput, average video bitrate, and video quality of experience (QoE). The emulation results, which are performed using the Mininet environment, clearly demonstrate the effectiveness of the proposed approach that outperforms existing frameworks.     

Provisioning of Parameterized Quality of Service in 802.11e Based Wireless Mesh Networks

There has been a growing interest in the use of wireless mesh networks. Today’s wireless technology enables very high data rate up to hundreds of Megabits per second, which creates the high demand of supporting real-time multimedia applications over wireless mesh networks. Hence it is imperative to support quality of service (QoS) in wireless mesh networks. In this paper, we design a framework to provide parameterized QoS in 802.11e based wireless mesh networks. Our framework consists of admission control algorithms and scheduling algorithms, which aim at supporting constant bit-rate (CBR) traffic flows, as well as variable bit-rate (VBR) traffic flows. We first present deterministic end-to-end delay bounds for CBR traffic. We then prove that the delay of VBR traffic can be bounded if the traffic flow conforms to a leaky-bucket regulator. We further study different admission control algorithms for VBR traffic. Our simulation results show that, by taking advantage of statistical multiplexing, much more traffic flows can be admitted.     

Jitter‐minimized reliability‐maximized management of networks

We propose a joint optimization network management framework for quality‐of‐service (QoS) routing with resource allocation. Our joint optimization framework provides a convenient way of maximizing the reliability or minimizing the jitter delay of paths. Data traffic is sensitive to droppage at buffers, while it can tolerate jitter delay. On the other hand, multimedia traffic can tolerate loss but it is very sensitive to jitter delay. Depending on the type of data, our scheme provides a convenient way of selecting the parameters which result in either reliability maximization or jitter minimization. We solve the optimization problem for a GPS network and provide the optimal solutions. We find the values of control parameters which control the type of optimization performed. We use our analytical results in a multi‐objective QoS routing algorithm. Finally, we provide insights into our optimization framework using simulations. Copyright © 2011 John Wiley & Sons, Ltd.     

基于无线Mesh网络的分布式协调功能的研究

随着无线mesh网络的迅速发展和实时多媒体业务的日益增长,要求无线网络不仅能提供简单的连通性,还需要提供非常有效的QoS保证机制,针对这一问题,以时分多址/时分双工(TDMA/TDD)技术为基础,提出一种基于无线mesh网络的分布式协调功能,信道存取与数据传输发生在不同的时隙中,能够为端到端数据流公平的分配带宽,并且保证了实时服务传输的QoS.仿真及分析表明该协调功能可提高系统吞吐量并降低端到端延迟,有着更好的QoS性能.     

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

The requirement to provide multimedia services with QoS support in mobile networks has led to standardization and deployment of high speed data access technologies such as the High Speed Downlink Packet Access (HSDPA) system. HSDPA improves downlink packet data and multimedia services support in WCDMA-based cellular networks. As is the trend in emerging wireless access technologies, HSDPA supports end-user multi-class sessions comprising parallel flows with diverse Quality of Service (QoS) requirements, such as real-time (RT) voice or video streaming concurrent with non real-time (NRT) data service being transmitted to the same user, with differentiated queuing at the radio link interface. Hence, in this paper we present and evaluate novel radio link buffer management schemes for QoS control of multimedia traffic comprising concurrent RT and NRT flows in the same HSDPA end-user session. The new buffer management schemes—Enhanced Time Space Priority (E-TSP) and Dynamic Time Space Priority (D-TSP)—are designed to improve radio link and network resource utilization as well as optimize end-to-end QoS performance of both RT and NRT flows in the end-user session. Both schemes are based on a Time-Space Priority (TSP) queuing system, which provides joint delay and loss differentiation between the flows by queuing (partially) loss tolerant RT flow packets for higher transmission priority but with restricted access to the buffer space, whilst allowing unlimited access to the buffer space for delay-tolerant NRT flow but with queuing for lower transmission priority. Experiments by means of extensive system-level HSDPA simulations demonstrates that with the proposed TSP-based radio link buffer management schemes, significant end-to-end QoS performance gains accrue to end-user traffic with simultaneous RT and NRT flows, in addition to improved resource utilization in the radio access network.