当前位置: X-MOL 学术Physica A › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On achieving capacity-enhanced small-world networks
Physica A: Statistical Mechanics and its Applications ( IF 2.8 ) Pub Date : 2020-05-21 , DOI: 10.1016/j.physa.2020.124729
Abhishek Chakraborty , Sarath Babu , B.S. Manoj

Networks, whether it is communication or transportation, often suffer from significant degradation in average network flow capacity (ANFC) due to the presence of one or more bottleneck nodes. Presence of a few long-ranged links, connecting distant nodes in a regular network, enhances ANFC and incorporates small-world characteristics. However, the existing deterministic long-ranged link addition strategies based on minimum average path length, maximum betweenness centrality, or maximum closeness centrality, cannot guarantee significant improvement in ANFC. In this paper, we propose an exhaustive search-based long-ranged link (LL) addition algorithm, maximum flow capacity (MaxCap), which deterministically maximizes ANFC, based on the maximum flow (of information or objects) among node-pairs in the context of weighted undirected networks. Furthermore, based on the observations from MaxCap, we propose a new LL addition heuristic, average network flow capacity enhancement using small-world characteristics (ACES), which significantly enhances ANFC and the LL length-type product, and improves traffic load distribution in a weighted undirected network. We validate the performance of our LL addition method through exhaustive simulations on various arbitrary networks and real-world road transportation networks. ACES can be applied to many real-world applications in communication networks, transportation networks, and tactical networks where ANFC is a critical parameter.



中文翻译:

关于实现能力增强的小世界网络

由于存在一个或多个瓶颈节点,因此,无论是通信网络还是运输网络,平均网络流容量(ANFC)均经常遭受严重降低。在正常网络中连接远程节点的一些远程链接的存在,增强了ANFC并融合了小世界特性。但是,现有的基于最小平均路径长度,最大中间度或最大紧密度的确定性远程链路添加策略不能保证ANFC的显着改善。在本文中,我们提出了一种基于穷举的基于搜索的远程链接(LL)加法,即最大流量(MaxCap),它根据节点对中节点对之间的最大流量(信息或对象)确定性地使ANFC最大化。加权无向网络的上下文。此外,根据MaxCap的观察,我们提出了一种新的LL附加启发式方法,即使用小世界特征(ACES)来提高平均网络流量,从而显着增强ANFC和LL长度类型乘积,并在加权无向情况下改善流量负荷网络。我们通过在各种任意网络和现实世界的道路运输网络上进行详尽的仿真,来验证LL加法的性能。ACES可以应用于ANFC是关键参数的通信网络,运输网络和战术网络中的许多实际应用。并改善了加权无向网络中的流量负载分配。我们通过在各种任意网络和现实世界的道路运输网络上进行详尽的仿真,来验证LL加法的性能。ACES可以应用于ANFC是关键参数的通信网络,运输网络和战术网络中的许多实际应用。并改善了加权无向网络中的流量负载分配。我们通过在各种任意网络和现实世界的道路运输网络上进行详尽的仿真,来验证LL加法的性能。ACES可以应用于ANFC是关键参数的通信网络,运输网络和战术网络中的许多实际应用。

更新日期:2020-05-21
down
wechat
bug