一种新的基于GPON的动态带宽分配算法

为了实现吉比特无源光网络(GPON)带宽分配的公平性,降低网络的丢包率及传输延时,文章研究了GPON系统传输汇聚层的帧结构及动态带宽分配的实现方法,提出了一种新的动态带宽分配(DBA)算法--基于QoS的二层动态带宽分配算法.基本思路是根据不同等级业务的带宽需求,在PON层和ONU层分别进行带宽的合理分配.理论分析和仿真试验证明,这种算法可以提高带宽的利用率,保证不同业务的不同时延要求,并且对不同用户和不同等级的业务都具有很好的公平性.     

一种新的EPON上行动态带宽分配算法与仿真

为了合理分配EPON上行信道带宽,提出一种能够区分服务等级的固定周期轮询动态带宽分配算法。该算法将光网络单元(ONU)的业务分为三个等级,根据不同的业务等级动态分配上行带宽,有效保证整个EPON网络的QoS以及带宽分配的公平性。同时,为了进一步提高EPON系统上行链路的带宽利用率,克服算法产生的idle time问题,对算法进行了改进。最后,对该算法进行仿真实验。     

一种基于SLA的MAC改进协议

首先分析了EPON系统中IPACT MAC协议,然后提出一种改进的MAC协议。该协议根据服务等级协议(SLA)以动态带宽分配方式对于带宽需求不同的用户分配不等的可用带宽,采用固定周期轮询,并改进授权表的产生方法。最后给出了实验仿真,结果表明该改进协议减少了在不同光网络单元(ONU)数据传输时的平均时延和丢包率,提高了在不同授权方法时的吞吐量。     

一种基于 SLA 的 WDM EPON 动态波长带宽分配算法简

波分复用技术结合时分复用形成了混合WDM EPON,如何提高系统的带宽利用率和用户服务质量成为关键技术。结合已有算法的优缺点,提出一种新的动态波长带宽分配算法。该算法结合业务等级分类和用户服务等级协议的权重为光网络单元分配相应的带宽和波长,以达到提高服务质量、带宽分配公平性,提高上行带宽利用率和改善网络性能的目的。     

一种保证QoS的10G-EPON动态带宽分配算法

随着高清IPTV、在线游戏等业务的发展,用户对于带宽的需求日益增加,10G-EPON技术应运而生。与传统的EPON系统一样,10G-EPON系统的动态带宽分配问题仍然十分关键。带宽分配方式的选择对于如何避免传输冲突,提高系统的带宽利用率且保障服务质量都非常重要。在已有算法的基础之上,提出一种改进型动态带宽分配算法。该算法重点确保高优先级业务的服务要求,在一定程度上体现了不同等级ONU之间的公平性,提高了上行带宽利用率。     

EPON中保证QoS的动态带宽分配算法

作为一种新技术，EPON系统采取在下行信道使用广播方式而在上行信道使用时分多址(TDMA)方式，为用户提供共享传输介质的接入方式，因此就需要一种接入控制机制来为用户分配带宽。为了使EPON系统更好地支持QoS并且进一步提高带宽利用率，提出了一种新的固定周期轮询动态带宽分配算法，针对不同时延特性业务采用不同的授权分配算法。算法包括两部分：OLT时ONU的调度以及ONU内部不同优先级的队列之间的调度。最后讨论了包时延、系统吞吐量等仿真结果和性能分析。     

一种基于无线多媒体业务的可升降级QoS动态带宽分配与优化策略

无线多媒体网络中的业务包括话音、流媒体、交互类和背景类业务4种,除话音业务外其余3种业务都是可变比特速率业务。对该网络用户资源分配(主要是带宽的分配)若采用传统的固定分配方法,必定陷入资源利用率低下和用户QoS得不到保障的两难境地。该文提出了一种基于无线多媒体业务的动态带宽分配与优化策略,在保证用户QoS的前提下,尽可能提高资源利用率。该文分别从网络和用户两个角度考虑,通过系统容量、业务阻塞率、数据延迟、流媒体的实际传输比和VBR业务综合服务等级等参数,对可升降级QoS无线多媒体网络进行了仿真分析,结果表明,对比传统的网络资源管理策略,该策略大大改善了系统的性能,提高了系统资源利用率。     

APON业务调度算法的研究与实现

利用业务调度算法实现不同业务等级间的动态带宽分配（DBA），从而保证接入业务的服务质量（QoS)，是异步转移模式无源光网络（APON）系统的关键技术之一，文章所设计的APON系统业务调度算法，通过基本带宽分配和剩余带宽再分配实现了业务等级间的动态带宽分配，算法建模仿真和系统实际测试证明算法具有良好的性能，实现简单，可用性强。     

三网融合下的动态带宽分配方案研究

以三网融合的接八技术EPON为基础,分析三网融合后不同等级用户、不同等级业务的竞争关系,研完了已有的经典动态带宽分配方案,并根据ONU端不同用户的SLA（服务等级协议）划分,及ONU内部不同优先级业务的划分,设计了支持用户SLA的EPON系统,最后给出一种新的带宽分配算法STFD-DBA,并在理论上分析了该算法的可行性...     

基于IEEE 802.16的下行服务流调度算法设计

文章详细介绍了IEEE 802．16协议中的MAC层保证QoS的带宽分配机制，根据协议建立了相应的调度系统模型，并提出了一种适合多用户多业务的宽带无线通信系统的下行服务流调度算法。     

基于智能网络的租户服务质量保证技术

在多租户虚拟网络环境中,用户对于网络服务的多样性以及性能的稳定性需求并不会随着网络架构和运营模式的升级而削弱,用户需求之间的差异性和动态性对于不同切片间资源的分配和调度效率提出了新的挑战。针对多租户虚拟网络的特殊环境,首先提出了QVR(QoS-Virtual Routing)流量调度算法,同时将用户流量调度与网络虚拟资源分配看做一个联合优化问题,提出了面向多租户的流量调度算法以及适用于共享链路的动态带宽分配算法。该算法能够释放更多的物理网络资源,明显降低了租户网络的延时和拥塞。     

一种用于IEEE 802.16无线城域网TDD模式中的带宽调度方案

该文提出了一种用于IEEE 802.16宽带无线接入系统TDD模式下的公平而有效的带宽分配调度体系。与该领域中传统的固定带宽分配方式相比,该文提出的调度体系结构综合考虑了上下行链路不同业务带宽需求并进行动态带宽分配。该文提出一种新的亏空公平优先级队列(DFPQ)算法来调度不同优先级的业务流,可以为系统提供更好的公平性。仿真结果显示该文提出的调度体系结构能够很好地满足所有类型业务的服务质量(QoS)需求,并提供较好的公平性。     

Optimal solutions for a dynamic bandwidth allocation scheme in high-speed networks

In this paper, we investigate the problem of determining the optimal bandwidth allocation for a Dynamic Bandwidth Allocation Scheme (DBAS). The objective is to minimize the total amount of bandwidth required to satisfy the Quality of Service (QoS) requirements of all traffic streams. It is shown that when the performance functions satisfy a certain number of conditions, there exists a unique optimal bandwidth allocation such that, for each traffic stream, either its QoS is just satisfied or its QoS is over-satisfied and it is allocated zero bandwidth. Such an allocation is said to be efficient. It is also shown that there exists a unique efficient allocation in the entire feasible region. An iterative algorithm is developed to compute the efficient allocation employing its special properties. Numerical examples are presented to demonstrate how the algorithm works. Future extensions of this work are also discussed.Partially supported by NSERC of Canada through grants OGP14020 and STRIN-200.     

Comprehensive bandwidth utilization and polling mechanism for XGPON

For an efficient utilization of the upstream bandwidth in passive optical network, a dynamic bandwidth assignment mechanism is necessary as it helps the service providers in provisioning of bandwidth to users according to the service level agreements. The scheduling mechanism of existing schemes, immediate allocation with colorless grant and efficient bandwidth utilization (EBU), does not assign the surplus bandwidth to a specific traffic class and only divides it equally among the optical network units (ONUs). This results in overreporting of ONU bandwidth demand to the optical line terminal and causes wastage of bandwidth and increase in delays at high traffic loads. Moreover, the EBU also assigns the unused bandwidth of lightly loaded ONU queues to the overloaded queues through an Update operation. This Update operation has a flaw that it borrows the extra bandwidth to a queue in the current service interval, if the queue report is higher than its service level agreement and refunds in next service interval. This borrow‐refund operation causes reduced bandwidth allocation to the lower priority classes and increases their delay and frame loss. This study improves both these weaknesses. The simulation results show that the proposed scheme uses bandwidth efficiently and reduces mean upstream delay of type‐2 (T2) traffic class by 38% and type‐3 (T3) up to 150% compared to immediate allocation with colorless grant at a cost of up to 10% higher delay for T2. However, T4 performance improves by 400% compared to EBU with slight increase in delay for T2 traffic class. Overall, it shows a balanced performance for all the traffic classes and minimizes the bandwidth waste per cycle as well as the frame loss rate.     

基于多门限预留机制的自适应带宽分配算法

针对异构无线网络融合环境提出了一种基于多门限预留机制的自适应带宽分配算法,从而为多业务提供QoS保证。该算法采用多宿主传输机制,通过预设各个网络中不同业务的带宽分配门限,并基于各个网络中不同业务和用户的带宽分配矩阵,根据业务k支持的传输速率等级需求和网络状态的变化,将自适应带宽分配问题转化为一个动态优化问题并采用迭代方法来求解,在得到各个网络中不同业务和用户优化的带宽分配矩阵的同时,在带宽预留门限和网络容量的约束条件下实现网络实时吞吐量的最大化,以提高整个异构网络带宽的利用效率。数值仿真结果显示,所提算法能够支持满足QoS需求的传输速率等级,减小了新用户接入异构网络的阻塞概率,提高了平均用户接入率并将网络吞吐量最大提高40%。     

3GPP LTE系统中无线视频传输调度算法研究

摘要：针对3GPP LTE系统,本文提出了适用于下行链路视频业务的一种新的分组调度算法,即时延优先比例公平调度（Delay First-Proportional Fair Scheduling,DF-PFS）。当需要做出调度决策时,该算法利用每个用户的数据包时延信息和瞬时下行信道条件,在满足用户QoS前提下最大限度地提高系统吞吐量。同时,当用户选择资源块（RB）进行传输后,即从用户集合中将该用户删除,避免接近eNodeB的用户一直占用无线资源,确保了资源分配的公平性。实验仿真结果表明,该算法在丢包率和PSNR性能上优于最大权重时延优先（M-LWDF）算法,在保证用户间公平性前提下,满足了视频业务的QoS要求。     

Quality of service aware traffic scheduling in wireless smart grid communication

The next generation electrical power grid, known as smart grid (SG), requires a communication infrastructure to gather generated data by smart sensors and household appliances. Depending on the quality of service (QoS) requirements, this data is classified into event-driven (ED) and fixed-scheduling (FS) traffics and is buffered in separated queues in smart meters. Due to the operational importance of ED traffic, it is time sensitive in which the packets should be transmitted within a given maximum latency. In this paper, considering QoS requirements of ED and FS traffics, we propose a two-stage wireless SG traffic scheduling model, which results in developing a SG traffic scheduling algorithm. In the first stage, delay requirements of ED traffic is satisfied by allocating the SG bandwidth to ED queues in smart meters. Then, in the second stage, the SG rest bandwidth is going to the FS traffic in smart meters considering maximizing a weighted utility measure. Numerical results demonstrate the effectiveness of the proposed model in terms of satisfying latency requirement and efficient bandwidth allocation.     

A Two‐Step Scheduling Algorithm to Support Dual Bandwidth Allocation Policies in an Ethernet Passive Optical Network

In this paper, we design a two‐step scheduling algorithm to support multiple bandwidth allocation policies for upstream channel access in an Ethernet passive optical network. The proposed scheduling algorithm allows us a simultaneous approach for multiple access control policies: static bandwidth allocation for guaranteed bandwidth service and dynamic bandwidth allocation for on‐demand, dynamic traffic services. In order to reduce the scheduling complexity, we separate the process of the transmission start‐ time decision from the process of grant generation. This technique does not require the timing information of other bandwidth allocation modules, so respective modules are free from a heavy amount of timing information or complex processing.     

An optimized scheduling scheme in OFDMA WiMax networks

This paper proposes an optimized scheduling scheme in OFDMA‐based WiMax networks to achieve both optimized system throughput and a complete QoS implementation for various types of traffic flows. Our scheduling scheme includes two components, one is the resource allocation for each user; the other is the QoS scheduling for various traffic sessions. Specifically an optimization problem is formulated to distribute all OFDMA channel resource among different competing users by exploiting the transmission adaption and multiuser diversity on each traffic channel. The optimized resource allocation can also be processed under different constraints to achieve different performance metrics. To ensure the WiMax QoS performance, we perform the resource allocation in a priority manner with respect to the different types of QoS requirements and get a desired transmission bandwidth for each user. Based on it we further schedule different traffic sessions at each user with respect to a proper admission control mechanism. The relevant solution and algorithms for our proposed scheduling scheme are presented in detail. Both the theoretical analysis and simulation results show that our scheme can achieve the key performance objectives such as complete QoS requirements, high channel transmission efficiency and optimal throughput over the whole OFDMA WiMax system. Copyright © 2009 John Wiley & Sons, Ltd.     

Adaptive envelope process and minimum service curve applied to resource block allocation in the LTE downlink

In this work, we propose a resource allocation algorithm for the LTE downlink that makes use of an adaptive multifractal envelope process and a minimum service curve. The proposed scheduling algorithm aims to improve some network parameters while guaranteeing a maximum delay to the user by considering the following information: backlog, channel condition and user traffic behavior. In order to estimate the maximum network delay, we propose an adaptive minimum service curve for the LTE network that can be used for admission control purposes in the resource allocation algorithm. The performance of the proposed scheduling algorithm is compared to those of several scheduling schemes known in the literature through computational simulations of the LTE downlink. In order to develop a new adaptive envelope process and to precisely describe network flows, we propose an adaptive algorithm to estimate the parameters of the Multifractal Wavelet Model (MWM). The proposed envelope process is compared to the main traffic model based envelope processes known in the literature. Simulations of the LTE downlink considering AMC (Adaptive Modulation and Coding) are carried out showing the efficiency of the proposed resource allocation approach that considers adaptive estimation of network traffic parameters.