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

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

A hybrid cycle bandwidth allocation scheme with differentiated services support in Ethernet passive optical networks

The Ethernet passive optical network (EPON) has emerged as one of the most promising solutions for next generation broadband access networks. Designing an efficient upstream bandwidth allocation scheme with differentiated services (DiffServ) support is a crucial issue for the successful deployment of EPON, carrying heterogeneous traffic with diverse quality of service (QoS) requirements. In this article, we propose a new hybrid cycle scheme (HCS) for bandwidth allocation with DiffServ support. In this scheme, the high-priority traffic is transmitted in fixed timeslots at fixed positions in a cycle while the medium- and low-priority traffic are transmitted in variable timeslots in an adaptive dynamic cycle. A suitable local buffer management scheme is also proposed to facilitate QoS implementation. We develop a novel feature providing potentially multiple transmission opportunities (M-opportunities) per-cycle for high-priority traffic. This feature is significant in improving delay and delay-variation performance. The HCS provides guaranteed services in a short-cycle scale for delay and jitter sensitive traffic while offering guaranteed throughput in a moderately long-time scale for bandwidth sensitive traffic and at the same time maximizing throughput for non-QoS demanding best-effort traffic. We develop analytical performance analysis on the deterministic delay bound for high-priority traffic and minimum throughput guarantees for both high- and medium-priority traffic. On the other hand, we also conduct detailed simulation experiments. The results show a close agreement between analytical approach and simulation. In addition, the simulation results show that the HCS scheme is able to provide excellent performance in terms of average delay, delay-variation, and throughput as compared with previous approaches.

Performance Evaluation of Ethernet Frame Burst Mode in EPON Downstream Link

We apply IEEE 802.3 frame burst mode (FBM) to the Ethernet passive optical network (EPON) downstream link and compare its performance with non‐frame burst mode for various traffic patterns. Although in light traffic loads (ρ<0.5) the efficiency of the FBM mechanism is not significant, it does feature high throughput, small jitter, low queue occupancy, and short queuing delay in optical line terminals under various traffic loads with various numbers of optical network units (ONUs). The FBM performance always approaches that of full‐duplex mode, especially under heavy traffic loads (ρ>0.5). Moreover, an increase in number of ONUs will decrease the burst performance. Our work shows that FBM scheme is very useful for EPON transmission and has low design complexity.     

车联网中网络切片资源分配方案

为了满足车联网中不同应用的服务质量(Quality of Service, QoS)要求,提出了一种基于网络切片技术的车联网频谱资源分配方案。该方案考虑数据接入控制,通过联合优化频谱资源块(Resource Block, RB)分配和车辆信号发射功率控制,在安全服务切片低时延高可靠性的约束下,最大化信息娱乐服务切片的平均和吞吐量。将车联网资源管理建模为一个混合整数随机优化问题,利用李雅普诺夫(Lyapunov)优化理论将该优化问题分解为接入控制和RB分配与功率控制两个子问题,并分别对其进行求解,得到每个时隙的接入控制和资源分配方案。仿真结果表明,所提出的资源分配方案能够有效提高信息娱乐服务切片的平均和吞吐量,并且可以通过调整引入的控制参数值来实现吞吐量和时延的动态平衡。同时,与已有方案相比,该方案具有更好的时延性能。     

基于OPNET对SSA的EPON系统性能分析

对采用静态时隙结构的EPON系统如何与高度突发数据业务相结合进行了研究。并用OPNET创建了一个采用静态时隙分配(SSA)的上行系统,且确定合适的参数进行了EPON系统性能的仿真分析。仿真结果表明:基于SSA的EPON显然不适合高突发与高负载的业务流,但在负载小于0.47时,该系统性能良好。在长距离的情况下,基于动态带宽分配(DBA)的EPON轮询周期较长,使得系统效率降低,因而在长距离情况下建议采用静态带宽分配(SBA)算法。     

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.     

Optimal resource allocation for heterogeneous traffic in multipath networks

Multipath networks allow each source to send packets from it to its destination over multiple paths, which increases the available bandwidth and throughput for source‐destination pairs. Recently, a variety of flow control schemes have been presented for multipath networks to achieve optimal resource allocation. Unfortunately, much of the investigation focused on elastic traffic with controllable packet injection rates. Networks have witnessed an increase in real‐time traffic (voice and video), which are inelastic. We consider resource allocation for heterogeneous traffic in multipath networks and formulate an optimization problem, which is intrinsically difficult nonconvex. In order to address the aforementioned issue and obtain the optimum, we approximate an equivalent problem of the original optimization problem to a strictly convex problem and present a primal‐dual resource allocation algorithm for the approximation problem, which converges to an optimal solution satisfying the Karush‐Kuhn‐Tucker conditions of the original problem. We evaluate its convergence performance through theoretical analysis and illustrate it with numerical examples. Copyright © 2014 John Wiley & Sons, Ltd.     

Adaptive Radio Resource Allocation for a Mobile Packet Service in Multibeam Satellite Systems

In this paper, we introduce an adaptive radio resource allocation for IP‐based mobile satellite services. We also present a synchronous multibeam CDMA satellite system using an orthogonal resource sharing mechanism among downlink beams for the adaptive packet transmission. The simulation results, using a Ka‐band mobile satellite channel and various packet scheduling schemes, show that the proposed system and resource allocation scheme improves the beam throughput by more than two times over conventional systems. The simulation results also show that, in multibeam satellite systems, a system‐level adaptation to a user's channel and interference conditions according to user locations and current packet traffic is more efficient in terms of throughput improvement than a user‐level adaptation.     

Adaptive Fair Subcarrier/Rate Allocation in Multirate OFDMA Networks: Radio Link Level Queuing Performance Analysis

This paper presents a semi-analytical methodology for radio link level performance analysis in a multirate "orthogonal frequency-division multiple-access" (OFDMA) network with adaptive fair rate allocation. Multirate transmission is assumed to be achieved through adaptive modulation, and fair rate allocation is based on the principle of generalized processor sharing to allocate the subcarriers adaptively among the users. The fair rate allocation problem is formulated as an optimization problem with the objective of maximizing system throughput while maintaining fairness (in terms of transmission rate) among the users. The "optimal" fair rate allocation is obtained by using the "Hungarian method." A heuristic-based approach, namely the "iterative approach," that is more implementation friendly is also presented. The throughput performance of the iterative fair rate allocation is observed to be as good as that of optimal fair rate allocation and is better than that of the static subcarrier allocation scheme. Also, the iterative fair allocation provides better fairness compared to that for each of the optimal and the static subcarrier allocation schemes. To this end, a queuing model is formulated to analyze radio link level performance measures such as packet dropping probability and packet transmission delay under the above rate allocation schemes. In this formulation, packet arrivals are modeled by the discrete Markov modulated Poisson process, which is flexible to model different types of traffic arrival patterns. The proposed framework for radio link level performance analysis of multirate OFDMA networks is validated by extensive simulations. Also, examples on the application of the proposed model for connection admission control and quality-of-service provisioning are illustrated     

基于深度强化学习的异构云无线接入网自适应无线资源分配算法

为了满足无线数据流量大幅增长的需求,异构云无线接入网(H-CRAN)的资源优化仍然是亟待解决的重要问题。该文在H-CRAN下行链路场景下,提出一种基于深度强化学习(DRL)的无线资源分配算法。首先,该算法以队列稳定为约束,联合优化拥塞控制、用户关联、子载波分配和功率分配,并建立网络总吞吐量最大化的随机优化模型。其次,考虑到调度问题的复杂性,DRL算法利用神经网络作为非线性近似函数,高效地解决维度灾问题。最后,针对无线网络环境的复杂性和动态多变性,引入迁移学习(TL)算法,利用TL的小样本学习特性,使得DRL算法在少量样本的情况下也能获得最优的资源分配策略。此外,TL通过迁移DRL模型的权重参数,进一步地加快了DRL算法的收敛速度。仿真结果表明,该文所提算法可以有效地增加网络吞吐量,提高网络的稳定性。     

H-CRAN网络下联合拥塞控制和资源分配的网络切片动态资源调度策略

针对异构云无线接入网络(H-CRAN)网络下基于网络切片的在线无线资源动态优化问题,该文通过综合考虑业务接入控制、拥塞控制、资源分配和复用,建立一个以最大化网络平均和吞吐量为目标,受限于基站(BS)发射功率、系统稳定性、不同切片的服务质量(QoS)需求和资源分配等约束的随机优化模型,并进而提出了一种联合拥塞控制和资源分配的网络切片动态资源调度算法。该算法会在每个资源调度时隙内动态地为性能需求各异的网络切片中的用户分配资源。仿真结果表明,该文算法能在满足各切片用户QoS需求和维持网络稳定的基础上,提升网络整体吞吐量,并且还可通过调整控制参量的取值实现时延和吞吐量间的动态平衡。     

Dynamic bandwidth allocation for quality-of-service over Ethernet PONs

Ethernet-based passive optical network (EPON) technology is being considered as a promising solution for next-generation broadband access networks due to the convergence of low-cost Ethernet equipment and low-cost fiber infrastructures. A major feature for this new architecture is the use of a shared transmission media between all users; hence, medium access control arbitration mechanisms are essential for the successful implementation of EPON: i.e., to ensure a contention-free transmission and provide end users with equal access to the shared media. We propose to use the multipoint control protocol defined by the IEEE 802.3ah task force to arbitrate the transmission of different users, and we present different dynamic bandwidth allocation (DBA) algorithms to allocate bandwidths effectively and fairly between end users. These DBA algorithms are also augmented to support differentiated services, a crucial requirement for a converged broadband access network with heterogeneous traffic. We show that queueing delays under strict bandwidth allocation algorithms result in an unexpected behavior for certain traffic classes, and we suggest the use of DBA with appropriate local queue management to alleviate this inappropriate behavior. We conduct detailed simulation experiments to study the performance and validate the effectiveness of the proposed protocols.     

低轨星座的跳波束资源调度策略

跳波束技术作为一种高通量卫星资源分配方法,能够根据地面业务需求灵活配置星上资源,提高星上资源利用率。本文将跳波束技术应用到低轨星座场景中,针对用户业务先验未知和先验已知两种情况,考虑波束间的共信道干扰,基于迭代算法和凸优化制定了适用于低轨星座的两种跳波束资源调度策略。与传统策略对比,能达到更高的系统吞吐量,同时具有较好的时延性能,且适应用户业务的不均分布。     

基于业务认知的多用户带宽分配方法

无线局域网的MAC协议难以兼顾多用户差别的业务需求和网络吞吐量的有效性。建立具有超帧结构的带宽分配模型和具有惩罚函数的优化目标,计算满足单用户QoS需求的最小带宽,进而提出基于业务认知的多用户带宽分配算法(TCBAA)。该算法优先满足用户QoS要求,其次最大化系统的吞吐量。理论和仿真实验显示:相比于固定分配机制和最大吞吐量分配机制,TCBAA能够在有限带宽下满足更多用户的QoS需求。     

Interference graph based adaptive interference coordination method in indoor UDN

An interference graph based adaptive interference coordination method was proposed for indoor scenario of ultra dense network (UDN).The algorithm aimed at maximizing system throughput.Firstly,the interference relationship in the system was modeled as an interference graph,and the iterative coloring algorithm was used to determine the available resources of each small cell base station (SBS).Thereafter,the SBS allocated resources to each user by using a throughput optimizing resource allocation algorithm.The method could adaptively select a resource allocation strategy according to the network topology and channel conditions,thereby mitigating interference in the system.The simulation results show that compared with the existing methods,the proposed method effectively reduces the system outage probability while significantly improving the throughput performance through a small additional signaling overhead.     

OFDMA系统中线性注水功率分配算法

功率分配是OFDMA系统资源调度中的一个重要研究问题。该文通过寻求快速确定不需分配功率的子载波方法,提出了一种线性注水功率分配算法,运算中不需多次迭代,就可完成功率注水过程。仿真结果表明,该算法的吞吐量逼近迭代注水功率分配算法。     

Bandwidth utilization efficiency enhancement for OFDM‐based WSN

Normally IEEE 802.16 (WiMAX) is used for mainly downlink traffic applications. However in the upper tier of 2‐tier (WiMAX‐WiFi) wireless sensor network, the uplink bandwidth faces bottlenecks for high throughput. In this paper, a solution has been proposed for this limitation of uplink bandwidth allocation through the use of queuing theoretic performance modeling. A Markov‐modulated Poisson process traffic model has been formed for orthogonal frequency division multiple access‐based transmission along with discrete time Markov chain system model for queuing. A downlink traffic pattern has been defined for wireless sensor network nodes. Analytical methods are used to estimate the performance parameters like throughput, delay, and probability of packet drop for resource allocation. An algorithm is formulated to find out minimum resource requirement for downlink and to transfer rest of the resources to uplink bandwidth allocation, for throughput enhancement. Uplink frame utilization is determined through another discrete time Markov chain model for adaptive triggering between the proposed maximum and the normal downlink to uplink ratio operations, for efficient distribution of bandwidth resources. Algorithm and simulation results prove outstanding improvement in the uplink throughput around 50%, without degrading the downlink throughput.     

An optimization framework for balancing throughput and fairness in wireless networks with QoS support

Quality-of-service (QoS) provisioning, high system throughput, and fairness assurance are indispensable for heterogeneous traffic in future wireless broadband networks. With limited radio resources, increasing system throughput and maintaining fairness are conflicting performance metrics, leading to a natural tradeoff between these two measures. Balancing system throughput and fairness is desired. In this paper, we consider an interference-limited wireless network, and derive a generic optimization framework to obtain an optimal relationship of system throughput and fairness with QoS support and efficient resource utilization, by introducing the bargaining floor. From the relationship curve, different degrees of performance tradeoff between throughput and fairness can be obtained by choosing different bargaining floors. In addition, our framework facilitates call admission control to effectively guarantee QoS of. multimedia traffic. The solutions of resource allocation obtained from the optimization framework achieve the pareto optimality, demonstrating efficient use of network resources.     

Controlling QoS in EPON-based FTTX access networks

The Ethernet PON (EPON) is viewed by many as an attractive solution to deliver very high-speed broadband access and is widely deployed in some geographical areas. While downstream traffic is broadcast to all customers, the access of upstream traffic to the fiber has to be arbitrated in order to avoid collisions. This arbitration mechanism and more generally, bandwidth distribution and QoS Provisioning, have been left to the implementer. One solution is to enforce static Time Division Multiplexing Access (TDMA) between end-users. This however precludes an efficient usage of resources. Interleaved Polling with Adaptive Cycle Time (IPACT) is one of the earliest proposed schemes for Dynamic Bandwidth Assignment (DBA) in EPON and has been extensively used as a benchmark by many subsequent allocation schemes. In this paper, we first propose an analytical model which yields approximate values for mean queue length and mean packet delay in an EPON using IPACT with Gated Service (GS) scheme under the assumption of heterogeneous Poisson arrivals. We use the model to demonstrate that all users experiment performance degradation in case of local overload, thus showing the necessity of correcting somehow IPACT-GS in order to avoid this phenomenon. This is achieved by designing a control plane for EPON, which includes a priority based DBA together with a framework for enforcing Service Level Agreements (SLAs), and fairly sharing available resources. The proposed framework is easily configured (all the control being centralized at the OLT or in the backbone) while allowing the support of large varieties of services. It is shown to behave more efficiently than other QoS sensitive DBAs in the literature.     

基于改进遗传算法的C-RAN网络动态无线资源分配

针对云无线网络(Cloud Radio Access Network,C-RAN)中传统静态资源分配效率低下以及动态无线资源分配中资源种类单一的问题,提出了一种基于用户服务质量(Qulity of Service,QoS)约束的动态无线资源分配方案,对无线资源从无线射频单元(Remote Radio Head,RRH)选择、子载波分配和RRH功率分配三个维度进行研究.首先,根据传统的C-RAN系统传输模型和QoS约束在时变业务环境下建立了以发射功率为变量,以吞吐量最大为优化目标的优化问题;然后,基于改进的遗传算法,将原优化方案转变为通过优化RRH选择、子载波分配和RRH功率分配来达到提高系统吞吐量的目的;最后,将改进的遗传算法与其他智能算法在种群规模变化下进行了时间复杂度对比.实验结果表明,所提算法具有较低时间复杂度,所提资源分配方案下的平均吞吐量增益为17％.