检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中山大学信息科学与技术学院,广州510006 [2]广东技术师范学院电子与信息学院,广州510665
出 处:《物理学报》2013年第5期557-565,共9页Acta Physica Sinica
基 金:国家自然科学基金(批准号:60970146;61272381;61202271);国家自然科学基金-广东联合基金重点项目(批准号:U0735002)资助的课题;国家高技术研究发展计划(批准号:2007AA01Z449)~~
摘 要:现有研究表明明显的社团结构会显著降低网络的传输性能.本文基于网络邻接矩阵的特征谱定义了链路对网络社团特性的贡献度,提出一种通过逻辑关闭或删除对网络社团特性贡献度大的链路以提高网络传输性能的拓扑管理策略,即社团弱化控制策略(CWCS策略).在具有社团结构的无标度网络上分别进行了基于全局最短路径路由和局部路由的仿真实验,并与关闭连接度大的节点之间链路的HDF策略进行了比较.仿真实验结果显示,在全局最短路径路由策略下,CWCS策略能更有效地提高网络负载容量,并且网络的平均传输时间增加的幅度变小.在局部路由策略下,当调控参数0<α<2,对网络负载容量的提升优于HDF策略.Previous research has shown that the community structure of the network well significantly affect information transmission, and the obvious community structure will significantly reduce the network transmission performance. To address the problem, first we define the link importance to communities, which is based on the spectrum of network adjacency matrix. Then we propose a topological management strategy called community weaken control strategy (CWCS) to enhance traffic capacity, which weakens the community structures by logically closing or cutting some links with great link importance. We implement the scheme in both a global shortest-path routing strategy and local routing strategy, and compare it with the previous scheme HDF that removes the links among hub nodes. The simulation results show that the traffic capacity can be greatly enhanced and the average transport time is effectively reduced under the shortest path routing strategy. Under the local routing strategy, the traffic capacity can also be greatly enhanced when the tunable parameter a lies in a range from 0 and 2.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.104