DYNAMIC IP ROUTER TABLES USING HIGHEST-PRIORITY MATCHING
摘要
An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention relates to a method and system for using tree data structures to select the highest priority rule that matches a destination address in dynamic Internet packet routing tables. In an embodiment, a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address is disclosed. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the highest-priority rule that matches a destination address may be found in O(log<2>n) time; a new rule may be inserted and an old one deleted in O(log n) time.
申请公布号
WO2004006061(A3)
申请公布日期
2004.05.27
申请号
WO2003US21135
申请日期
2003.07.03
申请人
UNIVERSITY OF FLORIDA;SAHNI, SARTAJ, KUMAR;LU, HABIN