Connection availability based protection algorithm in wireless-optical broadband access network

The hybrid Wireless-Optical Broadband Access Network （WOBAN） provides a new and promising architecture for broadband access network by combining the beneficial properties of wireless and optical access technologies. To avoid huge data loss, WOBAN needs to be designed with a high availability guarantee. The purpose of this paper is to protect the Passive Optical Network at the back-end using the backup radios in Wireless Mesh Network at the front-end. The proposed protection scheme is based oi1 a connection availability mode]. First,we assigned several backup Optical Network Units （ONUs） for each primary ONU not satisfying the availability requirement of primary optical connection. Under the availability requirement of backup optical connection, each backup ONU needed to reserve the residual capacity as the backup capacity to fully protect the traffic demand of its primary ONU. Then, we selectively deployed the additional radio interfaces as the backup radios for the wireless routers in the front-end under the availability requirement of backup wireless connection, in order to establish the wireless-backup-path between each pair of primary and backup ONUs. Each backup radio on the wireless-backup-path will retain the backup radio capacity for rerouting traffic, so as to decrease the possibility of traffic block in case of failure. We aimed to design efficient heuristic algorithms and yield suboptimal solutions for minimizing the consumption of backup ONU capacity and the cost of backup radios. Simulation results demonstrate the advantage of the proposed scheme compared to previous works.     

A new integrated energy-saving scheme in green Fiber-Wireless（FiWi） access network

Energy savings in Internet have been regarded as a significant technical issue for academic and industrial community.Particularly,access network accounts for more than 70%of the total energy consumption of Internet.As a promising access technique,Fiber-Wireless(FiWi)network not only enables the cost-effective broadband access,but also provides more opportunities for energy savings.Previous works mostly focused on the energy savings in the optical back-end of FiWi.Generally,they extended the Optical Network Unit(ONU)sleep mechanisms initially designed for Passive Optical Network(PON)to FiWi by combining with the wireless rerouting.However,most of these works left the energy savings in the wireless front-end untouched.In fact,when one or more ONUs in the network is/are sleeping,many wireless components remain idle or underutilized which cause a lot of energy waste.Motivated by this,we propose a new integrated Wireless-Optical Energy Savings(WOES)scheme for the comprehensive energy savings in FiWi.The WOES scheme consists of two interactive modules,Energy-Efficient ONU Management(EEOM)and Energy-Aware Topology Configuration(EATC).EEOM aims at the energy savings in the optical back-end by putting the low-load ONUs into sleep state.A pair of thresholds is introduced into EEOM to maintain the states of ONUs.As soon as ONUs states change,EATC will reconfigure the wireless topology by putting the idle Radio Interfaces(RIs)into standby state,thus minimizing the energy consumption of the wireless front-end.Simulation results show that the WOES scheme can reduce the energy consumption significantly with just a little performance degradation in network throughput and end-to-end delay.     

一种保证NFV可靠性的最优备份拓扑生成方法

网络功能虚拟化（NFV）将服务功能链（SFC）映射到底层网络时,与传统的虚拟网络一样,会存在可靠性问题。本文针对NFV环境中的单链路故障,在考虑SFC拓扑设计和映射的基础上添加备份拓扑提高可靠性,再进一步简化备份拓扑,减少资源消耗。按照服务路径是否可分离,提出了两种最优备份拓扑的生成算法。仿真结果表明,最优备份拓扑在提高可靠性的基础上能够有效的减少备份带宽资源的消耗,提高资源利用率。     

Applying tabu search to backup path planning for multicast networks

More and more multimedia applications rely on the ability of networks to provide multicast communications. Network survivability becomes a critical issue in network planning, design, and operation to reduce the impacts of failures in high-speed networks. A rapid and cost-effective restorable network must be planned to maintain network survivability and use network bandwidth effectively. This paper considers the problem of preplanning delay-constrained backup path for multicast networks to minimize the total cost of all the backup paths. Based on the path restoration scheme, a tabu search (TS) algorithm is proposed to find a near optimal solution for the problem under investigation. Diversification and intensification strategies are suggested. The computational experiments are conducted to demonstrate the performance of the proposed TS algorithm. The results show that it offers high-quality solutions within a short amount of time.     

PTN网络的二次断纤链路规划算法

在PTN（PacketTransportNetwork）网络规划建设中,需要对光纤链路留出备份带宽,以保证部分光纤断开时,受影响业务有足够的容量进行路由重组。这也是提高网络生存性的有效方法之一。文中首先遍历网络双链路的失效状态,然后断开网络中任意两条链路,通过逐次增加链路容量来保证失效业务能够重组路由;最后提出二次断纤链路容量规划算法并进行试验仿真。结果表明,该算法在节约网络带宽、降低建造成本以及故障容错方面有着良好性能,能够很好应用于传送网络的链路规划中。     

Performance improvement for applying network virtualization in fiber-wireless （FiWi） access networks

Fiber-wireless （FiWi） access networks, which are a combination of fiber networks and wireless networks, have the advantages of both networks, such as high bandwidth, high security, low cost, and flexible access. However, with the increasing need for bandwidth and types of service from users~ FiWi networks are still relatively incapable and ossified. To alleviate bandwidth tension and facilitate new service deployment, we attempt to apply network virtualization in FiWi networks, in which the network＇s control plane and data plane are separated from each other. Based on a previously proposed hierarchical model and service model for FiWi network virtualization, the process of service implementation is described. The performances of the FiWi access networks applying network virtualization are analyzed in detail, including bandwidth for links, throughput for nodes, and multipath flow transmission. Simulation results show that the FiWi network with virtualization is superior to that without.     

应对枢纽失效的轴辐式网络枢纽备份

为提高轴辐式网络可靠性,在初始枢纽失效时保持轴辐式网络正常运转,提出了一种轴辐式网络枢纽备份优化方法,给每一个枢纽点选择一个备份枢纽,使轴辐式网络初始成本和备份成本总和最优。首先,在轴辐式网络基本模型中引入枢纽备份变量,建立非线性规划扩展模型,通过变量代换的线性化方法,将扩展模型线性化,用数学求解器CPLEX求解轴辐式网络枢纽备份小规模问题。然后,增加轴辐式网络节点规模,设计遗传算法求解大规模轴辐式网络枢纽备份优化问题。最后,在CPLEX和遗传算法中,调整初始轴辐式网络成本和备份成本比例权重,分别得到初始成本、备份成本、枢纽选址与备份枢纽的精确解和优化解。算例实验得出初始轴辐式网络、备份枢纽以及目标函数最优值。实验结果表明,所提方法备份枢纽分担了初始枢纽的流量和容量,当初始枢纽失效时,备份枢纽可以承担初始枢纽的运输任务让轴辐式网络继续运转。该枢纽备份优化方法可应用于应急物流和物流网络安全管理方面。     

Localized motion-based connectivity restoration algorithms for wireless sensor and actor networks

In wireless sensor and actor networks maintaining inter-actor connectivity is very important in mission-critical applications where actors have to quickly plan optimal coordinated response to detected events. Failure of one or multiple actors may partition the inter-actor network into disjoint segments, and thus hinders the network operation. Autonomous detection and rapid recovery procedures are highly desirable in such a case. This paper presents DCR, a novel distributed partitioning detection and connectivity restoration algorithm to tolerate the failure of actors. DCR proactively identifies actors that are critical to the network connectivity based on local topological information, and designates appropriate, preferably non-critical, backup nodes. Upon failure detection, the backup actor initiates a recovery process that may involve coordinated relocation of multiple actors. We also present an extended version of DCR, named RAM, to handle one possible case of a multi-actor failure. The proposed algorithms strive to avoid procrastination, localize the scope of recovery and minimize the movement overhead. Simulation results validate the performance of the proposed algorithms.     

基于DSR协议的备用路由机制设计和性能评价

由于Adhoc网络中无线节点的移动性及无线信道的不稳定性,已经建立起来的源和目的节点间的路由在多媒体业务传输过程中往往会失效,重新发现路由会导致较大延迟和丢包,对实时多媒体业务传输这是不能接受的,因此需要在Adhoc网络中建立一种快速路由恢复机制以减少因路由失效引起的较大端到端的延迟和丢包。将有线网络中广泛使用的备用路由机制扩充到了无线Adhoc网络DSR路由协议上,并通过实验床上进行的户外实验,分析和评价了增加了备用路由的DSR协议在减少路由失效次数和投递率方面的性能改善。     

一种基于备份代价重要度的虚拟网络功能备份方法

为了保证网络服务的可靠性,降低备份资源成本开销,首先在初始映射视图中计算每个虚拟网络功能的备份代价重要度,每次迭代选择具有最大和次大备份代价重要度的虚拟网络功能进行联合备份,通过相应的选择和更新模型最终得到最优的备份策略。最后,将该方法与其他三种方法进行对比实验,所提算法在备份成本开销、占用的物理节点数量、服务请求接受数量和备份资源利用率上具有良好的性能。     

Multicast protection scheme in survivable WDM optical networks

The protection design is a key issue in survivable wavelength division multiplexing (WDM) optical networks. Most researches focused on protecting unicast traffic against the failure of a single network component such as a link or a node. In this paper, we investigate the protection scheme for multicast traffic in meshed WDM optical networks under dual-link failure consideration, and propose a novel protection algorithm called shared segment protection with reprovisioning (SSPR). Through dynamically adjusting link-cost according to the current network state, SSPR establishes a primary light-tree and corresponding link-disjoint backup segments for each multicast connection request. A backup segment can efficiently share wavelength capacity of its working tree or the common resource of other backup segments. Capacity reprovisioning establishes new segments for the vulnerable connections after a link failure and tolerates following link failures. The simulation results show that SSPR not only can make good use of wavelength resources and protect multicast sessions against any single-link failure, but also can greatly improve the traffic restorability in the event of dual-link breakdown.     

Cost Efficient Fault Tolerant Design in Mesh Optical Networks with the Load Aware Method

With increasing wavelength capacity, the fault tolerant policy of the mesh optical network becomes much more important. To meet the survivability requirement, a set of cost efficient fault tolerant mechanisms are designed in this paper. The main objective is the minimization of the total number of required wavelengths. Furthermore, based on the method of the Integer Linear Program (ILP), shared-path protection and shared-link protection strategies are achieved, respectively. Moreover, the objective of minimizing the load imbalance is used to ensure the network resources utilized efficiently, and then the wavelength contention can be mitigated by selecting the working path and backup path reasonably. The results show that the survivability of the optical network can be guaranteed in a cost efficient manner.     

基于非均匀分环与最小通信代价的路由算法

为了提高无线传感器网络的生命周期,提出了一种基于非均匀分环与最小通信代价的路由算法URMC.算法采用圆环模型,首先为各环分配不同的簇头选择概率;其次以各环节点能耗均衡为目标,推导出各环宽度的表达式;最后通过设计通信代价公式来选择簇头和建立簇间路由树.最终形成一个节点能耗均衡、簇间路由合理的网络.经仿真验证,URMC算法能有效克服能量空洞现象,延长网络的生存周期.     

基于骨干网的数据中心网络服务规划设计

数据中心是云计算的核心,而当前基于电交换器、传统多级交换网络、集中放置与管理的数据中心架构无法满足未来云服务对高性能数据中心在可生存性、高可用性与设计灵活性等方面的要求。以网络可生存性和最小化网络代价为目标,针对数据中心的放置、服务路由及保护进行联合优化设计。首先通过设计ILP获取最优解。该ILP集成了p-cycle、服务量备份以及快速重路由等思想,分别针对单个链路或单个服务器损坏进行快速保护。然后进一步给出一种启发式算法,该算法包含数据中心的放置及服务路由和快速保护两大步骤。ILP和启发式两种方法最终都通过广泛的仿真实验进行了验证。     

传感器网络中一种存储有效的小波渐进数据压缩算法

现有的数据压缩算法大多以节能为设计目标,很少顾及到节点有限的存储容量.设计适合传感器网络小波变换的环模型和基于覆盖重叠的分簇模型,消除边界效应.基于此两种网络模型,分别提出存储有效的二维和三维渐进小波数据压缩算法,该算法依据小波函数的支撑长度和簇头的可用存储容量来确定渐进传送的数据单元,具有存储有效性;依据空间相关性来选择渐进传送数据的传感器节点,从而在存储有效的同时又节省网络传输耗能.从存储开销、能量消耗和网络延时等3个方面分析了算法的性能.理论分析和实验结果表明,和一般的数据压缩算法相比,小波渐进压缩算法在耗能相当的情况下,节省了节点的存储容量.     

A new algorithm based on auxiliary virtual topology for sub-path protection in WDM optical networks

This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (SPAVT) to tolerate the single-link failure in WDM optical networks. First, according to the protection-switching time constraint, SPAVT searches multiple pairs of primary and backup paths for each node pair in the network by the off-line manner, and then map these paths to the virtual topology. When a connection request arrives, SPAVT only needs to run one time of the Dijkstra’s algorithm to search a virtual route in virtual topology, where the route may consist of multiple pairs of sub-paths, to meet the protection-switching time constraint. Then, according to the shared resources policy, SPAVT chooses an optimal pair of sub-paths. Simulation results show that SPAVT has smaller blocking probability and lower time complexity than conventional algorithms.     

网络备份系统中的海量缓存方法*

提出一种在网络备份系统(network backup system,NBS)中的海量缓存方法。给出海量缓存的定义、使用目的和与备份代价密切相关的大小评估,并描述了一种基于MS Windows海量缓存设计与实现的方法,并对其性能进行了实验分析。由于网络传输与备份中心处理的延迟,使得本地I/O系统处理速度远远大于数据备份的速度,从而造成本地内存缓冲队列的大小越来越大。海量缓存方法就是通过借助大量的辅存来解决这个问题,当本地数据中心监控到数据变化后,会先把数据变化放入辅存中,然后再发送到远程备份中心。     

A new heuristic protection algorithm based on survivable integrated auxiliary graph in waveband switching optical networks

In this paper, we study the survivability in waveband switching optical networks and propose a new heuristic algorithm called Protection based on Survivable Integrated Auxiliary Graph (PSIAG) to tolerate the single-link failure. The survivable integrated auxiliary graph (SIAG) is compared of the single virtual topology layer and multiple waveband-plane layers, and it can well solve the problem of routing and waveband assignment. In PSIAG, we can feasible use the waveband sub-path grouping scheme based on SIAG to save the switching ports in MG-OXCs. For each demand, PSIAG first computes the single-hop or multi-hop route-pair including a primary path and a link-disjoint backup path on virtual topology layer. If the route-pair cannot be found on virtual topology layer, PSIAG then computes the hybrid multi-hop route-pair on jointing the virtual topology layer and waveband-plane layers. Simulation results show that PSIAG can obtain better performance than previous algorithm.     

Restoration Probability Modelling for Active Restoration-Based Optical Networks with Correlation Among Backup Routes

Active restoration (AR) is a novel lightpath restoration scheme proposed recently to guarantee a certain degree of survivability in wavelength-division multiplexing (WDM) optical networks with a reasonable trade-off between capacity requirement and restoration time. In this paper, we conduct a comprehensive performance analysis for AR-based optical networks. In particular, we propose a novel analytical framework for modeling the restoration probability of a connection (the probability that the connection can be successfully restored in case of a failure) when the possible correlation among its multiple backup routes is incorporated. Although theoretically, we need to consider all the possible correlations between as many as Q) pairs of backup routes to analyze the restoration probability in a network with N nodes, and this high computation complexity may obscure the practicality of an approach, considering all the possible correlations among backup routes, our analysis in this paper indicates that by considering at most the possible correlations among any three successive backup routes of a connection, we can achieve a very good approximation to the simulated restoration probability of the connection, as verified by extensive simulation results upon two typical network topologies under various workloads. We find that the proposed framework can deeply investigate into the inherent relationship among restoration probability, wavelength channel utilization ratio, number of wavelengths per fiber, routes hop length, and wavelength conversion capability. As a result, the framework significantly contributes to the related areas by providing network designers with a quantitative tool to evaluate the restoration probability and, thus, the survivability of AR-based optical networks.     

基于EPON系统的电力ONU模块设计

针对当前电力通信方式在稳定性与安全性方面的不足,设计了基于以太网无源光网络(EPON)系统的电力光网络单元(ONU)模块.采用电力ONU设备模块化的方法简化了电力通信的网络结构,采用电力ONU模块精简组合设计降低了成本.阐述了电力ONU模块的硬件设计实现方法,对主控芯片、光收发模块、数据存储模块以及外围电路进行了分析;软件部分给出了操作系统移植与应用程序设计流程.测试结果表明,电力ONU模块满足电力通信的要求.