MPLS网络带宽配置的Hose模型及优化算法

服务质量(QoS)和流量工程(TE)是在当前网络中提供实时应用业务的两项重要技术.多协议标记交换(MPLS)在IP网QoS提供和TE实现中起了关键作用.本文首先介绍了Hose模型,分析了MPLS网采用该模型提供多种VPN业务的流量工程问题,提出了MPLS网采用该模型提供多种VPN业务的最优带宽配置算法,给出了相关的优化模型和实例,实例优化结果表明该方法能在确保业务的QoS要求并且网络开销增加较少的情况下,有效地均衡网络负荷.     

流量识别和QoS控制在IP/MPLS业务路由器的实现

1 引言 业务路由器在IP/MPLS网络的服务质量(QoS)控制方面正在发挥越来越大的作用.IP网络中传统的"尽力而为"方式已经无法满足当前的业务需求,而QoS技术的发展为IP/MPLS网络承载多种业务提供了有效保障,并使得IP真正成为端到端业务汇聚最理想的网络技术,因此网络QoS设计在现代IP/MPLS网络设计中具有重要的作用.     

基于WRR的改进型队列调度算法

基于Diffserv(区分服务)体系,研究实现QoS(服务质量)控制的核心技术之一的队列调度技术。基于WRR(加权轮询)队列调度算法,提出新型的改进算法。改进的队列调度算法主要由流量调节器和调度策略两部分构成,将网络上的包按照Diffserv体系分为EF(加速转发)、AF(保证转发)、BE(尽力服务)三种业务类型,对不同的类型采用不同的调度策略。针对高优先级的EF业务直接采用PRI(优先级调度),针对AF业务采用改进后的WRR调度。仿真结果表明,该改进型调度算法在网络资源分配上具有一定的优越性。     

避免轻载惩罚支持多业务的EPON动态带宽分配

为了支持语音、视频和数据等多业务接入,以太网无源光网络(EPON)动态带宽分配算法需要保证不同业务的优先级以提供不同的服务质量(QoS)、减小实时业务时间延迟,这会带来轻载惩罚问题.针对该问题,文章提出一种基于多队列带宽分配方案,即光网络单元为不同优先级的业务分别申请带宽并引入预测机制.给出了具体算法并进行了算法仿真.仿真结果表明,该方案不仅能支持语音、视频和数据等多业务接入,还能从根本上避免轻载惩罚,通过预测可以进一步提高高优先级业务的QoS.     

无线Mesh网络中支持QoS的802.11e协议优化

在无线Mesh网络中,支持QoS的IEEE 802.11eEDCA协议,其固定的队列接入机制,使得在网络负载较重的时高优先业务的QoS得不到应有的保障,同时在网络负载较轻时信道利用率也不高.文中提出了一种动态调整业务接入队列的算法.节点可以根据感知到的网络负载状况自适应调整队列接入方式,在保障高优先级业务QoS要求的同时,尽可能提高信道的利用率.仿真结果表明,在不同网络负载的场景下,该算法相对于IEEE802.11e在QoS保障和利用率方面都有较好的表现.     

基于多业务QoS的LTE下行资源分配算法

提出一种保证混合业务QoS的LTE系统下层资源分配算法。该算法采用跨层设计思想,根据用户缓存队列状态以及QoS需求将用户按照调度的紧急程度分为三类,然后按照不同的调度准则依次为这三类用户分配资源块。仿真结果表明,所提资源块分配算法不仅能够大幅度降低用户的丢比特率,还能改善用户公平性和吞吐量性能。     

基于多业务的队列调度算法研究

讨论了几种典型的调度算法,并在WRR基础上提出一种针对多业务的调度算法(MWRR),同时描述了算法的实现过程。该算法根据各队列的延迟时间比来动态调整队列的调度次序。MWRR算法能够降低多业务的端对端时延,为多业务提供更好的QoS保证。最后通过仿真,证明了该算法的优越性。     

D-DRR:一种可动态改变带宽的分组调度算法

在分组网络设备中，采用适当的调度算法是为网络上运行的业务提供服务质量(QoS：quality of service)的关键。在差额循环(DRR：deficit round robin)调度算法的基础上提出了一种动态差额循环(D-DRR：dynamic deficit round robin)调度算法，该算法通过实时跟踪特定服务队列长度来调整量子值，以改变预约带宽，从而满足一些特定的实时业务类型的QoS。     

一种分级WFQ的宽带无线接入系统QoS架构

文章介绍了加权公平排队(WFQ)分组调度算法和IEEE 802 16的QoS架构.在此基础上,文章结合分级WFQ分组调度算法和IEEE 802 16协议中所提供的控制机制提出了一种适合于BWA系统的QoS架构.该架构充分利用IEEE 802.16提供的控制机制,结合分级WFQ公平队列调度算法,在主动授予业务(UGS)、实时轮询业务(rtS)、非实时轮询业务(nrtPS)和尽力传输业务(BE)之间公平分配带宽,并保证各种业务的QoS特性,完成了在IEEE 802 16协议中留给用户自己定义的调度策略.     

WFQ流量调度算法研究

高速包交换电路常常需要为各种不同要求的服务公平地分配带宽,在公平分配带宽的同时还需要满足这些服务的服务质量(QoS)参数.不同QoS需求的业务将被复用到同一条输出链路上,要为它们公平地分配带宽就需要用到各种各样的流量调度算法.加权公平队列(WFQ)是一种常用的流量调度算法.它不仅能保证带宽分配的公平性,而且具有较好的时延性能.文章较为详细地讨论了WFQ算法的基本原理.     

A Novel Algorithm Supporting QoS for Traffic Engineering in MPLS Networks

1　Introduction　AstheQoSrequirementofserviceclasseshaschangeddramaticallyduringthepastyears,thesingle classbesteffortarchitecturecurrentlyusedintheinternetcan tmeettheincreasingneedofdifferenttrafficswithdiffer entQoSrequirements .Asaresult ,themanagementandcontrolofTrafficEngineering (TE)becomesmoreimportantinhigh speednetworksforserviceproviders.AccordingtoInternetEngineeringTaskForce ,TEisanaspectofnetworkengineeringconcernedwiththeissueofnetworkperformanceoptimization[1] .Thenewlye …     

Efficient scheduling discipline for Hierarchical Diff‐EDF

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best‐effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet‐scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff‐EDF (Differentiate Earliest Deadline First), which can meet the real‐time needs of these applications while continuing to provide best‐effort service to non‐real time traffic. The Hierarchal Diff‐EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. Copyright © 2007 John Wiley & Sons, Ltd.     

Design of MAC protocols with fast collision resolution for wireless local area networks

Development of efficient medium access control (MAC) protocols providing both high throughput performance for data traffic and good quality of service (QoS) support for real-time traffic is the current major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention resolution algorithm for wireless local area networks, namely, the fast collision resolution (FCR) algorithm. The MAC protocol with this new algorithm attempts to provide significantly higher throughput performance for data services than the IEEE 802.11 MAC algorithm and more advanced dynamic tuning backoff (DTB) algorithm. We demonstrate that this algorithm indeed resolves collisions faster and reduces the idle slots more effectively. To provide good fairness performance and to support good QoS for real-time traffic, we incorporate the self-clocked fair queueing algorithm and a priority scheme into the FCR algorithm and come up with the real-time FCR (RT-FCR) algorithm, and show that RT-FCR can simultaneously achieve high throughput and good fairness performance for nonreal-time traffic while maintaining satisfactory QoS support for real-time traffic.     

An Application Oriented Power Saving MAC Protocol for Wireless Sensor Networks

Energy efficiency has been an important concern in wireless sensor networks where Medium Access Control (MAC) protocol plays an important role. However, current MAC protocols designed for energy saving have seldom considered multiple applications coexisting in WSN with variation of traffic load dynamics. In this paper, we propose an adaptive control algorithm at MAC layer to promote energy efficiency. We focus on the tradeoff relation between collisions and control overhead as a reflection of traffic load and propose to balance the tradeoff under the constraints of QoS options. We integrate the algorithm into S-MAC and verify it through NS-2 platform. The simulation results demonstrate that our algorithm achieves observable improvement in energy performance while meeting QoS requirement for different coexisting applications in comparison with S-MAC.     

A learning approach for prioritized handoff channel allocation in mobile multimedia networks

An efficient channel allocation policy that prioritizes handoffs is an indispensable ingredient in future cellular networks in order to support multimedia traffic while ensuring quality of service requirements (QoS). In this paper we study the application of a reinforcement-learning algorithm to develop an alternative channel allocation scheme in mobile cellular networks that supports multiple heterogeneous traffic classes. The proposed scheme prioritizes handoff call requests over new calls and provides differentiated services for different traffic classes with diverse characteristics and quality of service requirements. Furthermore, it is asymptotically optimal, computationally inexpensive, model-free, and can adapt to changing traffic conditions. Simulations are provided to compare the effectiveness of the proposed algorithm with other known resource-sharing policies such as complete sharing and reservation policies     

Adaptive Rate Control and QoS Provisioning in Direct Broadcast Satellite Networks

Adaptive rate control, if properly employed, is an effective mechanism to sustain acceptable levels of Quality of Service (QoS) in wireless networks where channel and traffic conditions vary over time. In this paper we present an adaptive rate (source and channel) control mechanism, developed as part of an Adaptive Resource Allocation and Management (ARAM) algorithm, for use in Direct Broadcast Satellite (DBS) networks. The algorithm performs admission control and dynamically adjusts traffic source rate and Forward Error Correction (FEC) rate in a co-ordinated fashion to satisfy QoS requirements. To analyze its performance, we have simulated the adaptive algorithm with varying traffic flows and channel conditions. The traffic flow is based on a variable bit rate (VBR) source model that represents Motion Picture Expert Group (MPEG) traffic fluctuations while the DBS channel model is based on a two-state Additive White Gaussian Noise (AWGN) channel. For measures of performance, the simulator quantifies throughput, frame loss due to congestion during transmission as well as QoS variations due to channel (FEC) and source (MPEG compression and data transmission) rate changes. To show the advantage of the adaptive FEC mechanism, we also present the performance results when fixed FEC rates are employed. The results indicate significant throughput and/or quality gains are possible when the FEC/source pairs are adjusted properly in co-ordination with source rate changes.     

A QoS aware joint design for wireless mesh networks

Wireless mesh networks (WMNs) provide Internet access to remote areas and wireless connections on a metropolitan scale. In this paper, we focus on the problem of improving the gateway throughput in WMNs while achieving fairness and supporting quality-of-service (QoS) differentiation for end-users. To address this problem, we propose a new distributed dynamic traffic scheduling algorithm that supports different QoS requirements from different users. We also develop a joint weight-aware channel assignment and minimum expected delay routing mechanism. Simulation results demonstrate the performance of the proposed work in terms of the achieved throughput and minimized packet loss ratio and delay.     

Mobile flow-aware networks for mobility and QoS support in the IP-based wireless networks

As the volume of mobile traffic consisting of video, voice, and data is rapidly expanding, a challenge remains with the mobile transport network, which must deliver data traffic to mobile devices without degrading the service quality. Since every Internet service holds its own service quality requirements, the flow-aware traffic management in fine granularity has been widely investigated to guarantee Quality of Service (QoS) in the IP networks. However, the mobile flow-aware management has not been sufficiently developed yet because of the inherent constraints of flow routing in the mobile networks regarding flow-aware mobility and QoS support. In this paper, we propose a flow-aware mobility and QoS support scheme called mobile flow-aware network (MFAN) for IP-based wireless mobile networks. The proposed scheme consists of dynamic handoff mechanisms based on QoS requirements per flow to reduce the processing overhead of the flow router while ensuring QoS guarantee to mobile flows. The performance analyses of the proposed scheme demonstrate that MFAN successfully supports the mobile flow traffic delivery while satisfying the QoS requirement of flows in the wireless mobile IP networks.     

Performance analysis for voice/data integration on a finite-buffermobile system

Personal communication service (PCS) networks offer mobile users diverse telecommunication applications, such as voice, data, and image, with different bandwidth and quality-of-service (QoS) requirements. This paper proposes an analytical model to investigate the performance of an integrated voice/data mobile network with finite data buffer in terms of voice-call blocking probability, data loss probability, and mean data delay. The model is based on the movable-boundary scheme that dynamically adjusts the number of channels for voice and data traffic. With the movable-boundary scheme, the bandwidth can be utilized efficiently while satisfying the QoS requirements for voice and data traffic. Using our model, the impact of hot-spot traffic in the heterogeneous PCS networks, in which the parameters (e.g., number of channels, voice, and data arrival rates) of cells can be varied, can be effectively analyzed. In addition, an iterative algorithm based on our model is proposed to determine the handoff traffic, which computes the system performance in polynomial-bounded time. The analytical model is validated by simulation     

Radio Network Aggregation for 5G Mobile Terminals in Heterogeneous Wireless and Mobile Networks

This paper provides a novel design concept for advanced mobile multi interface terminals with radio network aggregation capability and enhanced quality of service (QoS) provisioning for multimedia services (voice, video and data) in heterogeneous wireless and mobile networks. A new module is established which provides the best QoS and lowest cost for any given multimedia service by using simultaneously all available wireless and mobile access networks for a given traffic flow. This novel adaptive QoS module with adaptive QoS routing algorithm is called advanced QoS routing algorithm (AQoSRA), which is defined independently from any existing and future radio access technology. The performance of our proposal is evaluated using simulations and analysis with multi-interface mobile stations with AQoSRA within, carrying multimedia traffic in heterogeneous mobile and wireless environment with coexistence of multiple Radio Access Technologies, such as 3G, 4G as well as future 5G radio access networks. The analysis of the proposed framework for radio networks aggregation in advanced mobile terminals has shown overall better performances regarding the achievable throughput and multimedia access probability in heterogeneous wireless and mobile environment.