检索结果-南通市图书馆

基于betweenness centrality提高复杂网络容量的方法

在线全文

cnki会议

学校读者我要写书评

暂无评论

基于Betweenness Centrality提高复杂网络容量的方法

2006全国复杂网络学术会议

作者：范晶秦卓琼张国强张国清中国科学院计算技术研究所

betweenness centrality能够刻画节点在网络中的重要程度,能够反映节点在网络中可能承载的网络流量。本文引入betweenness centrality对网络拓扑进行优化和拥塞预测,通过理论分析和仿真实验,提出在具有scale-free特征的复杂网络中,依据B... 详细信息

betweenness centrality能够刻画节点在网络中的重要程度,能够反映节点在网络中可能承载的网络流量。本文引入betweenness centrality对网络拓扑进行优化和拥塞预测,通过理论分析和仿真实验,提出在具有scale-free特征的复杂网络中,依据betweenness值以及betweenness 的标准差增加一些捷径路径的方法,有效平衡中枢节点的负载,缓解拥塞状况,提高网络容量。

关键词： betweenness centrality 网络拓扑网络容量拥塞无标度网络

Relations between structural properties and synchronizability on local world dynamical networks

在线全文

cnki会议

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2007年第8期17卷 956-961页

作者： Sun Shiwen~(**) Liu Zhongxin Chen Zengqiang Yuan Zhuzhi (Department of Automation,Nankai University,Tianjin 300071,China) Department of Automation Nankai University Tianjin 300071 China

In this paper,the effects of various structural properties on the synchronization of coupled oscillators with local-world coupling configurations are *** is found that for local world networks,the larger heterogeneity of the degree distribution,the enhanced interconnection of nodes,and the increased clustering do not improve the synchronizability of dynamical *** the con- trary,the increase of the maximum betweenness centrality appears to be responsible for the decrease of the synchronizability.

关键词： complex dynamical network local-world evolving model synchronizability structural properties betweenness centrality

Two Novel Methods to Enhance Network Synchronizability

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Communications in Theoretical Physics 2008年第4期49卷 1064-1068页

作者： DAI Kun WANG Xiao-Fan LI Xiang Department of Automation Shanghai Jiao Tong University Shanghai 200240 China

In this paper, we propose two methods to enhance the synchronizability of a class of complex networks which do not hold the positive correlation between betweenness centrality （BC） and degree of a node, and observe other topology characteristics of the network affected by the methods. Numerical simulations show that both methods can effectively enhance the synchronizability of this kind of networks. Furthermore, we show that the maximal BC of all edges is an important factor to affect the network synchronizability, although it is not the unique factor.

关键词： synchronizability betweenness centrality clustering coefficient

维普期刊数据库

Virtual network embedding based on real-time topological attributes

在线全文

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2015年第2期16卷 109-118页

作者： Jian DING Tao HUANG Jiang LIU Yun-jie LIU State Key Laboratory of Networking and Switching Technology Beo'ing University of Posts and Telecommunications Beijing 100876 China

As a great challenge of network virtualization, virtual network embedding/mapping is increasingly important. It aims to successfully and efficiently assign the nodes and links of a virtual network （VN） onto a shared substrate network. The problem has been proved to be NP-hard and some heuristic algorithms have been proposed. However, most of the algorithms use only the local information of a node, such as CPU capacity and bandwidth, to determine how to map a VN, without considering the top- ological attributes which may pose significant impact on the performance of the embedding. In this paper, a new embedding algorithm is proposed based on real-time topological attributes. The concept ofbetweenness centrality in graph theory is borrowed to sort the nodes of VNs, and the nodes of the substrate network are sorted according to the correlation properties between the former selected and unselected nodes. In this way, node mapping and link mapping can be well coupled. A simulator is built to evaluate the performance of the proposed virtual network embedding （VNE） algorithm. The results show that the new algorithm significantly increases the revenue/cost （R/C） ratio and acceptance ratio as well as reduces the runtime.

关键词： Virtual network embedding (VNE) Real-time topological attributes betweenness centrality Correlation properties Network virtualization

维普期刊数据库

Evolving networks: from topology to dynamics

在线全文

学校读者我要写书评

暂无评论

控制理论与应用(英文版) 2004年第1期2卷 60-64页

作者： Zhengping FAN Guanrong CHEN King Tim KO Deparment of Electronic Engineering City University of Hong KongHong Kong SAgChina

A multi-local-world model is introduced to describe the evolving networks that have a localization property such as the Internet. Based on this model, we show that the traffic load defined by 'betweenness centrality' on the multi-local-world scale-free networks' model also follows a power law form. In this kind of network, a few vertices have heavier loads and so play more important roles than the others in the network.

关键词： Evolving network Multi-local-world model betweenness centrality

维普期刊数据库

A New Method to Enhance the Network Synchronizability

在线全文

学校读者我要写书评

暂无评论

A New Method to Enhance the Network Synchronizability

第二十六届中国控制会议

作者： Dai Kun,Wang Xiaofan,Li Xiang Department of Automation,Shanghai Jiao Tong University,Shanghai 200240,P.R.China

In this paper,we propose one method to enhance the synchronizability of complex networks which do not hold the positive correlation between the BC(betweenness centrality)and degree of nodes,and observe other topology characteristics of the network affected by the *** numerical simulations prove the method can effectively enhance the network *** find the BC of the edge which has the highest BC can affect the network synchronizability.

关键词： Complex network Synchronizability betweenness centrality Clustering coefficient Average path length

Fluctuation Analysis of Runoff Time Series Under Coarse-Graining Network Modeling Method

在线全文

cnki会议

学校读者我要写书评

暂无评论

Fluctuation Analysis of Runoff Time Series Under Coarse-Grai...

2015年中国智能自动化学术会议

作者： Qiang Tang Jie Liu HongLing Liu College of Mathematics and Computer Science Wuhan Textile University Research Center of Nonlinear Science Wuhan Textile University

Based on coarse-graining complex networks modeling method, the fluctuation characteristic of the daily runoff series of the Yangtze River in China and the Ocumlgee River in America are investigated in this paper, respectively. First, the related runoff time series were transformed into discrete symbolic sequences by coarse-graining preprocessing method, and then, related complex networks were created. Dynamic statistical features and topology parameters of the two fluctuation networks, such as clustering coefficient(CC), characteristic path length(CPL), and betweenness centrality example, from 2-June to 19-June in(BC) of nodes, are calculated and compared with each other. It can be found that, the clustering coefficients of both networks are much larger than random networks with the same scale,and both characteristic path lengths are as small as random networks with the same scale. It indicated that the short-range correlation exists in different fluctuation patterns of the discrete symbolic sequences obtained by the coarse-graining ***, it can be found that, the betweenness centrality of different node is obvious different from each other in both networks, which means that some fluctuation patterns have important significance and can be seen as a conversion precursor between the various fluctuation patterns. Also, the community analysis are also carried out and closer connections are revealed for further prediction *** results indicates potential value for research on short-term prediction of runoff process.

关键词： Runoff time series Fluctuation Complex networks Coarse graining Clustering coefficient Characteristic path length betweenness centrality Community analysis

Attack Vulnerability of Online Social networks

在线全文

cnki会议

学校读者我要写书评

暂无评论

Attack Vulnerability of Online Social networks

第37届中国控制会议

作者： Hui Li Department of Educational Technology Capital Normal University

In order to protect existing systems and design new systems,attack vulnerability of online social networks is studied in this ***,directed online social networks are constructed,and the topological quantities(***,betweenness centrality) are ***,the ability of online social network to resist attacks is studied by removing specific classes of important nodes with highest-degree or highest betweenness *** performance is quantitatively measured by characteristic path length,global efficiency and the size of the largest connected *** results show that removals by recalculated betweenness centrality are more harmful than attack strategies based on the initial network,suggesting that online social network is highly vulnerable to deliberate attacks on vital nodes keeping the connectivity of the network.

关键词： Attack vulnerability online social network betweenness centrality complex network