一种基于兴趣约束的新型组播地址分配方法

A Novel Multicast Address Allocation Approach Based on Interest Constrains

基于兴趣的约束关系提出了一种新型的组播地址分配方法———建立布种模型,通过布种模型的初始化和推演实现组播地址的静态和动态分配.论文结合二维点阵和PR四分树定义了布种模型的空间数据结构,并提出自适应生长/剪枝算法和检索算法实现组播地址的动态分配和快速搜索.算法分析和性能测试表明该方法效率高,可满足大规模分布式虚拟环境中的组播地址分配和检索.最后简介了该方法在分布式仿真运行平台BH RTI中的实现.

There exists a sharp conflict between the large amount of multicast addresses required in distributed virtual environment and the multicast address finiteness. In this paper, a novel multicast address allocation approach based on the interest constrains is proposed, which operates the allocation process with a seeding model. The initiation and run-time process of seeding model carry out the static and dynamic muhieast address allocations individually. This paper combines 2-dimension lattice and PR quadtree structure to design the spatial data structure of seeding model and presents the adaptive growing and pruning algorithms for dynamic allocation, together with the searching algorithm for rapid searching the multicast address for a location. Algorithm analysis and performance experiments show that this approach has high efficiency and reach the requirements for multicast address allocation and search in large-scale distributed virtual environment. In the end a brief introduction to the implementation of this approach in BH RTI, a runtime infrastructure, for distributed simulation is given.