Robust network planning in nonuniform traffic scenarios

Robustness to the environmental variations is an important feature of any reliable communication network. This paper reports on a network theory approach to the design of such networks where the environmental changes are traffic fluctuations, topology modifications, and changes in the source of external traffic. Motivated by the definition of betweenness centrality in network science, we introduce the notion of traffic-aware betweenness (TAB) for data networks, where usually an explicit (or implicit) traffic matrix governs the distribution of external traffic into the network. We use the average normalized traffic-aware betweenness, which is referred to as traffic-aware network criticality (TANC), as our main metric to quantify the robustness of a network. We show that TANC is directly related to some important network performance metrics, such as average network utilization and average network cost. We prove that TANC is a linear function of end-to-end effective resistances of the graph. As a result, TANC is a convex function of link weights and can be minimized using convex optimization techniques. We use semi-definite programming method to study the properties of the optimization problem and derive useful results to be employed for robust network planning purposes.     

复杂河流网络节点重要度分析

流域中,具有一定水力联系的河流、交叉口、水利工程设施等纵横交错地构成了一个复杂的河流网络.应用复杂网络理论,建立了河流网络模型,并描述了节点的重要度.将该网络模型应用于海河流域,建立了含有565个节点的海河流域网络.计算了海河流域网络节点的度指标和介数指标,并分别划分为8个等级和12个等级,对不同等级的节点进行节点重要度分析.通过对比分析节点的度指标和介数指标,证明了介数指标更能准确刻画河流网络节点的重要性.复杂网络中节点重要度分析可以为水利规划提供理论依据.     

Centrality measure of complex networks based on resource flow

A new centrality measure for complex networks,called resource flow centrality,is proposed in this paper. This centrality measure is based on the concept of the resource flow in networks.It not only can be applied to the connected networks,but also the disconnected networks. Moreover,it overcomes some disadvantages of several common centrality measures. The performance of the proposed measure is compared with some standard centrality measures using a classic dataset and the results indicate the proposed measure performs more reasonably. The statistical distribution of the proposed centrality is investigated by experiments on large scale computer generated graphs and two networks from the real world.     

面向SNS用户访问行为的Web缓存预测替换

为了提高web缓存性能,在已有缓存替换算法的基础上加入预测机制,提出了一种面向社交网站(SNS)用户访问行为特征的预测替换算法.通过研究SNS的用户行为模型,引入预测对象集,减小了替换风险,提高了缓存命中率.为了验证所提算法的性能,进行了大量仿真实验,结果表明,该算法在基于SNS使用行为的缓存方面,具有提高命中率的优越性.     

酵母蛋白网络的功能模块与关键蛋白研究

蛋白交互网络在各种细胞功能和生命过程中发挥着至关重要的作用。对它的结构特征进行分析吸引了众多科研人员的关注,功能模块与关键蛋白的识别是其中的重要研究主题。本文主要使用模拟退火算法分析了酵母蛋白交互网络的功能模块,同时结合使用多种中心化指标识别了其中的关键蛋白,并讨论了这些功能模块和关键蛋白的生物学意义。     

基于滤波器-信赖域方法的最优潮流算法

在电力市场环境下，求解诸多问题都需要最优潮流作为理想的工具。该文基于滤波器和信赖域的思想提出了求解最优潮流的新算法：由信赖域决定线性化步长，线性规划子问题由多步中心校正原一对偶内点法进行求解，并采用了考虑电网拓扑的物理策略和动态调整线性规划子问题的收敛判据策略来改善最优潮流算法的稳定性和收敛性。该算法通过逐次求解线性规划子问题，在滤波器中利用多目标规划的优超(Domin Rllce)概念决定是否接受新的点，算法本身具有非单调的性质。通过与预测一校正方法的比较，进一步验证了多步中心校正方法的求解效率。对系统规模从14节点到662节点的7个电力系统作了全面的数值计算，计算结果表明，该算法具有较高的稳定性和快速收敛性，具有实用意义。     

道路交通网络中的关键节点识别方法研究

在现实世界中，大量复杂系统都可以通过抽象的节点和连边构成的网络来加以刻画。作为城市交通系统的重要组成部分，道路交通网络是一个典型的复杂系统，与人们的生活密切相关。道路交通网络中的关键节点识别问题是复杂网络领域研究中的一个经典难题。传统的度中心性算法和PageRank算法在复杂网络的关键节点的识别中具有较好的应用，考虑到道路交通网络中关键节点的特殊性和彼此关联性，在度中心性算法的基础上引入贪心算法的思想，提出了一个基于贪心策略的度中心性关键节点识别方法；同时，在PageRank算法的基础上引入贪心算法的思想，提出了一种基于贪心策略的PageRank关键节点识别方法，从而使道路交通网络中关键节点识别的结果更合理，在交通道路维护保养、规划设计，以及犯罪分子潜逃阻断等领域都有重要的应用价值。通过公开数据集与经典的关键节点识别方法做比较，验证了算法的有效性。     

Adaptive synchronization of fractional‐order complex networks via pinning control

Adaptive synchronization of a class of fractional‐order complex networks is investigated in this paper. On the basis of the fractional‐order system stability theory, adaptive synchronization criteria of fractional‐order complex networks with 0 < q < 1 is achieved. Furthermore, pinning control method is then suggested to control the networks, and adaptive strategy is employed to tune the control gains and coupling strength. Because the nodes with high degree may not be the center of the networks, a new attempt to choose the pinned nodes on the basis of the closeness centrality scheme is proposed. Finally, numerical simulations are given to verify the effectiveness of the proposed approach based on the closeness centrality scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

一种改进的EPON网络拓扑结构

首先介绍了EPON的几种现有网络拓扑结构。通过探讨网络的连通性和中心性，研究了EPON网络拓扑结构的可靠性。鉴于原有结构的特点，提出了一种适用于光纤用户接入网的改进的EPON网络拓扑结构。