Data structure supporting random delete and timer function
First Claim
1. In a computer processor system for transferring an active file entry to and from a dynamic data structure in connection with networking tasks, comprising:
- a) a data structure to handle the addition and the deletion of a large number of data entries;
b) at least one data entry associated with said data structure;
c) a timer control block for each data entry;
d) a bidirectional link pointer between each data entry and its corresponding timer control block; and
e) a tree structure consisting of a direct table (DT) and pattern search control blocks (PSCBs) to associate each data entry with a unique search key, said tree structure created by;
1) adding a new data entry to the data structure by;
a) removing an empty data entry from the data entry free queue;
b) removing an empty timer control block from the timer control block free queue; and
c) initializing the data entry and timer control block with application specific parameters and pointers to associate the data entry and timer control block, and2) modifying the DT and PSCBs within the data structure to enable a search process to locate the added data entry.
0 Assignments
0 Petitions
Accused Products
Abstract
A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging/timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.
15 Citations
17 Claims
-
1. In a computer processor system for transferring an active file entry to and from a dynamic data structure in connection with networking tasks, comprising:
-
a) a data structure to handle the addition and the deletion of a large number of data entries; b) at least one data entry associated with said data structure; c) a timer control block for each data entry; d) a bidirectional link pointer between each data entry and its corresponding timer control block; and e) a tree structure consisting of a direct table (DT) and pattern search control blocks (PSCBs) to associate each data entry with a unique search key, said tree structure created by; 1) adding a new data entry to the data structure by; a) removing an empty data entry from the data entry free queue; b) removing an empty timer control block from the timer control block free queue; and c) initializing the data entry and timer control block with application specific parameters and pointers to associate the data entry and timer control block, and 2) modifying the DT and PSCBs within the data structure to enable a search process to locate the added data entry. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A computer readable storage medium containing a program for transferring an active file entry to and from a dynamic data structure, comprising instructions to:
-
a) partition said active file into basic application data and a timer control block; b) maintain an association between an active entry and its corresponding timer control clock using a bidirectional pointer; c) include a free queue of timer control blocks in the same timer loop used for timer control blocks assigned to active sessions; and d) construct a tree structure consisting of a direct table (DT) and pattern search control blocks (PSCBs) to associate each data entry with a unique search key, wherein the construction of the tree structure includes the additional process of; 1) adding a new data entry to the data structure by; a) removing an empty data entry from the data entry free queue; b) removing an empty timer control block from the timer control block free queue; and c) initializing the data entry and timer control block with application specific parameters and pointers to associate the data entry and timer control block, and 2) modifying the DT and PSCBs within the data structure to enable a search process to locate the added data entry. - View Dependent Claims (16, 17)
-
Specification