A dynamic bandwidth control scheme of VP in ATM networks

This paper proposes an efficient adaptive bandwidth allocation scheme of virtual paths. The bandwidth of a virtual path is dynamically adjusted according to the link residual capacity. The scheme can remarkably reduce the load on node processing and simplify the network architecture, while keeping higher transmission efficiency. The excellent performance is proved by detailed theoretical analyses.     

A multilevel optimal control approach to dynamic bandwidth allocation in broadband ISDN

In this paper a novel scheme for the dynamic allocation of bandwidth at the virtual path level in B-ISDNs is presented. A fluid flow model is developed to describe the time varying mean behaviour of a virtual path and serves as a state variable model. A multilevel optimal control theoretic approach is used in conjunction with the state model to derive a coordinated decentralised algorithm for virtual path bandwidth allocation. The integration of the virtual path bandwidth controller into a hierarchically organised network control scheme is incorporated in the problem formulation. The performance of the proposed scheme is evaluated using simulation.A version of this paper appears in the proceedings of INFOCOM'95.     

Network planning based on virtual path bandwidth management

Periodical performance evaluation and adaptive resource assignment, already proposed as performance-oriented management, seems to be the most suitable strategy for network planning under demand uncertainty. In this paper, we exploit the inherent capability of ATM networks to rearrange dynamically the already installed resources, and propose performance-oriented management combined with virtual path bandwidth (VPB) control for the planning of the extensions of bandwidth capacities of virtual paths (VPs) and transmission links of the network. We define a large network optimization problem and solve it by a rigorous, analytical procedure. The optimization model comprises specific requirements of the network-planning problem and a bandwidth distribution scheme ensuring network reliability. We reveal the efficiency of the proposed scheme by applying it on a model network, considering two realistic case-studies of network-traffic evolution. We show that in the presence of VPB control: (a) the initial distribution of the total bandwidth to VPs is of no importance, since it can be adaptively rearranged according to the offered traffic, (b) the network is well used and bandwidth investment could be saved, and (c) whenever additional bandwidth must be installed in VPs which have an unanticipated bad grade-of-service, time savings result. We present the network performance in detail, in figures, and compare this with the performance of the network in the absence of VPB control.     

一种智慧协同网络多参数的多路径路由算法

多路径路由技术采用多条路径同时传输,作为优化资源配置和负载均衡的重要技术,在路由可靠性、QoS路由、传输效率等多方面比单路径传输具有优势.现有互联网网络资源配置和路由机制相对静态和僵化,导致多路径技术的发展存在发展的局限性.现有多路径技术考虑在路由层面不利于多路径路由选择和计算,难以保证传输性能,降低网络传输效率.智慧协同网络能够动态感知网络需求,灵活适配网络资源,更好的支持路由可扩展性.本文在智慧协同网络架构下提出了一种智慧协同网络多参数的多路径路由算法.该算法制定了智慧协同网络多参数的多路径路由协议,对网络性能参数CPU占用率、往返时延(RTT)、带宽进行加权计算得到路径权重值,根据权重值进行流量分配.采用图论理论对网络流量分配及模型进行了分析.并在Mini-Net平台上进行了开发和实验,结果表明,该算法能够优化网络配置,减小往返时延,提高网络吞吐量,从而提高网络性能,实现负载均衡.     

保证航电波分复用网络实时性的虚拓扑设计

针对航空电子波分复用网络消息的实时性要求,对航空电子网络的结构进行了研究,分析了在该网络中造成消息延迟的主要因素为转发延迟。进而对航空电子网络建模,根据WDM网络的资源特性进行拓扑的约束,提出了基于综合考虑虚拓扑跳数以及消息的带宽保证为目标的线性规划算法,在此基础上给出了大型网络的一个启发式算法,采用该线性规划算法对NSFNet网络拓扑进行了仿真验证。仿真结果表明,综合考虑虚拓扑跳数和消息带宽能减少消息的延迟,保证了网络实时性。     

基于TDMA起伏追踪机制的LTE网络数据传输优化算法

针对当前LTE网络数据传输优化算法对信道转移判断效率低、带宽占用率高、难以提升数据传输质量等不足,提出了一种新的LTE网络数据传输优化算法.基于时分多址(TDMA)控制技术,结合马尔科夫信道转移模型优化了信道带宽偏移轨迹;通过获取激发态-非激发态信道转移概率构建了起伏追踪机制,对信道转移时的起伏特性进行筛选.仿真结果表明:与当前LTE网络数据传输中常用的混频载波带通过滤算法、窄带噪声调整自适应过滤算法相比,所提算法进行数据传输所需的带宽最低,而数据传输质量更高,信道传输性能更好.     

Research of embedding algorithm for wireless network virtualization

Wireless network virtualization has become one of the promising techniques in fifth generation mobile networks (5G),and the virtual network embedding plays a very important role.A model was formulated to describe the problem and a wireless virtual network embedding algorithm based on joint bandwidth and power allocation (WVNEA-JBP) was put forward,which selected the suitable node and path to serve the data transmission from virtual networks.In order to minimize the overhead while satisfy the higher capacity request,this algorithm considered the impact of interference of wireless links and supports path splitting.A case study was introduced to show how WVNEA-JBP to work.Furthermore,simulation results show that WVNEA-JBP is able to accomplish the efficient utilization of network resources and improve the accept rate of virtual network requests.     

A simple bandwidth management strategy based on measurements ofinstantaneous virtual path utilization in ATM networks

A new connection admission control method based on actual virtual path traffic measurements is proposed to achieve high bandwidth efficiency for various types of traffic. The proposed method is based on the measurement of instantaneous virtual path utilization, which is defined as the total cell rate of the active virtual channels normalized by the virtual path capacity. A low-pass filter is used to determine the instantaneous virtual path utilization from crude measurements. A smoothing coefficient formula is derived as a function of the peak rate of the virtual channel. The residual bandwidth is derived from the maximum instantaneous utilization observed during a monitoring period. Simulation shows that the proposed method achieves statistical multiplexing gains of up to 80% of the limit possible with optimum control for similar traffic sources. It can be implemented with very simple hardware. The admission decision is simple: the requested bandwidth is compared with the residual bandwidth. This method is therefore well suited for practical asynchronous transfer mode switching systems     

Virtual network construction with K‐shortest path algorithm and optimization problems for robust physical networks

In network virtualization, it has been considered that virtual networks are constructed over a physical network where conventional data transmission services have been utilized. Here, virtual networks have to be constructed while keeping qualities of the conventional services. In this paper, we propose a new virtual network construction in order to construct many virtual networks while keeping the robustness of a physical network by using network resources effectively. The proposed method consists of three processes: K ‐shortest path algorithm and Prim's minimum spanning tree algorithm, path splitting, and path migration. In the proposed method, at first, multiple topologies are designed by using the K ‐shortest path algorithm and the Prim's MST algorithm according to the user's request. After the topology design is completed, an admission control with network robustness of the physical network is performed. Then, if one of the designed topologies can satisfy the construction conditions, a virtual network is constructed and provided with the user. Otherwise, the path splitting and path migration are performed. Here, the path splitting is utilized to design another topology of a virtual network and path migration is used to change the topologies of the virtual networks that have already been constructed. These processes are formulated as optimization problems and those are processed by solving the optimization problems. In numerical examples, we show that our proposed method can construct a higher number of virtual networks while keeping the robustness of a physical network by comparing with the conventional method where only the Kou–Markowsky–Berman algorithm is used. Copyright © 2015 John Wiley & Sons, Ltd.     

一种生存性军事虚拟网络映射新方法

针对生存性的军事虚拟网络映射问题,提出了生存性的军事虚拟网络映射需要遵循的原则。构建了虚拟网络映射模型,并采用蝙蝠算法进行求解。针对故障情况,提出了区分服务的故障恢复策略,对于高优先级虚网请求提前构建保护路径,对于低优先级虚网请求则提出基于链路可靠性的故障迁移算法,为了减少带宽消耗适当考虑了节点迁移策略。最后通过仿真验证了算法在虚拟网络运行成功率、故障修复率和链路利用率方面相比其他算法具有更好的性能。     

基于链路优先的快速协同虚拟网络映射算法

在网络虚拟化环境中,为了减少链路映射成本和提高收益,提出了一种链路优先的协同映射算法。该算法交替映射链路和节点,并使用贪心思想优先将带宽资源需求较大的虚拟链路映射到跳数较少的物理路径上,最终达到降低虚拟网络平均消耗和提高虚拟网络接受率的目的。仿真结果表明,与已有算法相比,所提算法节约了链路映射的成本,提高了虚拟网络接受率和物理网络收益,算法运行时间也有效缩短。     

弹性光网络中面向任播业务的节能路由算法

为提高数据中心间光互联网络的能效,面向任播业务提出一种具有业务持续时间感知的混合路径传输节能路由算法.为了减少新建光路和工作元器件数量,优先采用单路径传输;若业务阻塞则以传输能耗最小化为目标进行多路径传输.除此之外,引入基于频谱预留的业务疏导策略来降低保护带宽和光收发器的开销.仿真结果表明:与传统节能路由算法相比,所提算法在显著降低网络能耗的同时,有效避免了业务阻塞率的过度增加,实现了网络能耗与性能的平衡.     

Medium-term centralized virtual-path bandwidth control based ontraffic measurements

The paper presents a centralized virtual path bandwidth (VPB) control scheme for ATM networks which satisfies mainly three specifications: a) optimality during a medium-term control interval, b) fast time response so as to absorb the medium-term traffic fluctuations, and c) easy implementation. The paper mainly points at the impact of direct, on-line traffic measurements on bandwidth control. The control objective is to rearrange the installed bandwidth of the virtual paths according to the offered traffic so as to minimize the maximum call blocking probability of the whole network. Network simulation shows that a sophisticated VPB controller which relies on simple measurements of the offered traffic can substantially improve the performance of an ATM network. The necessary bandwidth rearrangement time is also examined by simulation     

物理节点可重复映射的虚拟网映射算法

该文在已有的映射算法基础上,结合K短路径的思想,改进了链路映射过程。算法通过多次搜索K短路径,寻找满足虚链路带宽需求的物理路径,有效地提高了虚链路的映射率。同时,根据虚拟网映射特性,针对节点映射过程,提出了物理节点可重复映射的映射算法,即在同一虚拟网映射过程中,物理节点可接受多个虚节点的映射。算法不仅减少了部分虚链路的映射过程,降低了映射的复杂度,而且节约了链路映射的成本,使物理网可以接收更多的虚拟网请求,有效地提高了映射效率。模拟实验表明,算法在执行时间、映射成功率以及映射收益等指标上都有着明显优势。     

卫星光网络的虚拟信道和主信道双重优化数据封装方法

针对卫星 光网络中不同类型、不同速率业务统一封装实现难度大和传输效率低的问题,提出利用虚拟 信道(VC) 与主信道(MC)联合优化的数据封装方法,分别给出VC封装与MC处理方法,并针 对其原理进 行分析。在VC中,提出了基于优先级的虚拟信道调度算法,对帧调度的时间冲突进 行优化,提 高虚拟信道处理的帧复用效率。在MC处理中,对传输帧支持的业务类型进行了扩展, 分析了前向 纠错编码对帧传输的性能影响。研究结果表明,采用优先级算法后帧传输效率提升 24.61%;外码为RS 码、内码为卷积码的级联码是MC处理中可选择的最佳编码方式。     

一种基于拓扑势的虚拟网络映射算法

该文针对现有的虚拟网络映射算法对网络中节点的拓扑属性考虑不够周到,导致其请求接受率和收益开销比较低的问题,将物理学里的场论思想引入了虚拟网络映射,并提出一种基于拓扑势的虚拟网络映射算法。该算法在节点映射阶段,通过计算节点的拓扑势、节点的资源能力、待映射节点与已映射节点之间的距离,将虚拟节点映射至最佳的物理节点。在链路映射阶段,通过计算物理路径的可用带宽和路径跳数,将虚拟链路映射至最佳的物理路径。仿真实验表明,该算法在多种虚拟网络到达强度下的请求接受率和收益开销比均优于当前的虚拟网络映射算法。     

Multi-hour, multi-traffic class network design for virtualpath-based dynamically reconfigurable wide-area ATM networks

The virtual path (VP) concept has been gaining attention in terms of effective deployment of asynchronous transfer mode (ATM) networks in recent years. In a recent paper, we outlined a framework and models for network design and management of dynamically reconfigurable ATM networks based on the virtual path concept from a network planning and management perspective. Our approach has been based on statistical multiplexing of traffic within a traffic class by using a virtual path for the class and deterministic multiplexing of different virtual paths, and on providing dynamic bandwidth and reconfigurability through virtual path concept depending on traffic load during the course of the day. In this paper, we discuss in detail, a multi-hour, multi-traffic class network (capacity) design model for providing specified quality-of-service in such dynamically reconfigurable networks. This is done based on the observation that statistical multiplexing of virtual circuits for a traffic class in a virtual path, and the deterministic multiplexing of different virtual paths leads to decoupling of the network dimensioning problem into the bandwidth estimation problem and the combined virtual path routing and capacity design problem. We discuss how bandwidth estimation can be done, then how the design problem can be solved by a decomposition algorithm by looking at the dual problem and using subgradient optimization. We provide computational results for realistic network traffic data to show the effectiveness of our approach. We show for the test problems considered, our approach does between 6% to 20% better than a local shortest-path heuristic. We also show that considering network dynamism through variation of traffic during the course of a day by doing dynamic bandwidth and virtual path reconfiguration can save between 10% and 14% in network design costs compared to a static network based on maximum busy hour traffic     

动态层次式接入控制方法的研究

针对分布式虚拟环境中,协作对象对数据报文的传送有着不同服务要求,本文提出了一种基于协作层次的动态层次式接入控制方法.该方法将协作层次和带宽预分配结合,协作用户在加入系统时,系统将用户订购的服务质量和系统即时网络情况进行比较,从而允许或挂起.实验结果表明这种动态层次式接入控制方法能减少无效报文的转发,缓解路由器上的报文处理负荷,并且能提高系统总的网络服务效率.     

SR架构下的软件定义信息中心网络概率路由策略

传统的TCP/IP路由以IP地址为中心,信息传输效率低下,难以满足网络用户需求.信息中心网络(Information-Centric Network,ICN)开始成为研究热点,ICN以内容为中心,可以高效传输信息.为了利用软件定义网络(Software Defined Network,SDN)和分段路由技术的优势,提高...     

基于智能网络的租户服务质量保证技术

在多租户虚拟网络环境中,用户对于网络服务的多样性以及性能的稳定性需求并不会随着网络架构和运营模式的升级而削弱,用户需求之间的差异性和动态性对于不同切片间资源的分配和调度效率提出了新的挑战.针对多租户虚拟网络的特殊环境,首先提出了QVR(QoS-Virtual Routing)流量调度算法,同时将用户流量调度与网络虚拟资...