5G网络切片场景中基于预测的虚拟网络功能动态部署算法

针对无线虚拟化网络在时间域上业务请求的动态变化和信息反馈时延导致虚拟资源分配的不合理,该文提出一种基于长短时记忆(LSTM)网络的流量感知算法,该算法通过服务功能链(SFC)的历史队列信息来预测未来负载状态。基于预测的结果,联合考虑虚拟网络功能(VNF)的调度问题和相应的计算资源分配问题,提出一种基于最大最小蚁群算法(MMACA)的虚拟网络功能动态部署方法,在满足未来队列不溢出的最低资源需求的前提下,采用按需分配的方式最大化计算资源利用率。仿真结果表明,该文提出的基于LSTM神经网络预测模型能够获得很好的预测效果,实现了网络的在线监测;基于MMACA的VNF部署方法有效降低了比特丢失率的同时也降低了整体VNF调度产生的平均端到端时延。     

虚拟化云无线接入网络下基于在线学习的网络切片虚拟资源分配算法

针对现有研究中缺乏云无线接入网络(C-RAN)场景下对网络切片高效的动态资源分配方案的问题,该文提出一种虚拟化C-RAN网络下的网络切片虚拟资源分配算法。首先基于受限马尔可夫决策过程(CMDP)理论建立了一个虚拟化C-RAN场景下的随机优化模型,该模型以最大化平均切片和速率为目标,同时受限于各切片平均时延约束以及网络平均回传链路带宽消耗约束。其次,为了克服CMDP优化问题中难以准确掌握系统状态转移概率的问题,引入决策后状态(PDS)的概念,将其作为一种“中间状态”描述系统在已知动态发生后,但在未知动态发生前所处的状态,其包含了所有与系统状态转移有关的已知信息。最后,提出一种基于在线学习的网络切片虚拟资源分配算法,其在每个离散的资源调度时隙内会根据当前系统状态为每个网络切片分配合适的资源块数量以及缓存资源。仿真结果表明,该算法能有效地满足各切片的服务质量(QoS)需求,降低网络回传链路带宽消耗的压力并同时提升系统吞吐量。     

基于在线双向拍卖的虚拟网络切片资源调度机制

为解决 5G网络切片间资源分配的问题,该文提出一种基于在线双向拍卖 (ODA)的资源调度机制。该机制首先针对不同的业务需求和业务收益确定网络切片的优先级和单位资源报价;其次明确最大化网络收益的目标建立线下单向拍卖模型;进一步,考虑资源的动态分配和回收利用,提出价格更新算法实时更新资源价格;最后,综合线下单向拍卖机制和价格动态变化机制建立在线双向拍卖模型,为切片动态分配资源。仿真结果表明,该机制在提高网络收益的同时可以保证各切片用户的QoS需求。     

基于WRR的改进型队列调度算法

基于Diffserv(区分服务)体系,研究实现QoS(服务质量)控制的核心技术之一的队列调度技术。基于WRR(加权轮询)队列调度算法,提出新型的改进算法。改进的队列调度算法主要由流量调节器和调度策略两部分构成,将网络上的包按照Diffserv体系分为EF(加速转发)、AF(保证转发)、BE(尽力服务)三种业务类型,对不同的类型采用不同的调度策略。针对高优先级的EF业务直接采用PRI(优先级调度),针对AF业务采用改进后的WRR调度。仿真结果表明,该改进型调度算法在网络资源分配上具有一定的优越性。     

多模态网络中时间敏感网络模态的智能调度机制

针对多模态网络中时间敏感网络模态转发调度不确定、求解时间长等问题,提出了一种基于CSQF的时间敏感网络模态的联合路由与调度机制。综合考虑有界时延需求、网络状态和不同的路由机制,建立联合缓存队列和路由的混合资源调度模型,旨在优化整个网络的资源使用。基于深度强化学习方法,利用流量特征与缓存队列利用率来预测下一循环的缓存利用率。此外,基于多队列CSQF转发调度机制和基于缓存利用率的显式路由算法,提出了一种迭代调度算法,实现了确定性转发和资源分配。仿真结果表明,所提机制可以根据网络的资源使用情况有效地调整确定性应用的传输调度,与其他离线调度机制相比,具有更好的调度性能。     

非正交多址接入系统中基于受限马尔科夫决策过程的网络切片虚拟资源分配算法

针对无线接入网络切片虚拟资源分配优化问题,该文提出基于受限马尔可夫决策过程(CMDP)的网络切片自适应虚拟资源分配算法。首先,该算法在非正交多址接入(NOMA)系统中以用户中断概率和切片队列积压为约束,切片的总速率作为回报,运用受限马尔可夫决策过程理论构建资源自适应问题的动态优化模型;其次定义后决策状态,规避最优值函数中的期望运算;进一步地,针对马尔科夫决策过程(MDP)的“维度灾难”问题,基于近似动态规划理论,定义关于分配行为的基函数,替代决策后状态空间,减少计算维度;最后设计了一种自适应虚拟资源分配算法,通过与外部环境的不断交互学习,动态调整资源分配策略,优化切片性能。仿真结果表明,该算法可以较好地提高系统的性能,满足切片的服务需求。     

基于可靠性的5G网络切片在线映射算法

为了满足业务多样性对5G网络切片带来差异化需求的同时保证切片的可靠性,实现网络资源的优化配置。该文针对5G网络切片的动态映射、轻量级可靠映射问题,提出对计算资源、链路资源和RRU频谱资源联合分配方案。首先,该方案建立面向可靠性约束的多目标资源分配模型,引入李雅普诺夫优化模型,在保证队列稳定同时优化资源分配。其次,提出了基于队列稳定性的虚拟节点映射算法和基于可靠性的虚拟链路映射算法。最后,将时间离散为一系列连续的时间窗,利用时间窗动态处理到达的网络切片请求,实现在线的网络切片映射算法。仿真结果表明,该算法提高了资源利用率,并且保证网络可靠性。     

多业务网络动态带宽分配算法研究

在多业务网络环境中,面对不同的QoS需求,为不同业务分配合理的带宽资源是提高网络效率的有效保障。探讨了多业务网络环境下的带宽资源管理办法。重点研究了区分业务模型Diffserv中相关队列调度算法的基本原理,并对加权循环算法WRR进行改进。在基于周期测量发送队列的基础上对队列分配权值进行动态调整,使高优先级业务能够得到充分带宽资源保证的同时,对低优先级业务也有最低的传输带宽保证,从而满足多个业务的共同需求。通过NS2仿真和分析表明,经过改进的算法能对多业务环境下的数据传输提供区分服务,并且使得高优先级业务在丢包数和数据延迟方面与低优先级业务相比有明显减少。     

基于5G接入网络的多优先级虚拟网络功能迁移开销与网络能耗联合优化算法

针对5G接入网络中虚拟网络功能(VNF)部署完成后,其资源需求发生动态变化,导致网络中物理机(PM)资源利用率过高或过低这一问题,该文首先将网络中PM的资源使用情况划分5个不同分区,提出一种多优先级VNF迁移请求队列调度模型。其次基于该模型,对VNF迁移开销的最小化及网络能耗的最小化建立联合优化模型。最后提出一种基于5G接入网络的多优先级VNF迁移开销与网络能耗联合优化算法对其进行求解。仿真结果表明,该算法在有效实现VNF迁移开销与网络能耗折中的同时,提高了PM资源利用率,保证了PM性能并均衡各PM负载。     

MF-TDMA时隙资源的一种动态优化控制算法

针对当前卫星通信系统主要采用的多址接入体制,介绍了基于动态优化的时隙资源分配技术,并在多频时分多址技术(MF-TDMA)的二叉树块内时隙支援均分法的基础上,提出一种基于业务优先级预约的动态优化MF-TDMA时隙资源分配算法,对该算法进行了仿真和分析并给出了仿真曲线。仿真结果表明:通过针对不同优先级业务进行资源调度,能有效地保障高优先级的用户需求,还能降低提升整个系统的整体的业务离去率。     

自相似业务流下的星上交换全局优化缓冲分配算法

针对空间信息网络星上交换节点缓冲资源有限,提出一种适用于星上交换的缓冲优化分配算法。采用了Crossbar交换模型,在此基础上建立了虚通道自相似排队模型,通过计算每个虚通道缓冲溢出概率并采用遗传算法来实现缓冲资源全局优化分配。仿真结果表明,与均匀分配算法和贪婪分配算法相比,新算法具有更好的延时性能,在同等分组平均时延、业务流自相似程度为0.6和0.8的情况下,新算法比均匀分配算法可分别节省24.5%和26.4%的缓冲资源,并且分配效率比贪婪分配算法提高约21.9%。     

Source time scale and optimal buffer/bandwidth tradeoff forheterogeneous regulated traffic in a network node

We study the problem of resource allocation and control for a network node with regulated traffic. Both guaranteed lossless service and statistical service with small loss probability are considered. We investigate the relationship between source characteristics and the buffer/bandwidth tradeoff under both services. Our contributions are the following. For guaranteed lossless service, we find that the optimal resource allocation scheme suggests that sources sharing a network node with finite bandwidth and buffer space divide into groups according to time scales defined by their leaky-bucket parameters. This time-scale separation determines the manner by which the buffer and bandwidth resources at the network node are shared among the sources. For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexer using the “extremal” on-off, periodic sources. Under this approach, the optimal resource allocation for statistical service is achieved by maximizing both the benefits of buffering sharing and bandwidth sharing. The optimal buffer/bandwidth tradeoff is again determined by a time-scale separation     

基于在线拍卖的网络切片资源分配算法

为满足未来移动通信网络中多样化的业务需求,为用户提供定制化服务的同时提升网络经济效益,该文提出一种基于在线拍卖的网络切片资源分配算法。根据业务类型将用户的服务请求转化为相应投标信息,以最大化拍卖参与者的社会福利为目标,将切片资源分配问题建模为基于多业务的在线赢家确定问题。结合资源分配与价格更新策略,实现基于在线拍卖的资源优化配置。仿真结果表明,该算法能够在满足用户业务需求的同时,提升网络经济效益。     

A tree‐based algorithm for virtual infrastructure allocation with joint virtual machine and network requirements

Cloud providers have introduced the on‐demand provisioning of virtual infrastructures (VIs) to deliver virtual networks of computing resources as a service. By combining network and computing virtualization, providers allow traffic isolation between hosted VIs. Taking advantage of this opportunity, tenants have deployed private VIs with application‐optimized network topologies to increase quality of experience of final users. One of the main open challenges in this scenario is the allocation of physical resources to host VIs in accordance with quality of service computing (eg, virtual CPUs and memory) and network requirements (guaranteed bandwidth and specific network topology). Moreover, a VI can be allocated anywhere atop a network datacenter, and because of its NP‐hard complexity, the search for optimal solutions has a limited applicability in cloud providers as requesting users seek an immediate response. The present work proposes an algorithm to accomplish the VI allocation by applying tree‐based heuristics to reduce the search space, performing a joint allocation of computing and network resources. So as to accomplish this goal, the mechanism includes a strategy to convert physical and virtual graphs to trees, which later are pruned by a grouped accounting algorithm. These innovations reduce the number of comparisons required to allocate a VI. Experimental results indicate that the proposed algorithm finds an allocation on feasible time for different cloud scenarios and VI topologies, while maintaining a high acceptance rate and a moderate physical infrastructure fragmentation.     

MPEG4视频流量预测自适应算法的研究

为了保证用户的服务质量(QOS),宽带分组网在传送视频信息时需要进行动态带宽分配,而视频流量预测在动态带宽分配中发挥着重要的作用。本文从自相关性、自相似性的Hurst参数两个方面,阐明GOP时间尺度上的流量能够体现原始帧序列的流量特性,并在固定步长的LMS自适应算法(FSSA)的基础上提出的一种新的可变步长自适应算法(VSSA),在GOP的大时间尺度上预测MPEG4视频流量,通过大量的仿真实验表明,VSSA算法可以明显地改善预测性能。     

Resource allocation for statistical quality of service provision in buffered crossbar switches

The buffered crossbar switch is a promising switching architecture that plays a crucial role for providing quality of service (QoS) in computer networks. Sufficient amount of resources—bandwidth and buffer space—must be allocated in buffered crossbar switches for QoS provision. Resource allocation based on deterministic QoS objectives might be too conservative in practical network operations. To improve resource utilization in buffered crossbar switches, we study the problem of resource allocation for statistical QoS provision in this paper. First, we develop a model and techniques for analyzing the probabilistic delay performance of buffered crossbar switches, which is described by the delay upper bound with a prescribed violation probability. Then, we determine the required amounts of bandwidth and buffer space to achieve the probabilistic delay objectives for different traffic classes in buffered crossbar switches. In our analysis, we apply the effective arrival envelope to specify traffic load in a statistical manner and characterize switch service capacity by using the service curve technique. Instead of just focusing on one specific type of scheduler, the model and techniques developed in this paper are very flexible and can be used for analyzing buffered crossbar switches with a wide variety of scheduling algorithms. Copyright © 2007 John Wiley & Sons, Ltd.     

An Elastic Sub-carrier and Power Allocation Algorithm Enabling Wireless Network Virtualization

Wireless mobile network virtualization enables physical mobile network operators (PMNO) to partition their network resources into smaller slices and assign each slice to an individual virtual mobile network operator and then manages these virtual networks in a more dynamic and cost-effective fashion. How a PMNO allocates resources to individual slices while ensuring resource elasticity is a key issue. This paper presents a resource allocation algorithm in such a network virtualization scenario where resource considered here includes both sub-carriers and transmission power. The overall algorithm involves the following two major processes: firstly to virtualize a physical wireless network into multiple slices each representing a virtual network, where resources are allocated elastically based on traffic loads and channel state information during virtualization; secondly, to carry out physical resource allocation within each virtual network (or slice). In particular the paper adopts orthogonal frequency division multiplexing as its physical layer to achieve more efficient resource utilization. A multi-step dynamic optimization approach is proposed to achieve sub-carrier allocation using binary integer programming and power allocation using nonlinear programming. The aim is to achieve the following design goals: virtual network isolation, and resource efficiency. The simulation results show that the above goals have been achieved.     

A prioritized resource allocation algorithm for multiple wireless body area networks

This paper presents a prioritized resource allocation algorithm to share the limited communication channel resource among multiple wireless body area networks. The proposed algorithm is designed based on an active superframe interleaving scheme, one of the coexistence mechanisms in the IEEE 802.15.6 standard. It is the first study to consider the resource allocation method among wireless body area networks within a communication range. The traffic source of each wireless body area network is parameterized using the traffic specification, and required service rate for each wireless body area networks can be derived. The prioritized resource allocation algorithm employs this information to allocate the channel resource based on the wireless body area networks’ service priority. The simulation results verified that the traffic specification and the wireless body area network service priority based resource allocation are able to increase quality of service satisfaction, particularly for health and medical services.