Electrical computers and digital processing systems: multicomput – Computer-to-computer data addressing
Reexamination Certificate
2007-04-17
2007-04-17
Prieto, Beatriz (Department: 2142)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data addressing
C709S217000
Reexamination Certificate
active
10128919
ABSTRACT:
A method and system are disclosed for efficiently matching incoming packets to previously forwarded outgoing packets within a network node to ensure a response received by a network node corresponds to a previously forwarded request. The network node receives an outgoing packet including state information and computes a mapping (e.g., hash) function value based upon the state information. Thereafter, the network node sets and entry within a bitmap at a position corresponding to the mapping function value. The network node also receives an incoming packet purportedly responsive to an earlier outgoing packet and includes state information of a type corresponding to the state information of an outgoing packet. The network node computes a mapping function value based upon the state information in the incoming packet. The network node then tests an entry corresponding to the mapping function value within one or more bitmaps including bits set at positions corresponding to previously forwarded outgoing packets. If the corresponding bit is not set within at least one of the bitmaps, then the network node discards the corresponding packet. Finally, in order to maintain a relative sparse bitmap, the entries are reset after detecting a clearance threshold event.
REFERENCES:
patent: 5519706 (1996-05-01), Bantz et al.
patent: 5764890 (1998-06-01), Glasser et al.
patent: 5784362 (1998-07-01), Turina
patent: 5926549 (1999-07-01), Pinkas
patent: 5987376 (1999-11-01), Olson et al.
patent: 6085249 (2000-07-01), Wang et al.
patent: 6115376 (2000-09-01), Sherer et al.
patent: 6219706 (2001-04-01), Fan et al.
patent: 6263445 (2001-07-01), Blumenau
patent: 6289013 (2001-09-01), Lakshman et al.
patent: 6385209 (2002-05-01), Skirmont et al.
patent: 6434618 (2002-08-01), Cohen et al.
patent: 6665714 (2003-12-01), Blumenau et al.
patent: 6738828 (2004-05-01), Keats et al.
patent: 6778501 (2004-08-01), Malmgren et al.
patent: 6970939 (2005-11-01), Sim
patent: 6970960 (2005-11-01), Sarfati
patent: 6978384 (2005-12-01), Milliken
patent: 7000021 (2006-02-01), Radhakrishnan et al.
patent: 7003574 (2006-02-01), Bahl
patent: 7031288 (2006-04-01), Ogier
patent: 7047287 (2006-05-01), Sim et al.
patent: 7058789 (2006-06-01), Henderson et al.
patent: 2002/0078174 (2002-06-01), Sim et al.
patent: 2002/0129165 (2002-09-01), Dingsor et al.
patent: 2002/0143944 (2002-10-01), Traversat et al.
patent: 2002/0143989 (2002-10-01), Huitema et al.
Cheung et al.,Proceedings of the International Conference on Dependable Systems and Networks 2000(DSN 2000), New York, NY, Jun. 25-28, 2000, pp. 641-651 (IEEE Computing Society, Jun. 25, 2000).
Frantzen et al.,Computers&Security, 20 (3), 263-270 (May 1, 2001).
Tripunitara et al.,Proceedings of the 15th Annual Computer Security Applications Conference(ACSAC '99), Phoenix, AZ, Dec. 6-10, 1999, pp. 303-309 (IEEE Computing Society, Dec. 6, 1999).
Adam Langley,The Freenet Protocol, The Free Network Project, at http://freenet.sourceforge.net/index.php?page=protocol (last visited May 21, 2001).
Philip J. Erdelsky,The Birthday Paradox, EFG, at http://www.efgh.com/math/birthday.htm (last visited Mar. 8, 2002).
Red-Black Tree, National Institute of Standards and Technology, at http://www.nist.gov/dads/HTML/redblack.html (last visited Mar. 5, 2002).
Lai, Kevin, and Mary Baker,Measuring Link Bandwidths Using a Deterministic Model of Packet Delay, at Department of Computer Science at Stanford University, 13 pages.
Rowstron, Antony, and Peter Druschel,Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, at Microsoft Research, Ltd., St. George House and Rice University, 20 pages.
Druschel, Peter, and Antony Rowstron,PAST: A large-scale, persistent peer-to-peer storage utility, at Rice University and Microsoft Research, 6 pages.
Rowstron, Antony, and Peter Druschel,Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility, at Microsoft Research, Ltd., St. George House and Rice University, 14 pages.
Rowstron, Antony, Anne-Marie Kermarrec, Peter Druschel, and Miguel Castro,SCRIBE: The design of a large-scale event notification infrastructure, at Microsoft Research, Ltd., St. George House and Rice University, 20 pages.
Dabek, Frank, Emma Brunskill, M.Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan,Building Peer-to-Peer Systems With Chord, a Distributed Lookup Service, at MIT Laboratory for Computer Science, 6 pages, at http://pdos.lcs.mit.edu/chord.
Ellison, C.,SPKI Requirements, (The Internet Society 1999), at http://www.ietf.org/rfc/rfc2692.txt?number=2692 (last visited Aug. 6, 2001).
Ellison, Carl, Bill Frantz, Butler Lampson, Ron Rivest, Brian M. Thomas, and Tatu Ylonen,Simple Public Key Certificate, (Internet Draft 1999), at http://www.world.std.com/˜cme/spki.txt (last visited Aug. 6, 2001).
Ellison, C., B. Frantz, B. Lampson, R. Rivest, B. Thomas, and T. Ylonen,SPKI Certificate Theory, (The Internet Society 1999), at http://www.ietf.org/rfc/rfc2693.txt?number=2693 (last visited Aug. 6, 2001.
Marshall & Gerstein & Borun LLP
Meucci Michael D.
Prieto Beatriz
LandOfFree
Method and apparatus for efficiently matching responses to... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for efficiently matching responses to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for efficiently matching responses to... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3722281