A Scalable Pricing Model for Bandwidth Allocation

In this paper, we present a scalable pricing model for dynamic bandwidth allocation. Using simulation we demonstrate that service providers can achieve increased revenue as well as better resource utilization without compromising user specified levels of Quality of Service (QoS). Our model allows for increasing the revenue while maintaining an acceptable level of QoS, this is done by selecting an appropriate bandwidth allocation policy, to reduce the number of blocked users.     

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.     

Dynamic radio resource allocation for 3G and beyond mobile wireless networks

Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). Resource allocation and call admission control (CAC) are key management functions in future 3G and 4G cellular networks, in order to provide multimedia applications to mobile users with QoS guarantees and efficient resource utilization. There are two main strategies for radio resource allocations in cellular wireless networks known as complete partitioning (CP) and complete sharing (CS). In this paper, theses strategies are extended for operation in 3G and beyond network. First, two CS-based call admission controls, referred to herein as queuing priority call admission control (QP-CAC) and hybrid priority call admission control (HP-CAC), and one CP-based call admission control referred to as complete partitioning call admission control (CP-CAC) are presented. Then, this study proposes a novel dynamic procedure, referred to as the dynamic prioritized uplink call admission control (DP-CAC) designed to overcome the shortcomings of CS and CP-based CACs. Results indicate the superiority of DP-CAC as it is able to achieve a better balance between system utilization, revenue, and quality of service provisioning. CS-based algorithms achieve the best system utilization and revenue at the expense of serious unfairness for the traffic classes with diverse QoS requirements. DP-CAC manages to attain equal system utilization and revenue to CS-based algorithms without the drawbacks in terms of fairness and service differentiation.     

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.     

Formal QoS Policy Based Grid Resource Provisioning Framework

Grid resource provisioning is a complex task that is often compromised due to non-availability of the desired resources. The heterogeneous and dynamic nature of the Grid resources depends on the Quality of Service (QoS) based resource provisioning for allocation of appropriate resources to Grid applications. Until resource provisioning is considered a fundamental capability, predictable QoS cannot be delivered to the Grid consumers. A resource provisioning policy based on QoS parameters is required for efficient Grid resource provisioning. In this paper a resource provisioning framework has been proposed. This framework offers resource provisioning policy that caters to provisioned resource allocation and resource scheduling. The policy rules have been specified in XML schema. The policy has been validated by Z Formal specification language and implementation has been demonstrated through a case study. The experimental results demonstrate that QoS based provisioned approach is effective in minimizing cost and submission burst time of applications in comparison to the existing approaches.     

An Efficient Resource Allocation Mechanism for LTE–GEPON Converged Networks

Optical–wireless convergence is becoming popular as one of the most efficient access network designs that provides quality of service (QoS) guaranteed, uninterrupted, and ubiquitous access to end users. The integration of passive optical networks (PONs) with next-generation wireless access networks is not only a promising integration option but also a cost-effective way of backhauling the next generation wireless access networks. The QoS performance of the PON–wireless converged network can be improved by taking the advantages of the features in both network segments for bandwidth resources management. In this paper, we propose a novel resource allocation mechanism for long term evolution–Gigabit Ethernet PON (LTE–GEPON) converged networks that improves the QoS performance of the converged network. The proposed resource allocation mechanism takes the advantage of the ability to forecast near future packet arrivals in the converged networks. Moreover, it also strategically leverages the inherited features and the frame structures of both the LTE network and GEPON, to manage the available bandwidth resources more efficiently. Using extensive simulations, we show that our proposed resource allocation mechanism improves the delay and jitter performance in the converged network while guarantying the QoS for various next generation broadband services provisioned for both wireless and wired end users. Moreover, we also analyze the dependency between different parameters and the performance of our proposed resource allocations scheme.     

A novel pricing approach to support QoS in 3G networks

Pricing in 3G and other communication networks may control and manage the utilisation of network resources. The available network resources get strained with increased usage levels, which results in poor service to the users. Most users prefer receiving high quality services at affordable costs. This requires the provision of QoS guarantees for network services at a low cost. In a real business scenario, this relationship is hard to achieve; moreover revenue sources for network operators have been shifting from the provision of network access to provisioning of rich services, e.g. multimedia services. To attain a functional compromise, we propose a pricing scheme that relies on service profiles to manage resource utilisation in a DiffServ-enabled 3G network. The service profiles define the QoS achieved for accessing services through a common resource pool, in which resource sharing is used to maximise network resource utilisation, user satisfaction and profits for the network operators. In an NGN scenario users would select pricing profiles according to their budgets, and the network will map these profiles to a set of QoS options that may translate to the choice of an access network for service access. In this paper, we present the mathematical model of the proposed pricing scheme, the proposed design of an evaluation framework, QoS performance results, and a service provisioning scenario illustrating the applicability of the proposed pricing scheme.     

Resource management for bursty streams on multi-tenancy cloud environments

The number of applications that need to process data continuously over long periods of time has increased significantly over recent years. The emerging Internet of Things and Smart Cities scenarios also confirm the requirement for real time, large scale data processing. When data from multiple sources are processed over a shared distributed computing infrastructure, it is necessary to provide some Quality of Service (QoS) guarantees for each data stream, specified in a Service Level Agreement (SLA). SLAs identify the price that a user must pay to achieve the required QoS, and the penalty that the provider will pay the user in case of QoS violation. Assuming maximization of revenue as a Cloud provider’s objective, then it must decide which streams to accept for storage and analysis; and how many resources to allocate for each stream. When the real-time requirements demand a rapid reaction, dynamic resource provisioning policies and mechanisms may not be useful, since the delays and overheads incurred might be too high. Alternatively, idle resources that were initially allocated for other streams could be re-allocated, avoiding subsequent penalties. In this paper, we propose a system architecture for supporting QoS for concurrent data streams to be composed of self-regulating nodes. Each node features an envelope process for regulating and controlling data access and a resource manager to enable resource allocation, and selective SLA violations, while maximizing revenue. Our resource manager, based on a shared token bucket, enables: (i) the re-distribution of unused resources amongst data streams; and (ii) a dynamic re-allocation of resources to streams likely to generate greater profit for the provider. We extend previous work by providing a Petri-net based model of system components, and we evaluate our approach on an OpenNebula-based Cloud infrastructure.     

无线Ad Hoc网络中QoS感知的跨层资源分配算法

在分析无线Ad Hoc网络资源分配模型的基础上,提出一种QoS感知的跨层资源分配算法CL-QARA (cross layer QoS aware resource allocation).其主要思想是,引入价格作为资源分配的度量指标,以QoS带宽需求为参数,将网络层的动态资源分配信息与MAC层CSMA/CA接入机制相结合,以改进MAC层的冲突退避算法.设计了改进的退避算法和呼叫接入控制算法,以实现MAC层与网络层的跨层技术.通过QoS感知的资源分配算法和跨层技术协同工作,为QoS服务提供了业务保障.仿真结果表明,CL-QARA算法具有良好的收敛性和稳定性.与其他算法相比,CL-QARA能够有效地提供QoS保证,提高了网络的效用和性能.     

基于IEEE 802.16e的VoIP公平调度算法

针对IEEE802.16e未规定具体的服务质量调度算法的问题,提出一种适用于IP电话（VoIP）业务的算法,该算法包括额外带宽再分配策略和补偿机制,根据业务流的优先级分配额外带宽,滞后的流根据它所丢失的服务被补偿。仿真结果表明,经过一段时间,业务流实际接收的服务与它在理想无差错系统中所得到的服务的差近似为0。     

一种动态带宽分配策略及其性能分析

针对当前网络中不同业务的服务质量需求,综合考虑业务优先级及业务负载,提出一种动态带宽分配策略——E-DBA。建立具有多重工作休假机制的Geom/G/1排队模型,使用嵌入式马尔可夫链导出排队模型的稳态指标。给出E-DBA的平均响应时间和信道利用率等系统性能指标表达式,并通过实验分析了第II类业务的保障带宽对系统性能的影响。     

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.     

一种区分服务网络的设计与实现

给出了DiffServ网络的一种设计与实现，提出了一种有效的资源管理模型。在该模型中，存在一个带宽代理(Bandwidth Broker)同步多个边界节点的接纳控制，负责区分服务网络之间的SLA(Server Level Agreement)协商，进行路由器配置；边界节点使用RSVP协议为集聚流预留资源；RSVP使用预计算QoS路由寻找路径。整个模型不仅综合了已有资源管理方案的优点，而且保持了区分服务网络的可扩展性。     

Edge Provisioning and Fairness in VPN-DiffServ Networks

Customers of Virtual Private Networks (VPNs) over Differentiated Services (DiffServ) infrastructure are most likely to demand not only security but also guaranteed Quality-of-Service (QoS) in pursuance of their desire to have leased-line-like services. However, expectedly they will be unable or unwilling to predict the load between VPN endpoints. This paper proposes that customers specify their requirements as a range of quantitative services in the Service Level Agreements (SLAs). To support such services Internet Service Providers (ISPs) would need an automated provisioning system that can logically partition the capacity at the edges to various classes (or groups) of VPN connections and manage them efficiently to allow resource sharing among the groups in a dynamic and fair manner. While with edge provisioning a certain amount of resources based on SLAs (traffic contract at edge) are allocated to VPN connections, we also need to provision the interior nodes of a transit network to meet the assurances offered at the boundaries of the network. We, therefore, propose a two-layered model to provision such VPN-DiffServ networks where the top layer is responsible for edge provisioning, and drives the lower layer in charge of interior resource provisioning with the help of a Bandwidth Broker (BB). Various algorithms with examples and analyses are presented to provision and allocate resources dynamically at the edges for VPN connections. We have developed a prototype BB performing the required provisioning and connection admission.     

认知无线电网络基于QoS的监听时间与资源联合分配

以最大化所有认知无线电用户(CRU)的吞吐量为目标,同时保证每个CRU的服务质量(QoS)约束,研究了联合最优监听时间和资源分配问题,并基于此提出了一种监听时间与资源联合分配算法.在多信道认知无线电网络中,频谱监听和资源分配都会影响网络的吞吐量.兼顾二者的联合优化问题可以被分解为两个子问题:固定监听时间的资源分配问题, 以及固定资源分配策略的最优监听时间一维穷举搜索问题.提出的算法可以通过穷举搜索获得最优监听时间,并通过次梯度算法获得最优资源分配策略.仿真结果表明,提出的最优监听时间与资源分配算法可以最大化认知无线网络的吞吐量; 此外,各认知用户的QoS需求也能得到保证.     

QoS-aware distributed spectrum sharing for heterogeneous wireless cognitive networks

Ubiquitous wireless networking calls for efficient dynamic spectrum allocation (DSA) among heterogeneous users with diverse transmission types and bandwidth demands. To meet user-specific quality-of-service (QoS) requirements, the power and spectrum allocated to each user should lie inside a bounded region in order to be meaningful for the intended application. Most existing DSA methods aim at enhancing the total system utility. As such, spectrum wastage may arise when the system-wise optimal allocation falls outside individual users’ desired regions for QoS provisioning. The goal of this paper is to develop QoS-aware distributed DSA schemes using game-theoretic approach. We derive DSA solutions that respect QoS and avoid naively boosting or sacrificing some users’ utilities to maximize the network spectrum utilization. Specifically, we propose two game-based DSA algorithms: one resorts to proper scaling of the transmission power according to each user’s useful utility range, and the other embeds the QoS factor into the utility function used during gaming. To evaluate DSA schemes from a practical QoS perspective, we introduce two new metrics, namely “system useful utility” and “fraction of QoS-satisfied users”. Simulations confirm that the proposed DSA techniques outperform existing QoS-blind game models in terms of the spectrum sharing efficiency in heterogeneous networks. Convergence analysis of the proposed QoS-aware DSA algorithms is also provided.     

在线多点广播路由的动态方法探讨

多点广播是网络支持多媒体业务的关键技术之一。在线多点广播问题是指组中的成员加入或离开后多点广播路由树的更新问题。本文以服务质量（QoS)指标中的带宽和时延为优化选路准则，提出了一种受限的动态多点广播路由算法，仿真结果证明了该算法比传统算法更简洁。     

基于IEEE 802.16e协议的公平调度算法

无线城域网标准IEEE 802.16e规定了系统的服务质量（QoS）框架,并把所有服务划分为五种类型,但没有规定具体的QoS调度算法。提出了在不同的业务类型间进行资源调度的算法,并把所有的业务流划分为领先、同步、滞后三种状态,根据业务流的类型以及其所处的状态,采取两级额外带宽再分配策略和补偿机制。仿真结果显示使用该算法提高了系统的资源利用率,同时公平性也得到很好的保障。     

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

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

基于DQN的超密集网络能效资源管理

小基站的密集随机部署会产生严重干扰和较高能耗问题,为降低网络干扰、保证用户网络服务质量（QoS）并提高网络能效,构建一种基于深度强化学习（DRL）的资源分配和功率控制联合优化框架。综合考虑超密集异构网络中的同层干扰和跨层干扰,提出对频谱与功率资源联合控制能效以及用户QoS的联合优化问题。针对该联合优化问题的NP-Hard特性,提出基于DRL框架的资源分配和功率控制联合优化算法,并定义联合频谱和功率分配的状态、动作以及回报函数。利用强化学习、在线学习和深度神经网络线下训练对网络资源进行控制,从而找到最佳资源和功率控制策略。仿真结果表明,与枚举算法、Q-学习算法和两阶段算法相比,该算法可在保证用户QoS的同时有效提升网络能效。