半导体激光器实现波长转换的理论模型分析

作为自动交换光网络中的核心器件，全光波长转换器的研究是目前的热点。提出了基于半导体激光器实现波长转换的理论模型，采用小信号分析方法，利用速率方程求解了波长转换的频率调制响应特性。并初步研究了不同半导体激光器工作电流、码速、输入信号光功率、增益吸收系数条件对波长转换性能的影响。这对于优化基于半导体激光器的全光波长转换器有一定的参考价值。     

饱和吸收体实现波长转换的理论模型分析

作为自动交换光网络中的核心器件,全光波长转换器在网络中发挥着重要作用。基于半导体激光器速率方程,提出了新的基于饱和吸收体实现全光波长转换器的理论模型;并针对该理论模型,采用小信号分析方法讨论了波长转换的频率调制响应特性;数值求解了不同偏置电流、码速、输入信号光功率对波长转换性能的影响,对于实现和优化基于饱和吸收体的全光波长转换器有理论指导作用。     

A Demonstration of Automatically Switched Optical Network

We build an automatically switched optical network (ASON) testbed with four optical cross-connect nodes. Many fundamental ASON features are demonstrated, which is implemented by control protocols based on generalized multi-protocol label switching (GMPLS) framework.     

一种高效的ASON安全光路建立协议

针对自动交换光网络光路建立过程中存在的安全威胁,提出了一种高效的安全光路建立协议.该协议使用综合的波长预留策略,通过数字签名和消息反馈等安全机制,对GMPLS RSVP-TE消息中的重要对象进行完整性保护,并可防止内部节点的恶意或自私行为.另外,考虑到自动交换光网络中路由模块和信令模块强耦合的特点,采用OSPF-TE的PKLSA消息分发光路建立协议中所需的节点公钥证书.经仿真实验及分析表明,该协议在保证光通路安全建立的同时,在连接阻塞率、光通路建立时间和消息负载方面都优于原有的RSVP-TE信令协议.     

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

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

Design and Implementation of an ASON Management System

According to current management requirements, an ASON management information model and system architecture using CORBA and Java are proposed. A test platform is implemented to demonstrate multi-domain, connection and control plane management.     

A Novel Approach for TNA Address Management

We present a new scheme to allocate/de- allocate Transport Network Assigned (TNA) address using Link ManagementProtocol (LMP) and to register/resolution these addresses using Lightweight Directory Access Protocol (LDAP) forAutomatically Switched Optical Network (ASON).     

An Experimental ASON Based on OADM Rings and a GMPLS Control Plane

This article presents the architecture of an ASON testbed implemented in the EMPIRICO project, focusing on design and implementation issues of real-time provisioning of bidirectional optical connections supported by a distributed GMPLS-based control plane and triggered by the network management system. Experimental performance is evaluated over a unidirectional and a bidirectional all-optical OADM ring in which neither wavelength converters nor optical resources discovery are employed. Performance analysis evaluates the blocking probability and the connection setup time.     

An Experimental ASON Based on OADM Rings and a GMPLS Control Plane

This article presents the architecture of an ASON testbed implemented in the EMPIRICO project, focusing on design and implementation issues of real-time provisioning of bidirectional optical connections supported by a distributed GMPLS-based control plane and triggered by the network management system. Experimental performance is evaluated over a unidirectional and a bidirectional all-optical OADM ring in which neither wavelength converters nor optical resources discovery are employed. Performance analysis evaluates the blocking probability and the connection setup time.     

ASON信令协议RSVP-TE中资源预留策略研究

基于流量工程的资源预留协议（Resource Reservation Protocol-Traffic Engineering，RSVP-TE）是自动交换光网络（Automatic Switch Optical Network，ASON）中前景最被看好的一种重要信令协议，在研究对RSVP-TE中的前向资源预留协议FRP（Forward Reservation Protocol）和后向资源预留协议BRP（Backward Reservation Protocol）的基础上，提出了ASON中一种新的资源预留方式：单波长预留BRP方式.通过仿真验证和比较分析可知，单波长预留的BRP方式兼备FRP和BRP两者的优点，在满足较低的控制带宽开销和较短的业务建立时间下，能够较有效地利用网络资源，并使得业务阻塞率较低.     

Multifractal analysis of complex networks

Complex networks have recently attracted much attention in diverse areas of science and technology.Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions.Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns.In this paper,we introduce a new box-covering algorithm for multifractal analysis of complex networks.This algorithm is used to calculate the generalized fractal dimensions D q of some theoretical networks,namely scale-free networks,small world networks,and random networks,and one kind of real network,namely protein-protein interaction networks of different species.Our numerical results indicate the existence of multifractality in scale-free networks and protein-protein interaction networks,while the multifractal behavior is not clear-cut for small world networks and random networks.The possible variation of D q due to changes in the parametersof the theoretical network models is also discussed.     

Topological Effects on the Performance of Transportation Networks

We investigate the influence of the network topology on the performance （characterized by the total system cost and maximal tratffic volume） of transportation networks, where the weights are not static （constant）, but dynamic （a function of the flow on the link）. Four classes of networks are used in the simulation, including regular networks, random networks, small-world networks and scale-free networks. The initial simulation results show that topologies play important roles on the performance of transportation networks, and random networks have better performance than other networks. Also, we find that there are distinct difference of the link flow distribution for various networks in both the distribution function form and the span between the minimum and the maximum of the link flow, explaining the difference of the performance among distinct networks. These findings will be useful in network design problems of transportation systems.     

权重分布对加权局域世界网络动力学同步的影响

加权网络可以更细致地刻画复杂系统中两节点之间的相互作用, 所以加权网络也比无权网络更接近真实的复杂系统. 改变权重分布来调节和改善复杂网络的性质也成为一种新的研究方法. 基于现有无权网络同步的概念, 应用特征值比R来衡量加权局域世界网络的同步能力, 发现权重分布对加权局域世界网络的同步能力有很重要的影响, 权重分布越均匀, 网络的同步能力就越大. 关键词： 权重分布 局域世界 加权网络 同步     

复杂交通运输网络上的拥挤与效率问题研究

本文研究复杂交通运输网络上的拥挤与效率问题. 在无标度网络、随机网络以及小世界网络等不同拓扑结构中, 探讨了不同的能力分配方式和不同的OD (Origin-Destination) 交通需求分布对网络拥挤度和效率的影响. 随着平均交通需求的增加, 分析无标度网络、随机网络以及小世界网络从自由流状态到交通拥堵状态的变化规律. 为便于比较, 本文侧重研究网络拥挤度的倒数, 并将其定义为通畅度. 研究发现网络中的通畅度与效率之间存在线性相关关系, 并且不同网络中的线性比例系数 (或斜率)是不同的, 从而体现了不同网络具有不同的运输性能. 关键词： 复杂网络 拥挤 效率     

An Extended Correlation Dimension of Complex Networks

Fractal and self-similarity are important characteristics of complex networks. The correlation dimension is one of the measures implemented to characterize the fractal nature of unweighted structures, but it has not been extended to weighted networks. In this paper, the correlation dimension is extended to the weighted networks. The proposed method uses edge-weights accumulation to obtain scale distances. It can be used not only for weighted networks but also for unweighted networks. We selected six weighted networks, including two synthetic fractal networks and four real-world networks, to validate it. The results show that the proposed method was effective for the fractal scaling analysis of weighted complex networks. Meanwhile, this method was used to analyze the fractal properties of the Newman–Watts (NW) unweighted small-world networks. Compared with other fractal dimensions, the correlation dimension is more suitable for the quantitative analysis of small-world effects.     

A Path-Based Distribution Measure for Network Comparison

As network data increases, it is more common than ever for researchers to analyze a set of networks rather than a single network and measure the difference between networks by developing a number of network comparison methods. Network comparison is able to quantify dissimilarity between networks by comparing the structural topological difference of networks. Here, we propose a kind of measures for network comparison based on the shortest path distribution combined with node centrality, capturing the global topological difference with local features. Based on the characterized path distributions, we define and compare network distance between networks to measure how dissimilar the two networks are, and the network entropy to characterize a typical network system. We find that the network distance is able to discriminate networks generated by different models. Combining more information on end nodes along a path can further amplify the dissimilarity of networks. The network entropy is able to detect tipping points in the evolution of synthetic networks. Extensive numerical simulations reveal the effectivity of the proposed measure in network reduction of multilayer networks, and identification of typical system states in temporal networks as well.     

红外光谱评价内燃机油抗氧化性能的研究

红外光谱快速检测石油产品性能是近年来发展的新技术,目前国内外在该领域的研究仅限于测试燃料油性能,由于润滑油组成、结构复杂,红外光谱技术测试润滑油性能的研究还未见报道。文章研究了润滑油组成、结构的红外光谱特征,提出了根据内燃机油组成、结构对抗氧化性能的贡献来提取其光谱信息的技术路线。结合BP神经网络和自组织神经网络的优点,发展了量化自组织神经网络数学模型,该数学模型具有自组织神经网络的定性聚类功能和BP神经网络的定量分析功能,与BP神经网络相比较,量化自组织神经网络具有更好的鲁棒性,测试结果优于BP神经网络,该论文的研究为润滑油性能的快速检测提供了一种新的技术手段。     

Linear analysis of degree correlations in complex networks

Many real-world networks such as the protein–protein interaction networks and metabolic networks often display nontrivial correlations between degrees of vertices connected by edges. Here, we analyse the statistical methods used usually to describe the degree correlation in the networks, and analytically give linear relation in the degree correlation. It provides a simple and interesting perspective on the analysis of the degree correlation in networks, which is usefully complementary to the existing methods for degree correlation in networks. Especially, the slope in the linear relation corresponds exactly to the degree correlation coefficient in networks, meaning that it can not only characterize the level of degree correlation in networks, but also reflects the speed that the average nearest neighbours’ degree varies with the vertex degree. Finally, we applied our results to several real-world networks, validating the conclusions of the linear analysis of degree correlation. We hope that the work in this paper can be helpful for further understanding the degree correlation in complex networks.     

A new information dimension of complex networks

The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks.     

复杂网络研究概述

近年来，真实网络中小世界效应和无标度特性的发现激起了物理学界对复杂网路的研究热潮．复杂网络区别于以前广泛研究的规则网络和随机网络最重要的统计特征是什么?物理学家研究复杂网络的终极问题是什么?物理过程以及相关的物理现象对拓扑结构是否敏感?物理学家进入这一研究领域的原因和意义何在?复杂网络研究领域将来可能会向着什么方向发展?文章围绕上述问题，从整体上概述了复杂网络的研究进展．