应用层组播网状拓扑的生成

pplication-layer multicast is based on terminal device for message distribution, which increases flexibility of network and reduces dependence on hardware devices. In general, tree structure can satisfy a few of information sources. However, only graph-structure can satisfy multi-sources, which confirms the system radiate information rapidly and strongly by adding redundant routes. BBV model proposes vertex weight, which describes the evolution of a high clustering coefficient unweighted and undirected graph. Based on BBV, LBBV discusses the direction, the different weight of different edges, and the limit of vertex weight. This paper, based on models upon, discusses the situation that the weight of each vertex is different and limited, and optimize the evolution of the graph to distribute messages. At last, this paper will analyse the theory and simulation data.