The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Better never than late: meeting deadlines in datacenter networks
Abstract
The soft real-time nature of large scale web applications in today's datacenters, combined with their distributed workflow, leads to deadlines being associated with the datacenter application traffic. A network flow is useful, and contributes to application throughput and operator revenue if, and only if, it completes within its deadline. Today's transport pro- tocols (TCP included), given their Internet origins, are agnostic to such flow deadlines. Instead, they strive to share network resources fairly. We show that this can hurt application 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
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
LIU, C. L., & LAYLAND, J. W. (2002) · Readings in Hardware/Software Co-Design · doi:10.1016/b978-155860702-6/50016-8 · Cited by 3,233
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
Dryad: distributed data-parallel programs from sequential building blocks
Isard, M., Budiu, M., Yu, Y., Birrell, A., & Fetterly, D. (2007) · Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 · doi:10.1145/1272996.1273005 · Cited by 2,432
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111
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
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402967 · Cited by 1,679
Dynamo: amazon's highly available key-value store
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., & Vogels, W. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1323293.1294281 · Cited by 1,151
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
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402968 · Cited by 994
SEDA: an architecture for well-conditioned, scalable internet services
Welsh, M., Culler, D., & Brewer, E. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502057 · Cited by 834
Controlled experiments on the web: survey and practical guide
Kohavi, R., Longbotham, R., Sommerfield, D., & Henne, R. M. (2009) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0114-1 · Cited by 690
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402968 · Cited by 563
Safe and effective fine-grained TCP retransmissions for datacenter communication
Vasudevan, V., Phanishayee, A., Shah, H., Krevat, E., Andersen, D. G., Ganger, G. R., Gibson, G. A., & Mueller, B. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592604 · Cited by 427
Finding a needle in Haystack: facebook's photo storage
Beaver, D., Kumar, S., Li, H. C., Sobel, J., & Vajgel, P. (2010) · doi:10.5555/1924943.1924947 · Cited by 419
Symbiotic routing in future data centers
Abu-Libdeh, H., Costa, P., Rowstron, A., O'Shea, G., & Donnelly, A. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851191 · Cited by 227
Real-time communication in packet-switched networks
Aras, C. M., Kurose, J., Reeves, D. S., & Schulzrinne, H. G. (1994) · Proceedings of the IEEE · doi:10.1109/5.259431 · Cited by 222
Network support for multimedia A discussion of the Tenet approach
Ferrari, D., Banerjea, A., & Zhang, H. (1994) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(94)90101-5 · Cited by 186
Data center transport mechanisms: Congestion control theory and IEEE standardization
Alizadeh, M., Atikoglu, B., Kabbani, A., et al. (2008) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2008.4797706 · Cited by 129
Cited by
Achieving high utilization with software-driven WAN
Hong, C.-Y., Kandula, S., Mahajan, R., Zhang, M., Gill, V., Nanduri, M., & Wattenhofer, R. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486012 · Cited by 1,057
Data Center Network Virtualization: A Survey
Bari, M. F., Boutaba, R., Esteves, R., Granville, L. Z., Podlesny, M., Rabbani, M. G., Zhang, Q., & Zhani, M. F. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.090512.00043 · Cited by 677
Resource Management in Clouds: Survey and Research Challenges
Jennings, B., & Stadler, R. (2015) · Journal of Network and Systems Management · doi:10.1007/s10922-014-9307-7 · Cited by 548
Deadline-aware datacenter tcp (D2TCP)
Vamanan, B., Hasan, J., & Vijaykumar, T. N. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342388 · Cited by 473
Heracles: improving resource efficiency at scale
Lo, D., Cheng, L., Govindaraju, R., Ranganathan, P., & Kozyrakis, C. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2749475 · Cited by 466
Metadata
- Authors
- Wilson, C., Ballani, H., Karagiannis, T., & Rowtron, A.
- Venue
- Proceedings of the ACM SIGCOMM 2011 conference
- Publisher
- ACM
- Published
- 2011-08-15
- Pages
- 50-61
- OpenAlex
- W2101871381
- Cited by
- 579
- References
- 22
- FWCI
- 47.13
- Type
- conference paper
- 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.