Dynamic bandwidth provisioning using ARIMA-based traffic forecasting for Mobile WiMAX

With fast proliferation of QoS-enabled wireless packet networks, need for effective QoS control is increasing. In this paper, we focus on QoS provisioning in Mobile WiMAX access service network (ASN). We investigate a dynamic bandwidth provisioning method that can help to increase resource utilization. Our approach consists of two stages: traffic forecasting, followed by bandwidth provisioning. For the first stage, we use auto-regressive integrated moving average (ARIMA) model to forecast traffic based on online measurement. For the second stage, we use a bandwidth provisioning scheme that allocates bandwidths depending on the traffic forecasting. We modeled our problem as a Fractional Knapsack Problem for which we used a greedy algorithm in order to find an approximate solution. Through simulation studies with real-world data sets, we found that our approach could increase the bandwidth for the real-time traffic class and guarantee adequate service quality for the nonreal-time traffic class as well, while maximizing resource utilization.     

QoS and SLA aspects across multiple management domains: the SEQUIN approach

The aim of this work is to define and implement an end-to-end approach to quality of service (QoS), operating across multiple management domains and exploiting a combination of link layer technologies. The architecture for the Premium IP service is presented, which aims at offering the equivalent of an end-to-end virtual leased line service at the IP layer across multiple domains. Also, the results of the initial testing performed for the validation of the service and the provisioning model for Premium IP are described. The work presented has been carried out in the framework of SEQUIN, a European Commission-funded research project.     

路由交换设备QoS应用技术分析

针对业务应用系统对网络传输质量要求的不断提高,通过分析路由交换设备服务质量（QoS）实现机制,研究了报文分类、优先级标识、流量监管、队列调度以及端口限速等多方面的QoS应用技术。最后,从工程实践角度提出了一套完善的QoS部署流程,解决了网际互联协议（IP）网络设备传输在拥塞避免和流量管理方面的问题,从根本上提高了IP网络的服务能力。     

Opportunistic Optical Hyperchannel and Its Distributed QoS Assuring Access Control

Light-trail is proposed as a candidate to carry IP traffic over wavelength-division multiplexing optical networks given its capability of enabling high-speed provisioning and accommodating multigranularity traffic. In a light-trail, the optical shutters at the start node and the end node are configured to be in OFF state and the optical shutters at the intermediate nodes are configured to be in ON state. Thus, an optical bus is formed, allowing traffic multiplexing without the state change of any optical shutter. This, however, limits the system throughput and also makes it impossible to implement a fully distributed medium access control (MAC) protocol to assure quality of service (QoS) in a light-trail. With the recent development on ultrafast optical shutter, we propose an improved light-trail architecture, called opportunistic hyperchannel in this paper. In an opportunistic hyperchannel, an intermediate node can dynamically control its optical shutter which makes it possible to design a fully distributed QoS assuring MAC protocol. We then present a QoS assuring distributed dynamic scheduling protocol, namely, minimum source round robin (minSrcRR) protocol, for opportunistic hyperchannels. Theoretical analysis on the effectiveness of the proposed QoS assuring protocol and the worst-case delay bound are also derived in this paper. The simulation results quantitatively demonstrate the advantage of opportunistic hyperchannels and the effectiveness of minSrcRR protocol.     

基于Overlay Network的网格虚拟端到端带宽分配问题研究

提出了基于Overlay Network的服务网格（SGON）的概念,以此来生成和部署网络增值服务.带宽分配问题是在Overlay Grid上部署和运行增值服务的关键问题,为了解决这个问题,Overlay Grid在已存在的数据传输网络的上部建立了一个逻辑的端到端的服务传输基础,通过双边的服务水平协议（SLA）,提供QoS约束的带宽.给出了包含SLA、服务QoS、流量需求分布、开销等因素的带宽分配问题的模型,同时提供了静态和动态带宽分配问题的分析模型和近似解,最后设计了一种启发式自适应在线动态带宽分配算法.实验仿真结果表明,该算法是可行的.     

Multi-Layer Resource Management in Cloud Computing

The paper studies multi-layer optimization in service oriented cloud computing to optimize the utility function of cloud computing, subject to resource constraints of an IaaS provider at the resource layer, service provisioning constraints of a SaaS provider at the service layer, and user QoS (quality of service) constraints of cloud users at application layer, respectively. The multi-layer optimization problem can be decomposed into three subproblems: cloud computing resource allocation problem, SaaS service provisioning problem, and user QoS maximization problem. The proposed algorithm decomposes the global optimization problem of cloud computing into three sub-problems via an iterative algorithm. The experiments are conducted to test the efficiency of the proposed algorithm with varying environmental parameters. The experiments also compare the performance of the proposed approach with other related work.     

Estimation of backlog and delay in OFDM/TDMA systems with traffic policing using Network Calculus

Achieving quality of service (QoS) in OFDM based networks depends, among other factors, on mechanisms for traffic policing or control. Aggregate traffic in high speed networks can present multifractal characteristics such as bursts over a wide range of time scales, heavy tailed inter-arrival time densities, self-similarity and long-range dependence. These properties are followed by a degradation of quality of service for the traffic flows. In this paper, we firstly propose a policing algorithm based on multifractal traffic modeling, evaluating its performance in comparison to other algorithms. We present a more precise in general envelope modeling process in order to efficiently police the input traffic to the system. Further, we present an approach based on Network Calculus for estimating quality of service parameters, such as mean queue length (backlog) and delay. We analyze these two parameters for an OFDM/TDMA based simplified WiMAX system with and without the application of traffic modeling based policing algorithms. In other words, we propose an approach for evaluating some QoS parameters of an OFDM/TDMA system where the traffic is policed. We also evaluate the performance of the proposed algorithm in policing the traffic in an OFDM/TDMA system.     

A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources.In this paper we introduce a new service model that provides per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate.To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop a set of dynamic on-line bandwidth allocation algorithms that take explicitly into account traffic statistics and users’ utility functions to increase users’ benefit and network revenue.Further, we propose a mathematical formulation of the extra-bandwidth allocation problem that maximizes network revenue. The solution of this model allows to obtain an upper bound on the performance achievable by any on-line bandwidth allocation algorithm.We demonstrate through simulation in realistic network scenarios that the proposed dynamic allocation algorithms are superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue, and they approach, in several network scenarios, the ideal performance provided by the mathematical model.     

Traffic Engineered Multicast Content Delivery Without MPLS Overlay

Multicast traffic engineering (TE) has recently attracted significant attention given the emergence of point-to-multipoint multimedia content delivery over the Internet. Existing multicast resource provisioning solutions tend to use explicit-routing based TE with multiprotocol label switching (MPLS) tunnels. In this paper, we shift away from this overlay approach and address native IP multicast traffic engineering based on link state routing protocols. The objective is that, through plain protocol independent multicast-sparse mode (PIM-SM) shortest path routing with optimized multitopology IGP (MT-IGP) link weights, the resulting multicast trees are geared towards minimal consumption of bandwidth resources. We apply genetic algorithms (GA) to the calculation of optimized MT-IGP link weights that specifically cater for engineered PIM-SM routing with statistical bandwidth guarantees in multimedia content delivery. Our evaluation results show that GA-based multicast traffic engineering consumes significantly less bandwidth in comparison to conventional IP approaches while also exhibiting higher service availability     

A scalable multimedia QoS architecture for ad hoc networks

Communication demands have grown from separate data and voice to integrated multimedia, paving the way to converging fixed, mobile and IP networks. Supporting Multimedia is a challenging task for wireless ad hoc network designers. Multimedia forms high data rate traffic with stringent Quality of Service (QoS) requirements. Wireless ad hoc networks are characterized by frequent topology changes, unreliable wireless channel, network congestion and resource contention. Providing scalable QoS is the most important challenge for multimedia delivery over ad hoc networks. We introduce here a provisioning and routing architecture for ad hoc networks which scales well while provisioning QoS. The proposed architecture is analysed using a mix of HTTP, voice and video streaming applications over 54 Mbps 802.11 g-based ad hoc networks. The architecture is simulated and compared to well-known routing protocols using the OPNET Modeller. The results show that our architecture scales well with increase in the network size, and outperforms well-known routing protocols.     

SLA-controlled interconnection charging in next generation networks

Next generation network (NGN) should facilitate a single party to establish quality of service (QoS) enabled path between the two IP providers mutually interconnected by one or more transit providers. For that purpose, an end-to-end service level agreement (SLA) should be negotiated and maintained. In this article, we propose interconnection charging, which is controlled by the end-to-end SLA. Relationships between the required, offered, and actually achieved inter-provider QoS are quantified through the degrees of offering and provisioning, at both end-to-end and per-domain levels. Nominal retail price offered to end users and interconnection costs related with particular SLA are then corrected if needed, depending on the offered and provisioned QoS levels. We further propose five policies for interconnection charging and compare them under different QoS provisioning scenarios. Results of the analysis indicate that a properly selected SLA-controlled interconnection charging policy should encourage providers: (1) to offer services with different QoS levels; (2) to offer service that perfectly or most approximately matches the required QoS and (3) to achieve the contracted QoS level.     

A calculus for stochastic QoS analysis

The issue of Quality of Service (QoS) performance analysis in packet-switched networks has drawn a lot of attention in the networking community. There is a lot of work including an elegant theory under the name of network calculus, which focuses on analysis of deterministic worst case QoS performance bounds. In the meantime, researchers have studied stochastic QoS performance for specific schedulers. However, most previous works on deterministic QoS analysis or stochastic QoS analysis have only considered a server that provides deterministic service, i.e. deterministically bounded rate service. Few have considered the behavior of a stochastic server that provides input flows with variable rate service, for example wireless links. In this paper, we propose a stochastic network calculus to analyze the end-to-end stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastic servers. We also prove that a server serving an aggregate of flows can be regarded as a stochastic server for individual flows within the aggregate. Based on this, the proposed framework is further applied to analyze per-flow stochastic QoS performance under aggregate scheduling.     

Availability of end-to-end ideal QoS in IP packet networks

Network processor technology has advanced to the point where high-precision time-based store-and-forward logic is readily incorporated into packet switches and routers. With appropriate scheduling, packets from multiple flows can be serviced without contending for link resources. Accordingly, packet flows traversing a network of switching elements can have both path and time determinacy attributes which support ideal end-to-end QoS (zero jitter, zero loss, acceptable end-to-end latency) for real-time UDP packet flows and guaranteed goodput for TCP flows. One approach to packing a network with a relatively large number of such deterministic flows, i.e. achieving high availability of the ideal QoS service in a network, uses precise buffering of packets at each switch, which introduces latency. This paper describes analysis methods for quantifying how much buffering may be necessary to achieve high (99.999%) availability. For typical network topologies the analysis shows that buffering latency requirements are very small compared to transport delays, even when the network is highly utilized with heterogeneous (e.g. voice, video, circuit emulation, and data) traffic. Actual physical implementations have empirically validated the analysis results as well as the scalability of the end-to-end, time-based forwarding approach and the end-to-end availability of ideal QoS services in IP packet networks.     

Topology-aware wavelength partitioning for DWDM OBS networks: A novel approach for absolute QoS provisioning

Optical Burst Switching (OBS) is a promising switching technology for the next generation all-optical networks. An OBS network without wavelength converters and fiber delay lines can be implemented simply and cost-effectively using the existing technology. However, this kind of networks suffers from a relatively high burst loss probability at the OBS core nodes. To overcome this issue and consolidate OBS networks with QoS provisioning capabilities, we propose a wavelength partitioning approach, called Optimization-based Topology-aware Wavelength Partitioning approach (OTWP). OTWP formulates the wavelength partitioning problem, based on the topology of the network, as an Integer Linear Programming (ILP) model and uses a tabu search algorithm (TS) to resolve large instances efficiently. We use OTWP to develop an absolute QoS differentiation scheme, called Absolute Fair Quality of service Differentiation scheme (AFQD). AFQD is the first absolute QoS provisioning scheme that guarantees loss-free transmission for high priority traffic, inside the OBS network, regardless of its topology. Also, we use OTWP to develop a wavelength assignment scheme, called Best Effort Traffic Wavelength Assignment scheme (BETWA). BETWA aims to reduce loss probability for best effort traffic. To make AFQD adaptive to non-uniform traffic, we develop a wavelength borrowing protocol, called Wavelength Borrowing Protocol (WBP). Numerical results show the effectiveness of the proposed tabu search algorithm to resolve large instances of the partitioning problem. Also, simulation results, using ns-2, show that: (a) AFQD provides an excellent quality of service differentiation; (b) BETWA substantially decreases the loss probability of best effort traffic to a remarkably low level for the OBS network under study; and (c) WBP makes AFQD adaptive to non-uniform traffic by reducing efficiently blocking probability for high priority traffic.     

Assured end-to-end QoS through adaptive marking in multi-domain differentiated services networks

The issue of resource management in multi-domain Differentiated Services (DiffServ) networks has attracted a lot of attention from researchers who have proposed various provisioning, adaptive marking and admission control schemes. In this paper, we propose a Reinforcement Learning-based Adaptive Marking (RLAM) approach for providing assured end-to-end quality of service (QoS) in the form of end-to-end delay and throughput assurances, while minimizing packet transmission cost since ‘expensive’ Per Hop Behaviors like Expedited Forwarding (EF) are used only when necessary. The proposed scheme tries to satisfy per flow end-to-end QoS through control action,s which act on flow aggregates in the core of the network. Using an ns2 simulation of a multi-domain DiffServ network with multimedia traffic, the RLAM scheme is shown to be effective in significantly lowering packet transmission costs without sacrificing end-to-end QoS, when compared to the commonly used static marking scheme.     

Service level agreements (SLAs) parameter negotiation between heterogeneous 4G wireless network operators

We are currently witnessing a growing interest of network operators to migrate their existing 2G/3G networks to 4G technologies such as long-term evolution (LTE) to enhance the user experience and service opportunities in terms of providing multi-megabit bandwidth, more efficient use of radio networks, latency reduction, and improved mobility. Along with this, there is a strong deployment of packet data networks such as those based on IEEE 802.11 and 802.16 standards. Mobile devices are having increased capabilities to access many of these wireless networks types at the same time. Reinforcing quality of service (QoS) in 4G wireless networks will be a major challenge because of varying bit rates, channel characteristics, bandwidth allocation and global roaming support among heterogeneous wireless networks. As a mobile user moves across access networks, to the issue of mapping resource reservations between different networks to maintain QoS behavior becomes crucial. To support global roaming and interoperability across heterogeneous wireless networks, it is important for wireless network operators to negotiate service level agreement (SLA) contracts relevant to the QoS requirements. Wireless IP traffic modeling (in terms of providing assured QoS) is still immature because the majority of the existing work is merely based on the characterization of wireless IP traffic without investigating the behavior of queueing systems for such traffic. To overcome such limitations, we investigate SLA parameter negotiation among heterogeneous wireless network operators by focusing on traffic engineering and QoS together for 4G wireless networks. We present a novel mechanism that achieves service continuity through SLA parameter negotiation by using a translation matrix, which maps QoS parameters between different access networks. The SLA matrix composition is modeled analytically based on the G/M/1 queueing system. We evaluate the model using two different scheduling schemes and we derive closed form expressions for different QoS parameters for performance metrics such as packet delay and packet loss rate. We also develop a discrete event simulator and conduct a series of simulation experiments in order to understand the QoS behavior of corresponding traffic classes.     

Design and implementation of a QoS-aware MAC protocol for Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) have entered the class of Wireless Sensor Networks (WSNs) to meet the multimedia requirements of new emerging applications, such as surveillance and telepresence. Combining the traditional scalar sensors used in WSN nodes with tiny cameras and microphones, WMSNs commonly carry heterogeneous traffic with different Quality of Service (QoS) requirements. In order to deliver heterogeneous traffic with different requirements in highly resource constrained sensor networks, QoS provisioning and service differentiation become unavoidable. In this paper first we discuss the QoS-provisioning in sensor networks and evaluate the efficiency of existing QoS-aware MAC protocols. As a result of this evaluation, next we design and implement a QoS-aware MAC protocol for WMSNs, Diff-MAC, which integrates different methods to meet the requirements of QoS provisioning to deliver heterogeneous traffic and provides a fair all-in-one QoS-aware MAC protocol. Diff-MAC aims to increase the utilization of the channel with effective service differentiation mechanisms while providing fair and fast delivery of the data. Performance evaluation results of Diff-MAC, obtained through extensive simulations, show significant improvements, in terms of latency, data delivery and energy efficiency, compared to two other existing protocols. Implementation of Diff-MAC on Imote2 platform also reveals that the protocol with moderate complexity can be easily implemented on the resource constrained motes.     

IP QoS体系结构

通过对目前正在研究的四类IP QoS协议（RSVP,DiffServ,MPLS,SBM）的详细分析比较发现：虽然它们都能够提供对QoS的支持,但都不能单独成为大规模网络环境下的QoS解决方案,只有对它们的综合应用才能真正实现广域环境下的数据流可预测性传输。以此为基础,给出了大规模网络系统中的IP QoS体系结构。     

Impact of QoS operations on an experimental testbed network

By making the best use of limited bandwidth, quality of service (QoS) provisioning over internet is essential for satisfying various types of internet-application requirements. The traffic classification and scheduling are the key functions to provide various kinds of class of service (CoS) under an overload condition. This paper investigates QoS performance in a network equipment testbed when implementing these main functions. We examine the major CoS functions provided by the Juniper T320 router, and measure their performance. In addition to fundamental analysis of the QoS behavior, we show the impact of QoS operations on a parallel system distributed in multi-domain networks as a practical case study of grid environments.     

IP QoS技术探讨及应用部署

本文以河北财政综合业务网改造过程中的IP QoS部署为例.对IP QoS技术发展的历史,标准和实际应用情况进行了回顾.选择差分服务作为综合业务网IPQoS部署模型.在全网路由器上部署统一策略的CBQ队列实现对不同业务应用的相应服务质量保证.从实际工作出发对TCP/UDP与IP QoS的关系.QoS在工作中的误区.IP QoS的测试方法以及需要注意的问题做出了较为深入的探讨.