Abstract: The subject invention provides a data structure and method for IP lookups, insertions, and deletions using a dynamic tree bitmap structure (DTBM) that utilizes an array of child pointers for each node instead of the typical TBM approach using one pointer to an array of children.

Abstract: A method to compress an unoptimized Aho-Corasick automaton is provided that can be used in network intrusion detection systems. Embodiments of the subject method use bitmaps with multiple levels of summaries as well as aggressive path compaction. By using multiple levels of summaries, a popcount can be determined with as few as 1 addition.

Abstract: A recursively partitioned static router-table, the data structure incorporating a first-level partition including subtries and an auxiliary trie. A node of the subtrie includes a path Q(N) from the root R of a trie T to a root N of the subtrie, a stride s for a next-level partition, a mask that characterizes a next-level perfect hash function, and a pointer to the hash table for the next-level partition. At least one of the trie T, the first-level partition, the auxiliary trie, and the next-level partition is represented by a base structure selected from the group consisting of MBT and HSST.

Abstract: A method to compress an unoptimized Aho-Corasick automaton is provided that can be used in network intrusion detection systems. Embodiments of the subject method use bitmaps with multiple levels of summaries as well as aggressive path compaction. By using multiple levels of summaries, a popcount can be determined with as few as 1 addition.

Abstract: A recursively partitioned static router-table, the data structure incorporating a first-level partition including subtries and an auxiliary trie. A node of the subtrie includes a path Q(N) from the root R of a trie T to a root N of the subtrie, a stride s for a next-level partition, a mask that characterizes a next-level perfect hash function, and a pointer to the hash table for the next-level partition. At least one of the trie T, the first-level partition, the auxiliary trie, and the next-level partition is represented by a base structure selected from the group consisting of MBT and HSST.

Abstract: The subject invention provides a data structure and method for IP lookups, insertions, and deletions using a dynamic tree bitmap structure (DTBM) that utilizes an array of child pointers for each node instead of the typical TBM approach using one pointer to an array of children.

Abstract: A system for classifying data packets transmitted over a data communications network based upon a set of predetermined prefixes associated with destination addresses of the data packets is provided. The includes a data structure stored in an electronic memory. The data structure is a prefix-in-B-tree (PIBT) data structure and/or a range-in-B-tree (RIBT) data structure, the at least one data structure comprising a plurality of nodes based upon the set of predetermined prefixes. The system also includes a determination module for determining a match between one or more of the plurality of nodes and a destination address of a particular data packet.

Abstract: A method and associated system 300 for delivering intensity-modulated radiation therapy (IMRT) uses variable feathering field splitting for intensity modulated fields of large size. A processor controls a beam-shaping device that splits the radiation beam into a plurality of radiation fields delivered to a patient. The processor in cooperation with the beam-shaping device implements a variable feathering method which includes providing an intensity matrix for the treatment of a patient, the intensity matrix having a plurality of rows and columns for spanning a prescribed radiation field including a prescribed field width. The prescribed width is compared to a maximum field width provided by the radiation treatment system.

Abstract: An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention provides a method, computer system, and computer readable media for using Priority Search Trees (PSTs) to match, insert, and delete rules in dynamic routing tables in O(log n) time. In a first embodiment, for a dynamic router table consisting of n pairs of tuples, each tuple comprising an address prefix and next-hop information, the invention provides a system and method, using a PST, for inserting a new tuple, deleting an existing tuple, and searching for the tuple with the longest matching prefix for destination address, wherein each operation is performed in O(log n) time.

Abstract: 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(log2n) time; a new rule maybe inserted and an old one deleted in O(log n) time.

Abstract: Systems and methods for improving the performance of dynamic router table data structures are provided. The invention relates to methods and systems for partitioning prefixes or prefix-based intervals. In one embodiment, priority search tree router data structures are applied to prefix partitions of the present invention. In another embodiment, basic-interval tree and prefix tree data structures are applied to interval partitions of the present invention.

Abstract: A method is provided to improve the performance of dynamic router-table designs. Specifically, the invention relates to a method and system for partitioning prefixes at each node of a partitioning tree into 2s+1 partitions using the next s bits of the prefixes. Prefixes that have a length less than s are placed into partition ?1, with the remaining prefixes falling into the remaining partitions that correspond to the value of their first s bits. Prefix partitioning may be controlled using either static rule tables or by dynamic rule tables. In one embodiment, binary tree on binary tree (BOB) data structures are applied to a partition of the present invention. In another embodiment, prefix binary tree on binary tree (PBOB) data structures are applied to a partition of the present invention. In a further embodiment, a dynamic longest-matching prefix binary tree on binary tree-table (LMPBOB) is applied to a partition of the present invention.

Abstract: A method and associated system 300 for delivering intensity-modulated radiation therapy (IMRT) uses variable feathering field splitting for intensity modulated fields of large size. Processor 112 controls a beam-shaping device 106 so that the beam-shaping device splits the radiation beam into a plurality of radiation fields delivered to the patient 102. Processor 112 in cooperation with beam-shaping device 106 implements a variable feathering method which includes the steps of providing an intensity matrix for the treatment of a patient, the intensity matrix having a plurality of rows and columns for spanning a prescribed radiation field including a prescribed field width. The prescribed width is compared to a maximum field width provided by the radiation treatment system. The intensity matrix is split into a plurality of spatially overlapping intensity submatrices when the prescribed width exceeds the maximum field width, wherein the splitting comprises variably feathering the intensity matrix.

Abstract: A method is provided to improve the performance of dynamic router-table designs. Specifically, the invention relates to a method and system for partitioning prefixes at each node of a partitioning tree into 2s+1 partitions using the next s bits of the prefixes. Prefixes that have a length less than s are placed into partition −1, with the remaining prefixes falling into the remaining partitions that correspond to the value of their first s bits. Prefix partitioning may be controlled using either static rule tables or by dynamic rule tables. In one embodiment, binary tree on binary tree (BOB) data structures are applied to a partition of the present invention. In another embodiment, prefix binary tree on binary tree (PBOB) data structures are applied to a partition of the present invention. In a further embodiment, a dynamic longest-matching prefix binary tree on binary tree-table (LMPBOB) is applied to a partition of the present invention.

Abstract: Systems and methods for improving the performance of dynamic router table data structures are provided. The invention relates to methods and systems for partitioning prefixes or prefix-based intervals. In one embodiment, priority search tree router data structures are applied to prefix partitions of the present invention. In another embodiment, basic-interval tree and prefix tree data structures are applied to interval partitions of the present invention.

Abstract: 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(log2n) time; a new rule maybe inserted and an old one deleted in O(log n) time.