Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2011-07-12
2011-07-12
Ngo, Ricky (Department: 2464)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S412000, C370S428000
Reexamination Certificate
active
07978709
ABSTRACT:
A method of constructing a hierarchical database from an initial plurality of rules. A first rule of the initial plurality of rules is added to: a first sub-database if a first bit of the rule is a logic ‘0’ value; a second sub-database if the first bit is a logic ‘1’ value; or a third sub-database if the first bit is in a masked state, ‘X’, indicating that the first bit may be either a logic ‘1’ or a logic ‘0’ value.
REFERENCES:
patent: 5574910 (1996-11-01), Bialkowski et al.
patent: 5991758 (1999-11-01), Ellard
patent: 6018524 (2000-01-01), Turner et al.
patent: 6154384 (2000-11-01), Nataraj et al.
patent: 6192051 (2001-02-01), Lipman et al.
patent: 6212184 (2001-04-01), Venkatachary et al.
patent: 6215816 (2001-04-01), Gillespie et al.
patent: 6223172 (2001-04-01), Hunter et al.
patent: 6298340 (2001-10-01), Calvignac et al.
patent: 6307855 (2001-10-01), Hariguchi
patent: 6374326 (2002-04-01), Kansal et al.
patent: 6385649 (2002-05-01), Draves et al.
patent: 6546391 (2003-04-01), Tsuruoka
patent: 6571313 (2003-05-01), Filippi et al.
patent: 6615210 (2003-09-01), Huang et al.
patent: 6662184 (2003-12-01), Friedberg
patent: 6735600 (2004-05-01), Andreev et al.
patent: 6778984 (2004-08-01), Lu et al.
patent: 6963924 (2005-11-01), Huang et al.
patent: 7162481 (2007-01-01), Richardson et al.
patent: 7249228 (2007-07-01), Agarwal et al.
patent: 7266085 (2007-09-01), Stine
patent: 7299399 (2007-11-01), Huang
patent: 7313666 (2007-12-01), Saminda De Silva et al.
patent: 7426518 (2008-09-01), Venkatachary et al.
patent: 7461200 (2008-12-01), Birman et al.
patent: 7571156 (2009-08-01), Gupta et al.
patent: 7694068 (2010-04-01), Rosman
patent: 7836246 (2010-11-01), Birman et al.
patent: 2002/0089937 (2002-07-01), Venkatachary et al.
patent: 2008/0275872 (2008-11-01), Venkatachary et al.
A Fast and Scalable IP Lookup Scheme for High-Speed Networks, Chen et al., © 1999 IEEE, pp. 211-218.
Efficient hardware Architecture for Fast IP Address Lokup, Pao et al., IEEE INFOCOM 2002, pp. 555-561.
Fast Address lookups using controlled Prefix Expansion, Venkatachary Srinivasan et al., ACM Transactions on Computer Systems, vol. 17., No. 1, Feb. 1999, pp. 1-40.
Fast and Scalable Layer 4 Switching, V. Srinivasan, G Varghese, S. Suri and M. Waldvogel, Presented at ACM Sigcomm '98, 18 page slide presentation.
Forwarding Engine for Fast Routing Lookups and Updates, Yu et al., 1999 Gobal Telecommunications Conference, pp. 1556-1564.
Gupta, “Algorithms for routing Lookups and packet Classification,” Dec. 2000, pp. 1-197.
Lampson et al., “IP Lookup using Multiway and Multicolumn Search,” Aug. 1997, pp. 1-23.
Packet Classification using hierarchical Intelligent Cuttings, Pankaj Gupta and Nick McKeown, Proc. Hot Interconnects VII, Aug. 1999, Stanford University.
Packet Classification on Multiple Fields, Pankj Gupta and Nick McKeown, Proc. Sigcomm, Computer Communication Review, vol. 29, No. 4, pp. 147-160, Sep. 1999 Harvard University.
Reconfigurable memory Architecture for Scalable IP Forwarding Engines, Akhbarizadeh et al., © 2002 IEEE, pp. 432-437.
Gupta Pankaj
Venkatachary Srinivasan
Mahamedi Paradice Kreisman LLP
NetLogic Microsystems, Inc.
Ngo Ricky
Nguyen Phuongchau B
Paradice III William L.
LandOfFree
Packet matching method and system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Packet matching method and system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Packet matching method and system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2719301