VeriTable:多个大型转发表的快速等价性验证
VeriTable: Fast Equivalence Verification of Multiple Large Forwarding Tables
摘要:
由于流量工程和多宿主等网络实践,全球转发表中的路由(也称为IP前缀)数量在过去十年中显著增加,并继续以超线性趋势增长。最有前途的解决方案之一是使用智能转发信息库(FIB)聚合算法来聚合前缀并将大表转换为小表。然而,这样做提出了一个研究问题,即,我们如何快速验证原始表产生与聚合表相同的转发行为?我们在本文中回答这个问题,包括解决最长前缀匹配(LPM)查找所带来的挑战。特别是,我们提出的VeriTable算法,可以采用一个单一的树/trie遍历快速检查多个转发表转发等价,以及如果他们可能会导致路由环路或黑洞。VeriTable算法在各个方面都明显优于IPv4和IPv6表的最新工作,包括总运行时间,内存访问时间和内存消耗。
英文摘要:
Due to network practices such as traffic engineering and multi-homing, the number of routes---also known as IP prefixes---in the global forwarding tables has been increasing significantly in the last decade and continues growing in a super linear trend. One of the most promising solutions is to use smart Forwarding Information Base (FIB) aggregation algorithms to aggregate the prefixes and convert a large table into a small one. Doing so poses a research question, however, i.e., how can we quickly verify that the original table yields the same forwarding behaviors as the aggregated one? We answer this question in this paper, including addressing the challenges caused by the longest prefix matching (LPM) lookups. In particular, we propose the VeriTable algorithm that can employ a single tree/trie traversal to quickly check if multiple forwarding tables are forwarding equivalent, as well as if they could result in routing loops or black holes. The VeriTable algorithm significantly outperforms the state-of-the-art work for both IPv4 and IPv6 tables in every aspect, including the total running time, memory access times and memory consumption.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。