FQLP:ATM网中一种新的实时业务调度算法

 本文提出了基于丢失优先权公平队列(FQLP)调度算法.理论分析和仿真实验表明FQLP调度算法能保证实时业务获得的网络资源不小于预约带宽,为实时业务提供确定的时延上界.FQLP调度算法利用ATM网络中的信元优先权机制,提高了网络资源的利用率.同时FQLP调度策略能保证信元的发送顺序.     

WDM网状网络中一种动态多播自适应业务疏导算法

光多播业务需要消耗大量的WDM光网络带宽资源,业务疏导是光多播网络降低业务请求阻塞率和提高带宽资源利用率的有效方法。提出了一种新型光多播疏导节点结构,研究了疏导端口优先的多播业务疏导算法(TGPFA)和新建光树优先的多播业务疏导算法(TCLFA),进而提出了一种能够适应网络资源变化的动态多播业务疏导算法(ADMGA)。结果表明,在网络资源有限的情况下,ADMGA算法能取得较低的请求阻塞率和带宽阻塞率,获得较好的网络性能。     

基于业务感知和策略选择的认知路由算法

提出了一种基于业务感知和策略选择的认知路由(cognitive network routing)算法。该算法面向认知网络环境综合考虑了网络资源、业务流、策略选择等要素,在获知网络中业务流的宏观特征和需求的前提下,首先通过离线资源分配将网络资源按照业务流的固有分配特征预先配置给不同类型的业务流,然后通过在线路径计算实时得出各个业务流的最优路径。仿真实验验证了认知路由算法的有效性,对比于MIRA、SWP路由算法,CNR算法可以提高网络资源利用率,避免因资源不均衡产生的网络拥塞,能够在业务流和资源2个层面优化网络性能。     

一种人与人和物到物业务共存下的异构蜂窝网络柔性接入策略

针对人与人(H2H)和物到物(M2M)业务共存的异构无线网络,该文设计了一种根据业务特性的代理节点的网络选择策略,用博弈论对以保障两类业务服务质量(QoS)需求和网络负载均衡为目标的代理节点网络选择问题进行建模,并分析了该博弈模型纳什均衡(NE)的存在性和可行性;同时,提出了基于学习自动机的分布式网络-信道选择算法(DNCSALA),求得该博弈的纳什均衡。仿真结果表明,所提算法能够获得与穷举搜索算法相近的性能,可满足共存场景中不同类型业务的QoS需求并提高网络资源利用率。     

ATM网络中带有接入平衡机制的实时CAC算法

本文介绍的CAC算法旨在使各种业务的呼叫能够平衡地接入ATM网络,降低算法的复杂程度,提高对呼叫的实时处理能力,同时提高网络资源的利用率。     

基于电力光纤到户的网络切片资源管理方案

为解决电力光纤到户项目中网络管控不灵活、业务种类繁多且QoS复杂等问题,提出了基于电力光纤到户的网络切片资源管理方案和基于网络切片感知的多业务融合动态资源分配算法。仿真结果表明,所提方案能够有效实现不同切片的QoS保障,并显著提升网络资源利用率。     

波分复用光网中的一种新型波长分配算法

目前网络承载业务的趋势是以IP为中心的数据业务,从而促进了以WDM光网络向高速和宽带多波长的应用和普及,为了进一步提高网络的性能并提高资源利用率,出现了光网络控制面技术.路由选择与波长分配问题是WDM光传输网络控制面中非常重要的问题之一.目前实际应用最广泛的波长分配算法是First-Fir(FF)算法.本文基于FF算法,研究动态业务下波分复用光网络在固定选路下的波长分配问题,提出了一种新的波长分配启发式算法——Joint First Fit.计算机仿真试验表明,与常用的FF算法相比,该算法显著的降低了网络呼叫阻塞率,有利于提高网络资源的利用率.     

光互联网中的业务感知和波长调度机制研究

提出了使用广义到达时间间隔的贝叶斯网络业务分类感知算法和基于业务感知的光互联网波长调度机制.仿真结果表明,使用广义到达时间间隔的贝叶斯网络业务感知算法获得的平均感知准确率可高达98%,同时训练数据中业务类型所占比例与该类型业务的感知准确率有密切关系.基于业务感知的波长调度机制在获得更高波长资源利用率的同时,能够实现光网络资源与业务需求的更好适配.     

基于迁移演员-评论家学习的服务功能链部署算法

针对5G网络切片环境下由于业务请求的随机性和未知性导致的资源分配不合理从而引起的系统高时延问题,该文提出了一种基于迁移演员-评论家(A-C)学习的服务功能链(SFC)部署算法(TACA)。首先,该算法建立基于虚拟网络功能放置、计算资源、链路带宽资源和前传网络资源联合分配的端到端时延最小化模型,并将其转化为离散时间马尔可夫决策过程(MDP)。而后,在该MDP中采用A-C学习算法与环境进行不断交互动态调整SFC部署策略,优化端到端时延。进一步,为了实现并加速该A-C算法在其他相似目标任务中(如业务请求到达率普遍更高)的收敛过程,采用迁移A-C学习算法实现利用源任务学习的SFC部署知识快速寻找目标任务中的部署策略。仿真结果表明,该文所提算法能够减小且稳定SFC业务数据包的队列积压,优化系统端到端时延,并提高资源利用率。     

基于最长有效功能序列的服务功能链部署算法

服务功能链的服务性能取决于功能的部署位置和数据传输路径的选择。针对资源有限的网络中的服务功能链部署问题,该文设计了一种基于最长有效功能序列(LEFS)的服务功能链部署算法,以功能复用和带宽需求联合优化为目标,在控制路径长度的同时根据LEFS逐步搜索中继节点,直至满足服务请求。仿真结果表明,该算法能够均衡网络资源,同时优化网络的功能部署率和带宽利用率,与其他算法相比,网络资源利用率降低了10%,可以支持更多的服务请求,且算法计算复杂度低,可以实现对服务请求的快速响应。     

支持多优先级QoS的业务量疏导算法

针对当前业务量疏导研究中很少涉及的QoS约束的问题,提出并研究了一种支持多优先级QoS的业务量疏导算法（Differentiated Traffic Grooming Algorithm,DTGA）,该算法综合考虑了对不同等级业务QoS和网络资源利用率的优化。与目前实用的WDM光网络业务量疏导算法的性能仿真对比表明,DTGA能有效地降低高服务等级需求业务的阻塞率和节省网络资源。     

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

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

异构无线网络基于业务特性的动态无线资源管理（英文）

The traffic with tidal phenomenon in Heterogeneous Wireless Networks(HWNs)has radically increased the complexity of radio resource management and its performance analysis.In this paper,a Simplified Dynamic Hierarchy Resource Management(SDHRM)algorithm exploiting the resources dynamically and intelligently is proposed with the consideration of tidal traffic.In network-level resource allocation,the proposed algorithm first adopts wavelet neural network to forecast the traffic of each sub-area and then allocates the resources to those sub-areas to maximise the network utility.In connection-level network selection,based on the above resource allocation and the pre-defined QoS requirement,three typical network selection policies are provided to assign traffic flow to the most appropriate network.Furthermore,based on multidimensional Markov model,we analyse the performance of SDHRM in HWNs with heavy tailed traffic.Numerical results show that our theoretical values coincide with the simulation results and the SDHRM can improve the resource utilization.     

带有业务感知分类的低开销保护策略

为将IP业务准确分类,并根据所分优先级类别进 行高效合理的区分保护,提出一种带有业务感知分 类的网络保护策略(PSTAC)。定义信息重要度(IS)感知业务特征 ,结合贝叶斯理论建立业务优先级分类模型,并考虑不 同级别业务的QoS参数进行针对性保护。仿真结果表明,所提PSTAC实现了高精度的业务分类 ,且比传统的区分保护策略有更高的资源利用率和更低的网络阻塞率。     

一种新的对称CDMA系统中非对称业务下的呼叫允许控制策略

未来无线多媒体网络将以分组技术为基础,支持多种业务的传输,业务的QoS保证将受到一定的挑战.各运营商也将针对自己所服务的对象特点,定义各类业务的QoS等级,来提供具有不同QoS要求的业务.因此,呼叫允许控制(Call Admission Control,CAC)策略将要以分组业务为主要对象,即既要在充分利用系统资源的基础上保证各业务的QoS要求,又要适应各运营商之间的不同需求.因此本文提出一种新的对称CDMA系统中非对称业务下基于动态QoS保证的CAC策略.各运营商可根据自己的要求定义各业务的QoS等级.由于业务的不同特性,使得网络中上行链路和下行链路的业务呈现不对称性,为避免资源的浪费,将根据网络中的资源占有情况动态的地分配上行和下行链路中的资源.仿真结果表明,该策略可以自适应地保证各业务的QoS要求,提高了业务间的公平性和系统资源的利用率.     

Fair resource allocation with guaranteed statistical QoS for multimedia traffic in wideband CDMA cellular network

A dynamic fair resource allocation scheme is proposed to efficiently support real-time and non-real-time multimedia traffic with guaranteed statistical quality of service (QoS) in the uplink of a wideband code-division multiple access (CDMA) cellular network. The scheme uses the generalized processor sharing (GPS) fair service discipline to allocate uplink channel-resources, taking into account the characteristics of channel fading and intercell interference. In specific, the resource allocated to each traffic flow is proportional to an assigned weighting factor. For real-time traffic, the assigned weighting factor is a constant in order to guarantee the traffic statistical delay bound requirement; for non-real-time traffic, the assigned weighting factor can be adjusted dynamically according to fading, channel states and the traffic statistical fairness bound requirement. Compared with the conventional static-weight scheme, the proposed dynamic-weight scheme achieves capacity gain. A flexible trade-off between the GPS fairness and efficient resource utilization can also be achieved. Analysis and simulation results demonstrate that the proposed scheme enhances radio resource utilization and guarantees statistical QoS under different fairness bound requirements.     

一种在MPLS网络中支持QoS的流量工程算法

该文提出了一种改善QoS的队列调谐算法(QueueTuningAlgorithm:QTA),该算法应用于多协议标签交换(MPLS)流量工程。该算法通过把不同类别的业务,如传统的尽力而为(Best-Effort)业务和具有QoS需求的业务,映射到不同队列,然后根据链路的状况以及业务的QoS需求来进行队列调谐。QTA在实现负载均衡的同时又支持业务流的QoS,优化网络资源的利用。仿真表明该算法在MPLS网络中运行良好。     

动态TDMA时隙分配算法在数据链中的仿真

固定TDMA分配算法能够保证节点数据发送的公平性,但不可能针对当前业务和网络状态进行时隙预留分配,很难实现差别服务和提供支持QoS（服务质量）的机制。因此提出一种适用于TTNT（战术瞄准网络技术）数据链通信系统的动态TDMA时隙分配算法,在高负载的网络环境下,这种算法加入了优先级机制并根据业务量轻重对各节点采取不同的发送策略,对时隙有较高利用率,提高了Ad Hoc（自组织网）网络系统吞吐量。在OPNET网络仿真平台上进行了仿真验证,仿真结果表明该算法在吞吐量和时延方面都优于固定TDMA算法。     

Dynamic inter-SLA resource sharing in path-oriented differentiated services networks

This paper proposes novel resource sharing schemes for differentiated services (DiffServ) networks, to achieve both high resource utilization and quality of service (QoS) guarantee. Service level agreements (SLAs) are negotiated at network boundaries and supported by path-oriented resource mapping within the network. The recently proposed SLA management scheme based on virtual partitioning (Bouillet et al., 2002) allows overloaded SLAs to exploit the spare capacity of underloaded SLAs for efficient resource utilization, however, at the the cost of possible SLA violation of the underloaders. In the bandwidth borrowing scheme proposed here, the dedicated bandwidth for underloaded SLAs is determined and adaptively adjusted at network boundaries according to the actual traffic load and QoS policies; the available spare capacity is then properly distributed to related links for lending to others. On the other hand, the traffic flows admitted with borrowed bandwidth are tagged and may be preempted later when the original bandwidth owner needs to claim back the resources. Through a detailed implementation design and extensive computer simulation results we show that, by bandwidth borrowing, both SLA compliance and high resource utilization can be achieved in various load conditions, with some side benefits such as call-level service differentiation, small admission overhead, and convenience for policy-based management. In addition, we propose a distributed bandwidth pushing scheme that can dynamically adjust the spare bandwidth distribution over the network. Combining bandwidth pushing with bandwidth borrowing, the resource utilization can be further improved.     

A flexible and distributed architecture for adaptive end-to-end QoS provisioning in next-generation networks

A novel distributed end-to-end quality-of-service (QoS) provisioning architecture based on the concept of decoupling the end-to-end QoS provisioning from the service provisioning at routers in the differentiated service (DiffServ) network is proposed. The main objective of this architecture is to enhance the QoS granularity and flexibility offered in the DiffServ network model and improve both the network resource utilization and user benefits. The proposed architecture consists of a new endpoint admission control referred to as explicit endpoint admission control at the user side, the service vector which allows a data flow to choose different services at different routers along its data path, and a packet marking architecture and algorithm at the router side. The achievable performance of the proposed approach is studied, and the corresponding results demonstrate that the proposed mechanism can have better service differentiation capability and lower request dropping probability than the integrated service over DiffServ schemes. Furthermore, it is shown that it preserves a friendly networking environment for conventional transmission control protocol flows and maintains the simplicity feature of the DiffServ network model.