基于BRITE的向量地址平均长度仿真研究

A research on simulation of average length of vector address based on BRITE

本文主要就向量地址平均长度问题进行建模与仿真。向量网很好地解决了IP网络地址枯竭的问题,但由于向量地址是不定长的,因此对向量地址平均长度的研究成为评价向量网效率的一个重要方面。本文利用BRITE网络拓扑生成器,分别利用Waxman随机图模型和BA无标度模型,针对不同节点和边数的网络拓扑进行仿真实验,并对不同实验结果进行对比与分析。实验结果表明,向量地址平均长度会随节点数增长而增长,但在较大规模网络拓扑中,向量地址平均长度远远小于IP地址长度。

This paper mainly describes modeling and simulation on average length of vector address. Vector network solves the problem of limited amount of address of IP network, but for the uncertainty of its length, research on average length of vector address becomes an important aspect to evaluate the efficiency of vector network. In this paper, we generate network topology with Waxman model and BA scale-free model with different amount of nodes and edges using BRITE. Then, we make comparison and analysis of the simulation. The result shows that average length of vector address increases with the amount of nodes, but its length is far shorter than the length of IP network.