Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2008-07-01
2008-07-01
Duong, Frank (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
Reexamination Certificate
active
07394809
ABSTRACT:
A packet classifier having a forest of hash tables data structure. The forest of hash tables data structure includes a number of hash tables, each hash table having a bit mask corresponding to an equivalent set of rules. Each hash table includes a number of entries, wherein an entry of a hash table may correspond to a rule. One or more of the hash tables may include a marker in one entry, wherein the marker identifies another one of the hash tables. The hash table identified by the marker is a descendant of the hash table in which the marker is placed.
REFERENCES:
patent: 5615341 (1997-03-01), Agrawal et al.
patent: 5920900 (1999-07-01), Poole et al.
patent: 5951651 (1999-09-01), Lakshman et al.
patent: 5995971 (1999-11-01), Douceur et al.
patent: 6115802 (2000-09-01), Tock et al.
patent: 6141749 (2000-10-01), Coss et al.
patent: 6147976 (2000-11-01), Shand et al.
patent: 6182228 (2001-01-01), Boden et al.
patent: 6212184 (2001-04-01), Venkatachary et al.
patent: 6289013 (2001-09-01), Lakshman et al.
patent: 6301669 (2001-10-01), Boden et al.
patent: 6341130 (2002-01-01), Lakshman et al.
patent: 7031314 (2006-04-01), Craig et al.
patent: 7039641 (2006-05-01), Woo
patent: 7133400 (2006-11-01), Henderson et al.
patent: 2001/0000193 (2001-04-01), Boden et al.
patent: 2002/0023080 (2002-02-01), Uga et al.
patent: 2002/0118682 (2002-08-01), Choe
patent: 2002/0152209 (2002-10-01), Merugu et al.
patent: 2002/0191605 (2002-12-01), Lunteren et al.
patent: 2003/0014525 (2003-01-01), DeLima et al.
patent: 2003/0018591 (2003-01-01), Komisky
patent: 2003/0048785 (2003-03-01), Calvignac et al.
patent: 0 742 524 (1996-11-01), None
patent: WO 00/08817 (2000-02-01), None
Chao, Next Generation Routers, IEEE, pp. 1518-1558, Sep. 2002.
Milind M. Buddhikot et al., “Space Decomposition Techniques for Fast Layer-4 Switching,” Proceedings of Conference on Protocols for High Speed Networks, Aug. 1999, pp. 25-41.
Pankaj Gupta et al., “Packet Classification Using Hierarchical Intelligent Cuttings,” Proc. Hot Interconnects VII, Aug. 1999, Stanford./This paper is also available in: IEEE Micro, Jan./Feb. 2000, pp. 34-41, vol. 20, No. 1.
T.V. Lakshman et al., “High-Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching,” Proceedings of ACM Sigcomm, Sep. 1998, pp. 191-202.
V. Srinivasan et al., “Fast and Scalable Layer Four Switching,” Proceedings of ACM Sigcomm, Sep. 1998, pp. 203-214.
V. Srinivasan et al., “Packet Classification Using Tuple Space Search,” Proceedings of ACM Sigcomm, Sep. 1999, pp. 135-146.
V. Srinivasan et al., “Packet Classification Using Tuple Space Search,” Computer Communication Review, Association for Computing Machinery, Oct. 1999, pp. 135-160, vol. 29, No. 4, XP: 000852194 Department of Computer Science, Washington University in St. Louis, USA.
Kumar Alok
Yavatkar Raj
Caven & Aghevli LLC
Duong Frank
Intel Corporation
LandOfFree
Method and apparatus for packet classification using a... 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 packet classification using a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for packet classification using a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2756955