{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T21:00:16Z","timestamp":1763499616975,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1733794, CNS-2045861, CNS-2107147, CNS-2124184"],"award-info":[{"award-number":["CCF-1733794, CNS-2045861, CNS-2107147, CNS-2124184"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-17- C0047"],"award-info":[{"award-number":["HR0011-17- C0047"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3485371","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:33Z","timestamp":1636805133000},"page":"3415-3430","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Packet Scheduling with Optional Client Privacy"],"prefix":"10.1145","author":[{"given":"Andrew","family":"Beams","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}]},{"given":"Sebastian","family":"Angel","sequence":"additional","affiliation":[{"name":"University of Pennsylvania &amp; Microsoft Research, Philadelphia, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Alexa - top sites. https:\/\/www.alexa.com\/topsites."},{"volume-title":"https:\/\/iperf.fr","year":"2015","key":"e_1_3_2_1_2_1","unstructured":"iperf3. https:\/\/iperf.fr, 2015."},{"volume-title":"https:\/\/github.com\/programmable-scheduling\/pifo-hardware","year":"2015","key":"e_1_3_2_1_3_1","unstructured":"pifo-hardware. https:\/\/github.com\/programmable-scheduling\/pifo-hardware, 2015."},{"key":"e_1_3_2_1_4_1","volume-title":"https:\/\/github.com\/programmable-scheduling\/pifo-machine","author":"Push-In","year":"2016","unstructured":"C+ reference implementation of a pipeline of Push-In First-Out queues. https:\/\/github.com\/programmable-scheduling\/pifo-machine, 2016."},{"volume-title":"Approximating push-in first-out behaviors using strict-priority queues. https:\/\/github.com\/nsg-ethz\/sp-pifo","year":"2020","key":"e_1_3_2_1_5_1","unstructured":"Sp-pifo: Approximating push-in first-out behaviors using strict-priority queues. https:\/\/github.com\/nsg-ethz\/sp-pifo, 2020."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Alcoz A. G.","year":"2020","unstructured":"A. G. Alcoz, A. Dietm\u00fcller, and L. Vanbever. SP-PIFO: Approximating push-in first-out behaviors using strict-priority queues. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), Feb. 2020."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Angel S.","year":"2014","unstructured":"S. Angel, H. Ballani, T. Karagiannis, G. O'Shea, and E. Thereska. End-to-end performance isolation through virtual datacenters. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), Oct. 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00065"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3267323.3268958"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Angel S.","year":"2016","unstructured":"S. Angel and S. Setty. Unobservable communication over fully untrusted infrastructure. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), Nov. 2016."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Ballani H.","year":"2013","unstructured":"H. Ballani, K. Jang, T. Karagiannis, C. Kim, D. Gunawardena, and G. O'Shea. Chatty tenants and the cloud network sharing problem. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2013."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Workshop on Privacy Enhancing Technologies (PET)","author":"Berthold O.","year":"2002","unstructured":"O. Berthold and H. Langos. Dummy traffic against long term intersection attacks. In Proceedings of the Workshop on Privacy Enhancing Technologies (PET), Mar. 2002."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the Workshop on Privacy Enhancing Technologies (PET)","author":"Bissias G. D.","year":"2005","unstructured":"G. D. Bissias, M. Liberatore, D. Jensen, and B. N. Levine. Privacy vulnerabilities in encrypted HTTP streams. In Proceedings of the Workshop on Privacy Enhancing Technologies (PET), 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00066"},{"key":"e_1_3_2_1_17_1","volume-title":"Feb.","author":"Chaum D. L.","year":"1981","unstructured":"D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2), Feb. 1981."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/54235.54239"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813628"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2018.00018"},{"key":"e_1_3_2_1_21_1","volume-title":"North Holland","author":"Cooper R.","year":"1981","unstructured":"R. Cooper. Introduction to Queueing Theory. North Holland, 1981."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866346"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/75246.75248"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.28"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2797953"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2438860"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649569"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.2307\/2333130"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5501972"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2182348"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2406317"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2418194"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055858"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405855"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1962.tb00465.x"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132755"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0008"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787491"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486002"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626326"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180437"},{"key":"e_1_3_2_1_46_1","volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Liu V.","year":"2013","unstructured":"V. Liu, D. Halperin, A. Krishnamurthy, and T. Anderson. F10: A fault-tolerant engineered network. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2013."},{"key":"e_1_3_2_1_47_1","volume-title":"Analyzing weighted round robin policies with a stochastic comparison approach. Computers & Operations Research, 35(8)","author":"Mamoun M. B.","year":"2008","unstructured":"M. B. Mamoun, J.-M. Fourneau, and N. Pekergin. Analyzing weighted round robin policies with a stochastic comparison approach. Computers & Operations Research, 35(8), 2008."},{"key":"e_1_3_2_1_48_1","volume-title":"Pacer: Network side-channel mitigation in the cloud","author":"Mehta A.","year":"2020","unstructured":"A. Mehta, M. Alzayat, R. de Viti, B. B. Brandenburg, P. Druschel, and D. Garg. Pacer: Network side-channel mitigation in the cloud, 2020."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486027"},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the ACM Conference on Computer and Communications Security (CCS)","author":"Ristenpart T.","year":"2009","unstructured":"T. Ristenpart, E. Tromer, H. Shacham, and S. Savage. Hey, you, get off of my cloud:exploring information leakage inthird-party compute clouds. In Proceedings of the ACM Conference on Computer and Communications Security (CCS), 2009."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP763"},{"key":"e_1_3_2_1_53_1","volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Sharma N. K.","year":"2018","unstructured":"N. K. Sharma, M. Liu, K. Atreya, and A. Krishnamurthy. Approximating fair queueing on reconfigurable switches. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2018."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2834050.2834106"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934899"},{"key":"e_1_3_2_1_56_1","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Wolinsky D. I.","year":"2012","unstructured":"D. I. Wolinsky, H. Corrigan-Gibbs, B. Ford, and A. Johnson. Dissent in numbers: Making strong anonymity scale. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), Oct. 2012."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880029"},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of the USENIX Security Symposium","author":"Wu Z.","year":"2012","unstructured":"Z. Wu, Z. Xu, and H. Wang. Whispers in the hyper-space: High-speed covert channel attacks in the cloud. In Proceedings of the USENIX Security Symposium, 2012."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472887"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.31"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event Republic of Korea","acronym":"CCS '21"},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3485371","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3485371","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3485371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:54:29Z","timestamp":1763499269000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3485371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":60,"alternative-id":["10.1145\/3460120.3485371","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3485371","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}