Method and system for data-structure management
AssigneeSecure64 Software Corporation
InventorsJohn S. Worley, Hugh Mahon
Life of this patent
Estimating the term…
Abstract
Embodiments of the present invention are directed to computationally efficient methods and systems for managing connection-associated and exchange-associated resources within network proxies. In one embodiment of the present invention, a circular connection-switch queue is employed for allocating, de-allocating, and maintaining connection-based or exchange-based data resources within a proxy. The connection-switch queue includes a free pointer that identifies a next connection-switch queue entry for allocation, and an idle pointer that is incremented continuously or at fixed intervals as timers associated with connection-switch entries expire. In an alternate embodiment, the connection-switch queue includes a free pointer, an idle pointer, and a clear pointer.
Claims9
A system for managing a data-resource queue, the system comprising:
- an electronic memory;
- a connection switch queue that contains entries, stored in the electronic memory, each associated with a timer;
- a free pointer that points to a next connection-switch-queue entry that may be allocated;
- and
- an idle pointer that points to a connection-switch-queue entry that is next due to expire.
A connection-switch queue, implemented in an electronic memory, that manages connection-associated resources for a communications proxy, the connection-switch queue comprising:
- an array of connection-switch-queue entries, stored in the electronic memory, each occupied entry of which includes an indication of an expiration time, an indication of a status, and connection-associated data or a reference to connection-associated data;
- management routines that employ modular arithmetic to circularize the array of connection-switch-queue entries with respect to pointer operations and connection-switch-queue indexing and that implement connection-switch-queue operations;
- a free pointer that references a next connection-switch-queue entry into which connection-associated data or a reference to connection-associated data can next be stored;
- and
- an idle pointer that references a first connection-switch-queue entry that will next expire.
A communications proxy device or computer executing a connection-switch queue for managing connection-associated resources, the connection-switch queue comprising:
- an array of connection-switch-queue entries, stored in an electronic memory, each occupied entry of which includes an indication of an expiration time, an indication of a status, and connection-associated data or a reference to connection-associated data;
- management routines that employ modular arithmetic to circularize the array of connection-switch-queue entries with respect to pointer operations and connection-switch-queue indexing and that implement connection-switch-queue operations;
- a free pointer that references a next connection-switch-queue entry into which connection-associated data or a reference to connection-associated data can next be stored;
- and
- an idle pointer that references a first connection-switch-queue entry that will next expire.
Dependencies are inferred from the claim text.