Data structure supporting session timer and variable aging function including self adjustable 2MSL
First Claim
1. A system for managing dynamic data search structures, comprising:
- a) a search structure having at least one data entry comprising an active session, b) a timing loop containing all active sessions in the search structure, and c) a free queue for providing available sessions for new entries in the search structure and for removing obsolete sessions from said search structure, wherein the free queue is incorporated into a timing loop and has a pointer for adding new sessions at an insertion/deletion point in the loop and for moving obsolete sessions to the free queue in the loop.
1 Assignment
0 Petitions
Accused Products
Abstract
Dynamic data search structures are described that are capable of handling large numbers of active entries and a high rate of additions and deletions of active entries while complying with 2MSL requirements and providing precise time-out capabilities. A free queue which is integrated with the timing loop of session entries provides available sessions for new entries in the search structure and removes obsolete sessions from the tree. Multiples of such timing loops can be used to maintain multiple timing intervals. One such timing loop may contain soft entries still attached to the search structure but which are eligible to be removed and to be reused to accommodate new sessions. A spare buffer pool is also included in the data structure to add and remove buffers to maintain delays.
19 Citations
35 Claims
-
1. A system for managing dynamic data search structures, comprising:
-
a) a search structure having at least one data entry comprising an active session, b) a timing loop containing all active sessions in the search structure, and c) a free queue for providing available sessions for new entries in the search structure and for removing obsolete sessions from said search structure, wherein the free queue is incorporated into a timing loop and has a pointer for adding new sessions at an insertion/deletion point in the loop and for moving obsolete sessions to the free queue in the loop. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A method for managing dynamic data search structures, comprising the steps of:
-
a) providing a search structure having at least one data entry comprising an active session, b) providing a timing loop containing all active sessions in the search structure, and c) creating a free queue for providing available sessions for new entries in the search structure and for removing obsolete sessions from said search structure, wherein the free queue is incorporated into a timing loop and has a pointer for adding new sessions at an insertion/deletion point in the loop and for moving obsolete sessions to the free queue in the loop. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21)
-
-
22. A system for managing dynamic data search structures comprising:
-
a) a search structure containing multiple data entries, at least one data entry comprising an active session;
b) a first timer loop to maintain active sessions;
c) a free queue for the first timer loop, said free queue having available sessions for new entries in the search tree and for removal of obsolete sessions from the search tree;
d) a FIFO list of soft entries in a maximum segment lifetime (MSL) state;
e) a second timer loop to maintain sessions in a (MSL) state; and
f) a free queue for the second timer loop for moving an active session from the active state to the MSL state. - View Dependent Claims (23, 24, 25)
-
-
26. A method for managing dynamic data search structures comprising:
-
a) providing a search structure containing multiple data entries, at least one data entry comprising an active session;
b) providing a first timer loop to maintain active sessions;
c) providing a free queue for the first timer loop, said free queue having available sessions for new entries in the search tree and for removal of obsolete sessions from the search tree;
d) providing a FIFO list of soft entries in a maximum segment lifetime (MSL) state;
e) providing a second timer loop to maintain sessions in a (MSL) state; and
f) providing a free queue for the second timer loop for moving an active session from the active state to the MSL state. - View Dependent Claims (27, 28, 29)
-
- 30. A computer readable medium containing instructions for managing dynamic data search structures, the medium enabling a free queue to provide available sessions for new entries in a search structure and for removing obsolete sessions from said search structure.
-
33. A data search structure wherein the data entries comprise active entries, and one or more soft entries that are in a maximum segment lifetime state and that are available for use for new entries,
said active entries are joined together to form one timing loop, said soft entries are joined together to form another loop, and one or more available entries outside of the loops that are used for new entries ahead of soft entries.
Specification