Multiplex communications – Diagnostic testing – Determination of communication parameters
Reexamination Certificate
2008-05-23
2010-10-05
Cho, Hong (Department: 2467)
Multiplex communications
Diagnostic testing
Determination of communication parameters
Reexamination Certificate
active
07808923
ABSTRACT:
In one embodiment, a node-implemented method for performing analysis of traffic within a packet communications network. First, the node measures a traffic aggregate at specified nodes within the network with regard to a packet set of interest. Each traffic aggregate (i) is a set of packets, observed at one of the specified nodes, having a common characteristic and (ii) is measured at one of the specified nodes by creating a digest for the packets having the common characteristic. The digest characterizes the traffic aggregate without containing the actual packets themselves. Next, the node formulates an intersection set cardinality determination for a network traffic-characterizing parameter to be measured in the network utilizing the digests characterizing the traffic aggregates. Next, the node solves the set cardinality determination for the network traffic-characterizing parameter to be measured.
REFERENCES:
patent: 5999961 (1999-12-01), Manohar et al.
patent: 6873600 (2005-03-01), Duffield et al.
patent: 7146416 (2006-12-01), Yoo et al.
patent: 2002/0143929 (2002-10-01), Maltz et al.
patent: 2002/0143935 (2002-10-01), Schenkel et al.
patent: 2003/0097439 (2003-05-01), Strayer et al.
patent: 2003/0135612 (2003-07-01), Huntington et al.
patent: 2003/0145231 (2003-07-01), Poletto et al.
patent: 2003/0198190 (2003-10-01), Rajan et al.
patent: WO 03/075509 (2003-09-01), None
Andrei Broder et al., “Network Applications of Bloom Filters: A Survey*” Allerton Conference 2002, available at http://www/eecs.harvard.edu/˜michaelm, pp. 636-646.
John Byers et al., “Informed Content Delivery Across Adaptive Overlay Networks*”, Proc. of ACM SIGCOMM'02, Aug. 19-23, 2002, Pittsburg, Pennsylvania, pp. 47-60.
Philippe Flajolet et al., “Probabilistic Counting Algorithms for Data Base Applications”, Reprinted from Journal of Computer and System Sciences, vol. 31, No. 2, Oct. 1985, pp. 182-209.
Marianne Durand et al., “Loglog Counting of Large Cardinalities”, submitted to European Symposium on Algorithms, ESA'2000, Apr. 2003.
Cristian Estan et al., “Counting the number of active flows on a high speed link”, ACM SIGCOMM Computer Communications Review, vol. 32, No. 3, Jul. 2002, p. 10.
Phillip B. Gibbons et al., “Estimating Simple Functions On The Union of Data Streams”, Proc. of ACM SPAA '01, Crete, Greece, 2001, pp. 281-290.
Herman Lam et al., “A Special Function Unit for Database Operations (SFU-DB): Design and Performance Evaluation” IEEE Transactions on Computers, vol. 40, No. 3, Mar. 1991, pp. 263-275.
R. Sarnath et al., Efficient Parallel Algorithms for Selection and Searching on Sorted Matrices, 1992 IEEE, pp. 108-111.
Wei-Ming Lin et al., “Look-Ahead Traffic Distribution In Wormhole-Routed Networks”, Proceedings of Seventeenth IEEE Symposium on Reliable Distributed Systems, Oct. 20-23, 1998, XP10319124A, pp. 318-323.
Andrei Z. Broder., “On the Resemblance And Containment of Documents”, Compression and Complexity of Sequences 1997 Proceedings, Positano, Itlay, Jun. 1997.
Y. Vardi, “Network Tomography: Estimating Source-Destination Traffic Intensities From Link Data”, Journal of the American Statistical Association, vol. 91, No. 433, Theory and Methods, Mar. 1996, pp. 365-377.
Jin Cao et al., “Time-Varying Network Tomography: Router Link Data”, Journal of the American Statistical Association, vol. 95, No. 452, Applications and Case Studies, Dec. 2000, pp. 1063-1075.
Andrei Z. Broder et al., “Min-Wise Independent Permutations”, Journal of Computer and System Sciences, vol. 60, No. 3, 2000, pp. 630-659.
A. Medina et al., “Traffic Matrix Estimation: Existing Techniques and New Directions”, Proc. of ACM SIGCOMM'02, Aug. 19-23, 2002, Pittsburg, Pennsylvania, pp. 1-14.
Yin Zhang et al., “Fast Accurate Computation of Large-Scale IP Traffic Matrices From Link Loads”, Proc. of ACM SIGMETRICS'03, Jun. 10-14, 2003, San Diego, CA, 12 pages.
Yin Zhang et al., “An Information-Theoretic Approach to Traffic Matrix Estimation,” Proc. of ACM SIGCOMM'03, Aug. 25-29, 2003, Karlsruhe, Germany, pp. 301-312.
“CISCO ISO Software Netflow”, http://www.cisco.com/warp.public/732/Tech
mp
etflow/index.shtml, (Web Printout: Nov. 22, 2004, 1 page.
N.G. Duffield et al., “Trajectory Sampling for Direct Traffic Observation,” Proc. of ACM SIGCOMM'00, Stockholm, Sweden, 2000, pp. 271-282.
Alex C. Snoeren et al., “Hash-Based IP Traceback”, Proc. of ACM SIGCOMM'01, Aug. 27-31, 2001, San Diego, California, pp. 3-14.
Burton H. Bloom, “Space/Time Trade-offs in Hash Coding with Allowable Errors”, Communications of the ACM, vol. 13, No. 7, Jul. 1970, pp. 422-426.
Kodialam Muralidharan S.
Lakshman Tirunell V.
Lau Wing Cheong
Alcatel-Lucent USA Inc.
Cho Hong
Choi Eunsook
Mendelsohn & Associates, P.C.
LandOfFree
High-speed traffic measurement and analysis methodologies... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with High-speed traffic measurement and analysis methodologies..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-speed traffic measurement and analysis methodologies... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4240363