符号网络中的路由策略
Routing Strategies on Signed Networks
DOI: 10.12677/orf.2026.161009, PDF,    国家社会科学基金支持
作者: 孔嘉文*:北京邮电大学数学科学学院,北京;李元昊:中国联合网络通信集团有限公司,北京;卓新建#:北京邮电大学数学科学学院,北京;数学与信息网络教育部重点实验室(北京邮电大学),北京
关键词: 流量容量符号网络路由策略同配系数Traffic Capacity Signed Network Routing Strategy Assortativity Coefficient
摘要: 符号网络是一类具有符号属性的复杂网络,近年来逐渐成为研究热点,但针对符号网络中路由与传输问题的研究尚未涉及。本文构建了基础符号网络,将改进的路由策略应用于该网络,系统研究其路由机制与流量传输特性。人工构建的符号网络可通过无标度网络与随机网络组合连接形成,本文采用同配连接和异配连接两种连接方式,生成不同属性的网络模型。随后,通过调整网络的平均负度,深入探究同配系数、网络平均路径长度与数据包生成率之间的内在关联。最后,在真实符号网络上进行仿真实验,验证了所提路由策略及结论的有效性。
Abstract: Signed network is a kind of complex network with signed attributes. It has gradually become a hot topic in recent years, but the research on routing and transmission on signed network has not been involved yet. In this paper, a basic signed network is constructed, and the improved routing strategy is applied to research the routing strategy and traffic transmission on the signed network. The artificially built signed network can be connected by a combination of scale-free networks and random networks. We use two connection methods, the assortative connection and the disassortative connection, to obtain networks of different properties. Then, we adjusted the average negative degree of the network to study the relationship among the assortativity coefficient, the average path length of the network and the packet generation rate. Finally, we performed simulations on the real signed network to verify the validity of our routing strategy and conclusions.
文章引用:孔嘉文, 李元昊, 卓新建. 符号网络中的路由策略[J]. 运筹与模糊学, 2026, 16(1): 91-101. https://doi.org/10.12677/orf.2026.161009

参考文献

[1] Yan, G., Zhou, T., Hu, B., Fu, Z. and Wang, B. (2006) Efficient Routing on Complex Networks. Physical Review E, 73, Article 046108. [Google Scholar] [CrossRef] [PubMed]
[2] Ling, X., Hu, M., Jiang, R. and Wu, Q. (2010) Global Dynamic Routing for Scale-Free Networks. Physical Review E, 81, Article 016113. [Google Scholar] [CrossRef] [PubMed]
[3] Jiang, Z. and Liang, M. (2013) Incremental Routing Strategy on Scale-Free Networks. Physica A: Statistical Mechanics and Its Applications, 392, 1894-1901. [Google Scholar] [CrossRef
[4] Zhang, X., He, Z., He, Z. and Rayman-Bacchus, L. (2013) Probability Routing Strategy for Scale-Free Networks. Physica A: Statistical Mechanics and Its Applications, 392, 953-958. [Google Scholar] [CrossRef
[5] Zhang, S., Liang, M. and Li, H. (2014) Method to Enhance Traffic Capacity for Two-Layer Complex Networks. Canadian Journal of Physics, 92, 1599-1605. [Google Scholar] [CrossRef
[6] Zhang, S., Liang, M., Jiang, Z. and Li, H. (2015) Improved Efficient Static Weighted Routing Strategy on Two-Layer Complex Networks. International Journal of Modern Physics C, 26, Article 1550001. [Google Scholar] [CrossRef
[7] Zhang, S., Liang, M., Jiang, Z. and Li, H. (2013) Queue Resource Reallocation Strategy for Traffic Systems in Scale-Free Network. International Journal of Modern Physics C, 24, Article 1350013. [Google Scholar] [CrossRef
[8] Li, H., Bu, Z., Wang, Z. and Cao, J. (2020) Dynamical Clustering in Electronic Commerce Systems via Optimization and Leadership Expansion. IEEE Transactions on Industrial Informatics, 16, 5327-5334. [Google Scholar] [CrossRef
[9] Li, H., Wang, Q., Liu, S. and Hu, J. (2020) Exploring the Trust Management Mechanism in Self-Organizing Complex Network Based on Game Theory. Physica A: Statistical Mechanics and Its Applications, 542, Article 123514. [Google Scholar] [CrossRef
[10] Bu, Z., Li, H., Zhang, C., Cao, J., Li, A. and Shi, Y. (2019) Graph K-Means Based on Leader Identification, Dynamic Game, and Opinion Dynamics. IEEE Transactions on Knowledge and Data Engineering, 32, 1348-1361. [Google Scholar] [CrossRef
[11] Barabási, A. and Albert, R. (1999) Emergence of Scaling in Random Networks. Science, 286, 509-512. [Google Scholar] [CrossRef] [PubMed]
[12] Erdős, P. and Rényi, A. (1959) On Random Graphs. I. Publicationes Mathematicae Debrecen, 6, 290-297. [Google Scholar] [CrossRef
[13] Arenas, A., Díaz-Guilera, A. and Guimerà, R. (2001) Communication in Networks with Hierarchical Branching. Physical Review Letters, 86, 3196-3199. [Google Scholar] [CrossRef] [PubMed]
[14] Watts, D.J. and Strogatz, S.H. (1998) Collective Dynamics of ‘Small-World’ Networks. Nature, 393, 440-442. [Google Scholar] [CrossRef] [PubMed]
[15] Chen, H.L., Liu, Z.X., Chen, Z.Q. and Yuan, Z.Z. (2009) Research on One Weighted Routing Strategy for Complex Networks. Acta Physica Sinica, 58, 6068-6073. [Google Scholar] [CrossRef
[16] Kumar, S., Spezzano, F., Subrahmanian, V.S. and Faloutsos, C. (2016) Edge Weight Prediction in Weighted Signed Networks. 2016 IEEE Edge Weight Prediction in Weighted Signed Networks, Barcelona, 12-15 December 2016, 221-230. [Google Scholar] [CrossRef