Importance

Loading Importance Indicators...

Abstract

Methods and systems consistent with the present invention store connection information in a memory of a node in a communications network such that the number of searches for retrieving the connection information is less than a predetermined probe threshold. The node includes a hash table and a connection table in the memory for storing and retrieving information associated with packets, frames, and/or cells in the communications network. Each entry in the hash table includes a connection identifier and, for example, a connection index, and is indexed according to a hash value based on the connection identifier. Each entry in the connection table includes connection state information that is indexed according to a connection index in the hash table. To store connection information in the memory, the node identifies in the hash table a first set of addresses that correspond to a first connection identifier. When the first set of addresses does not correspond to a free entry, the node randomly selects one of the first set of addresses, and identifies a second connection identifier in an entry at the randomly selected address. The node then inserts the second connection identifier at a free one of a second set of addresses corresponding to the second connection identifier and inserts the first connection identifier at the randomly selected address.

Loading the Abstract Image...

First Claim