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.     

Optimization for adaptive bandwidth reservation in wireless multimedia networks

In future wireless multimedia networks, user mobility management for seamless connection regarding realtime multimedia applications is one of the most important problems. In this paper we propose an opportunity-cost concept-based approach for adaptive bandwidth reservation with admission control for handover calls utilizing network traffic information. Excessive reservation guarantees low blocking probability of handover calls at the cost of high blocking probability of new calls. According to our survey, however, it may degrade bandwidth utilization while no prioritization for handover admissions degrades quality of service (QoS) for ongoing calls. We consider both QoS assurance and bandwidth utilization in order to optimize the amount of bandwidth to reserve for handover admissions. We believe that our scheme could be utilized as a guideline for cost-effective radio resource allocation in mobile multimedia networks.     

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.     

Integrated Multimedia Personal Communications with Asymmetric Services for Mobile Users in Cellular Systems

Wireless personal communication networks are evolving to provide integrated multimedia services to mobile users. An important issue in their design is the accommodation of various services each having predefined Quality-of-Service (QoS) requirements. Efficient resource utilization can be achieved using a medium access scheme that allows various traffic components to be statistically multiplexed and a call admission control to prevent overload. Some multimedia services have asymmetric resource needs. For example, web browsing generally requires more downlink bandwidth than uplink bandwidth. We present a medium access scheme and a call admission control algorithm for guaranteed QoS provisioning in asymmetric integrated multimedia personal communication networks. An overall performance analysis model is developed. Performance characteristics are calculated and presented for an example system.     

Scheduling and flexible control of bandwidth and in-transit services for end-to-end application workflows

End-to-end scientific application workflows that integrate high-end experiments and instruments with large scale simulations and end-user displays are becoming increasingly important. These workflows require complex couplings and data sharing between distributed components involving large data volumes and present varying hard (in-time data delivery) and soft (in-transit processing) quality of service (QoS) requirements. As a result, supporting efficient data transport is critical for such workflows. In this paper, we leverage software-defined networking (SDN) to address issues of data transport service control and resource provisioning to meet varying QoS requirements from multiple coupled workflows sharing the same service medium. Specifically, we present a flexible control and a disciplined resource scheduling approach for data transport services for science networks. Furthermore, we emulate an SDN testbed on top of the FutureGrid virtualized testbed and use it to evaluate our approach for a realistic scientific workflow. Our results show that SDN-based control and resource scheduling based on simple intuitive models can meet the requirements of the targeted workflows with high resource utilization.     

多业务流量预测动态带宽分配方法

静态带宽资源分配方法或基于业务分类的动态带宽分配方法等很难适应业务流特性,无法保证各级业务的服务质量。设计了流量预测及带宽分配模型,给出了流量预测计算方法,提出多业务流量预测动态带宽分配方法（MSTPDBA）,该方法基于业务预测流量的大小进行可用带宽的重新分配。仿真实验证明了MSTPDBA的有效性,能控制不同业务的时延,并提高了系统带宽资源的利用率。     

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.     

Fuzzy-based adaptive bandwidth control for loss guarantees

This paper presents the use of adaptive bandwidth control (ABC) for a quantitative packet loss rate guarantee to aggregate traffic in packet switched networks. ABC starts with some initial amount of bandwidth allocated to a queue and adjusts it over time based on online measurements of system states to ensure that the allocated bandwidth is just enough to attain the specified loss requirement. Consequently, no a priori detailed traffic information is required, making ABC more suitable for efficient aggregate quality of service (QoS) provisioning. We propose an ABC algorithm called augmented Fuzzy (A-Fuzzy) control, whereby fuzzy logic control is used to keep an average queue length at an appropriate target value, and the measured packet loss rate is used to augment the standard control to achieve better performance. An extensive simulation study based on both theoretical traffic models and real traffic traces under a wide range of system configurations demonstrates that the A-Fuzzy control itself is highly robust, yields high bandwidth utilization, and is indeed a viable alternative and improvement to static bandwidth allocation (SBA) and existing adaptive bandwidth allocation schemes. Additionally, we develop a simple and efficient measurement-based admission control procedure which limits the amount of input traffic in order to maintain the performance of the A-Fuzzy control at an acceptable level.     

Inter-autonomous system provisioning for end-to-end bandwidth guarantees

This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and establishing service level agreements for end-to-end bandwidth guarantees between ASes. We then present a network dimensioning system that uses traffic engineering mechanisms for the provisioning of end-to-end bandwidth guarantees. The network dimensioning system solves two problems: (1) the economic problem of how to determine the optimum amount of bandwidth that needs to be purchased from adjacent downstream ASes at a minimum total cost; (2) given the available bandwidth resources within and beyond the AS as a result of (1), the engineering problem of how to assign bandwidth guaranteed routes to the predicted traffic while optimizing the network resource utilization. We formulate both as integer-programming problems and prove them to be NP-hard. An efficient genetic algorithm and an efficient greedy-penalty heuristic are, respectively, used to solve the two problems and we show that these perform significantly better than simple heuristic and random approaches.     

A fair resource allocation protocol for multimedia wireless networks

Wireless networks are expected to support real-time interactive multimedia traffic and must be able, therefore, to provide their users with quality-of-service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts and scarcity of bandwidth makes QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in QoS can be exploited by protocol designers to significantly improve the overall performance of wireless systems. This paper presents a fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities. Our view of fairness was inspired by the well-known max-min fairness allocation protocol for wireline networks. Simulation results are presented that compare our protocol to similar schemes.     

Resource optimization algorithms for virtual private networks using the hose model

Virtual private networks (VPNs) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, service providers need efficient provisioning techniques that adapt to customer demands. The recently proposed hose model for VPN alleviates the scalability problem of the pipe model by reserving for aggregate ingress and egress bandwidths instead of between every pair of VPN endpoints. Existing studies on quality of service guarantees in the hose model either deal only with bandwidth requirements or regard the delay limit as the main objective ignoring the bandwidth cost. In this work we propose a new approach to enhance the hose model to guarantee delay limits between endpoints while optimizing the provisioning cost. We connect VPN endpoints using a tree structure and our algorithm attempts to optimize the total bandwidth reserved on edges of the VPN tree. Further, we introduce a fast and efficient algorithm in finding the shared VPN tree to reduce the total provisioning cost compared to the results proposed in previous works. Our proposed approach takes into account the user preferences in meeting the delay limits and provisioning cost to find the optimal solution of resource allocation problem. Our simulation results indicate that the VPN trees constructed by our proposed algorithm meet maximum end-to-end delay limits while reducing the bandwidth requirements as compared to previously proposed algorithms.     

Upper-level scheduling supporting multimedia traffic in cellular data networks

Wireless data networks such as cdma2000 1x EV-DO and UMTS HSDPA use downlink scheduling that exploits channel fading to increase the system throughput. As future wireless networks will eventually support multimedia and data traffic together, we need a proper criterion for scheduling that can count various service requirements such as delay and packet loss. Although some previous approaches proposed opportunistic schedulers at the lower layer, it has not been investigated well whether they are able to meet explicit QoS defined at the upper layer. Hence, in this paper, we develop a hierarchical scheduling model that considers QoS provisioning and the time-varying channel feature separately. We focus on the upper-level QoS scheduling that supports various traffic classes in a unified manner. Supposing that a user gets some satisfaction or utility when served, we introduce a novel concept of opportunity cost, which is defined as the maximum utility loss among users incurred by serving a particular user at the current turn. We obtain each user’s net profit by subtracting the opportunity cost from its expected utility, and then select a user with the maximum profit for service. Simulation results reveal that our scheme supports various QoS classes well that are represented by delay and packet loss under various traffic loadings.     

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

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

Minimizing Resource Cost for Camera Stream Scheduling in Video Data Center

Video surveillance service, which receives live streams from IP cameras and forwards the streams to end users, has become one of the most popular services of video data center. The video data center focuses on minimizing the resource cost during resource provisioning for the service. However, little of the previous work comprehensively considers the bandwidth cost optimization of both upload and forwarding streams, and the capacity of the media server. In this paper, we propose an efficient resource scheduling approach for online multi-camera video forwarding, which tries to optimize the resource sharing of media servers and the networks together. Firstly, we not only provide a fine-grained resource usage model for media servers, but also evaluate the bandwidth cost of both upload and forwarding streams. Without loss of generality, we utilize two resource pricing models with different resource cost functions to evaluate the resource cost: the linear cost function and the non-linear cost functions. Then, we formulate the cost minimization problem as a constrained integer programming problem. For the linear resource cost function, the drift-plus-penalty optimization method is exploited in our approach. For non-linear resource cost functions, the approach employs a heuristic method to reduce both media server cost and bandwidth cost. The experimental results demonstrate that our approach obviously reduces the total resource costs on both media servers and networks simultaneously.     

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     

一种基于优先级的Ad hoc网络QoS模型*

提出一种基于优先级业务分类的Ad hoc网络QoS模型,它能够为多种优先级多种类别的业务提供不同等级的服务。源端判断业务是否允许接入,中间节点只负责转发允许接入的业务。在资源不足的情况下,能为最高优先级业务提供相对稳定的带宽资源,高优先级业务能获得比低优先级业务更高的调度权限。通过OPNET下的仿真,证明该模型能满足不同级别QoS的要求。     

An efficient resource provisioning approach for analyzing cloud workloads: a metaheuristic-based clustering approach

With the recent advancements in Internet-based computing models, the usage of cloud-based applications to facilitate daily activities is significantly increasing and is expected to grow further. Since the submitted workloads by users to use the cloud-based applications are different in terms of quality of service (QoS) metrics, it requires the analysis and identification of these heterogeneous cloud workloads to provide an efficient resource provisioning solution as one of the challenging issues to be addressed. In this study, we present an efficient resource provisioning solution using metaheuristic-based clustering mechanism to analyze cloud workloads. The proposed workload clustering approach used a combination of the genetic algorithm and fuzzy C-means technique to find similar clusters according to the user’s QoS requirements. Then, we used a gray wolf optimizer technique to make an appropriate scaling decision to provide the cloud resources for serving of cloud workloads. Besides, we design an extended framework to show interaction between users, cloud providers, and resource provisioning broker in the workload clustering process. The simulation results obtained under real workloads indicate that the proposed approach is efficient in terms of CPU utilization, elasticity, and the response time compared with the other approaches.

     

Service Adaptability in Multimedia Wireless Networks

Next-generation wireless communication systems aim at supporting wireless multimedia services with different quality-of-service (QoS) and bandwidth requirements. Therefore, effective management of the limited radio resources is important to enhance the network performance. In this paper, we propose a QoS adaptive multimedia service framework for controlling the traffic in multimedia wireless networks (MWN) that enhances the current methods used in cellular environments. The proposed framework is designed to take advantage of the adaptive bandwidth allocation (ABA) algorithm with new calls in order to enhance the system utilization and blocking probability of new calls. The performance of our framework is compared to existing framework in the literature. Simulation results show that our QoS adaptive multimedia service framework outperforms the existing framework in terms of new call blocking probability, handoff call dropping probability, and bandwidth utilization.      

On utility-fair bandwidth adaptation for multi-class traffic QoS provisioning in wireless networks

The ability to adjust the allocated bandwidth of ongoing calls to cope with wireless network resource fluctuations is becoming increasingly important. In this paper, we describe a utility-based bandwidth adaptation scheme for multi-class traffic quality-of-service (QoS) provisioning in wireless networks. With the proposed scheme, each call is assigned a utility function according to its adaptive characteristics. Depending on the network load the allocated bandwidth of ongoing calls are upgraded or degraded dynamically such that each call receives fair utility. The quantization of utility function by dividing the utility range into a fixed number of equal intervals is a key feature of our proposed utility-fair algorithm. Appropriate call admission control and bandwidth reservation policies are also integrated into the proposed scheme to provide QoS guarantees to the new and handoff calls. Extensive simulation experiments have been conducted to evaluate the performance of the proposed scheme compared with two other existing ones. Results show that our bandwidth adaptation scheme is effective in achieving utility fairness while keeping the call blocking and handoff dropping probabilities substantially low.