Dynamic bandwidth allocation for Internet telephony

Internet telephony is promising for long-distance calls because of its low service charge and value-added functions. To provide Internet telephony to the general public, a service provider can operate a telephone gateway in each servicing city to bridge the local telephone network and the Internet, so that users can use telephones or fax machines to access this gateway for services. In this paper, we propose a dynamic bandwidth allocation scheme for two purposes: (1) each telephone gateway can fully utilize the available bandwidth to serve more telephone and fax sessions and (2) it can respond to the changing environments. We exploit three properties for dynamic bandwidth allocation. First, in a telephone session, each user usually alternates between speaking and listening. When a user is not speaking, she does not send any voice stream and hence the bandwidth can be dynamically released from this session for the other sessions. Second, voice traffic is elastic because it can be further compressed at the cost of a lower quality. Third, fax traffic is flexible because it can be temporarily delayed. We exploit these three properties to allocate bandwidth to telephone and fax sessions dynamically. When a telephone gateway adopts dynamic bandwidth allocation, it can serve more telephone and fax sessions while providing acceptably good quality-of-service (QoS), and it can give more stable QoS when the available bandwidth varies.     

QoS Control for NGN: A Survey of Techniques

This article presents an overview of standards and a survey of recent work on quality of service (QoS) control of next generation networks (NGNs). We outline primarily standardized QoS control architectures with respect to the service and transport strata of NGN. In the service stratum, QoS parameter negotiation using core IP multimedia subsystem (IMS) procedures is described. In the transport stratum, the resource control and admission schemes of IMS (3GPP), resource admission control function (ITU-T), and resource access control system (ETSI/TISPAN) are explained and compared with each other in terms of QoS coverage and number of required signaling messages. In addition, we give a survey of papers on QoS control architectures, which further strengthen existing standards by adaptively managing QoS modification according to user’s QoS changes and consistent QoS support for mobile users. Finally, we conclude this article with a discussion of further work of the QoS control for NGN.     

基于用户预算和服务质量的动态频谱接入

在动态频谱接入网络中,如何通过频谱地图有效地获得频谱的使用是一个亟待解决的问题。目前主要通过频谱运营商将可用频段销售给用户的方式实现频谱接入。针对用户的实际支付能力和服务质量(QoS)需求不同,提出联合预算和功率控制方案。将运营商和用户建模成两阶段的Stackelberg博弈模型,运营商根据用户的预算和QoS需求动态调整频谱价格,用户根据频谱价格改变自己的需求,最后证明了用户和运营商最大收益的纳什均衡解的存在性和唯一性。仿真结果表明:在多次交换信息后,用户预算的总和是整个网络收益的上限,用户和运营商均能获得最大收益且达到纳什均衡。     

MPLS VPN中动态服务质量机制的应用

在部署MPLS VPN时,接入服务商边缘路由器的各VPN场点存在闲置资源,也可能有突发的带宽资源需求。针对这些问题,提出一种改进的动态服务质量机制。设计实时流量监测预测模块,采用LGP算法对实时流量的峰值进行高概率预测,达到动态预留资源的目的。设计闲置资源再分配模块,把闲置资源用于再分配,为用户提供订制带宽以外的资源抢占业务。仿真实验表明,将该机制应用于MPLS VPN区分服务中,能有效提高服务质量。     

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.     

MQ: an integrated mechanism for multimedia multicasting

This paper studies the integration of multimedia multicasting, with the consideration of multicast with end-to-end QoS guarantees by resource reservation, dynamic join and departure of participants, user heterogeneity, scalability, robustness, and loop-free control. A protocol called MQ, Multicast with QoS, is proposed to support multimedia group communications with QoS guarantees for heterogeneous recipients. With MQ, while resource reservation is de-coupled from QoS multicast routing, they are integrated in a way to avoid the problem of “sender-oriented” path determination, a problem that occurs when RSVP is used in conjunction with QoS routing for heterogeneous reservations. Being a truly receiver-oriented and integrated scheme for multimedia multicasting, MQ supports such integration in a robust, scalable and loop-free way. It also accommodates heterogeneous users with varied QoS, dynamically adjusts QoS trees to improve resource utilization, and guarantees end-to-end QoS requirements. We have conducted simulations to evaluate the performance of the proposed mechanism. MQ demonstrates its advantages over the conventional loosely coupled integration of TP multicasting, resource reservation and QoS routing, in terms of better accommodation of heterogeneous users, higher scalability, lower blocking probability for users to join groups with service guarantees, and more efficient resource utilization to enhance system performance     

基于业务QoS保证的中继系统资源分配算法

在基于正交频分多址（OFDMA）的中继系统中,为了满足用户的QoS要求,保证系统的吞吐量最大的同时又保证用户公平性,给出了一种面向业务服务质量的资源分配算法。先根据用户在队列中的等待时延和用户对速率的需求引入时延优先级因子和速率优先级因子,以此计算用户的优先级。然后分别在回程链路和接入链路进行动态资源调度与分配。仿真结果表明,新算法能够兼顾中继用户和直传用户的性能,实现低丢包率、较好地满足 GBR需求,实现较高的系统吞吐量和公平性。     

Unlocking the Advantages of Dynamic Service Selection and Pricing

Bandwidth limitations, resource greedy applications verbose mark-up languages and an increasing number of voice and data users are straining the air interface of wireless networks. Hence, novel approaches and new algorithms to manage wireless bandwidth are needed. In addition, usage based pricing is becoming increasingly prevalent (pre-paid cell phones, calling cards, non-contract minutes, etc.). This paper unlocks the potential to improving the performance of overall system behavior by allowing users to change service level and/or service provider for a (small) price. The ability to dynamically re-negotiate service gives the user the power to control QoS while minimizing usage cost. On the other hand, the ability to change service level pricing dynamically allows the service providers to manage traffic better, improve resource usage and most importantly maximize their profit. This provides a surprising win-win situation for BOTH the service providers AND the users. In this paper we present easy to implement on-line algorithms to minimize the overall usage cost to individual mobile users. This on-line algorithm continuously receives pricing information and evaluates minimum QoS requirements. The algorithm then determines appropriate service level, chooses a service provider and sets a time for re-negotiation dynamically. Our algorithm can handle many practical issues such as capacity limitations, arbitrary price fluctuations and loss/gain of service providers due to mobility. Our results do not assume any specific technologies and can be applied to any environment that can employ dynamic pricing, including wired networks. In fact, dynamic pricing is becoming increasingly desirable since service provider and capacity changes are a growing by-product of mobility. Arriving and departing users at/from a cell tower (or wireless LAN) can effectively reduce or increase the available bandwidth in a cell (or LAN transmission area) and represents a natural opportunity for a pricing change.     

Adaptive QoS Control Based on Benefit Optimization for Video Servers Providing Differentiated Services

We propose and analyze quality of service (QoS) control algorithms for video servers designed to provide differentiated video streaming services. The design concepts are based on resource reservation and benefit optimization so that resources are reserved dynamically and adaptively for different QoS levels in response to the changing workload of the system, with the objective of maximizing the benefit throughput obtainable by the system. We analyze the benefit throughput obtainable by the system for a baseline algorithm for which the QoS levels of admitted users are not changed during the service lifetime and a greedy algorithm that may raise QoS levels of admitted users due to resources being free from departure events. We validate the design of these two QoS control algorithms via a detailed simulation study.     

Managing database server performance to meet QoS requirements in electronic commerce systems

The performance of electronic commerce systems has a major impact on their acceptability to users. Different users also demand different levels of performance from the system, that is, they will have different Quality of Service (QoS) requirements. Electronic commerce systems are the integration of several different types of servers and each server must contribute to meeting the QoS demands of the users. In this paper we focus on the role, and the performance, of a database server within an electronic commerce system. We examine the characteristics of the workload placed on a database server by an electronic commerce system and suggest a range of QoS requirements for the database server based on this analysis of the workload. We argue that a database server must be able to dynamically reallocate its resources in order to meet the QoS requirements of different transactions as the workload changes. We describe Quartermaster, which is a system to support dynamic goal-oriented resource management in database management systems, and discuss how it can be used to help meet the QoS requirements of the electronic commerce database server. We provide an example of the use of Quartermaster that illustrates how the dynamic reallocation of memory resources can be used to meet the QoS requirements of a set of transactions similar to transactions found in an electronic commerce workload. We briefly describe the memory reallocation algorithms used by Quartermaster and present experiments to show the impact of the reallocations on the performance of the transactions. Published online: 22 August 2001     

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.     

基于P2P计算的动态多副本开销模型

在多个结点上保持副本是提高P2P或网格计算环境可用性的一个有效途径。不可靠的对等点和网络环境以及用户访问模式的多样性使得难以确定多少个副本能够满足用户高可用性的需求。文章提出了一种最小开销模型来预测和动态控制副本数量。为了隐藏系统中对等点的不可靠性,在考虑多副本的同时通过一种冗余机制预测系统中的副本数量。仿真结果表明,该系统具有更好的可用性和低的副本开销。     

Resource scheduling with conflicting objectives in grid environments: Model and evaluation

The paper is to consider resource scheduling with conflicting objectives in the grid environment. The objectives of the grid users, the grid resources and the grid system clash with each other. Grid users want to access enough system resources to achieve the desired level of quality of service (QoS). Resource providers pay more attention to the performance of their resources. Our resource scheduling employs market strategies to determine which jobs are executed at what time on which resources and at what prices. A grid resource provider uses its utility function to maximize its profit and a grid user uses its utility function to complete tasks while minimizing its spending. The paper proposes grid system objective optimization scheduling that provides a joint optimization of objectives for both the resource provider and grid user, which combines the benefits of both resource provider objective optimization and user objective optimization. Experiments are designed to study the performances of three resource-scheduling optimization algorithms. Performance metrics are classified into efficiency metrics, utility metrics and time metrics.     

一种改进的网格资源调度算法及其有色Petri网建模和分析

在Sufferage算法基础上提出了一种改进的网格资源调度算法ISufferage,从两个方面进行了改进:(1)考虑执行开始前输入数据以及执行完成后输出数据的存取和传输时间对调度决策产生的影响;(2)在算法中考虑用户的QoS要求,在追求最小的任务完成时间的同时兼顾用户QoS要求.为了对改进算法进行性能分析和评价,使用有色Petri网对网格调度系统和ISufferage算法进行了建模和仿真分析.结果表明,ISufferage比Sufferage算法更适合于实际的网格环境,能更好地满足用户的QoS要求.     

RSVP协议在移动IPv6网络中的扩展性研究

针对无线移动通信的特点,提出了一种在移动IPv6网络中保障用户通信服务质量的资源预留新方案Fast RSVP.该方案采用跨层设计的思想,将两个不同层次的模块:移动IPv6模块和RSVP模块结合起来,通过在两个模块之间增加一些原语使得二者配合工作以保证移动用户的通信业务质量.Fast RSVP方案引入了邻居隧道提前资源预留、优化路径资源预留、切换预留、路径融合等一系列新机制.仿真实验结果表明,与其他移动环境中的RSVP扩展方案相比,该Fast RSVP方案在支持无线移动通信方面具有如下优势:(1)能够实现移动节点带有服务质量保证的快速切换;(2)能够避免移动IP切换过程中三角路由和重复预留造成的资源浪费;(3)能够区分不同类型的切换预留请求,在保证网络整体性能的前提下显著降低因为切换而导致的服务中断率.     

A multimedia service composition scheme for ubiquitous networks

It is a challenging task to develop a high quality and secure multimedia service for mobile terminals used in the ubiquitous computing environment. One of the issues is the resource limitation of mobile terminals. In this paper, we presented a multimedia service composition scheme for sharing computer and communication resources by using plural terminals to compensate for this resource limitation. The proposed scheme is based on user authentication, service access control, and the multi-agent-based adaptive Quality-of-Service (QoS) control framework that we developed. We also proposed a novel access mode control based on the trustworthiness of users and extension of the multi-agent-based adaptive QoS control framework to plural users. Focusing on the home network as a typical ubiquitous network, we implemented a prototype testbed system and showed experimental results for the multimedia service composition.     

基于马尔科夫链的联合呼叫接入控制算法

异构网络的接入策略与网络资源管理效率紧密相关;同时,网络复杂性与网络资源竞争性直接影响到用户服务质量。针对异构网络接入控制存在的切换掉话率和呼叫阻塞率高、资源利用率低等问题,提出了基于马尔科夫链的联合呼叫接入控制算法。接入控制算法为切换呼叫业务、实时业务动态地预留了一定的带宽资源,根据不同业务设置带宽降级因子来决定是否释放带宽;同时,根据用户偏好和不同业务的QoS要求,构建了呼叫接入控制效用函数,利用马尔科夫链进行了建模分析。仿真表明,算法提高了网络资源利用率,降低了系统复杂度,满足了各类业务的QoS要求。     

Autonomous and adaptive resource allocation among multiple nodes and multiple applications in heterogeneous wireless networks

In the forthcoming future, various means of wireless communication, such as cellular, Wi-Fi, WiMAX, and DSRC, will be available to mobile users and applications. With the development of wireless communication and mobile devices, more and more users and applications will be accommodated in mobile environment. Since mobile users and applications compete for the limited wireless resources whose communication quality dynamically change, we need an adaptive mechanism for mobile users and applications to share the available network resources while satisfying each application?s QoS requirements. In this paper, we propose an adaptive resource allocation mechanism where each node autonomously determines wireless network resources to assign to each of networked applications running on it. For this purpose, we adopt an attractor composition model, which is based on an autonomous and adaptive behavior of biological systems. Through numerical analysis, we confirmed that our mechanism could adaptively and stably allocate wireless network resources to applications, while considering their QoS requirements and fairly sharing network resources with other nodes. It also is shown that our mechanism superiors to a mechanism where a node determines resource allocation by solving an optimization problem.     

Adaptive security protocol selection for mobile computing

The mobile computing paradigm has introduced new problems for application developers. Challenges include heterogeneity of hardware, software, and communication protocols, variability of resource limitations and varying wireless channel quality. In this scenario, security becomes a major concern for mobile users and applications. Security requirements for each application are different, as well as the hardware capabilities of each device. To make things worse, wireless medium conditions may change dramatically with time, incurring great impact on performance and QoS guarantees for the application. Currently, most of the security solutions for mobile devices use a static set of algorithms and protocols for services such as cryptography and hashes.In this work we propose a security service, which works as a middleware, with the ability to dynamically change the security protocols used between two peers. These changes can occur based on variations on wireless medium parameters and system resource usage, available hardware resources, application-defined QoS metrics, and desired data “security levels”. We compare our solution to some widespread static security protocols, demonstrate how our middleware is able to adapt itself over different conditions of medium and system, and how it can provide a performance gain in the execution of cryptographic primitives, through the use of data semantics.     

基于区间Mamdani模糊推理的认知无线网络频谱迁移方案

机会式频谱接入技术虽能够有效提升认知无线网络频谱利用率,但在保障认知用户服务质量(quality of service, QoS)以及频谱资源有效利用率方面存在不足.为了提高认知用户QoS,提升认知无线网络系统性能,提出一种基于区间Mamdani模糊推理的认知无线网络频谱迁移方案.通过引入预判决方法减少不必要的数据量和系统开销.综合考虑待迁移频谱的频谱占用率以及链路维持率,并利用模糊推理计算出频谱迁移度,指导认知用户迁移至最优的频谱空穴.为了缩短模糊推理时长,提出区间Mamdani模糊推理方法.仿真结果表明,该方案能够降低认知用户业务传输的强制中断率、重传率以及频谱迁移次数,在维持较高系统吞吐量的同时,提高认知无线网络频谱资源的有效利用率.