Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2005-07-13
2010-06-01
Cho, Hong (Department: 2467)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C709S224000
Reexamination Certificate
active
07729256
ABSTRACT:
A system/method searches a traffic stream for a sequence of “matching” packets that exhibit a high degree of correlation or similarity to a sequence of “reference” packets. The correlation between matching and reference packets is based on a degree of correspondence between individual packets, as well as the sequence-order of the corresponding packets. A variation of the Needleman-Wunsch algorithm is preferably used to select corresponding packets in the traffic stream that provide a sequence-order that best matches the sequence-order of the reference packets, based on a measure of the correspondence for each match, and a penalty associated with each non-match. The algorithm is further modified to reduce the required search-space for finding corresponding packets in the traffic stream.
REFERENCES:
patent: 6129050 (2000-10-01), Carbajal
patent: 7047297 (2006-05-01), Huntington et al.
patent: 7246101 (2007-07-01), Fu et al.
patent: 2002/0166063 (2002-11-01), Lachman et al.
patent: 2003/0097439 (2003-05-01), Strayer et al.
patent: 2003/0097595 (2003-05-01), Partridge et al.
patent: 2004/0073655 (2004-04-01), Kan et al.
patent: 2004/0123155 (2004-06-01), Etoh et al.
patent: 2004/0186724 (2004-09-01), Morin
patent: 2005/0030979 (2005-02-01), Malloy
patent: 2005/0198268 (2005-09-01), Chandra
Batzoglou, S., CS262, lectures two and three, Stanford University, winter, 2004.
“Sequence Alignment”, en.wikipedia.org/wiki/sequence—alignment.
Allison, L., “Hirschberg's Algorithm”, www.csse.monash.edu.au/˜lloyd, 1999, School of Computer Science and Software Engineering, Faculty of Information Technology, Monash University, Australia.
Myers, E. and Miller, W., “Optimal Alignments in Linear Space”, CABIOS, vol. 4, pp. 11-17, 1988.
Needleman-Wunsch Algorithm, en.wikipedia.org/wiki/Needleman-Wunsch—algorithm.
U.S. Appl. No. 11/180,878, filed Jul. 13, 2005, Malloy et al.
Cohen Alain J.
Cohen Michael
Malloy Patrick J.
Cho Hong
Choi Eunsook
McDermott, Esq. Robert M.
OPNET Technologies Inc.
LandOfFree
Correlating packets does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Correlating packets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Correlating packets will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4171315