• Ding R, Yang S, Chen X and Huang Q. BitSense: Universal and Nearly Zero-Error Optimization for Sketch Counters with Compressive Sensing. Proceedings of the ACM SIGCOMM 2023 Conference. (220-238).

    https://doi.org/10.1145/3603269.3604865

  • Zeng Z, Cui L, Qian M, Zhang Z and Wei K. (2023). A survey on sliding window sketch for network measurement. Computer Networks. 10.1016/j.comnet.2023.109696. 226. (109696). Online publication date: 1-May-2023.

    https://linkinghub.elsevier.com/retrieve/pii/S138912862300141X

  • Chen Y and Wang P. Concise Retrieval of Flow Statistics for Software-Defined Networks. IEEE Systems Journal. 10.1109/JSYST.2021.3065306. 16:1. (554-565).

    https://ieeexplore.ieee.org/document/9395143/

  • Shahout R, Friedman R and Adas D. (2021). CELL: Counter Estimation for Per-flow Traffic in Streams and Sliding Windows 2021 IEEE 29th International Conference on Network Protocols (ICNP). 10.1109/ICNP52444.2021.9651924. 978-1-6654-4131-5. (1-12).

    https://ieeexplore.ieee.org/document/9651924/

  • Sateesan A, Vliegen J, Scherrer S, Hsiao H, Perrig A and Mentens N. (2021). Speed Records in Network Flow Measurement on FPGA 2021 31st International Conference on Field-Programmable Logic and Applications (FPL). 10.1109/FPL53798.2021.00043. 978-1-6654-3759-2. (219-224).

    https://ieeexplore.ieee.org/document/9556354/

  • Demianiuk V, Gorinsky S, Nikolenko S and Kogan K. Robust Distributed Monitoring of Traffic Flows. IEEE/ACM Transactions on Networking. 10.1109/TNET.2020.3034890. (1-14).

    https://ieeexplore.ieee.org/document/9260251/

  • Demianiuk V, Gorinsky S, Nikolenko S and Kogan K. (2019). Robust Distributed Monitoring of Traffic Flows 2019 IEEE 27th International Conference on Network Protocols (ICNP). 10.1109/ICNP.2019.8888046. 978-1-7281-2700-2. (1-11).

    https://ieeexplore.ieee.org/document/8888046/

  • Lin H, Lee G and Rocha Á. Speedily, efficient and adaptive streaming algorithms for real-time detection of flooding attacks. Journal of Intelligent & Fuzzy Systems. 10.3233/JIFS-169077. 31:4. (2363-2373).

    https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/JIFS-169077

  • Wellem T, Lai Y, Huang C and Chung W. (2016). A hardware-accelerated infrastructure for flexible sketch-based network traffic monitoring 2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR). 10.1109/HPSR.2016.7525661. 978-1-4799-8950-8. (162-167).

    http://ieeexplore.ieee.org/document/7525661/

  • Einziger G and Friedman R. (2015). A formal analysis of conservative update based approximate counting 2015 International Conference on Computing, Networking and Communications (ICNC). 10.1109/ICCNC.2015.7069350. 978-1-4799-6959-3. (255-259).

    http://ieeexplore.ieee.org/document/7069350/

  • Hu C, Liu B, Zhao H, Chen K, Chen Y, Cheng Y and Wu H. (2014). Discount counting for fast flow statistics on flow size and flow volume. IEEE/ACM Transactions on Networking. 22:3. (970-981). Online publication date: 1-Jun-2014.

    https://doi.org/10.1109/TNET.2013.2270439

  • Wang X, Li X and Loguinov D. (2013). Modeling residual-geometric flow sampling. IEEE/ACM Transactions on Networking. 21:4. (1090-1103). Online publication date: 1-Aug-2013.

    https://doi.org/10.1109/TNET.2012.2231435

  • Li T, Chen S, Luo W, Zhang M and Qiao Y. (2013). Spreader classification based on optimal dynamic bit sharing. IEEE/ACM Transactions on Networking. 21:3. (817-830). Online publication date: 1-Jun-2013.

    https://doi.org/10.1109/TNET.2012.2218255

  • Li T, Chen S and Ling Y. (2012). Per-flow traffic measurement through randomized counter sharing. IEEE/ACM Transactions on Networking. 20:5. (1622-1634). Online publication date: 1-Oct-2012.

    https://doi.org/10.1109/TNET.2012.2192447

  • Hu C, Liu B, Wang S, Tian J, Cheng Y and Chen Y. ANLS: Adaptive Non-Linear Sampling Method for Accurate Flow Size Measurement. IEEE Transactions on Communications. 10.1109/TCOMM.2011.112311.100622. 60:3. (789-798).

    http://ieeexplore.ieee.org/document/6094128/

  • Tsidon E, Hanniel I and Keslassy I. (2012). Estimators also need shared values to grow together IEEE INFOCOM 2012 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2012.6195564. 978-1-4673-0775-8. (1889-1897).

    http://ieeexplore.ieee.org/document/6195564/

  • Hao F, Kodialam M, Lakshman T and Song H. (2012). Fast dynamic multiple-set membership testing using combinatorial bloom filters. IEEE/ACM Transactions on Networking. 20:1. (295-304). Online publication date: 1-Feb-2012.

    https://doi.org/10.1109/TNET.2011.2173351

  • Tarkoma S, Rothenberg C and Lagerspetz E. Theory and Practice of Bloom Filters for Distributed Systems. IEEE Communications Surveys & Tutorials. 10.1109/SURV.2011.031611.00024. 14:1. (131-155).

    http://ieeexplore.ieee.org/document/5751342/

  • Shin S and Yoon M. (2012). Virtual vectors and network traffic analysis. IEEE Network: The Magazine of Global Internetworking. 26:1. (22-26). Online publication date: 1-Jan-2012.

    https://doi.org/10.1109/MNET.2012.6135852

  • Li T and Chen S. (2012). Introduction. Traffic Measurement on the Internet. 10.1007/978-1-4614-4851-8_1. (1-9).

    https://link.springer.com/10.1007/978-1-4614-4851-8_1

  • Tune P and Veitch D. (2011). Fisher Information in Flow Size Distribution Estimation. IEEE Transactions on Information Theory. 57:10. (7011-7035). Online publication date: 1-Oct-2011.

    https://doi.org/10.1109/TIT.2011.2165150

  • Hua N, Xu J, Lin B and Zhao H. (2011). BRICK. IEEE/ACM Transactions on Networking. 19:3. (670-682). Online publication date: 1-Jun-2011.

    https://doi.org/10.1109/TNET.2011.2111461

  • Wang X, Li X and Loguinov D. (2011). Modeling residual-geometric flow sampling IEEE INFOCOM 2011 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2011.5934980. 978-1-4244-9919-9. (1808-1816).

    http://ieeexplore.ieee.org/document/5934980/

  • Li T, Chen S and Ling Y. (2011). Fast and compact per-flow traffic measurement through randomized counter sharing IEEE INFOCOM 2011 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2011.5934979. 978-1-4244-9919-9. (1799-1807).

    http://ieeexplore.ieee.org/document/5934979/

  • Jose L, Yu M and Rexford J. Online measurement of large traffic aggregates on commodity switches. Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services. (13-13).

    /doi/10.5555/1972422.1972439

  • Mochizuki B, Kiyak F, Keller E and Caesar M. (2011). Better by a HAIR. Computer Networks: The International Journal of Computer and Telecommunications Networking. 55:4. (999-1010). Online publication date: 1-Mar-2011.

    https://doi.org/10.1016/j.comnet.2010.12.013

  • Sekar V, Reiter M and Zhang H. Revisiting the case for a minimalist approach for network flow monitoring. Proceedings of the 10th ACM SIGCOMM conference on Internet measurement. (328-341).

    https://doi.org/10.1145/1879141.1879186

  • Mai J, Sridharan A, Zang H and Chuah C. (2010). Fast Filtered Sampling. Computer Networks: The International Journal of Computer and Telecommunications Networking. 54:11. (1885-1898). Online publication date: 1-Aug-2010.

    https://doi.org/10.1016/j.comnet.2010.01.015

  • Hu C, Liu B, Zhao H, Chen K, Chen Y, Wu C and Cheng Y. DISCO. Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems. (665-674).

    https://doi.org/10.1109/ICDCS.2010.57

  • Better by a HAIR. Proceedings of the 2009 17th IEEE International Conference on Network Protocols. ICNP 2009.

    https://doi.org/10.1109/ICNP.2009.5339694

  • Chandar V, Shah D and Wornell G. (2009). A locally encodable and decodable compressed data structure 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton). 10.1109/ALLERTON.2009.5394919. 978-1-4244-5870-7. (613-619).

    http://ieeexplore.ieee.org/document/5394919/

  • Hu C and Liu B. Self-Tuning the Parameter of Adaptive Non-linear Sampling Method for Flow Statistics. Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 01. (16-21).

    https://doi.org/10.1109/CSE.2009.19

  • Yi K, Li F, Cormode G, Hadjieleftheriou M, Kollios G and Srivastava D. (2009). Small synopses for group-by query verification on outsourced data streams. ACM Transactions on Database Systems. 34:3. (1-42). Online publication date: 1-Aug-2009.

    https://doi.org/10.1145/1567274.1567277

  • Lall A, Ogihara M and Xu J. (2009). An Efficient Algorithm for Measuring Medium- to Large-Sized Flows in Network Traffic 2009 Proceedings IEEE INFOCOM. 10.1109/INFCOM.2009.5062217. 978-1-4244-3512-8. (2711-2715).

    http://ieeexplore.ieee.org/document/5062217/

  • Hao F, Kodialam M, Lakshman T and Song H. (2009). Fast Multiset Membership Testing Using Combinatorial Bloom Filters 2009 Proceedings IEEE INFOCOM. 10.1109/INFCOM.2009.5061957. 978-1-4244-3512-8. (513-521).

    http://ieeexplore.ieee.org/document/5061957/

  • Hua N, Lin B, Xu J and Zhao H. BRICK. Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. (89-98).

    https://doi.org/10.1145/1477942.1477956

  • Lin B and Xu J. (2008). DRAM is plenty fast for wirespeed statistics counting. ACM SIGMETRICS Performance Evaluation Review. 36:2. (45-51). Online publication date: 31-Aug-2008.

    https://doi.org/10.1145/1453175.1453183

  • Sekar V, Reiter M, Willinger W, Zhang H, Kompella R and Andersen D. CSAMP. Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation. (233-246).

    /doi/10.5555/1387589.1387606

  • Cvetkovski A. (2007). An algorithm for approximate counting using limited memory resources. ACM SIGMETRICS Performance Evaluation Review. 35:1. (181-190). Online publication date: 12-Jun-2007.

    https://doi.org/10.1145/1269899.1254903

  • Cvetkovski A. An algorithm for approximate counting using limited memory resources. Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. (181-190).

    https://doi.org/10.1145/1254882.1254903

  • Stanojevic R. Small Active Counters. Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. (2153-2161).

    https://doi.org/10.1109/INFCOM.2007.249

  • Zhao Q, Xu J and Liu Z. (2006). Design of a novel statistics counter architecture with optimal space and time efficiency. ACM SIGMETRICS Performance Evaluation Review. 34:1. (323-334). Online publication date: 26-Jun-2006.

    https://doi.org/10.1145/1140103.1140314

  • Ma C, Chen S, Zhang Y, Xiao Q and Odegbile O. Super Spreader Identification Using Geometric-Min Filter. IEEE/ACM Transactions on Networking. 10.1109/TNET.2021.3108033. 30:1. (299-312).

    https://ieeexplore.ieee.org/document/9525819/

  • Pandey R and Sahu A. Performance and Area Trade-Off of 3D-Stacked DRAM Based Chip Multiprocessor with Hybrid Interconnect. IEEE Transactions on Emerging Topics in Computing. 10.1109/TETC.2019.2946887. 9:4. (1945-1959).

    https://ieeexplore.ieee.org/document/8865144/

  • Scherrer S, Wu C, Chiang Y, Rothenberger B, Asoni D, Sateesan A, Vliegen J, Mentens N, Hsiao H and Perrig A. (2021). Low-Rate Overuse Flow Tracer (LOFT): An Efficient and Scalable Algorithm for Detecting Overuse Flows 2021 40th International Symposium on Reliable Distributed Systems (SRDS). 10.1109/SRDS53918.2021.00034. 978-1-6654-3819-3. (265-276).

    https://ieeexplore.ieee.org/document/9603501/

  • Huang H, Sun Y, Ma C, Chen S, Zhou Y, Yang W, Tang S, Xu H and Qiao Y. An Efficient K-Persistent Spread Estimator for Traffic Measurement in High-Speed Networks. IEEE/ACM Transactions on Networking. 10.1109/TNET.2020.2982003. (1-14).

    https://ieeexplore.ieee.org/document/9099387/

  • Bonelli N, Callegari C and Procissi G. A Probabilistic Counting Framework for Distributed Measurements. IEEE Access. 10.1109/ACCESS.2019.2899161. 7. (22644-22659).

    https://ieeexplore.ieee.org/document/8641276/

  • Peng Z, Li H and Hu C. DIAL: Distributed Elephant Flow Counting on SDN. 2018 IEEE Global Communications Conference (GLOBECOM). (1-6).

    https://doi.org/10.1109/GLOCOM.2018.8647402

  • Peng G, Xue G and Chen Y. (2018). Network Measurement and Performance Analysis at Server Side. Future Internet. 10.3390/fi10070067. 10:7. (67).

    https://www.mdpi.com/1999-5903/10/7/67

  • Huang H, Sun Y, Chen S, Tang S, Han K, Yuan J and Yang W. You Can Drop but You Can&#x0027;t Hide: <tex>$K$</tex>-persistent Spread Estimation in High-speed Networks. IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. (1889-1897).

    https://doi.org/10.1109/INFOCOM.2018.8485998

  • Zhou Y, Zhou Y, Chen S and Zhang Y. Highly Compact Virtual Active Counters for Per-flow Traffic Measurement. IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. (1-9).

    https://doi.org/10.1109/INFOCOM.2018.8485804

  • Demianiuk V, Gorinsky S, Nikolenko S and Kogan K. (2018). Distributed Counting Along Lossy Paths Without Feedback. Structural Information and Communication Complexity. 10.1007/978-3-030-01325-7_5. (30-33).

    http://link.springer.com/10.1007/978-3-030-01325-7_5

  • Yang S, Lin B and Xu J. (2017). Safe Randomized Load-Balanced Switching By Diffusing Extra Loads. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 1:2. (1-37). Online publication date: 19-Dec-2017.

    https://doi.org/10.1145/3154487

  • Zhou Y, Zhou Y, Chen S and Youlin Zhang . (2017). Per-flow counting for big network data stream over sliding windows 2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS). 10.1109/IWQoS.2017.7969118. 978-1-5386-2704-4. (1-10).

    http://ieeexplore.ieee.org/document/7969118/

  • Chen M, Chen S and Cai Z. (2017). Counter Tree. IEEE/ACM Transactions on Networking. 25:2. (1249-1262). Online publication date: 1-Apr-2017.

    https://doi.org/10.1109/TNET.2016.2621159

  • Zhao T, Li T, Han B, Sun Z and Huang J. (2016). Design and implementation of Software Defined Hardware Counters for SDN. Computer Networks: The International Journal of Computer and Telecommunications Networking. 102:C. (129-144). Online publication date: 19-Jun-2016.

    https://doi.org/10.1016/j.comnet.2016.03.004

  • Li B, Ramamoorthy A and Srikant R. (2016). Mean-field-analysis of coding versus replication in cloud storage systems IEEE INFOCOM 2016 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2016.7524626. 978-1-4673-9953-1. (1-9).

    http://ieeexplore.ieee.org/document/7524626/

  • Li Y, Wu H, Pan T, Dai H, Lu J and Liu B. (2016). CASE: Cache-assisted stretchable estimator for high speed per-flow measurement IEEE INFOCOM 2016 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2016.7524608. 978-1-4673-9953-1. (1-9).

    http://ieeexplore.ieee.org/document/7524608/

  • Li Y, Wang H and Sun K. (2016). A study of personal information in human-chosen passwords and its security implications IEEE INFOCOM 2016 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2016.7524583. 978-1-4673-9953-1. (1-9).

    http://ieeexplore.ieee.org/document/7524583/

  • Chen M and Chen S. (2015). Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement 2015 IEEE 23rd International Conference on Network Protocols (ICNP). 10.1109/ICNP.2015.15. 978-1-4673-8295-3. (111-122).

    http://ieeexplore.ieee.org/document/7437121/

  • Zhao T, Li T, Han B, Sun Z and Huang J. (2014). Design of Software Defined hardware counters for SDN 2014 IEEE 20th International Workshop on Local & Metropolitan Area Networks (LANMAN). 10.1109/LANMAN.2014.7028635. 978-1-4799-4894-9. (1-6).

    http://ieeexplore.ieee.org/document/7028635/

  • Wang H, Lin B and Xu J. (2013). Robust Statistics Counter Arrays with Interleaved Memories. IEEE Transactions on Parallel and Distributed Systems. 24:9. (1894-1907). Online publication date: 1-Sep-2013.

    https://doi.org/10.1109/TPDS.2012.287

  • Wang X, Li X and Loguinov D. (2013). Modeling residual-geometric flow sampling. IEEE/ACM Transactions on Networking. 21:4. (1090-1103). Online publication date: 1-Aug-2013.

    https://doi.org/10.1109/TNET.2012.2231435

  • Li T, Chen S, Luo W, Zhang M and Qiao Y. (2013). Spreader classification based on optimal dynamic bit sharing. IEEE/ACM Transactions on Networking. 21:3. (817-830). Online publication date: 1-Jun-2013.

    https://doi.org/10.1109/TNET.2012.2218255

  • Li T, Chen S and Ling Y. (2012). Per-flow traffic measurement through randomized counter sharing. IEEE/ACM Transactions on Networking. 20:5. (1622-1634). Online publication date: 1-Oct-2012.

    https://doi.org/10.1109/TNET.2012.2192447

  • Wang H, Zhao H, Lin B and Xu J. (2012). Robust Pipelined Memory System with Worst Case Performance Guarantee for Network Processing. IEEE Transactions on Computers. 61:10. (1386-1400). Online publication date: 1-Oct-2012.

    https://doi.org/10.1109/TC.2011.171

  • Wang H, Zhao H, Lin B and Xu J. (2012). DRAM-based statistics counter array architecture with performance guarantee. IEEE/ACM Transactions on Networking. 20:4. (1040-1053). Online publication date: 1-Aug-2012.

    https://doi.org/10.1109/TNET.2011.2171360

  • Ren W, Li R and Li M. (2012). The applicability of traditional sampling techniques in the measurement of LAN availability 2012 International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering (QR2MSE). 10.1109/ICQR2MSE.2012.6246192. 978-1-4673-0788-8. (83-88).

    http://ieeexplore.ieee.org/document/6246192/

  • Hao F, Kodialam M, Lakshman T and Song H. (2012). Fast dynamic multiple-set membership testing using combinatorial bloom filters. IEEE/ACM Transactions on Networking. 20:1. (295-304). Online publication date: 1-Feb-2012.

    https://doi.org/10.1109/TNET.2011.2173351

  • Li T and Chen S. (2012). Introduction. Traffic Measurement on the Internet. 10.1007/978-1-4614-4851-8_1. (1-9).

    https://link.springer.com/10.1007/978-1-4614-4851-8_1

  • Lieven P and Scheuermann B. High-speed per-flow traffic measurement with probabilistic multiplicity counting. Proceedings of the 29th conference on Information communications. (1253-1261).

    /doi/10.5555/1833515.1833701

  • Lieven P and Scheuermann B. (2010). High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting IEEE INFOCOM 2010 - IEEE Conference on Computer Communications. 10.1109/INFCOM.2010.5461921. 978-1-4244-5836-3. (1-9).

    http://ieeexplore.ieee.org/document/5461921/

  • Zhao H, Wang H, Lin B and Xu J. Design and performance analysis of a DRAM-based statistics counter array architecture. Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. (84-93).

    https://doi.org/10.1145/1882486.1882512

  • Lu Y, Montanari A, Prabhakar B, Dharmapurikar S and Kabbani A. (2008). Counter braids. ACM SIGMETRICS Performance Evaluation Review. 36:1. (121-132). Online publication date: 12-Jun-2008.

    https://doi.org/10.1145/1384529.1375472

  • Lu Y, Montanari A, Prabhakar B, Dharmapurikar S and Kabbani A. Counter braids. Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems. (121-132).

    https://doi.org/10.1145/1375457.1375472