N. Alon, Y. Matias, and M. Szegedy, The Space Complexity of Approximating the Frequency Moments, Journal of Computer and System Sciences, vol.58, issue.1, pp.137-143, 1999.
DOI : 10.1006/jcss.1997.1545

A. Broder, On the resemblance and containment of documents, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 1997.
DOI : 10.1109/SEQUEN.1997.666900

L. Carter and M. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences, vol.18, issue.2, pp.143-154, 1979.
DOI : 10.1016/0022-0000(79)90044-8
URL : http://doi.org/10.1016/0022-0000(79)90044-8

E. Cohen and H. Kaplan, Bottom-k sketches: better and more efficient estimation of aggregates, SIGMETRICS, 2007.

E. Cohen and H. Kaplan, Summarizing data using bottom-k sketches, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, 2007.
DOI : 10.1145/1281100.1281133

N. Duffield and M. Grossglauser, Trajectory sampling for direct traffic observation, IEEE transaction of Networking, pp.280-292, 2001.
DOI : 10.1109/90.929851
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.73

N. Duffield, C. Lund, and M. Thorup, Estimating flow distribution from sampled flow statistics, Proc. ACM SIGCOMM, 2003.
DOI : 10.1145/863989.863992

N. G. Duffield, C. Lund, and M. Thorup, Flow sampling under hard resource constraints, Sigmetrics, 2004.
DOI : 10.1145/1005686.1005699
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.4370

C. Estan and G. Varghese, New directions in traffic measurement and accounting, Proc. ACM SIGCOMM, 2002.
DOI : 10.1145/964725.633056
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.7103

L. Feinstein, D. Schnackenberg, R. Balupari, and D. Kindred, Statistical approaches to DDoS attack detection and response, Proceedings DARPA Information Survivability Conference and Exposition, 2003.
DOI : 10.1109/DISCEX.2003.1194894
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.4506

A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford et al., Deriving traffic demands for operational IP networks: Methodology and experience, IEEE transaction on Networking, 2001.
DOI : 10.1109/90.929850
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.957

A. Gunnar, M. Johansson, and T. Telkamp, Traffic matrix estimation on a large ip backbone? a comparison on real data, USENIX/ACM SIGCOMM IMC, 2004.
DOI : 10.1145/1028788.1028807

P. Indyk, Stable distributions, pseudorandom generators, embeddings, and data stream computation, Journal of the ACM, vol.53, issue.3, pp.307-323, 2006.
DOI : 10.1145/1147954.1147955
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.698

B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen, Sketch-based change detection, Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement , IMC '03, 2003.
DOI : 10.1145/948205.948236

A. Kumar, M. Sung, J. Xu, and E. Zegura, Data streaming algorithms for efficient and accurate estimation of flow size distribution, Proc. ACM SIGMETRICS, 2005.

A. Kumar and J. Xu, Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006.
DOI : 10.1109/INFOCOM.2006.326

A. Lakhina, M. Crovella, and C. Diot, Mining anomalies using traffic feature distributions, SIGCOMM, 2005.
DOI : 10.1145/1080091.1080118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4156

P. Li, Improving compressed counting, UAI, 2009.
DOI : 10.1137/1.9781611973068.46

P. Li and K. W. Church, Using sketches to estimate associations, Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing , HLT '05, 2005.
DOI : 10.3115/1220575.1220664
URL : http://acl.ldc.upenn.edu/H/H05/H05-1089.pdf

P. Li, K. W. Church, and T. Hastie, Conditional random sampling: A sketch-based sampling technique for sparse data, NIPS, 2006.

P. Li, K. W. Church, and T. Hastie, One sketch for all: Theory and application of conditional random sampling, NIPS, 2008.

P. Li and C. Zhang, A new algorithm for compressed counting with applications in shannon entropy estimation in dynamic data, COLT, 2011.

A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, Traffic matrix estimation:existing techniques and new directions, SIGCOMM, 2002.

A. Nucci, R. Cruz, N. Taft, and C. Diot, Design of IGP link weight changes for estimation of traffic matrices, IEEE INFOCOM 2004, 2004.
DOI : 10.1109/INFCOM.2004.1354656

K. Papagiannaki, N. Taft, and A. Lakhina, A distributed approach to measure IP traffic matrices, Proceedings of the 4th ACM SIGCOMM conference on Internet measurement , IMC '04, 2004.
DOI : 10.1145/1028788.1028808
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.6321

M. V. Ramakrishna, E. Fu, and E. Bahcekapili, Efficient hardware hashing functions for high performance computers, IEEE Transactions on Computers, vol.46, issue.12, pp.1378-1381, 1997.
DOI : 10.1109/12.641938
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.464.3127

V. Sekar, M. K. Reiter, W. Willinger, H. Zhang, R. R. Kompella et al., csamp: A system for network-wide flow monitoring, NSDI, 2008.

Y. Vardi, Internet tomography: estimating source-destination traffic intensities from link data, Journal of American Statistics Association, pp.365-377, 1996.
DOI : 10.2307/2291416

A. Wagner and B. Plattner, Entropy Based Worm and Anomaly Detection in Fast IP Networks, 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (WETICE'05), 2005.
DOI : 10.1109/WETICE.2005.35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.247

K. Xu, Z. Zhang, and S. Bhattacharya, Profiling internet backbone traffic: Behavior models and applications, SIGCOMM, 2005.
DOI : 10.1145/1090191.1080112

Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, Fast accurate computation of largescale ip traffic matrices from link loads, Proc. ACM SIGMETRICS, 2003.
DOI : 10.1145/781027.781053
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.6750

Y. Zhang, M. Roughan, C. Lund, and D. Donoho, An information-theoretic approach to traffic matrix estimation, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications , SIGCOMM '03, 2003.
DOI : 10.1145/863955.863990
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.712

H. Zhao, A. Lall, M. Ogihara, O. Spatscheck, J. Wang et al., A data streaming algorithm for estimating entropies of od flows, Proceedings of the 7th ACM SIGCOMM conference on Internet measurement , IMC '07, 2007.
DOI : 10.1145/1298306.1298345

Q. Zhao, A. Kumar, J. Wang, and J. Xu, Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices, SIGMETRICS, 2005.