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

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

GPON系统中基于QoS的动态带宽分配算法的研究

为了实现吉比特无源光网络(GPON)带宽分配的公平性,降低网络的丢包率及传输延时,研究了GPON系统传输汇聚层的帧结构及带宽分配的实现方法,提出了一种新的动态带宽分配(DBA)算法--基于QoS的二层动态带宽分配算法.性能分析与对比表明,这种算法对不同用户和不同等级的业务都具有很好的公平性,并可以降低低等级业务的传输延时.     

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

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

WDM EPON中的动态波长带宽分配算法

基于WDM EPON系统结构和已有波长带宽分配算法(DWBA)的不足,提出了一种结合流量预测与预分配机制的动态波长带宽分配算法--DWBPA.仿真表明在不同网络负载情况下,该算法不仅保证了波长带宽分配的公平性,而且能够满足高优先级业务的延时要求.     

一种EPON-WiMAX融合网络带宽分配算法

文中提出了一种应用于EPON和WiMAX的融合网络,实现用户多优先级业务区分并保证用户QoS的动态带宽分配算法。算法让EPON网络和WiMAX网络协同分配带宽,在EPON网络带宽分配的过程中加入WiMAX网络的带宽分配。整体算法使得因得不到足够带宽而受到影响的用户数保持在最小,同时加入令牌机制兼顾了用户之间的公平性。文中在现有融合网络框架的基础上提出算法,并给出了算法的具体设计步骤,详细分析了带宽申请和分配的过程,讨论了算法的优越性。     

以太无源光网络动态带宽分配算法研究

动态带宽分配是以太无源光网络的重点研究领域之一,其中光网络单元(ONU)内的带宽分配影响到用户的服务质量.文中在分析已有算法的基础上,提出了一种用于ONU内带宽分配的改进令牌桶算法,即每个分配周期中累积的令牌数取决于ONU分配的带宽,而不是ONU的基本带宽.给出了该算法详细的代码描述,并通过在模拟流量下的仿真,证明了该算法能保证不同类型数据的优先顺序,并能保证各种负载条件下带宽分配的公平性,因此相对于已有算法有更好的适用性.     

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

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

一种保证EPON中DBA公平性的算法

动态带宽分配是以太网无源光网络(EPON)系统的一个重要研究领域,文章提出一种在EPON系统中保证动态带宽分配公平性的新型算法.该算法计算量适中, 同时兼顾了动态带宽分配的效率和公平性.文中通过推导给出了最优算法,并在模拟流量下进行了仿真,通过与已有算法的对比,证明其有很好的性能.     

GPON中一种二端动态带宽分配算法的设计与分析

首先对GPON中现有的动态带宽分配算法进行了阐述,然后提出了一种有效QoS保证的二端动态带宽分配算法,并给出了该算法的实现流程图.接着针对几种负载下的不同业务吞吐量情况对该算法进行了分析,最后得出了该算法可以满足动态带宽分配公平性的结论.     

EPON带宽分配算法设计原则研究

在分析多种算法的基础上,对以太无源光网(EPON)动态带宽分配(DBA)算法的设计原则进行了总结.提出ONU分组交织、基于以太帧边界授权、采用较大的轮询周期等三项措施,来提升高信道利用率.提出采用两级结构的DBA为用户分别授权,在支持QoS的同时保障用户间的公平性.基于上述设计原则,提出了一种新算法──面向用户基于帧边界分配算法(SOABR),仿真实验证实其具有极高的信道利用率、良好的延时性能和公平性.     

Proportional bandwidth allocation with consideration of delay constraint over IEEE 802.11e-based wireless mesh networks

Wireless mesh networks (WMNs) extend the limited transmission coverage of wireless LANs by enabling users to connect to the Internet via a multi-hop relay service provided by wireless mesh routers. In such networks the quality of experience (QoE) depends on both the user location relative to the Internet gateway and the traffic load. Various channel access or queue management schemes have been proposed for achieving throughput fairness among WMN users. However, delay and bandwidth utilization efficiency of such schemes may be unacceptable for real-time applications. Accordingly, the present study proposes a proportional bandwidth allocation scheme with a delay constraint consideration for enhancing the QoE of users of WMNs based on the IEEE 802.11e standard. An analytical model of the proposed scheme is provided. Moreover, the performance of the proposed scheme is systematically compared with that of existing bandwidth allocation methods. The simulation results show that the proposed scheme outperforms previously proposed schemes in terms of both an improved throughput fairness among the WMN users and a smaller end-to-end transmission delay.     

脏纸编码的多用户MIMO-OFDM系统中基于纳什公平的资源分配算法

MIMO-OFDM技术是实现大容量无线数据传输的一项关键技术。多用户系统中,在最大化系统资源利用率的同时保证用户间资源分配的公平性是系统设计的一个重要问题。该文首先分析了MIMO系统中最大化吞吐量的一种实现方式脏纸编码(DPC),然后基于纳什公平性准则提出了一种用于DPC的多用户MIMO-OFDM系统中的自适应资源分配算法。仿真结果表明,该算法在损失较小系统吞吐量的前提下,很好地保证了用户间资源分配的公平性。     

Proportional-fair energy-efficient radio resource allocation for OFDMA smallcell networks

This paper investigates the energy-efficient radio resource allocation problem of the uplink smallcell networks. Different from the existing literatures which focus on improving the energy efficiency (EE) or providing fairness measured by data rates, this paper aims to provide fairness guarantee in terms of EE and achieve EE-based proportional fairness among all users in smallcell networks. Specifically, EE-based global proportional fairness utility optimization problem is formulated, taking into account each user’s quality of service, and the cross-tier interference limitation to ensure the macrocell transmission. Instead of dealing with the problem in forms of sum of logarithms directly, the problem is transformed into a form of sum of ratios firstly. Then, a two-step scheme which solves the subchannel and power allocation separately is adopted, and the corresponding subchannel allocation algorithm and power allocation algorithm are devised, respectively. The subchannel allocation algorithm is heuristic, but can achieve close-to-optimal performance with much lower complexity. The power allocation scheme is optimal, and is derived based on a novel method which can solve the sum of ratios problems efficiently. Numerical results verify the effectiveness of the proposed algorithms, especially the capability of EE fairness provisioning. Specifically, it is suggested that the proposed algorithms can improve the fairness level among smallcell users by 150–400 % compared to the existing algorithms.     

Resource allocation algorithm for LTE networks using fuzzy based adaptive priority and effective bandwidth estimation

In this paper, we propose a scheme to allocate resource blocks for the Long Term Evolution (LTE) downlink based on the estimation of the effective bandwidths of traffic flows, where users’ priorities are adaptively computed using fuzzy logic. The effective bandwidth of each user traffic flow that is estimated through the parameters of the adaptive β-Multifractal Wavelet Mode modeling, is used to attain their quality of service (QoS) parameters. The proposed allocation scheme aims to guarantee the QoS parameters of users respecting the constraints of modulation and code schemes (modulation and coding scheme) of the LTE downlink transmission. The proposed algorithm considers the average channel quality and the adaptive estimation of effective bandwidth to decide about the scheduling of available radio resources. The efficiency of the proposed scheme is verified through simulations and compared to other algorithms in the literature in terms of parameters such as: system throughput, required data rate not provided, fairness index, data loss rate and network delay.     

Fairness and Load Balancing in Wireless LANs Using Association Control

The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load imbalance and consequent unfair bandwidth allocation can be greatly reduced by intelligent association control. In this paper, we present an efficient solution to determine the user-AP associations for max-min fair bandwidth allocation. We show the strong correlation between fairness and load balancing, which enables us to use load balancing techniques for obtaining optimal max-min fair bandwidth allocation. As this problem is NP-hard, we devise algorithms that achieve constant-factor approximation. In our algorithms, we first compute a fractional association solution, in which users can be associated with multiple APs simultaneously. This solution guarantees the fairest bandwidth allocation in terms of max-min fairness. Then, by utilizing a rounding method, we obtain the integral solution from the fractional solution. We also consider time fairness and present a polynomial-time algorithm for optimal integral solution. We further extend our schemes for the on-line case where users may join and leave dynamically. Our simulations demonstrate that the proposed algorithms achieve close to optimal load balancing (i.e., max-min fairness) and they outperform commonly used heuristics.     

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

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

Dynamic resource allocation algorithm in multi-user cooperative OFDMA systems: considering QoS and fairness constraints

Wireless transmission systems are constrained by several parameters such as the available spectrum bandwidth, mobile battery energy, transmission channel impairments and users’ minimum quality-of-service. In this paper, a new strategy is investigated that aims at improving the allocation of resources in a dual hop OFDMA cooperative network consisting in multi source–destination pairs and multiple decode-and-forward relays. First, the joint optimization of three types of resources: power, sub-channel and relay nodes, is formulated as a problem of subchannel-relay assignment and power allocation, with the objective of minimizing overall transmission power under the bit-error-rate and data rate constraints. However, the optimal solution to the optimization problem is computationally complex to obtain and may be unfair. Assuming knowledge of the instantaneous channel gains for all links in the entire network, an iterative three-step resource allocation algorithm with low complexity is proposed. In order to guarantee the fairness of users, several fairness criteria are also proposed to provide attractive trade-offs between network performance (i.e. overall transmission power, average network lifetime and average outage probability) and fairness to all users. Numerical studies are conducted to evaluate the performance of the proposed algorithm in two practical scenarios. Simulation results show that the proposed allocation algorithm achieves an efficient trade-off between network performance and fairness among users.