Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Patent
1998-04-16
2000-08-01
Olms, Douglas W.
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
370392, 711216, 714781, H04L 1256
Patent
active
060977256
ABSTRACT:
A method and an apparatus for searching a bit field whose significant bits comprise two contiguous bit fields such as the VPI/VCI bit fields of an ATM cell header. The invention uses a hash key based on CRC-n calculated on the bit field to be searched. One m bit field part of the significant bits of the bit field to be searched can be concatenated with the CRC-n to form a double hash key. It appears that, L being the total of the two contiguous bit field lengths, if L=m=n+p, p being greater or equal to 4, the scattering of data to be searched is perfect. The method comprised a first step of pointing to a first address with the hash (or double hash) key and reading a maximum of 2.sup.p addresses before reaching the addresses containing the bit field to be searched.
REFERENCES:
patent: 4588985 (1986-05-01), Carter et al.
patent: 5199073 (1993-03-01), Scott
patent: 5689518 (1997-11-01), Galand et al.
patent: 5740171 (1998-04-01), Mazzola et al.
patent: 5912881 (1999-06-01), Glaise et al.
patent: 6014767 (2000-01-01), Glaise
patent: 6034958 (2000-03-01), Wicklund
Glaise Rene
Munier Jean-marie
International Business Machines - Corporation
Olms Douglas W.
Vanderpuye Ken
Woods Gerald R.
LandOfFree
Low cost searching method and apparatus for asynchronous transfe does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Low cost searching method and apparatus for asynchronous transfe, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low cost searching method and apparatus for asynchronous transfe will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-670853