The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Deriving traffic demands for operational IP networks: methodology and experience
Abstract
Engineering a large IP backbone network without an accurate network-wide view of the traffic demands is challenging. Shifts in user behavior, changes in routing policies, and failures of network elements can result in significant (and sudden) fluctuations in load. We present a model of traffic demands to support traffic engineering and performance debugging of large Internet service provider networks. By defining a traffic demand as a volume of load originating from an ingress link and destined to a set of egress links, we can capture and predict how routing affects the traffic traveling between domains. To infer the traffic demands, we propose a measurement methodology that combines flow-level measurements collected at all ingress links with reachability information about all egress links. We discuss how to cope with situations where practical considerations limit the amount and quality of the necessary data. Specifically, we show how to infer interdomain traffic demands using measurements collected at a smaller number of edge links-the peering links connecting to neighboring providers. We report on our experiences in deriving the traffic demands in the AT&T IP Backbone, by collecting, validating, and joining very large and diverse sets of usage, configuration, and routing data over extended periods of time. The paper concludes with a preliminary analysis of the observed dynamics of the traffic demands and a discussion of the practical implications for traffic engineering.
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
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Ferguson, P., & Senie, D. (2000) · doi:10.17487/rfc2827 · Cited by 1,313
Internet traffic engineering by optimizing OSPF weights
Fortz, B., & Thorup, M. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832225 · Cited by 1,110
Wide-area Internet traffic patterns and characteristics
Thompson, K., Miller, G. J., & Wilder, R. (1997) · IEEE Network · doi:10.1109/65.642356 · Cited by 1,074
Ferguson, P., & Senie, D. (1998) · doi:10.17487/rfc2267 · Cited by 381
On network-aware clustering of Web clients
Krishnamurthy, B., & Wang, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347412 · Cited by 370
MPLS and traffic engineering in IP networks
Awduche, D. O. (1999) · IEEE Communications Magazine · doi:10.1109/35.809383 · Cited by 363
Labovitz, C., Malan, G. R., & Jahanian, F. (1998) · IEEE/ACM Transactions on Networking · doi:10.1109/90.731185 · Cited by 359
SNMP, SNMPv2, SNMPv3, and RMON 1 and 2
Stallings, W. (1998) · Medical Entomology and Zoology · Cited by 333
NetScope: traffic engineering for IP networks
Feldmann, A., Greenberg, A., Lund, C., Reingold, N., & Rexford, J. (2000) · IEEE Network · doi:10.1109/65.826367 · Cited by 224
Self-citationExperimental study of Internet stability and backbone failures
Labovitz, C., Ahuja, A., & Jahanian, F. (2003) · Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352) · doi:10.1109/ftcs.1999.781062 · Cited by 218
Resource management with hoses: point-to-cloud services for virtual private networks
Duffield, N. G., Goyal, P., Greenberg, A. G., Mishra, A. B., Ramakrishnan, K. K., & van der Merwe, J. E. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.803918 · Cited by 195
Self-citation
Cited by
Mining anomalies using traffic feature distributions
Lakhina, A., Crovella, M., & Diot, C. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080118 · Cited by 1,054
Diagnosing network-wide traffic anomalies
Lakhina, A., Crovella, M., & Diot, C. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015492 · Cited by 1,039
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
Packet-level traffic measurements from the sprint IP backbone
Fraleigh, C., Moon, S., Lyles, B., Cotton, C., Khan, M., Moll, D., Rockell, R., Seely, T., & Diot, C. (2003) · IEEE Network · doi:10.1109/mnet.2003.1248656 · Cited by 639
Analyzing Peer-To-Peer Traffic Across Large Networks
Sen, S., & Wang, J. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826277 · Cited by 586
Metadata
- Authors
- Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., & True, F.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2001-06
- Volume
- 9
- Issue
- 3
- Pages
- 265-279
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2139054829
- Cited by
- 430
- References
- 13
- FWCI
- 49.06
- Type
- journal article
- Language
- en
- Open access
- closed
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.