Traitement en cours

Veuillez attendre...

Paramétrages

Paramétrages

Aller à Demande

1. AU2003266879 - Improved dense mode coding scheme

Office
Australie
Numéro de la demande 2003266879
Date de la demande 10.09.2003
Numéro de publication 2003266879
Date de publication 08.01.2004
Type de publication A
CIB
H04L 12/56
HÉLECTRICITÉ
04TECHNIQUE DE LA COMMUNICATION ÉLECTRIQUE
LTRANSMISSION D'INFORMATION NUMÉRIQUE, p.ex. COMMUNICATION TÉLÉGRAPHIQUE
12Réseaux de données à commutation
54Systèmes de commutation par mémorisation et restitution
56Systèmes de commutation par paquets
CPC
H04L 45/00
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
45Routing or path finding of packets in data switching networks
H04L 45/7457
HELECTRICITY
04ELECTRIC COMMUNICATION TECHNIQUE
LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
45Routing or path finding of packets in data switching networks
74Address processing for routing
745Address table lookup or address filtering
7457using content-addressable memories [CAM]
Déposants MOSAID TECHNOLOGIES INCORPORATED
Inventeurs Brown, David A.
Gillingham, Peter B.
Données relatives à la priorité 10262643 30.09.2002 US
Titre
(EN) Improved dense mode coding scheme
Abrégé
(EN)
A lookup table for searching for a longest prefix match for a key is disclosed. The lookup table provides a match for a key in a single search cycle. The number of matches stored in the lookup table is maximized by storing each match in only one location in the lookup table. The binary tree is divided into a plurality of levels and each level has a plurality of subtrees. A subtree descriptor stored for a subtree includes a field for each node in the subtree. The state of the field indicates whether an entry for the node is stored in the table. The bit vector allows indexing of the single match stored for the key.