Apparatus and method for efficient hashing in networks

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

C370S400000

Reexamination Certificate

active

06870849

ABSTRACT:
An apparatus and method for efficient hashing uses both an identifying portion of a data packet, e.g., source and destination ID, and an identifying value of the node, e.g., the IP address of the node, to generate a hash result. By inserting a unique value into the hash operation at each node, the invention effectively provides for a different hash implementation at each node. As a result, in situations where multiple paths or multiple links within a path are available to forward packets, traffic can be split over the multiple paths and links. Inefficient utilization of network links found in prior systems which use the same hash operation at each node are eliminated.

REFERENCES:
patent: 5978951 (1999-11-01), Lawler et al.
patent: 6044080 (2000-03-01), Antonov
patent: 6091725 (2000-07-01), Cheriton et al.
patent: 6111877 (2000-08-01), Wilford et al.
patent: 6397260 (2002-05-01), Wils et al.
patent: 20020097736 (2002-07-01), Cohen
Inventor Ross W. Callon's Statement Attached to Inventor's Declaration, dated Aug. 18, 2000.

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

Apparatus and method for efficient hashing in networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Apparatus and method for efficient hashing in networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for efficient hashing in networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3402346

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