Zaoxing Liu
Zaoxing Liu
Assistant Professor, Boston University
Verified email at - Homepage
Cited by
Cited by
One sketch to rule them all: Rethinking network flow monitoring with univmon
Z Liu, A Manousis, G Vorsanger, V Sekar, V Braverman
Proceedings of the 2016 ACM SIGCOMM Conference, 101-114, 2016
Nitrosketch: Robust and general sketch-based monitoring in software switches
Z Liu, R Ben-Basat, G Einziger, Y Kassner, V Braverman, R Friedman, ...
Proceedings of the ACM Special Interest Group on Data Communication, 334-350, 2019
Distcache: Provable load balancing for large-scale storage systems with distributed caching
Z Liu, Z Bai, Z Liu, X Li, C Kim, V Braverman, X Jin, I Stoica
17th {USENIX} Conference on File and Storage Technologies ({FAST} 19), 143-157, 2019
{ASAP}: Fast, approximate graph pattern mining at scale
AP Iyer, Z Liu, X Jin, S Venkataraman, V Braverman, I Stoica
13th {USENIX} Symposium on Operating Systems Design and Implementation …, 2018
Tea: Enabling state-intensive network functions on programmable switches
D Kim, Z Liu, Y Zhu, C Kim, J Lee, V Sekar, S Seshan
Proceedings of the Annual conference of the ACM Special Interest Group on …, 2020
Privacy for free: Communication-efficient learning with differential privacy using sketches
T Li, Z Liu, V Sekar, V Smith
arXiv preprint arXiv:1911.00972, 2019
Enabling a" risc" approach for software-defined monitoring using universal streaming
Z Liu, G Vorsanger, V Braverman, V Sekar
Proceedings of the 14th ACM Workshop on Hot Topics in Networks, 1-7, 2015
Streaming algorithms for halo finders
Z Liu, N Ivkin, L Yang, M Neyrinck, G Lemson, A Szalay, V Braverman, ...
2015 IEEE 11th International Conference on e-Science, 342-351, 2015
Memory-efficient performance monitoring on programmable switches with lean algorithms
Z Liu, S Zhou, O Rottenstreich, V Braverman, J Rexford
Symposium on Algorithmic Principles of Computer Systems, 31-44, 2020
Enhancing the privacy of federated learning with sketching
Z Liu, T Li, V Smith, V Sekar
arXiv preprint arXiv:1911.01812, 2019
I know what you did last summer: Network monitoring using interval queries
N Ivkin, RB Basat, Z Liu, G Einziger, R Friedman, V Braverman
Proceedings of the ACM on Measurement and Analysis of Computing Systems 3 (3 …, 2019
New bounds for the CLIQUE-GAP problem using graph decomposition theory
V Braverman, Z Liu, T Singh, NV Vinodchandran, LF Yang
Algorithmica 80 (2), 652-667, 2018
Jaqen: A high-performance switch-native approach for detecting and mitigating volumetric ddos attacks with programmable switches
Z Liu, H Namkung, G Nikolaidis, J Lee, C Kim, X Jin, V Braverman, M Yu, ...
30th {USENIX} Security Symposium ({USENIX} Security 21), 2021
Scalable streaming tools for analyzing n-body simulations: Finding halos and investigating excursion sets in one pass
N Ivkin, Z Liu, LF Yang, SS Kumar, G Lemson, M Neyrinck, AS Szalay, ...
Astronomy and computing 23, 166-179, 2018
Joltik: Enabling Energy-efficient "Future-proof" Analytics on Low-power Wide-area Networks
M Yang
Carnegie Mellon University, 2020
Towards fast and scalable graph pattern mining
AP Iyer, Z Liu, X Jin, S Venkataraman, V Braverman, I Stoica
10th {USENIX} Workshop on Hot Topics in Cloud Computing (HotCloud 18), 2018
CocoSketch: high-performance sketch-based measurement over arbitrary partial key query
Y Zhang, Z Liu, R Wang, T Yang, J Li, R Miao, P Liu, R Zhang, J Jiang
Proceedings of the 2021 ACM SIGCOMM 2021 Conference, 207-222, 2021
DISCOvering the heavy hitters with disaggregated sketches
V Bruschi, RB Basat, Z Liu, G Antichi, G Bianchi, M Mitzenmacher
Proceedings of the 16th International Conference on emerging Networking …, 2020
Unleashing In-network Computing on Scientific Workloads
D Kim, A Jain, Z Liu, G Amvrosiadis, D Hazen, B Settlemyer, V Sekar
arXiv preprint arXiv:2009.02457, 2020
Sketchlib: Enabling efficient sketch-based monitoring on programmable switches
H Namkung, Z Liu, D Kim, V Sekar, P Steenkiste
USENIX Symposium on Networked Systems Design and Implementation (NSDI) 2022, 0
The system can't perform the operation now. Try again later.
Articles 1–20