Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2005-08-29
2009-02-03
Moe, Aung S (Department: 2416)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S394000, C370S471000, C370S474000, C370S902000
Reexamination Certificate
active
07486673
ABSTRACT:
A method and system for inspecting a data packet stream in a computer network for patterns that fall across data packet boundaries is disclosed. This includes determining if two or more data packets are consecutive in the data packet stream, combining data payloads from the consecutive data packets, and analyzing the combined data payloads from the consecutive data packets for a plurality of patterns of character combinations, wherein the maximum length of the combined data payloads is one less than the maximum number of characters for a pattern having a longest length of the plurality of patterns of character combinations. This can include a content searching engine and/or a regular expression engine. There are optional aspects to return data packets to an outgoing data stream based on predetermined criteria and if the data packets are in the system for over a predetermined time period.
REFERENCES:
patent: 4593353 (1986-06-01), Pickholtz
patent: 4868376 (1989-09-01), Lessin et al.
patent: 5369605 (1994-11-01), Parks
patent: 5469161 (1995-11-01), Bezek
patent: 5497488 (1996-03-01), Akizawa et al.
patent: 5511213 (1996-04-01), Correa
patent: 5525982 (1996-06-01), Cheng et al.
patent: 5532693 (1996-07-01), Winters et al.
patent: 5542045 (1996-07-01), Levine
patent: 5546463 (1996-08-01), Caputo et al.
patent: 5576985 (1996-11-01), Holtz
patent: 5602764 (1997-02-01), Eskandari-Gharnin et al.
patent: 5631971 (1997-05-01), Sparrow
patent: 5680612 (1997-10-01), Asada et al.
patent: 5737424 (1998-04-01), Elteto et al.
patent: 5777608 (1998-07-01), Lipovski et al.
patent: 5778071 (1998-07-01), Caputo et al.
patent: 5805801 (1998-09-01), Holloway et al.
patent: 5809145 (1998-09-01), Slik et al.
patent: 5826011 (1998-10-01), Chou et al.
patent: 5829051 (1998-10-01), Steely, Jr. et al.
patent: 5845298 (1998-12-01), O'Connor et al.
patent: 5856977 (1999-01-01), Yang et al.
patent: 5867609 (1999-02-01), Shamoon et al.
patent: 5878142 (1999-03-01), Caputo et al.
patent: 5907838 (1999-05-01), Miyasaka et al.
patent: 5913216 (1999-06-01), Kneuer et al.
patent: 5940389 (1999-08-01), Yang et al.
patent: 5987028 (1999-11-01), Yang et al.
patent: 6005940 (1999-12-01), Kulinets
patent: 6070162 (2000-05-01), Miyasaka et al.
patent: 6079621 (2000-06-01), Vardanyan et al.
patent: 6098089 (2000-08-01), O'Connor et l.
patent: 6119120 (2000-09-01), Miller
patent: 6128741 (2000-10-01), Goetz et al.
patent: 6147890 (2000-11-01), Kawana et al.
patent: 6151598 (2000-11-01), Shaw et al.
patent: 6167136 (2000-12-01), Chou
patent: 6167393 (2000-12-01), Davis, III et al.
patent: 6223172 (2001-04-01), Hunter et al.
patent: 6240407 (2001-05-01), Chang et al.
patent: 6240436 (2001-05-01), McGregor
patent: 6253243 (2001-06-01), Spencer
patent: 6263313 (2001-07-01), Milsted et al.
patent: 6278782 (2001-08-01), Ober et al.
patent: 6282290 (2001-08-01), Powell et al.
patent: 6282657 (2001-08-01), Kaplan et al.
patent: 6307936 (2001-10-01), Ober et al.
patent: 6314506 (2001-11-01), Stanton et al.
patent: 6338056 (2002-01-01), Dessloch et al.
patent: 6345256 (2002-02-01), Milsted et al.
patent: 6381242 (2002-04-01), Maher, III et al.
patent: 6397331 (2002-05-01), Ober et al.
patent: 6412069 (2002-06-01), Kavsan
patent: 6438612 (2002-08-01), Ylonen et al.
patent: 6442295 (2002-08-01), Navoni et al.
patent: 6453415 (2002-09-01), Ober
patent: 6463538 (2002-10-01), Elteto
patent: 6523119 (2003-02-01), Pavlin et al.
patent: 6671808 (2003-12-01), Abbott et al.
patent: 6678734 (2004-01-01), Haatainen et al.
patent: 6704871 (2004-03-01), Kaplan et al.
patent: 6708273 (2004-03-01), Ober et al.
patent: 6781992 (2004-08-01), Rana et al.
patent: 6807553 (2004-10-01), Orelemans
patent: 6842896 (2005-01-01), Redding et al.
patent: 6848045 (2005-01-01), Long et al.
patent: 6856981 (2005-02-01), Wyschogrod et al.
patent: 6941404 (2005-09-01), Oerlemans et al.
patent: 6959297 (2005-10-01), Oh et al.
patent: 6973565 (2005-12-01), Couillard
patent: 2001/0013802 (2001-08-01), Faulcon et al.
patent: 2001/0043702 (2001-11-01), Elteto et al.
patent: 2001/0056540 (2001-12-01), Ober et al.
patent: 2002/0034329 (2002-03-01), Navoni et al.
patent: 2002/0046342 (2002-04-01), Elteto et al.
patent: 2002/0104004 (2002-08-01), Couillard
patent: 2002/0120810 (2002-08-01), Brouwer
patent: 2002/0129290 (2002-09-01), Couillard
patent: 2002/0157003 (2002-10-01), Beletski
patent: 2002/0188858 (2002-12-01), Oerlemans
patent: 2002/0191548 (2002-12-01), Ylonen et al.
patent: 2003/0026427 (2003-02-01), Couillard
patent: 2003/0028664 (2003-02-01), Tan et al.
patent: 2003/0028778 (2003-02-01), Couillard
patent: 2003/0065800 (2003-04-01), Wyschogrod et al.
patent: 2003/0097577 (2003-05-01), Sotoodeh et al.
patent: 2003/0108193 (2003-06-01), Sotoodeh
patent: 2003/0110208 (2003-06-01), Wyschogrod et al.
patent: 2003/0110379 (2003-06-01), Ylonen et al.
patent: 2003/0110389 (2003-06-01), Elteto
patent: 2003/0123491 (2003-07-01), Couillard
patent: 2003/0163738 (2003-08-01), Couillard
patent: 2003/0163803 (2003-08-01), Wyschogrod et al.
patent: 2004/0015905 (2004-01-01), Huima
patent: 2004/0034674 (2004-02-01), Benschop
patent: 2004/0057430 (2004-03-01), Paavolainen
patent: 2004/0059907 (2004-03-01), Cochran et al.
patent: 2004/0066274 (2004-04-01), Bailey
patent: 2004/0098585 (2004-05-01), Grove et al.
patent: 2004/0098596 (2004-05-01), Elteto et al.
patent: 2004/0162826 (2004-08-01), Wyschogrod et al.
patent: 2004/0168151 (2004-08-01), Elteto
patent: 2004/0215966 (2004-10-01), Elteto
patent: 2005/0111446 (2005-05-01), Greaves et al.
patent: 2005/0165966 (2005-07-01), Gai et al.
patent: 2005/0238010 (2005-10-01), Panigrahy et al.
patent: 2006/0039372 (2006-02-01), Sarkinen et al.
patent: 0859333 (1998-08-01), None
Cohen, “Recursive hashing functions for n-grams”, ACM Transactions on Information Systems, vol. 15, No. 3, Jul. 1997, pp. 291-320.
Brenner, “Extending APL for pattern matching”, IBM T. J. Watson Research Center 1983, pp. 275-280.
Cohen, “An n-gram Hash and Skip Algorithm for Finding Large Numbers of Keywords in Continuous Text Streams,” Software—Practice and Experience, 1998, pp. 1605-1635, vol. 28, John Wiley & Sons, Ltd.
Cohen, “Hardware-assisted algorithm for full-text large-dictionary string matching using n-gram hashing,” Information Processing & Management, 1998, pp. 443-464, vol. 34, Elsevier Science, Ltd., Great Britain.
International Search Report from corresponding PCT/US06/33123.
Harijono Indra Gunawan
Lee Ho Jae
Yoon Uooyeol
Connect Technologies Corporation
Kercher, Esq. Kevin M.
Khan Asif H
Moe Aung S
Thompson & Coburn LLP
LandOfFree
Method and system for reassembling packets prior to searching 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 system for reassembling packets prior to searching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for reassembling packets prior to searching will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4118036