基于六度分割理论的网络拓扑生成算法研究
发布时间：2018-11-04 08:02
【摘要】：网络的普及，正逐步改变着人们的日常生活。它们都与高性能网络密不可分。一个高性能的网络拓扑图，是实现高性能网络的基础。因此，研究网络拓扑生成算法具有理论价值和应用意义。 作为社会学概念的六度分隔理论，它的“社会网络中，任意两个个体都可以建立联系，且中间环节不超过6个”的思想，对网络拓扑生成工作具有一定的指导意义。 基于此，本文提出一种基于六度分割理论的网络拓扑生成算法，从一个节点出发，以6跳为限，与任意一个节点建立连接，从而生成网络拓扑图。本文首先介绍了网络拓扑生成和网络拓扑发现的概念和相互关系；然后，，介绍了网络拓扑生成算法的研究现状，选择近年来主要的网络拓扑生成算法进行详细的介绍；从社会学的角度，介绍六度分割理论及相关理论的主要成就；进而，提出了基于六度分割理论的网络拓扑生成算法，并构建了算法模型；通过理论分析和仿真实验，验证了该算法可以实现网络拓扑生成，性能还可以得到一定程度的提升。
[Abstract]:The popularity of the network is gradually changing people's daily life. They are inextricably linked to high performance networks. A high-performance network topology is the basis for the implementation of high-performance networks. Therefore, the study of network topology generation algorithm has theoretical value and application significance. As the six degree separation theory of the concept of sociology, the idea of "any two individuals can establish connections in social networks, and the intermediate links are not more than 6" has certain guiding significance for the work of network topology generation. Based on this, a network topology generation algorithm based on the six-degree segmentation theory is proposed in this paper. Starting from one node and taking 6 hops as the limit, the network topology graph can be generated by establishing a connection with any node. This paper first introduces the concepts and relationships of network topology generation and network topology discovery, then introduces the current research situation of network topology generation algorithms, and introduces the main network topology generation algorithms in detail in recent years. From the point of view of sociology, this paper introduces the main achievements of six-degree segmentation theory and related theories, and then puts forward a network topology generation algorithm based on six-degree segmentation theory, and constructs an algorithm model. Through theoretical analysis and simulation experiments, it is verified that the algorithm can realize network topology generation, and its performance can be improved to a certain extent.
【学位授予单位】：河北大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP393.02
本文编号：2309221
[Abstract]:The popularity of the network is gradually changing people's daily life. They are inextricably linked to high performance networks. A high-performance network topology is the basis for the implementation of high-performance networks. Therefore, the study of network topology generation algorithm has theoretical value and application significance. As the six degree separation theory of the concept of sociology, the idea of "any two individuals can establish connections in social networks, and the intermediate links are not more than 6" has certain guiding significance for the work of network topology generation. Based on this, a network topology generation algorithm based on the six-degree segmentation theory is proposed in this paper. Starting from one node and taking 6 hops as the limit, the network topology graph can be generated by establishing a connection with any node. This paper first introduces the concepts and relationships of network topology generation and network topology discovery, then introduces the current research situation of network topology generation algorithms, and introduces the main network topology generation algorithms in detail in recent years. From the point of view of sociology, this paper introduces the main achievements of six-degree segmentation theory and related theories, and then puts forward a network topology generation algorithm based on six-degree segmentation theory, and constructs an algorithm model. Through theoretical analysis and simulation experiments, it is verified that the algorithm can realize network topology generation, and its performance can be improved to a certain extent.
【学位授予单位】：河北大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP393.02
【参考文献】
相关期刊论文 前10条
1 夏金;;基于六度分割理论的SNS网络英语教学[J];重庆科技学院学报(社会科学版);2010年18期
2 何超英,蒋捷,韩刚,陈军;基于GDF的道路网完全拓扑生成算法[J];地理与地理信息科学;2004年02期
3 荆栋;肖刚;;网络拓扑发现算法[J];重庆理工大学学报(自然科学);2012年09期
4 林f辉;;人际传播与大众传播的融合[J];中国传媒科技;2012年20期
5 朱志伯;高飞;;PLDA:AS级的Internet拓扑生成算法[J];计算机工程;2010年07期
6 魏文红;梁可结;王高才;李勇;;CPN:一种基于小世界网络的P2P模型[J];计算机工程;2010年13期
7 苑文举;孙鑫;李飞鹏;付枫;刘衍珩;;一种新的P2P网络拓扑生成算法[J];计算机工程;2011年18期
8 苑文举;李飞鹏;孙鑫;付枫;刘衍珩;;基于三角构成规则的加权有向网络拓扑生成算法[J];计算机应用;2011年03期
9 高飞;朱志伯;;一种基于幂率的层次型拓扑生成算法HIPL[J];计算机应用与软件;2008年11期
10 秦勃;一种树型网络拓扑简图的生成算法[J];青岛海洋大学学报;1997年04期
本文编号：2309221
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2309221.html
