The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
PINT: Probabilistic In-band Network Telemetry
Open accessAbstract
Commodity network devices support adding in-band telemetry measurements into data packets, enabling a wide range of applications, including network troubleshooting, congestion control, and path tracing. However, including such information on packets adds significant overhead that impacts both flow completion times and application-level performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
Alizadeh, M., Greenberg, A., Maltz, D. A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., & Sridharan, M. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851192 · Cited by 1,877
Random sampling with a reservoir
Vitter, J. S. (1985) · ACM Transactions on Mathematical Software · doi:10.1145/3147.3165 · Cited by 1,758
Knight, S., Nguyen, H. X., Falkner, N., Bowden, R., & Roughan, M. (2011) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2011.111002 · Cited by 1,739
Practical network support for IP traceback
Savage, S., Wetherall, D., Karlin, A., & Anderson, T. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347560 · Cited by 1,127
Congestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
(2010) · doi:10.5555/1855711.1855728 · Cited by 970
Inside the Social Network's (Datacenter) Network
Roy, A., Zeng, H., Bagga, J., Porter, G., & Snoeren, A. C. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787472 · Cited by 849
Advanced and authenticated marking schemes for IP traceback
Song, D. X., & Perrig, A. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916279 · Cited by 750
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
Software defined traffic measurement with OpenSketch
Yu, M., Jose, L., & Miao, R. (2013) · Networked Systems Design and Implementation · Cited by 727
Self-citationEfficient Computation of Frequent and Top-k Elements in Data Streams
Metwally, A., Agrawal, D., & El Abbadi, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30570-5_27 · Cited by 681
NetCache: Balancing Key-Value Stores with Fast In-Network Caching
Jin, X., Li, X., Zhang, H., Soulé, R., Lee, J., Foster, N., Kim, C., & Stoica, I. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132764 · Cited by 556
Less is more: trading a little bandwidth for ultra-low latency in the data center
Alizadeh, M., Kabbani, A., Edsall, T., Prabhakar, B., Vahdat, A. M., & Yasuda, M. (2012) · Networked Systems Design and Implementation · Cited by 524
FlowRadar: a better NetFlow for data centers
Li, Y., Miao, R., Kim, C., & Yu, M. (2016) · Networked Systems Design and Implementation · Cited by 471
Self-citationPingmesh: A Large-Scale System for Data Center Network Latency Measurement and Analysis
Guo, C., Yuan, L., Xiang, D., Dang, Y., Huang, R., Maltz, D., Liu, Z., Wang, V., Pang, B., Chen, H., et al. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787496 · Cited by 390
Approximate counts and quantiles over sliding windows
Arasu, A., & Manku, G. S. (2004) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1055558.1055598 · Cited by 346
Why flow-completion time is the right metric for congestion control
Dukkipati, N., & McKeown, N. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1111322.1111336 · Cited by 317
(2014) · doi:10.5555/2616448.2616456 · Cited by 281
Approximate medians and other quantiles in one pass and with limited memory
Manku, G. S., Rajagopalan, S., & Lindsay, B. G. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276342 · Cited by 261
Trajectory sampling for direct traffic observation
Duffield, N. G., & Grossglauser, M. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929851 · Cited by 260
Revisiting network support for RDMA
Mittal, R., Shpiner, A., Panda, A., Zahavi, E., Krishnamurthy, A., Ratnasamy, S., & Shenker, S. (2018) · Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3230543.3230557 · Cited by 258
Tail bounds for sums of geometric and exponential variables
Janson, S. (2017) · Statistics & Probability Letters · doi:10.1016/j.spl.2017.11.017 · Cited by 247
Counting large numbers of events in small registers
Morris, R. (1978) · Communications of the ACM · doi:10.1145/359619.359627 · Cited by 238
Reversible sketches for efficient and accurate change detection over network data streams
Schweller, R., Gupta, A., Parsons, E., & Chen, Y. (2004) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1028788.1028814 · Cited by 164
Optimal Quantile Approximation in Streams
Karnin, Z. S., Lang, K., & Liberty, E. (2016) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2016.17 · Cited by 92
Narayana, S., Arashloo, M. T., Rexford, J., & Walker, D. (2016) · Networked Systems Design and Implementation · Cited by 81
Estimating Logarithmic and Exponential Functions to Track Network Traffic Entropy in P4
Ding, D., Savi, M., & Siracusa, D. (2020) · IEEE/IFIP Network Operations and Management Symposium (NOMS) · doi:10.1109/noms47738.2020.9110257 · Cited by 40
Characterizing the impact of network latency on cloud-based applications’ performance
Popescu, D. A., Zilberman, N., & Moore, A. W. (2017) · Apollo (University of Cambridge) · doi:10.17863/cam.17588 · Cited by 38
Cited by
Establishing trust for using natural language for intent-based networking
Jacobs, A. S., Pfitscher, R. J., Ribeiro, R. H., Granville, L. Z., Ferreira, R. A., Willinger, W., & Rao, S. G. (2025) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2025.3574626 · Cited by 5
“However, deciding which traffic, devices, and properties to monitor and which data to collect will require instrumenting networks with an unprecedented level of control that is only possible by leveraging emerging programmable data plane technologies [59], [60].”
Metadata
- Authors
- Ben Basat, R., Ramanathan, S., Li, Y., Antichi, G., Yu, M., & Mitzenmacher, M.
- Venue
- Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication
- Publisher
- ACM
- Published
- 2020-07-30
- Pages
- 662-680
- OpenAlex
- W3046750740
- Cited by
- 268
- References
- 29
- FWCI
- 30.88
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.