default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZaoxing Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Matthew Nance Hall, Zaoxing Liu, Vyas Sekar, Ramakrishnan Durairajan:
Analyzing the Benefits of Optical Topology Programming for Mitigating Link-Flood DDoS Attacks. IEEE Trans. Dependable Secur. Comput. 22(1): 146-163 (2025)- 2024
- [c35]Zeying Zhu, Yibo Zhao, Zaoxing Liu:
In-Memory Key-Value Store Live Migration with NetMigrate. FAST 2024: 209-224 - [c34]Qilong Shi
, Chengjun Jia, Wenjun Li, Zaoxing Liu, Tong Yang, Jianan Ji, Gaogang Xie, Weizhe Zhang, Minlan Yu:
BitMatcher: Bit-level Counter Adjustment for Sketches. ICDE 2024: 4815-4827 - [c33]Milind Srivastava, Shao-Tse Hung, Hun Namkung, Kate Ching-Ju Lin, Zaoxing Liu, Vyas Sekar:
Raising the Level of Abstraction for Sketch-Based Network Telemetry with SketchPlan. IMC 2024: 651-658 - [c32]Zhuo Cheng, Maria Apostolaki, Zaoxing Liu, Vyas Sekar:
TrustSketch: Trustworthy Sketch-based Telemetry on Cloud Hosts. NDSS 2024 - [c31]Yinda Zhang, Peiqing Chen, Zaoxing Liu:
OctoSketch: Enabling Real-Time, Continuous Network Monitoring over Multiple Cores. NSDI 2024 - [i10]Hao Kang, Qingru Zhang, Souvik Kundu, Geonhwa Jeong, Zaoxing Liu, Tushar Krishna, Tuo Zhao:
GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM. CoRR abs/2403.05527 (2024) - 2023
- [j7]Fuheng Zhao, Punnal Ismail Khan, Divyakant Agrawal, Amr El Abbadi, Arpit Gupta, Zaoxing Liu:
Panakos: Chasing the Tails for Multidimensional Data Streams. Proc. VLDB Endow. 16(6): 1291-1304 (2023) - [j6]Alexander Braverman, Zaoxing Liu:
Toward Fast Query Serving in Key-Value Store Migration with Approximate Telemetry. SIGMETRICS Perform. Evaluation Rev. 51(2): 91-93 (2023) - [j5]Ruijie Miao, Yinda Zhang, Zihao Zheng, Ruixin Wang, Ruwen Zhang, Tong Yang, Zaoxing Liu, Junchen Jiang:
CocoSketch: High-Performance Sketch-Based Measurement Over Arbitrary Partial Key Query. IEEE/ACM Trans. Netw. 31(6): 2653-2668 (2023) - [c30]Yajie Zhou, Nengneng Yu, Zaoxing Liu:
Towards Interactive Research Agents for Internet Incident Investigation. HotNets 2023: 33-40 - [c29]Yajie Zhou, Jason Li, Gianluca Stringhini, Ayse K. Coskun, Zaoxing Liu:
Enabling Privacy-preserving Multidimensional Network Telemetry with Autoencoders. IC2E 2023: 228-229 - [c28]Zeying Zhu, Kan Wu, Zaoxing Liu:
Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling. NSDI 2023: 1013-1030 - [c27]Hun Namkung, Zaoxing Liu, Daehyeok Kim, Vyas Sekar, Peter Steenkiste:
Sketchovsky: Enabling Ensembles of Sketches on Programmable Switches. NSDI 2023: 1273-1292 - [c26]Qiao Xiang, Chenyang Huang, Ridi Wen, Yuxin Wang, Xiwen Fan, Zaoxing Liu, Linghe Kong, Dennis Duan, Franck Le, Wei Sun:
Beyond a Centralized Verifier: Scaling Data Plane Checking via Distributed, On-Device Verification. SIGCOMM 2023: 152-166 - [c25]Qiang Su, Shaofeng Wu, Zhixiong Niu, Ran Shu, Peng Cheng, Yongqiang Xiong, Chun Jason Xue, Zaoxing Liu, Hong Xu:
Poster: Meili: Towards SmartNIC as a Service. SIGCOMM 2023: 1114-1116 - [i9]Shir Landau Feibish, Zaoxing Liu, Jennifer Rexford:
Compact Data Structures for Network Telemetry. CoRR abs/2311.02636 (2023) - [i8]Qiang Su, Shaofeng Wu, Zhixiong Niu, Ran Shu, Peng Cheng, Yongqiang Xiong, Chun Jason Xue, Zaoxing Liu, Hong Xu:
Meili: Enabling SmartNIC as a Service in the Cloud. CoRR abs/2312.11871 (2023) - 2022
- [j4]Antonis Manousis, Zhuo Cheng, Ran Ben Basat, Zaoxing Liu, Vyas Sekar:
Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams. Proc. VLDB Endow. 15(11): 3249-3262 (2022) - [c24]Anup Agarwal, Zaoxing Liu, Srinivasan Seshan:
HeteroSketch: Coordinating Network-wide Monitoring in Heterogeneous and Dynamic Networks. NSDI 2022: 719-741 - [c23]Hun Namkung, Zaoxing Liu, Daehyeok Kim, Vyas Sekar, Peter Steenkiste:
SketchLib: Enabling Efficient Sketch-based Monitoring on Programmable Switches. NSDI 2022: 743-759 - [c22]Shir Landau Feibish, Zaoxing Liu, Nikita Ivkin, Xiaoqi Chen, Vladimir Braverman, Jennifer Rexford:
Flow-level loss detection with Δ-sketches. SOSR 2022: 25-32 - [e1]Diogo Barradas, Zaoxing Liu, Georgiana Caltais:
FFSPIN '22: Proceedings of the ACM SIGCOMM Workshop on Formal Foundations and Security of Programmable Network Infrastructures, Amsterdam, The Netherlands, August 22, 2022. ACM 2022, ISBN 978-1-4503-9329-4 [contents] - [i7]Antonis Manousis, Zhuo Cheng, Ran Ben Basat, Zaoxing Liu, Vyas Sekar:
Enabling Efficient and General Subpopulation Analytics in Multidimensional Data Streams. CoRR abs/2208.04927 (2022) - 2021
- [c21]Peiqing Chen, Yuhan Wu, Tong Yang, Junchen Jiang, Zaoxing Liu:
Precise error estimation for sketch-based flow measurement. Internet Measurement Conference 2021: 113-121 - [c20]Renju Liu, Luis Garcia, Zaoxing Liu, Botong Ou, Mani B. Srivastava:
SecDeep: Secure and Performant On-device Deep Learning Inference Framework for Mobile and IoT Devices. IoTDI 2021: 67-79 - [c19]Zaoxing Liu, Hun Namkung, Anup Agarwal, Antonis Manousis, Peter Steenkiste, Srinivasan Seshan, Vyas Sekar:
Sketchy With a Chance of Adoption: Can Sketch-Based Telemetry Be Ready for Prime Time? NetSoft 2021: 9-16 - [c18]Yinda Zhang, Zaoxing Liu, Ruixin Wang, Tong Yang, Jizhou Li, Ruijie Miao, Peng Liu, Ruwen Zhang, Junchen Jiang:
CocoSketch: high-performance sketch-based measurement over arbitrary partial key query. SIGCOMM 2021: 207-222 - [c17]Hun Namkung, Daehyeok Kim, Zaoxing Liu, Vyas Sekar, Peter Steenkiste:
Telemetry Retrieval Inaccuracy in Programmable Switches: Analysis and Recommendations. SOSR 2021: 176-182 - [c16]Zaoxing Liu, Hun Namkung, Georgios Nikolaidis, Jeongkeun Lee, Changhoon Kim, Xin Jin, Vladimir Braverman, Minlan Yu, Vyas Sekar:
Jaqen: A High-Performance Switch-Native Approach for Detecting and Mitigating Volumetric DDoS Attacks with Programmable Switches. USENIX Security Symposium 2021: 3829-3846 - 2020
- [c15]Zaoxing Liu, Samson Zhou, Ori Rottenstreich, Vladimir Braverman, Jennifer Rexford:
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms. APOCS 2020: 31-44 - [c14]Valerio Bruschi, Ran Ben Basat, Zaoxing Liu, Gianni Antichi, Giuseppe Bianchi, Michael Mitzenmacher:
DISCOvering the heavy hitters with disaggregated sketches. CoNEXT 2020: 536-537 - [c13]Mingran Yang, Junbo Zhang, Akshay Gadre, Zaoxing Liu, Swarun Kumar, Vyas Sekar:
Joltik: enabling energy-efficient "future-proof" analytics on low-power wide-area networks. MobiCom 2020: 47:1-47:14 - [c12]Daehyeok Kim, Zaoxing Liu, Yibo Zhu, Changhoon Kim, Jeongkeun Lee, Vyas Sekar, Srinivasan Seshan:
TEA: Enabling State-Intensive Network Functions on Programmable Switches. SIGCOMM 2020: 90-106 - [c11]Nikita Ivkin, Ran Ben Basat, Zaoxing Liu, Gil Einziger, Roy Friedman, Vladimir Braverman:
I Know What You Did Last Summer: Network Monitoring using Interval Queries. SIGMETRICS (Abstracts) 2020: 61-62 - [i6]Daehyeok Kim, Ankush Jain, Zaoxing Liu, George Amvrosiadis, Damian Hazen, Bradley W. Settlemyer, Vyas Sekar:
Unleashing In-network Computing on Scientific Workloads. CoRR abs/2009.02457 (2020) - [i5]Zaoxing Liu, Hun Namkung, Anup Agarwal, Antonis Manousis, Peter Steenkiste, Srinivasan Seshan, Vyas Sekar:
Sketchy With a Chance of Adoption: Can Sketch-Based Telemetry Be Ready for Prime Time? CoRR abs/2012.06001 (2020)
2010 – 2019
- 2019
- [j3]Nikita Ivkin, Ran Ben Basat, Zaoxing Liu, Gil Einziger, Roy Friedman, Vladimir Braverman:
I Know What You Did Last Summer: Network Monitoring using Interval Queries. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 61:1-61:28 (2019) - [c10]Zaoxing Liu, Zhihao Bai, Zhenming Liu, Xiaozhou Li, Changhoon Kim, Vladimir Braverman, Xin Jin, Ion Stoica:
DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching. FAST 2019: 143-157 - [c9]Nikita Ivkin, Ran Ben Basat, Zaoxing Liu, Gil Einziger, Roy Friedman, Vladimir Braverman:
Attack Time Localization using Interval Queries. SIGCOMM Posters and Demos 2019: 85-87 - [c8]Zaoxing Liu, Ran Ben-Basat, Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, Vyas Sekar:
Nitrosketch: robust and general sketch-based monitoring in software switches. SIGCOMM 2019: 334-350 - [c7]Zaoxing Liu, Zhihao Bai, Zhenming Liu, Xiaozhou Li, Changhoon Kim, Vladimir Braverman, Xin Jin, Ion Stoica:
DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching. USENIX ATC 2019 - [i4]Zaoxing Liu, Zhihao Bai, Zhenming Liu, Xiaozhou Li, Changhoon Kim, Vladimir Braverman, Xin Jin, Ion Stoica:
DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching. CoRR abs/1901.08200 (2019) - [i3]Tian Li, Zaoxing Liu, Vyas Sekar, Virginia Smith:
Privacy for Free: Communication-Efficient Learning with Differential Privacy Using Sketches. CoRR abs/1911.00972 (2019) - [i2]Zaoxing Liu, Tian Li, Virginia Smith, Vyas Sekar:
Enhancing the Privacy of Federated Learning with Sketching. CoRR abs/1911.01812 (2019) - [i1]Zaoxing Liu, Samson Zhou, Ori Rottenstreich, Vladimir Braverman, Jennifer Rexford:
Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms. CoRR abs/1911.06951 (2019) - 2018
- [j2]Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang:
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. Algorithmica 80(2): 652-667 (2018) - [j1]Nikita Ivkin, Zaoxing Liu, Lin F. Yang, S. S. Kumar, Gerard Lemson, Mark Neyrinck, Alexander S. Szalay, Vladimir Braverman, Tamas Budavari:
Scalable streaming tools for analyzing N-body simulations: Finding halos and investigating excursion sets in one pass. Astron. Comput. 23: 166-179 (2018) - [c6]Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, Ion Stoica:
Towards Fast and Scalable Graph Pattern Mining. HotCloud 2018 - [c5]Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, Ion Stoica:
ASAP: Fast, Approximate Graph Pattern Mining at Scale. OSDI 2018: 745-761 - 2016
- [c4]Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, Vladimir Braverman:
One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon. SIGCOMM 2016: 101-114 - 2015
- [c3]Zaoxing Liu, Nikita Ivkin, Lin Yang, Mark Neyrinck, Gerard Lemson, Alexander S. Szalay, Vladimir Braverman, Tamas Budavari, Randal C. Burns, Xin Wang:
Streaming Algorithms for Halo Finders. e-Science 2015: 342-351 - [c2]Zaoxing Liu, Gregory Vorsanger, Vladimir Braverman, Vyas Sekar:
Enabling a "RISC" Approach for Software-Defined Monitoring using Universal Streaming. HotNets 2015: 21:1-21:7 - [c1]Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang:
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. MFCS (2) 2015: 151-162
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-14 01:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
