一种基于Bitmap的虚拟路由表算法的Petri网建模与分析  

Petri network modeling and analysis of virtual routing table based on Bitmap

作　　者：陈相宇[1] 胡怀湘[1] 张玉[1] 

机构地区：[1]华北计算技术研究所,北京100091

出　　处：《现代电子技术》2015年第6期65-69,共5页Modern Electronics Technique

摘　　要：路由器共享能极大地节约运营商成本,而建立高效的虚拟路由表是构建共享路由器的前提。在此提出一种新的路由表合并方案,创新地借助Bitmap这种高效低耗的工具,构建一种新型的共享Tire树,建立一种高效的虚拟路由表结构。这种新型路由表结构,可以有效降低虚拟路由表的空间占用率,同时也具备较低的算法复杂度。最后,为算法建立了Petri网模型,希望在进一步的工作中,能借助Petri网模型来优化路由表结构,获得更好的性能。Sharing of routers can greatly save the cost of ISPs. Establishment of efficient virtual routing table is a premise to build the shared routers. A new scheme for combining routing tables based on Bitmap is proposed in this paper. A novel sharing Tire and efficient virtual routing table are established by the aid of efficient low consumption tool Bitmap. The virtual routing ta？ble structure can reduce the space occupancy rate of virtual routing table effectively. It also has low algorithm complexity. A Pe？tri model was established for the algorithm. It is expected to optimize the routing table structure by means of Petri model and get a better performance.

关 键 词：虚拟路由表 BITMAP TRIE树 PETRI网 

分 类 号：TN964-34[电子电信—信号与信息处理]