An optical multicast packet switching architecture shared with limited-range multi-wavelength converter and full-range wavelength converters

Optical packet switch with multicast capability can inspire a broad range of multipoint to multipoint applications in future optical networks. An optical multicast packet switching architecture, equipped with feedback shared small number of limited-range multi-wavelength converters (LMWCs) and output shared some full-range wavelength converters (FRWCs), is proposed for a wavelength-division multiplexed optical multicast network to improve multicast performance in the paper. The FRWCs are used to overcome the performance degradation in terms of packet loss probability due to only use LMWCs. In the architecture, the two converters are shared by all the multicast packets importing to the optical multicast switch node. A maximum bipartite matching with minimum edges weights strategy was designed to employ fewer wavelength converters and avoid useless degradation of optical signal quality for the architecture to improve the node performance. The simulation results show that the proposed architecture and its wavelength converter scheduling algorithm can reduce the multicast packet loss probability with relatively lesser wavelength conversion cost.     

一种基于GMPLS协议快速实现ASON网络恢复的策略

在自动交换光网络(ASON)的控制平面内引入了通用多协议标签交换(GMPLS)协议, 使得光传送网络具备了更大的智能性。在控制平面拓扑和传送平面拓扑一致的情形下, 以GMPLS的“便道”技术为基础, 提出了一种改进型的基于标签交换路径(LSP )“双链路”恢复(DLR)的生存性机制。它对发生故障的节点两端链路同时实施迂回策略。通过对传统的链路恢复和“双链路”恢复进行细致地分析, 定量地给出了在这两种情形下, 信令恢复时间的比较方案。以美国AT&T实验室中研制的大型路由器上的数据为参数, 对上述两种不同恢复机制进行了对比分析, 进一步验证了该恢复策略提出的有效性。     

Multicast protection algorithms based on aggregated logical topology in survivable multi-domain optical networks

Since the optical network carries a lot of traffic, the survivability is an important issue to ensure the service continuity. At the same time, with the network scale increasing, the optical network has been divided into multi-domains each of which is managed by a unique network provider. Therefore, the survivability in multi-domain optical networks has got more attention in recent years. However, current works mostly addressed the unicast survivability and few or no solved the multicast survivability in multi-domain optical networks. Therefore, in this paper we propose two heuristic algorithms called Multicast Multi-domain Dedicated Protection (MMDP) and Multicast Multi-domain Shared Protection (MMSP) to provide the survivability in multicast multi-domain optical networks. In MMDP and MMSP, to provide the intra-domain protection, we use the modified Minimal-cost Path Heuristic (MPH) algorithm to compute the intra-domain survivable multicast tree. To provide the inter-domain protection, based on multi-domain logical topology, we firstly use the MPH algorithm to compute the inter-domain logical multicast tree and then use the Dijkstra algorithm to compute the inter-domain logical backup sub-path for each inter-link on this logical multicast tree. Simulation results show that MMSP has better resource utilization efficiency and lower blocking probability.     

复杂网络中带有应急恢复机理的级联动力学分析

提出带有应急恢复机理的网络级联故障模型,研究模型在最近邻耦合网络,Erdos-Renyi随机网络,Watts-Strogatz小世界网络和Barabasi-Albert无标度网络四种网络拓扑下的网络级联动力学行为.给出了应急恢复机理和网络效率的定义,并研究了模型中各参数对网络效率和网络节点故障率在级联故障过程中变化情况的影响.结果表明,模型中应急恢复概率的增大减缓了网络效率的降低速度和节点故障率的增长速度,并且提高了网络的恢复能力.而且网络中节点负载容量越大,网络效率降低速度和节点故障率的增长速度越慢.同时,随着节点过载故障概率的减小,网络效率的降低速度和节点故障率的增长速度也逐渐减缓.此外,对不同网络拓扑中网络效率和网络节点故障率在级联故障过程中的变化情况进行分析,结果发现网络拓扑节点度分布的异质化程度的增大,提高了级联故障所导致的网络效率的降低速度和网络节点故障率的增长速度.以上结果分析了复杂网络中带有应急恢复机理的网络级联动力学行为,为实际网络中级联故障现象的控制和防范提供了参考.     

基于节点负荷失效的网络可控性研究

Liu和Barabasi将现代控制理论应用到线性系统的网络可控性问题上, 提出了最小驱动节点集的计算方法, 解决了复杂网络控制的可计算问题. 针对现实网络中存在的节点因负荷过载而失效的问题, 本文提出了基于节点负荷失效的网络可控性模型. 通过对网络采用介数和Weibull失效模型, 在随机和目标失效机制下进行仿真, 研究结果表明: 维持无标度网络可控性的难度要明显大于随机网络; 在目标节点失效机制下, 即使对网络输入极少的失效信号, 也能极大地破坏网络的可控性; 使高介数节点失效要比使度高节点失效更能破坏网络的可控性, 说明高介数节点在维持网络可控性上发挥着重要作用; 对不同的负荷失效模型, 要合理采取措施, 防止网络发生阶跃性全不可控现象. 关键词： 网络可控性 结构可控性 节点失效     

Energy-Efficient Next-Generation Passive Optical Networks Based on Sleep Mode and Heuristic Optimization

Abstract

In this article, an energy-efficiency mechanism for next-generation passive optical networks is investigated through heuristic particle swarm optimization. Ten-gigabit Ethernet–wavelength division multiplexing optical code division multiplexing–passive optical network next-generation passive optical networks are based on the use of a legacy 10-gigabit Ethernet–passive optical network with the advantage of using only an en/decoder pair of optical code division multiplexing technology, thus eliminating the en/decoder at each optical network unit. The proposed joint mechanism is based on the sleep-mode power-saving scheme for a 10-gigabit Ethernet–passive optical network, combined with a power control procedure aiming to adjust the transmitted power of the active optical network units while maximizing the overall energy-efficiency network. The particle swarm optimization based power control algorithm establishes the optimal transmitted power in each optical network unit according to the network pre-defined quality of service requirements. The objective is controlling the power consumption of the optical network unit according to the traffic demand by adjusting its transmitter power in an attempt to maximize the number of transmitted bits with minimum energy consumption, achieving maximal system energy efficiency. Numerical results have revealed that it is possible to save 75% of energy consumption with the proposed particle swarm optimization based sleep-mode energy-efficiency mechanism compared to 55% energy savings when just a sleeping-mode-based mechanism is deployed.     

IP over WDM网络中可恢复的路由选择策略与算法

研究了IP over WDM网络中各层备用资源的分配问题,提出了一种新的IP over WDM网络中可恢复的路由选择策略以及应用于其中的备用路由选择算法.该策略通过层间备用资源共享,能够完全利用网络中为恢复光层故障所预留的资源来进行IP层故障恢复,从而大大提高了网络的资源利用率.对所提出的策略进行了性能分析,并给出了相应的性能指标.     

K-dimensional protection structure (KDPS) for multi-link failure in data center optical networks

Currently, data center has become one of the most important application resources. Meanwhile, there is huge amount of data streams within a data center or among different data centers, which requires the transmission channel with high bandwidth and good reliability. Optical networks become the essential solution for the data center interconnection. Especially for intra data center networks, there are too many links for a limited number of nodes, which make the network so complex and vulnerable. A K-dimensional protection structure (KDPS) is proposed against multi-link failure in data center optical networks, and 3DPS is mainly introduced and analyzed in the paper. Two greedy algorithms are proposed to construct KDPS in static and dynamic optical networks respectively. Numerical results show that 3DPS can be constructed with more difficulty in dynamic optical networks, and the greedy algorithm can find the 3DPS much easier under three-link failures than under dual-link failures.     

在WDM全光网络上构建上层网络的路由算法

在WDM全光网络上构建上层网络需要考虑上层网络的保护机制.上层网络按保护机制可分为最大故障链路数保护网和连通保护网.针对它们的不同特点给出了构建两类上层网络并使费用最低的启发式路由算法.与已有方法相比,具有算法简单,时间复杂性小,容易实用化的特点.大量的模拟计算也证明了算法的正确性.     

多波长复用光传送网的生存结构

本文讨论了光传送网的传送和监控机制,按照传送网通用功能结构的定义,分析了光传送网几种保护交换方式内在的机制,讨论了各自应该属于路径保护还是子网连接保护.在此基础上给出了光信道保护环和光复用段保护环详细的功能结构,同时简要地介绍了这两种保护环信息建模中需要用到的对象类.     

基于相继故障信息的网络节点重要度演化机理分析

分析了过载机制下节点重要度的演化机理.首先,在可调负载重分配级联失效模型基础上,根据节点失效后其分配范围内节点的负载振荡程度,提出了考虑级联失效局域信息的复杂网络节点重要度指标.该指标具有两个特点:一是值的大小可以清晰地指出节点的失效后果;二是可以依据网络负载分配范围、负载分配均匀性、节点容量系数及网络结构特征分析节点重要度的演化情况.然后,给出该指标的仿真算法,并推导了最近邻择优分配和全局择优分配规则下随机网络和无标度网络节点重要度的解析表达式.最后,实验验证了该指标的有效性和可行性,并深入分析了网络中节点重要度的演化机理,即非关键节点如何演化成影响网络级联失效行为的关键节点.     

WDM光网中虚拓扑重构的优化设计

采用优化方法来研究光网络业务发生改变时的虚拓扑重构问题,并提出了相应的混合整数线性规划算法.主要的思路是当业务发生改变时,寻找既能保证网络性能又对现有业务中断最小的虚拓扑.对影响虚拓扑重构的因素进行了研究,发现,如果使网络性能达到次优而不是最优可以大大减少对现有业务的中断.     

Complex networks: Dynamics and security

This paper presents a perspective in the study of complex networks by focusing on how dynamics may affect network security under attacks. In particular, we review two related problems: attack-induced cascading breakdown and range-based attacks on links. A cascade in a network means the failure of a substantial fraction of the entire network in a cascading manner, which can be induced by the failure of or attacks on only a few nodes. These have been reported for the internet and for the power grid (e.g., the August 10, 1996 failure of the western United States power grid). We study a mechanism for cascades in complex networks by constructing a model incorporating the flows of information and physical quantities in the network. Using this model we can also show that the cascading phenomenon can be understood as a phase transition in terms of the key parameter characterizing the node capacity. For a parameter value below the phase-transition point, cascading failures can cause the network to disintegrate almost entirely. We will show how to obtain a theoretical estimate for the phase-transition point. The second problem is motivated by the fact that most existing works on the security of complex networks consider attacks on nodes rather than on links. We address attacks on links. Our investigation leads to the finding that many scale-free networks are more sensitive to attacks on short-range than on long-range links. Considering that the small-world phenomenon in complex networks has been identified as being due to the presence of long-range links, i.e., links connecting nodes that would otherwise be separated by a long node-to-node distance, our result, besides its importance concerning network efficiency and security, has the striking implication that the small-world property of scale-free networks is mainly due to short-range links.     

二元决策图和故障树相融合的无线传感器网络可靠性分析

为了提高无线传感器分析网络可靠性,提出一种基于二元决策图和故障树相融合的无线传感器网络可靠分析方法;首先根据无线传感器网络拓扑结构建立了故障树模型,然后将无线传感器网络故障树转化为二元决策图结构,最后采用仿真实验分析了不同节点冗余度、不同跳数条件下无线传感器网络的可靠性;仿真结果表明,文章方法的分析结果可以帮助无线传感器网络性能的优化,可以提高无线传感器网络的可靠性。     

Analysis of permeability for the fractal-like tree network by parallel and series models

This work investigates the hydraulic conductivity properties in the fractal-like tree networks between one point and a straight line. The expression for the effective permeability of the networks is derived based on the parallel and series models and the relationship between the effective permeability and the geometry structures of the network is analyzed. It is found the effective permeability after including tortuosity is about 20% lower than that without considering the tortuosity, and the tortuosity effect should be included in analysis of hydraulic conductivity properties in the networks; the effective permeability is very sensitive to the geometrical structures of the network. A comparison of the fractal-like tree network with the traditional parallel net indicates that the fractal-like tree network can provide much higher permeability than that of the traditional parallel net.     

Analysis of Transmission Performance in SUPERPONs

In this work we study how optical amplifiers can deeply improve the performance of the passive optical networks (PONs), permitting a large number of optical network units (ONUs), transmitting at high bit rate. These high-capacity networks are called SUPERPONs, and we show how to achieve a network with 8,192 ONUs with a transmission in the downstream direction up to 10 Gbit/s.     

Analysis of Transmission Performance in SUPERPONs

In this work we study how optical amplifiers can deeply improve the performance of the passive optical networks (PONs), permitting a large number of optical network units (ONUs), transmitting at high bit rate. These high-capacity networks are called SUPERPONs, and we show how to achieve a network with 8,192 ONUs with a transmission in the downstream direction up to 10 Gbit/s.     

Failure location mechanism in long-reach PON based on OCDR

An efficient and unambiguous failure monitoring and protection mechanism is proposed in long-reach passive optical network (LR-PON). Optical code domain reflectometer by optical coding scheme is utilized. Improved optical encoders are placed centrally in optical distribution network and at both sides of each remote node to monitor all links and nodes in the network, which can make much simpler installation and smaller management costs. A reliable and robust protection system is designed and it can protect LR-PON from multiple fault cases. The network can achieve monitoring and protection process by network management system centrally. After locating fault, the system can also monitor the network continuously. The performance analysis of the monitoring system: signal-to-noise-plus-interference ratio, signal-to-interference-ratio and signal-to-noise-ratio are studied. Furthermore, the performance of data signals for protection system is investigated by bit error rate. The results obtained prove the feasibility and efficiency of the proposed network, and it can support high network capacity.     

智能光网络中一种新型的分布式恢复方法

提出了一种基于固定备用路由和目的端触发的智能光网络中的分布式恢复方法,所选择的任一对源端节点和目的的端节点之间的固定备用路由包括该节点对之间的k条最短路径路由和基于部分链路无关的路由.目的端节点一旦探测到业务通道的失效将立即启动恢复进程,根据网络当前的资源使用情况,在这些备用路由中按照一定的次序选择一条恢复路由并为此分配一条可用的波长(对于没有波长变换器的光网络),然后将恢复通道的建立请求消息发送给该恢复通道的相关节点,这些相关节点可以锁定相关的网络资源,以避免来自其他恢复通道的竞争.所提出的算法增加了固定备用路由的数量,从仿真结果可以看出,该方法明显改善了失效连接的阻塞性能.     

Cascading failure in multilayer networks with dynamic dependency groups

The cascading failure often occurs in real networks. It is significant to analyze the cascading failure in the complex network research. The dependency relation can change over time. Therefore, in this study, we investigate the cascading failure in multilayer networks with dynamic dependency groups. We construct a model considering the recovery mechanism.In our model, two effects between layers are defined. Under Effect 1, the dependent nodes in other layers will be disabled as long as one node does not belong to the largest connected component in one layer. Under Effect 2, the dependent nodes in other layers will recover when one node belongs to the largest connected component. The theoretical solution of the largest component is deduced and the simulation results verify our theoretical solution. In the simulation, we analyze the influence factors of the network robustness, including the fraction of dependent nodes and the group size, in our model. It shows that increasing the fraction of dependent nodes and the group size will enhance the network robustness under Effect 1. On the contrary, these will reduce the network robustness under Effect 2. Meanwhile, we find that the tightness of the network connection will affect the robustness of networks. Furthermore, setting the average degree of network as 8 is enough to keep the network robust.