Routing Oblivious Measurement Analytics
暂无分享,去创建一个
Minlan Yu | Danny Raz | Ran Ben Basat | Gil Einziger | Xiaoqi Chen | Shir Landau Feibish | Minlan Yu | D. Raz | Xiaoqi Chen | Gil Einziger
[1] Divyakant Agrawal,et al. Efficient Computation of Frequent and Top-k Elements in Data Streams , 2005, ICDT.
[2] Gabriel Maciá-Fernández,et al. Anomaly-based network intrusion detection: Techniques, systems and challenges , 2009, Comput. Secur..
[3] Todd L. Heberlein,et al. Network intrusion detection , 1994, IEEE Network.
[4] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[5] M. Abramowitz,et al. Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .
[6] Walter Willinger,et al. Sonata: query-driven streaming network telemetry , 2018, SIGCOMM.
[7] Mark Handley,et al. TCP Extensions for Multipath Operation with Multiple Addresses , 2011 .
[8] Roy Friedman,et al. Constant Time Updates in Hierarchical Heavy Hitters , 2017, SIGCOMM.
[9] Roy Friedman,et al. Randomized admission policy for efficient top-k and frequency estimation , 2016, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.
[10] Arpit Gupta,et al. Network-Wide Heavy Hitter Detection with Commodity Switches , 2018, SOSR.
[11] Nick G. Duffield,et al. Trajectory sampling for direct traffic observation , 2001, TNET.
[12] Walter Willinger,et al. cSamp: A System for Network-Wide Flow Monitoring , 2008, NSDI.
[13] Gero Dittmann,et al. Network Processor Load Balancing for High-Speed Links , 2000 .
[14] Minlan Yu,et al. Software Defined Traffic Measurement with OpenSketch , 2013, NSDI.
[15] S. Muthukrishnan,et al. Heavy-Hitter Detection Entirely in the Data Plane , 2016, SOSR.
[16] Guangyu Pei,et al. Measurements On Delay And Hop-Count Of The Internet , 1998 .
[17] Kai-Min Chung,et al. Why simple hash functions work: exploiting the entropy in a data stream , 2008, SODA '08.
[18] Xin Jin,et al. SketchVisor: Robust Network Measurement for Software Packet Processing , 2017, SIGCOMM.
[19] Gerard Hooghiemstra,et al. A scaling law for the hopcount in internet , 2000 .
[20] Yehuda Afek,et al. Detecting Heavy Flows in the SDN Match and Action Model , 2017, Comput. Networks.
[21] Hua Chen,et al. Pingmesh: A Large-Scale System for Data Center Network Latency Measurement and Analysis , 2015, SIGCOMM.
[22] Peng Liu,et al. Elastic sketch: adaptive and fast network-wide measurements , 2018, SIGCOMM.
[23] G. Maciá-Fernández,et al. Anomaly-based network intrusion detection: Techniques, systems and challenges , 2009, Comput. Secur..
[24] Alex C. Snoeren,et al. Inside the Social Network's (Datacenter) Network , 2015, Comput. Commun. Rev..
[25] Ben Y. Zhao,et al. Packet-Level Telemetry in Large Datacenter Networks , 2015, SIGCOMM.
[26] Roy Friedman,et al. Stream Frequency Over Interval Queries , 2018, Proc. VLDB Endow..
[27] P. Flajolet,et al. HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm , 2007 .
[28] Ariel Orda,et al. Memento: Making Sliding Windows Efficient for Heavy Hitters , 2018, IEEE/ACM Transactions on Networking.
[29] George Varghese,et al. Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN , 2013, SIGCOMM.
[30] Ori Rottenstreich,et al. Efficient Measurement on Programmable Switches Using Probabilistic Recirculation , 2018, 2018 IEEE 26th International Conference on Network Protocols (ICNP).
[31] Walter Willinger,et al. Sonata: Query-Driven Network Telemetry , 2017, ArXiv.
[32] Kirill Kogan,et al. Robust Distributed Monitoring of Traffic Flows , 2019, 2019 IEEE 27th International Conference on Network Protocols (ICNP).
[33] Gunnar Blom,et al. Problems and Snapshots from the World of Probability , 1993 .
[34] Mark Handley,et al. TCP Extensions for Multipath Operation with Multiple Addresses , 2020, RFC.
[35] Hari Balakrishnan,et al. Fast portscan detection using sequential hypothesis testing , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.
[36] Erik D. Demaine,et al. Frequency Estimation of Internet Packet Streams with Limited Space , 2002, ESA.
[37] Ming Zhang,et al. MicroTE: fine grained traffic engineering for data centers , 2011, CoNEXT '11.
[38] Carsten Lund,et al. Flow sampling under hard resource constraints , 2004, SIGMETRICS '04/Performance '04.
[39] Ramesh Govindan,et al. Trumpet: Timely and Precise Triggers in Data Centers , 2016, SIGCOMM.
[40] Minlan Yu,et al. FlowRadar: A Better NetFlow for Data Centers , 2016, NSDI.
[41] Rong Pan,et al. AF-QCN: Approximate Fairness with Quantized Congestion Notification for Multi-tenanted Data Centers , 2010, 2010 18th IEEE Symposium on High Performance Interconnects.
[42] Ashwin Lall,et al. Global iceberg detection over distributed data streams , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[43] Vladimir Braverman,et al. One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon , 2016, SIGCOMM.
[44] Vyas Sekar,et al. Revisiting the case for a minimalist approach for network flow monitoring , 2010, IMC '10.
[45] Danny Raz,et al. Network-wide routing-oblivious heavy hitters , 2018, ANCS.
[46] Carsten Lund,et al. Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications , 2004, IMC '04.
[47] Qin Zhang,et al. Optimal Tracking of Distributed Heavy Hitters and Quantiles , 2011, Algorithmica.