Virtual routing tables polymerization for lookup and update
Tong Yang, Shenjiang Zhang, Xianda Sun, Huichen Dai Ruian Duan, Jianyuan Lu, Zhian Mi, Bin Liu · 2012
Virtual router research has drawn increasing attention in recent years, and the most challenging issues of virtual routers are compression, lookup, and incremental update of 10∼200 routing tables. In this paper, we propose a set of solutions to achieve that storage, lookup time, and update time don't expand to 10∼200 times, but reduce to 1∼2 times.