EPON系统中基于业务等级的动态带宽算法研究

本文针对EPON系统中上行链路的时分复用机制,提出了一种基于服务等级的动态带宽分配方案,通过自适应地改变权值及服务等级的阈值,以适应网络的状况,提高带宽利用率。通过这种方案,既保证了上行链路的高效利用,又保证了网络的性能,满足了网络业务的QoS要求。最后,通过实验证明了这种算法的正确性和可行性。     

RPR环网中的一种带宽公平分配算法

首先讨论了RPR网络中的公平性原则,然后结合该原则引入了一种适合于RPR网络的公平分配方案,基于该方案提出了一种能满足RPR环网性能要求的公平分配算法。该算法通过采用控制的方法为共享某链路的各数据流合理地分配带宽资源,从而达到:(1)各流的速率达到稳定;(2)链路缓存的占有量稳定到一个目标值;(3)链路带宽得到充分利用且实现公平分配。同时该算法能顺次协同地处理完网络中的各个链路,从而能够实现整个RPR环网的公平性与高的链路带宽利用率,达到RPR协议所要求的目标。给出了该算法的代码描述并对其作出稳定性分析,然后通过仿真对其性能进行了验证。     

EPON系统的动态带宽分配算法

针对EPON系统上行链路多个ONU共享带宽的拓扑结构,分析了制定带宽分配策略所需考虑的基本因素,介绍了一种新的动态带宽分配算法,通过动态请求分配机制,实现上行链路的高效利用。     

用改进的LFVC算法提高网络调度的灵活性

在基于前跳虚时钟（LFVC）算法的基础上进行了改进，将实时业务所预留的带宽和链路的剩余带宽实时地分离开来，并用剩余带宽改善非实时业务的平均时延和丢失特性，使得宽带资源的分配更加灵活。     

弹性分组环（RPR） 仿真验证研究

本文实现在OPNet上搭建了一个RPR的基本框架，仿真三个C类业务流带宽公平分配：对环路处于拥塞状态，3个站点通过公平算法控制达到一个近似公平的带宽分配，有一定的抖动；对注入流量较小的两个站点，其带宽需求全部得到满足，而注入流量远大于环的容量的一个站点，它只能占用剩余的供Fairness分配的带宽，流量特性有比较大的抖动；对3个站点注入流量的总和小于链路的剩余带宽，因而带宽需要都能得到较好的满足。以后可以方便地进行功能扩充，如针对FPGA+NPU的实现架构，作对应的建模，用于设计前分析和性能模拟。     

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

由于EPON系统上行链路多个ONU共享带宽的拓扑结构,系统的上行带宽分配算法一直是EPON系统讨论的热点。本文分析了现有带宽分配的算法,基于网络流量的自相似特性,提出了一种新的固定周期的轮询动态带宽分配算法。本算法不仅保证了上行带宽的高效利用率,同时保证了不同业务的QOS。为了验证算法的性能,本文给出了基于本算法的系统仿真结构和相关结果。     

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

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

EPON和WLAN融合架构下带宽分配算法的研究

提出和设计了EPON和WLAN融合网络架构下两种上行链路调度算法:集中式带宽分配和分布式带宽分配,对它们的优缺点做了详细分析.理论和仿真实验表明,与集中式带宽分配相比较,分布式带宽分配算法能使融合网络高效运行,可以很好地支持各种业务的QoS,提高了系统吞吐量,降低了各业务的时延.     

基于闭环反馈模式的弹性分组环多阻塞点公平算法

提出了一种基于闭环反馈模式的多阻塞点公平算法,其核心思想是:先进行源节点加权,再对流进行加权.研究表明:该算法能有效控制链路速率的变化,避免排头阻塞的影响;只对阻塞域之间的链路进行速率调整,可以公平地控制节点间的带宽分配,实现空间重用.     

利用SDGP算法进行实时动态带宽分配的研究及仿真

提出一种在网络通信带宽分配领域,结合自动控制理论,利用基于优先级的串行主导因子法对链路带宽进行动态分配的方案。该算法通过引入主导因子和容忍因子,可以实现在具有流量工程基础的网络中对共享带宽进行实时动态分配。     

Cross-layer resource allocation for QoS guarantee with finite queue constraint in multirate OFDMA wireless networks

Efficient radio resource allocation is essential to provide quality of service （QoS） for wireless networks. In this article, a cross-layer resource allocation scheme is presented with the objective of maximizing system throughput, while providing guaranteed QoS for users. With the assumption of a finite queue for arrival packets, the proposed scheme dynamically a/locates radio resources based on user＇s channel characteristic and QoS metrics derived from a queuing model, which considers a packet arrival process modeled by discrete Markov modulated Poisson process （dMMPP）, and a multirate transmission scheme achieved through adaptive modulation. The cross-layer resource allocation scheme operates over two steps. Specifically, the amount of bandwidth allocated to each user is first derived from a queuing analytical model, and then the algorithm finds the best subcarrier assignment for users. Simulation results show that the proposed scheme maximizes the system throughput while guaranteeing QoS for users.     

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

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

Radio Resource Allocation for Scalable Video Services Over Wireless Cellular Networks

Good quality video services always require higher bandwidth. Hence, to provide the video services e.g., multicast/broadcast services (MBSs) and unicast services along with the existing voice, internet, and other background traffic services over the wireless cellular networks, it is required to efficiently manage the wireless resources in order to reduce the overall forced call termination probability, to maximize the overall service quality, and to maximize the revenue. Fixed bandwidth allocation for the MBS sessions either reduces the quality of the MBS videos and bandwidth utilization or increases the overall forced call termination probability and of course the handover call dropping probability as well. Scalable video coding (SVC) technique allows the variable bit rate allocation for the video services. In this paper, we propose a bandwidth allocation scheme that efficiently allocates bandwidth among the MBS sessions and the non-MBS traffic calls (e.g., voice, unicast, internet, and other background traffic). The proposed scheme reduces the bandwidth allocation for the MBS sessions during the congested traffic condition only to accommodate more calls in the system. Instead of allocating fixed bandwidths for the MBS sessions and the non-MBS traffic, our scheme allocates variable bandwidths for them. However, the minimum quality of the videos is guaranteed by allocating minimum bandwidth for them. Using the mathematical and numerical analyses, we show that the proposed scheme maximizes the bandwidth utilization and significantly reduces the overall forced call termination probability as well as the handover call dropping probability.     

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

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

A spare bandwidth sharing scheme based on network reliability

Spare bandwidth is required for recovering the network service from network faults. However, it degrades the efficiency of network utilization. Spare bandwidth demand can be reduced significantly by letting spare bandwidth be shared among several network services. Spare bandwidth reserved on a network element can be shared by a set of network services for a network fault if they are not simultaneously affected by the network fault. A new, and more practical spare bandwidth sharing scheme, which is based on the network reliability, is proposed in this paper. In the proposed scheme, multiple link failures are allowed with a given link failure rate, and a reasonable restoration level of near 100%; while in the conventional scheme, only a single link failure, and 100% restoration level are considered. To develop the spare bandwidth sharing scheme, we first investigate the framework for evaluating the reliability of path-based network services, and then we explain the proposed spare bandwidth sharing scheme with decision parameters such as lifetime of the path, restoration level, and the maximum number of working paths which can be protected by a backup link. Simulation results show that the proposed spare bandwidth sharing scheme requires a smaller amount of spare bandwidth than the conventional scheme.     

Dynamic Bandwidth Allocation in WDM Passive Star Networks with Asymmetric Traffic

When asymmetric traffic is offered to a WDM passive star network, the offered bandwidth must be allocated is such a way that each station takes a portion of the available bandwidth proportional to its needs. When the traffic characteristics are fixed and a priori known, then, the bandwidth allocation scheme can be based on these characteristics. Unfortunately, the traffic characteristics are often unknown and time-variable. In this paper, a dynamic bandwidth allocation scheme is presented, which is based on the network feedback information in order to be capable of adapting to the changing traffic characteristics. According to the proposed scheme, a set of learning automata processes the network feedback information and dynamically allocates the available bandwidth to the stations according to their needs.     

Efficient Resource Allocation for Policy-Based Wireless/Wireline Interworking

This paper proposes efficient resource allocation techniques for a policy-based wireless/wireline interworking architecture, where quality of service (QoS) provisioning and resource allocation is driven by the service level agreement (SLA). For end-to-end IP QoS delivery, each wireless access domain can independently choose its internal resource management policies to guarantee the customer access SLA (CASLA), while the border-crossing traffic is served by a core network following policy rules to meet the transit domain SLA (TRSLA). Particularly, we propose an engineered priority resource sharing scheme for a voice/data integrated wireless domain, where the policy rules allow cellular-only access or cellular/WLAN interworked access. By such a resource sharing scheme, the CASLA for each service class is met with efficient resource utilization, and the interdomain TRSLA bandwidth requirement can be easily determined. In the transit domain, the traffic load fluctuation from upstream access domains is tackled by an inter-TRSLA resource sharing technique, where the spare capacity from underloaded TRSLAs can be exploited by the overloaded TRSLAs to improve resource utilization. Advantages of the inter-SLA resource sharing technique are that the core network service provider can freely design the policy rules that define underload and overload status, determine the bandwidth reservation, and distribute the spare resources among bandwidth borrowers, while all the policies are supported by a common set of resource allocation techniques.     

GPON中基于认购速率和QoS等级的动态带宽分配算法

为了实现吉比特无源光网络带宽分配的公平性，降低网络的传输延时，设计了一种新的媒质访问控制协议，提出了一种新的动态带宽分配算法。其基本思想是：在保证拥有不同QoS业务的用户得到认购速率的基础上，根据网络负载的大小，动态地将某些用户未使用的带宽分配给其他带宽需求大的用户，以提高网络的带宽利用率。仿真结果表明，这种新的算法在严格控制数据传输延时的前提下，能够保证多用户之间带宽分配的公平性。     

Dynamic bandwidth-allocation and path-restoration in SONETself-healing networks

This paper presents a new scheme for real-time bandwidth allocation and path restoration (BARS) in mesh networks via SONET wideband digital cross-connect systems (WDCSs) in response to demand and load dynamics and link and/or node failure(s). The scheme dynamically maximizes bandwidth allocation while ensuring full service restorability. Since the physical network capacity is limited, sometime not all the demand can be accommodated under the full restorability requirement. This demand in SONET BARS is rejected fairly at the network boundary even if capacity for allocation is available. Bandwidth allocation and fair demand admission are optimized jointly under the full restorability requirements. The implementation of SONET WDCS does not need excessive storage. An efficient parallel algorithm for solving the optimization problem is also presented. The algorithm produces superior spare capacity assignments compared to the results in the literature