Network packet forwarding lookup with a reduced number of...

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S389000, C370S392000

Reexamination Certificate

active

06975631

ABSTRACT:
A switch/router contains intelligence for more quickly determining a next hop for an network layer packet. A network forwarding lookup table or array structure is configured so as to minimize the number of memory accesses required. This results in a decrease in time due to memory access and a decrease in computational overhead due to the memory accesses. In one embodiment, a first forwarding lookup is indexed by the first 16 bits of a destination address. A second forwarding lookup is indexed by the subsequent 8 bits of the destination address, and a final third forwarding lookup is indexed by the last 8 bits of the destination address. Each entry within a forwarding lookup contains either direction as to how properly forward the packet or reference to a next subsequent forwarding lookup.

REFERENCES:
patent: 5032987 (1991-07-01), Broder et al.
patent: 5353283 (1994-10-01), Tsuchiya
patent: 6052683 (2000-04-01), Irwin
patent: 6144662 (2000-11-01), Colmant et al.
patent: 6337861 (2002-01-01), Rosen
patent: 6392996 (2002-05-01), Hjalmtysson
patent: 6563823 (2003-05-01), Przygienda et al.
patent: 6611522 (2003-08-01), Zheng et al.
patent: WO 99/13619 (1999-03-01), None
(1993) “Memory Organization Scheme For The Implementation Of Routing Tables In High Performance IP Routers”,IBM Technical Disclosure Bulletin, vol. 36(2), pp. 151-153.
(1995) “Local Area Network Switch Frams Lookup Technique for Increased Speed and Flexibility”,IBM Technical Disclosure Bulletin, vol. 38,(7), pp. 221-222.
Degermark, M. et al. Small Forwarding Tables for Fast Routing Lookups. ACM SIGCOMM'97 Conference: Applications, Technologies, Architectures, and Protocols for Computer Communication, Sep. 14-18, 1997, Cannes, France.Computer Communication Review(1997) vol. 27, No. 4, pp. 3-14.
Waldvogel, M. et al. Scalable High Speed IP Routing Lookups. ACM SIGCOMM'97 Conference: Applications, Technologies, Architectures, and Protocols for Computer Communications, Sept. 14-18, 1997, Cannes, France.Computer Communication Review(1997) vol. 27, No. 4, pp. 25-38.
Copy of U.S. Appl. No. 09/336,311, filed Jun. 18, 1999; Qin Zheng et al.; A Quality of Service Facility In A Device For Performing IP Forwarding And ATM Switching; 102 pages.
Copy of U.S. Appl. No. 09/336,229, filed Jun. 18, 1999; Steven R. Willis; Device for Performing IP Forwarding And ATM Switching; 62 pages.
Copy of U.S. Appl. No. 09/336,090, filed Jun. 18, 1999; Frank Kastenholz et al.; An Interconnect Network For Operation Within A Communication Node; 57 pages.
Copy of U.S. Appl. No. 09/335,947, filed on Jun. 18, 1999; Gregg Bromley et al.; Method And System For Encapsulating/Decapsulating Data On A Per Channel Basis In Hardware; 59 pages.
Copy of U.S. Appl. No. 10/120,380, filed Apr. 12, 2002; Pradeep Sindhu et al.; Systems And Methods for Memory Utilization During Packet Fowarding; 25 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Network packet forwarding lookup with a reduced number of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Network packet forwarding lookup with a reduced number of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network packet forwarding lookup with a reduced number of... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3499099

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.