The DOI matches its Crossref record.
COPE: traffic engineering in dynamic networks
Abstract
Traffic engineering plays a critical role in determining the performance and reliability of a network. A major challenge in traffic engineering is how to cope with dynamic and unpredictable changes in traffic demand. In this paper, we propose COPE, a class of traffic engineering algorithms that optimize for the expected scenarios while providing a worst-case guarantee for unexpected scenarios. Using extensive evaluations based on real topologies and traffic traces, we show that COPE can achieve efficient resource utilization and avoid network congestion in a wide variety of scenarios.
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
Cited by
B4: experience with a globally-deployed software defined wan
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., et al. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486019 · Cited by 1,771
MicroTE: fine grained traffic engineering for data centers
Benson, T., Anand, A., Akella, A., & Zhang, M. (2011) · Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies · doi:10.1145/2079296.2079304 · Cited by 604
Dynamic load balancing without packet reordering
Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1232919.1232925 · Cited by 402
Dynamic scheduling of network updates
Jin, X., Liu, H. H., Gandhi, R., Kandula, S., Mahajan, R., Zhang, M., Rexford, J., & Wattenhofer, R. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626307 · Cited by 329
Inter-data-center network traffic prediction with elephant flows
Li, Y., Liu, H., Yang, W., Hu, D., & Xu, W. (2016) · NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium · doi:10.1109/noms.2016.7502814 · Cited by 34
Metadata
- Authors
- Wang, H., Xie, H., Qiu, L., Yang, Y. R., Zhang, Y., & Greenberg, A.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2006-08-11
- Volume
- 36
- Issue
- 4
- Pages
- 99-110
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2164096531
- Cited by
- 212
- References
- 0
- FWCI
- 22.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: COPE: traffic engineering in dynamic networks. https://app.cochat.ai/papers/10.1145/1151659.1159926
- The paper
- Wang, H., Xie, H., Qiu, L., Yang, Y. R., Zhang, Y., & Greenberg, A. (2006). COPE: traffic engineering in dynamic networks. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/1151659.1159926
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.