Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-04-11
2006-04-11
Knight, Anthony (Department: 2121)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S392000, C370S389000, C370S235000, C709S238000, C709S234000, C709S235000, C718S100000, C718S103000, C711S108000, C711S216000, C706S059000, C706S020000, C712S022000, C712S009000
Reexamination Certificate
active
07027446
ABSTRACT:
A method and apparatus for of high-speed and memory efficient rule matching, the rule matching being performed on an m-dimensional universe with each dimension bound by a given range of coordinate values, and a set of rules that apply to an undetermined number of coordinates in that universe. More specifically, a high-speed computer based packet classification system, uses an innovative set intersection memory configuration to provide efficient matching of packets flowing through a network system to a specific process flow based on a packet tuple. The system also provides classification of packets as they flow through a network system. More particularly, this system correlates these flowing packets with previously received packets, along with identifying the packets so that they are handled efficiently. The ability to correlate packets to their corresponding process flows permits the implementation of service aware networks (SAN) that are capable of handling network situations at the application level.
REFERENCES:
patent: 4180854 (1979-12-01), Walden et al.
patent: 4837735 (1989-06-01), Allen et al.
patent: 4984174 (1991-01-01), Yasunobu et al.
patent: 5010477 (1991-04-01), Omoda et al.
patent: 5152000 (1992-09-01), Hillis
patent: 5165009 (1992-11-01), Watanabe et al.
patent: 5197130 (1993-03-01), Chen et al.
patent: 5208768 (1993-05-01), Simoudis
patent: 5245697 (1993-09-01), Suzuoka
patent: 5249286 (1993-09-01), Alpert et al.
patent: 5379393 (1995-01-01), Yang
patent: 5414704 (1995-05-01), Spinney
patent: 5438670 (1995-08-01), Baror et al.
patent: 5463777 (1995-10-01), Bialkowski et al.
patent: 5465343 (1995-11-01), Henson et al.
patent: 5473680 (1995-12-01), Porter
patent: 5574910 (1996-11-01), Bialkowski et al.
patent: 5592590 (1997-01-01), Jolly
patent: 5649181 (1997-07-01), French et al.
patent: 5689670 (1997-11-01), Luk
patent: 5720005 (1998-02-01), Goke et al.
patent: 5727229 (1998-03-01), Kan et al.
patent: 5742761 (1998-04-01), Olnowich et al.
patent: 5745488 (1998-04-01), Thompson et al.
patent: 5757795 (1998-05-01), Schnell
patent: 5764736 (1998-06-01), Shachar et al.
patent: 5799291 (1998-08-01), Eichfeld et al.
patent: 5805874 (1998-09-01), Gallup et al.
patent: 5815500 (1998-09-01), Murono
patent: 5854938 (1998-12-01), Ogi
patent: 5890202 (1999-03-01), Tanaka
patent: 5951651 (1999-09-01), Lakshman et al.
patent: 6014508 (2000-01-01), Christian et al.
patent: 6018794 (2000-01-01), Kilpatrick
patent: 6032190 (2000-02-01), Bremer et al.
patent: 6052683 (2000-04-01), Irwin
patent: 6081884 (2000-06-01), Miller
patent: 6084877 (2000-07-01), Egbert et al.
patent: 6111874 (2000-08-01), Kerstein
patent: 6125359 (2000-09-01), Lautzenheiser et al.
patent: 6161144 (2000-12-01), Michels et al.
patent: 6175867 (2001-01-01), Taghadoss
patent: 6189034 (2001-02-01), Riddle
patent: 6208640 (2001-03-01), Spell et al.
patent: 6233686 (2001-05-01), Zenchelsky et al.
patent: 6249614 (2001-06-01), Kolesnik et al.
patent: 6314471 (2001-11-01), Alverson et al.
patent: 6317819 (2001-11-01), Morton
patent: 6321217 (2001-11-01), Maeda et al.
patent: 6353817 (2002-03-01), Jacobs et al.
patent: 6393413 (2002-05-01), Jorgensen et al.
patent: 6434156 (2002-08-01), Yeh
patent: 6438532 (2002-08-01), Kiji
patent: 6480489 (2002-11-01), Muller et al.
patent: 6481005 (2002-11-01), Crowley et al.
patent: 6502134 (2002-12-01), Makarios et al.
patent: 6522632 (2003-02-01), Waters et al.
patent: 6560592 (2003-05-01), Reid et al.
patent: 6584110 (2003-06-01), Mizuta et al.
patent: 6587963 (2003-07-01), Floyd et al.
patent: 6600724 (2003-07-01), Cheng
patent: 6615210 (2003-09-01), Huang et al.
patent: 6631419 (2003-10-01), Greene
patent: 6643628 (2003-11-01), Jackson et al.
patent: 6697362 (2004-02-01), Akella et al.
patent: 6700889 (2004-03-01), Nun
patent: 6704717 (2004-03-01), Tate
patent: 6714517 (2004-03-01), Fawaz et al.
patent: 6725452 (2004-04-01), Te'eni et al.
patent: 6728243 (2004-04-01), Jason et al.
patent: 6768739 (2004-07-01), Kobayashi et al.
patent: 6775290 (2004-08-01), Merchant et al.
patent: 6778984 (2004-08-01), Lu et al.
patent: 6788697 (2004-09-01), Aweya et al.
patent: 6813645 (2004-11-01), Meyer
patent: 6826561 (2004-11-01), Cao et al.
patent: 6831893 (2004-12-01), Ben Nun et al.
patent: 6839349 (2005-01-01), Ambe et al.
patent: 6862106 (2005-03-01), Matsushima
patent: 6873735 (2005-03-01), Aleksic et al.
patent: 6928482 (2005-08-01), Ben Nun et al.
patent: 6934696 (2005-08-01), Williams et al.
patent: 2001/0039576 (2001-11-01), Kanada
patent: 2002/0085573 (2002-07-01), McDonnell
patent: 459233 (1991-12-01), None
patent: 2399199 (2004-09-01), None
patent: WO 9913620 (1999-03-01), None
Pooch; Translation of Decision Tables; ACM Computing Surveys (CSUR); vol. 6, Is. 2; Jun. 1974.
Fraser et al; Engineering a simple, efficient code-generator generator; ACM Letters on Programming Languages and Systems (LOPLAS); vol. 1, Is. 3; Sep. 1992.
O'Neil et al; Improved query performance with variant indexes; Proceedings of the 1997 ACM SIGMOD international conference on Management of data; vol. 26, Is. 2; Jun. 1997.
Bottoni et al; An APL rule-based system architecture for image interpretation strategies; Proceedings of the international conference on APL; vol. 21, Is. 4; Jul. 1991.
Hernandez-Valencia et al; The building blocks of a data-aware transport network; deploying viable Ethernet and virtual wire services via multiservice ADMs; IEEE Communications Magazine; vol. 42, Is. 3; Mar. 2004; pp 104-111.
Serre et al; Implementing OSI-based interfaces for network management; IEEE Communications Magazine; vol. 31, Is. 5; May 1993; pp 76-81.
IEEE 100: The Authoritative Dictionary of IEEE Standards Terms; Seventh Edition; Dec. 2000; pp iii, v-x, 6, 682.
Held; High-Speed Networking with LAN Switches; ISBN 0-471-18444-6; 1997; pp iii-ix, xi-xii, 7-8, 37-61, 63-105, 109, 122-127, 133-134, 138-141, 176, 187-189, 204, 211, 214-216, 223-224, 230-238, 244, 246-247, 262, 264-272.
Lew; Optimal conversion of extended-entry decision tables with general cost criteria; Communications of the ACM; vol. 21, Is. 4; Apr. 1978; pp 269-279.
Nedjah; Technical Correspondence: Minimal deterministic left-to-right pattern-matching automata; ACM SIGPLAN Notices; vol. 33, Is. 1; Jan. 1998; pp 40-47.
Doerschler et al; A rule-based system for dense-map name placement; Communications of the ACM; vol. 35, Is. 1; Jan. 1992; pp 68-79.
Marcus; A design for a parser for English; Proceedings of the annual conference; Oct. 1976; pp 62-68.
Cohen et al; Analyses of deterministic parsing algorithms; Communications of the ACM; vol. 21, Is. 6; Jun. 1978; pp 448-458.
Nauck et al; NEFCLASS for Java—new learning algorithms; 18th International Conference of the North American Fuzzy Information Processing Society; Jul. 1999; pp 472-476.
Mercer et al; An array grammar programming system; Communications of the ACM; vol. 16, Is. 5; May 1973; pp 299-305.
Shieh et al; A GA-based Sugeno-type fuzzy logic controller for the cart-pole system; 23rd International Conference on Industrial Electronics, Control and Instrumentation; vol. 3; Nov. 9-14, 1997; pp 1028-1033.
Cabri et al; Reactive Tuple Spaces for Mobile Agent Coordination; Lecture Notes In Computer Science; vol. 1477; Proceedings of the Second International Workshop on Mobile Agents; 1998; pp 237-248 □□.
Gildea et al; Learning bias and phonological-rule induction; Computational Linguistics; vol. 22, Is. 4; Dec. 1996; pp 497-530.
Fromkin et al; An interactive phonological rule testing system; Proceedings of the 1969 conference on Computational linguistics; Sep. 1969; pp 1-21.
Tannenbaum; Computer Networks; Fourth Edition; Aug. 9, 2002; 3 copyright pages, 2 Other bestselling titles pages, 4 Preface pages, 2 About pages.
Lakshman et al; High-Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching; ACM SIGCOMM; Feb. 1998; pp 203-214.
Zanin et al; ADAPT—a low-cost videoconference model for personal computers running on IP networks; Proceedings of the ACM symposium on Applied computing; Mar. 2001; pp 446-447.
van der Merwe et al; Papers: mmdump: a
Finkelman Ori
Marko Reuven A
Rosenfeld Amir
Abelman, Frayne and Schwab
Bell Meltin
P-Cube Ltd.
LandOfFree
Method and apparatus for set intersection rule matching 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 set intersection rule matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for set intersection rule matching will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3615707