The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Trajectory sampling for direct traffic observation
Open accessAbstract
Traffic measurement is a critical component for the control and engineering of communication networks. We argue that traffic measurement should make it possible to obtain the spatial flow of traffic through the domain, i.e., the paths followed by packets between any ingress and egress point of the domain. Most resource allocation and capacity planning tasks can benefit from such information. Also, traffic measurements should be obtained without a routing model and without knowledge of network state. This allows the traffic measurement process to he resilient to network failures and state uncertainty. We propose a method that allows the direct inference of traffic flows through a domain by observing the trajectories of a subset of all packets traversing the network. The key advantages of the method are that (1) it does not rely on routing state; (2) its implementation cost is small; and (3) the measurement reporting traffic is modest and can be controlled precisely. The key idea of the method is to sample packets based on a hash function computed over the packet content. Using the same hash function will yield the same sample set of packets in the entire domain, and enables us to reconstruct packet trajectories.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
RTP: A Transport Protocol for Real-Time Applications
Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (2003) · doi:10.17487/rfc3550 · Cited by 5,776
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
Knuth, D. E. (1973) · Cumulative Index of Computer Aided Architectural Design · Cited by 1,719
RTP: A Transport Protocol for Real-Time Applications
Audio-Video Transport Working Group, Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (1996) · doi:10.17487/rfc1889 · Cited by 1,297
Sachs, L. (1984) · Springer Series in Statistics · doi:10.1007/978-1-4612-5246-7 · Cited by 973
A Proposal to add Explicit Congestion Notification (ECN) to IP
Ramakrishnan, K., & Floyd, S. (1999) · doi:10.17487/rfc2481 · Cited by 735
Empirically derived analytic models of wide-area TCP connections
Paxson, V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.330413 · Cited by 581
Deriving traffic demands for operational IP networks: methodology and experience
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., & True, F. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929850 · Cited by 430
Cited by
Optimizing OSPF/IS-IS weights in a changing world
Fortz, B., & Thorup, M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.1003042 · Cited by 660
Traffic engineering with traditional IP routing protocols
Fortz, B., Rexford, J., & Thorup, M. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1039866 · Cited by 460
(2014) · doi:10.5555/2616448.2616456 · Cited by 281
PINT: Probabilistic In-band Network Telemetry
Ben Basat, R., Ramanathan, S., Li, Y., Antichi, G., Yu, M., & Mitzenmacher, M. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405894 · Cited by 268
Metadata
- Authors
- Duffield, N. G., & Grossglauser, M.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2001-06
- Volume
- 9
- Issue
- 3
- Pages
- 280-292
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2168169496
- Cited by
- 260
- References
- 21
- FWCI
- 19.73
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Trajectory sampling for direct traffic observation. https://app.cochat.ai/papers/10.1109/90.929851
- The paper
- Duffield, N. G., & Grossglauser, M. (2001). Trajectory sampling for direct traffic observation. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.929851
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.