Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-12-21
2011-12-20
Scheibel, Robert (Department: 2467)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C711S108000, C711S216000
Reexamination Certificate
active
08081632
ABSTRACT:
Computers are caused to provide a hash table wherein each entry is associated with a binary key and indexed by a selected portion of a hash value of the associated key, and points to a data structure location for storing non-selected portions of, or the entire hash value of, the binary key, and action data corresponding to the value of the binary key. Content addressable memory entries store a binary key, or a value unique to it, and an association to a corresponding action. Pointers to the data structure use selected portions of binary key hash values as an index when not selected portions of hash values of other binary keys, and associations are established between CAM entry and associated data structure locations when selected portions of the hash values of the binary keys are the same as selected portions of hash values of one or more other binary keys.
REFERENCES:
patent: 5251207 (1993-10-01), Abensour et al.
patent: 5390173 (1995-02-01), Spinney et al.
patent: 5414704 (1995-05-01), Spinney
patent: 5881311 (1999-03-01), Woods
patent: 5893086 (1999-04-01), Schmuck et al.
patent: 5909686 (1999-06-01), Muller et al.
patent: 6104715 (2000-08-01), Basso et al.
patent: 6430190 (2002-08-01), Essbaum et al.
patent: 6735670 (2004-05-01), Bronstein et al.
patent: 6934796 (2005-08-01), Pereira et al.
patent: 7039764 (2006-05-01), Shetty et al.
patent: 919980015 (1998-05-01), None
IBM Technical Disclosure Bulletin vol. 35, No. 3, “Improved Rete Algorithm—Hashing Techniques Applied to Partial Match Memories”, Aug. 1992, p. 149.
IBM Technical Disclosure Bulletin vol. 38, No. 2, “Method for Organizing a Hash Table”, Feb. 1995, pp. 5-8.
IBM Technical Disclosure Bulletin vol. 38, No. 8, “Mapping of Distributed Computing Environment Identities to MVS Userids”, Aug. 1995, pp. 213-214.
Applied Optics vol. 24, No. 20, “Shadow Casting for Direct Table Look-Up and Multiple-Valued Logic”, Oct. 15, 1985, pp. 3312-3314.
Davis Gordon Taylor
Herkersdorf Andreas Guenther
Jeffries Clark Debs
Rinaldi Mark Anthony
Daugherty Patrick J.
Driggs, Hogg, Daugherty & Del Zoppo Co., LPA
International Business Machines - Corporation
Scheibel Robert
LandOfFree
Lookups by collisionless direct tables and CAMS does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Lookups by collisionless direct tables and CAMS, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lookups by collisionless direct tables and CAMS will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4255825