Fairness of traffic controls for inelastic flows in the Internet

In best-effort networks, fairness has been used as a criterion to guide the design of traffic controls. The notion of fairness has evolved over time, from simple equality to a form of equality modulated by the user’s need (e.g. max–min and proportional fairness). However, fairness has always been defined on a per-user basis for a deterministic workload. In this paper, we argue that we must redefine the notion of fairness when we study traffic controls for the co-existence of elastic and inelastic traffics. Our results indicate that subjecting inelastic flows to fairness congestion control on a per-flow basis does not necessarily maximize the network’s utility. Instead, inelastic flows may follow their own form of traffic control, such as admission control (without congestion control). At the aggregate level, our results indicate that it still makes sense to maintain a balance between elastic and inelastic traffic. In order to support our arguments, we develop a methodology for comparing different traffic controls for given utility functions and different workloads, both deterministic and stochastic.     

基于测量的接纳控制研究

与传统的接纳控制算法相比,基于测量的纳控制有诸多优点,首先它无需知识应用的流量模型,其次它能动态适应网络的负载变化,提高网络资源的利用率。文中分析了基于测量的接纳控制的基本思想,并在此基础上提出和实现了一种自适应的接纳控制算法（Adaptive Measurement-Based Admission Control,AMBAC).作者通过实验对该算法进行了验证,发现在系统资源利用率（或接纳能力）接近的情况下,与传统的（固定时间窗口的）,MBAC相比,AMBAC能达到更低的平均分组丢失率。     

Joint call and packet QoS in cellular packet networks

This paper proposes a novel call admission control scheme capable of providing a combination of call and packet level quality of service requirements in cellular packet networks. Specifically, we propose a distributed call admission control scheme called PFG, which maximizes the wireless channel utilization subject to a predetermined bound on the call dropping and packet loss probabilities for variable-bit-rate traffic in a packet-switched wireless cellular network. We show that in wireless packet networks, the undesired event of dropping an ongoing call can be completely eliminated without sacrificing the bandwidth utilization. Extensive simulation results confirm that our scheme satisfies the hard constraint on call dropping and packet loss probabilities while maintaining a high bandwidth utilization.     

基于Tetrolet变换的图像降噪新算法

通过在Tetrolet变换域利用最小化均方误差的SURE无偏估计方法对图像进行去噪处理,利用图像Tetrolet变换的多尺度框架和方向性来保留原始图像的边缘和纹理等重要信息,同时在Tetrolet变换域中用SURE无偏估计方法代替经典的硬阈值函数来对图像进行去噪。实验结果表明了该算法的有效性,其更高的峰值信噪比和更好的视觉效果说明该算法是可行的。     

IEEE 80211e中基于自适应信道预留的接纳控制算法*

为了在WLAN标准IEEE 802.11e中高效、高质量地传输各类业务,以及保证业务之间的公平性,提出一种基于自适应信道预留的接纳控制算法。算法中首先采用资源共享的方法提前为业务预留适当的信道资源,使用信道利用率作为接入准则,当网络资源不足时采用自适应地调节已经接入业务流的服务质量来满足新请求的业务流的服务质量需求。结果表明,该算法保证了各业务之间的公平性以及服务质量需求,而且最大程度地接入了更多的业务流,提高了网络的整体性能。     

Admission control for differentiated services in future generation CDMA networks

Future Generation CDMA wireless systems, e.g., 3G, can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As radio resources are limited, we propose an admission control rule that protects users with stringent transmission bit-rate requirements (“streaming traffic”) while offering sufficient capacity over longer time intervals to delay-tolerant users (“elastic traffic”). While our strategy may not satisfy classical notions of fairness, we aim to reduce congestion and increase overall throughput of elastic users. Using time-scale decomposition, we develop approximations to evaluate the performance of our differentiated admission control strategy to support integrated services with transmission bit-rate requirements in a realistic downlink transmission scenario for a single radio cell.     

一种支持宽带无线多媒体网络QoS的动态呼叫接纳策略

在无线网络中,小区微型化的趋势使得呼叫切换发生的频率越来越高,迫切需要一种有效的呼叫接纳控制策略,对有限的无线带宽资源进行分配,以保证切换时的QoS,同时使带宽利用率最高。传统的预留带宽策略(GC,guard channel scheme)由于其固有的静态特征而不能适应流量模式的变化。最近,人们发现采用动态的随机控制策略能适应流量模式的变化,而且能使精度和稳定性大大提高。但将这种策略应用于多业务环境依然十分困难,挑战来自于多类呼叫的QoS要求、流量模式、切换率的多样性和宽带条件下的实时可计算性。在文[3]中,我们建立了一个随机控制模型,可以在宽带条件下实时地进行多业务接纳控制,但由于没有考虑复杂的边界条件,控制精度受到影响。本文,我们在考虑边界条件的情况下,求解该随机问题,并采用一种有效的数值方法,使计算复杂度大大降低,保证了计算的实时性。最后得到的多业务动态接纳控制策略具有较高的控制精度和良好的可计算性。仿真结果显示该策略能稳定地满足多业务QoS对呼叫中断概率的严格限制,同时又能保证信道的高利用率。     

基于测量的接纳控制方案比较研究

基于测量的连接接纳控制(Measurement—based Connection Admission Control，MBCAC)通过实时的业务流测量从而对新连接请求做出接受与否的决定．MBCAC无须事先了解业务流的流量模型并能根据通过测量得到的数据动态适应网络灸栽的变化，所以近来受到了重视．分析了与接纳控制有关的问题．提出了一种新的MBcAC分类方法，并通过实验比较了几种MBCAC方案的实现复杂性、可扩展性和带宽利用率等．同时，实验结果也显示出了通过测量汇集流的信息计算有效带宽的方法可以在保证服务质量(QoS)的前提下得到较高的网络资源(带宽)利用率．     

Application Semantics and Seamlessness Based Admission Control Policy for Multimedia Mobile Networks

With the advent of different types of applications in bandwidth scarce cellular environment, efficient usage of bandwidth while providing the required Quality of Service (QoS) for these applications becomes a challenging issue. In a cellular environment, there is always a tradeoff between the efficient usage of network bandwidth and uninterrupted (seamless) communication to each user. The paramount importance is always given to the seamlessness, which could be achieved by the reservation based call admission policies. The degree of seamlessness is proportional to the amount of reservation. The objective of any call admission policy is to provide seamless communication with better bandwidth usage. This paper aims at achieving this objective by improving the Shadow Cluster call admission algorithm proposed recently in [8] for providing a high degree of seamlessness. Our proposed scheme exploits application semantics (loss profile) and delay properties of the application during call admission for better bandwidth utilisation and call acceptance. Moreover, efficient usage of bandwidth is highly desired under peak load conditions and the same is achieved by our scheme. We have conducted extensive simulation studies to evaluate the effectiveness of the proposed scheme under diverse traffic conditions by comparing it with the shadow cluster algorithm. The results clearly indicate that our scheme offers better bandwidth utilization and call acceptance rate than the shadow cluster algorithm for the same call drop percentage.     

Integration of pricing with call admission control to meet QoS requirements in cellular networks

Call admission control (CAC) plays a significant role in providing the desired quality of service (QoS) in cellular networks. We investigate the role of pricing as an additional dimension of the call admission control process in order to efficiently and effectively control the use of wireless network resources. First, we prove that, for a given wireless network, there exists a new call arrival rate which can maximize the total utility of users while maintaining the required QoS. Based on this result and observation, we propose an integrated pricing and call admission control scheme where the price is adjusted dynamically based on the current network conditions in order to alleviate the problem of congestion. Our proposed integrated approach implicitly implements a distributed user-based prioritization mechanism by providing negative incentives according to the current network conditions and therefore shaping the aggregate traffic in the network. We compare the performance of our approach in terms of congestion prevention, achievable total user utility, and obtained revenue, with the corresponding results of conventional systems where pricing is not taken into consideration in the call admission control process. These performance results verify the considerable improvement that can be achieved by the integration of pricing in the call admission control process in cellular networks.     

调度和拥塞控制相结合的无线网络资源分配模型

研究了基于WLAN访问Internet的网络基站处流,提出了一种基于队列长度的调度方法和基于信道容量的拥塞控制模式,以达到网络资源的公平分配,并解决由于不恰当处理基站处堆积数据包而引起的弊端。在提出的资源分配模型中,调度算法根据各条流堆积的队列长度来随机地选择将要发送的数据分组;而拥塞控制模式中,将链路使用率作为拥塞指示,通过计算,平等地反馈给每一条流的发送端。发送端根据反馈到的拥塞信息来调整发送速率,以达到资源分配的公平性。仿真的结果表明：各条流能公平地共享无线网络的带宽。此算法的最大的优点在于基站不需要按照某种特定的公平性定义来选择数据包却能达到很高的公平性。     

A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks

In current wireless networks, the radio systems are regulated by a fixed spectrum assignment strategy. This policy partitions the whole radio spectrum into a fixed number of radio ranges, each exclusively assigned to a specific user. Such a spectrum assignment strategy leads to an undesirable condition under which some systems only use a small portion of the allocated spectrum while the others have very serious spectrum insufficiency. The learning automata-based cognitive radio which is proposed in this paper is a highly potential technology to address the spectrum scarcity challenges in wireless ad hoc networks. This paper proposes a learning automata-based dynamic frame length TDMA scheme for slot assignment in clustered wireless ad-hoc networks with unknown traffic parameters, where the intra-cluster communications are scheduled by a TDMA scheme, and a CDMA scheme is overlaid on the TDMA to handle an interference-free inter-cluster communication. In this method, each cluster-head is responsible for a collision-free slot assignment within the cluster and determines the input traffic parameters of its own cluster members. It then takes these traffic parameters into consideration for an optimal channel access scheduling in the cluster. The medium access control layer in each cluster is based on a time division multiple access (TDMA) scheme, in which each host is assigned a fraction of the TDMA frame proportional to its traffic load. The simulation experiments show the superiority of our proposed slot assignment algorithm over the existing methods in terms of the channel utilization, control overhead, and throughput, specifically, under bursty traffic conditions.     

区分服务网络基于测量的接纳控制方案的设计与应用

提出了一种分布式可扩展的接纳控制方案，其目的是为区分服务网络提供端到端服务质量（Quality of Services,QoS)保证，该方案主要由以下部分构成：（1）连接接纳控制协议，主要负责主机和网络节点以及网络节点和带宽代理之间的信息传送，实现对连接请求的串行操作；（2）位于网络核心节点的可用带宽估计算法；（3）位于网络边缘节点的接纳控制算法；给出了该方案在视频传输方面的应用实例；利用多种网络拓扑结构和QoS指标评价该方案的性能，实验结果表明该方案能准确地控制可接纳区域和提高网络资源的利用率。     

一种基于博弈论的智能QoS静态通信量疏导模式

支持服务质量与提高带宽利用率是IP/DWDM光Internet需要解决的主要问题之一。该文引入博弈论知识和分层图思想,以最小化网络资源占用率和最大化总体QoS满意度为目标,设计了一种基于人工免疫算法的静态通信量疏导模式,支持网络提供方效用与用户效用的Nash均衡。仿真研究表明,该模式是可行的和有效的。     

Admission control scheme based on priority access for wireless LANs

In order to support the quality of service (QoS) requirements at the medium access control (MAC) layer, the enhanced distributed channel access (EDCA) has been developed in IEEE 802.11e standard. However, it cannot guarantee the stringent real-time constraints of multimedia applications such as voice and video without an efficient method of controlling network loads. In this paper, we propose a measurement-based admission control scheme, which is made up of two parts: priority access and admission control. First, in order to measure the channel status per traffic type, we propose a priority access mechanism in which each priority traffic is distinguished by a busy tone, and separately performs its own packet transmission operation. Then, admission control mechanism protects existing flows from new ones, and maintains the QoS of the admitted flows based on the measured channel status information. Performance of the proposed scheme is evaluated by simulation. Our results show that the proposed scheme is very effective in guaranteeing the QoS of multimedia applications as well as in avoiding the performance starvation of low priority traffics.     

On Sustained QoS Guarantees in Operated IEEE 802.11 Wireless LANs

Most of QoS-capable IEEE 802.11 MAC protocols are unable to deliver sustained quality of service while maintaining high network utilization, particularly under congested network conditions. The problem often resides in the fact that flows belonging to the same service class are assigned the same MAC parameters regardless theirs respective bitrate, which leads to throughput fairness rather than perceived QoS fairness. Harmonizing MAC parameters of traffic classes's flows may further lead to sub-optimal situations since certain network configurations (in terms of per class traffic load) can not be accommodated without reassigning the basic MAC parameters. In this paper, we propose a new cross-layer MAC design featuring a delay-sensitive backoff range adaptation along with a distributed flow admission control. By monitoring both MAC queue dynamics and network conditions, each traffic class reacts based on the degree to which application QoS metrics (delay) are satisfied. Besides, we use a distributed admission control mechanism to accept new flows while protecting the active one. Simulation results show that compared to the enhanced distributed coordination function (EDCA) scheme of 802.11e, our protocol consistently excels, in terms of network utilization, bounded delays, and service-level fairness.     

宽带卫星网络中基于跨层设计的带宽分配研究

传统的带宽分配策略按照分层结构进行设计,集中在链路层解决问题,没有考虑动态变化的信道状态和所承载的数据流的QoS性能。基于跨层设计的思想,针对支持话音业务和Internet数据业务的卫星网络提出了一种基于跨层设计的带宽分配算法。该策略将应用层的业务特性和数据链路层的带宽分配策略以及物理层的信道状态进行跨层优化。主控站通过建立代价函数的方法将所有相关参数综合考虑,利用动态规划算法得到了最佳的带宽分配方案。数值结果表明：跨层设计方式可以适应变化的信道状态,并且同传统带宽分配算法比较,提高了Internet数据的有效吞吐量并且保持了话音业务的QoS要求。     

自适应带宽的最大-最小公平性拥塞控制

带宽共享和拥塞控制对于Internet的健壮性和公平性是很重要的研究课题.对交换设备中流量共享拥塞链路的带宽公平分配进行研究,提出一个优化交换设备带宽的设置算法:根据出端口接收速率自适应设置入端口带宽门限,对入端口的带宽进行动态重新分配,提高资源利用率.模拟实验表明,此算法有以下优点:1)高适应性;2)最大最小公平性;3)快速响应网络变化;4)高可靠性;5)稳定性.     

The probability relationship between video’s instantaneous and average aggregate rates

The growing demand for video applications and services has contributed substantially to the increase of video traffic on the Internet. Measurement-based admission control was proposed with the primary aim of eliminating or reducing the need of flow state information; also to control overhead for admission decision and maximize utilization at the potential cost of QoS degradation. Some of the admission algorithms depend on the instantaneous rate for its operation. On the other hand, the average aggregate rate has been proposed to better suit variable rate such as video traffic. In this paper, we investigate the probability relationship between the instantaneous and average aggregate rates for video traffic. A mathematical model has been developed to quantify the probability relationship between both rates and validated through extensive simulations using real video sequences. The average rate was found to be lower than instantaneous for a small number of flows, however there was no pronounced difference for a large number of flows. Furthermore, the difference between both rates increases for fast moving content such as sport or longer measurement time window.     

DiffServ网络中接纳控制方法的研究

深入分析了DiffServ网络中接纳控制方法的缺点,提出了一种新的接纳控制方法.该方法将边界和内部接纳控制分开进行.边界接纳控制时,采用边界区分服务策略,根据流对QoS不同要求,将流分为两类区别对待,不但提高了网络资源利用率,而且保证了流的服务质量;内部接纳挖制时,采用了基于路径的方法,大大提高了网络接纳控制的效率.