The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection
Abstract
Datacenters need high-bandwidth interconnection fabrics. Several researchers have proposed highly-redundant topologies with multiple paths between pairs of end hosts for datacenter networks. However, traffic management is necessary to effectively utilize the bisection bandwidth provided by these topologies. This requires timely detection of elephant flows-flows that carry large amount of data-and managing those flows. Previously proposed approaches incur high monitoring overheads, consume significant switch resources, and/or have long detection times. We propose, instead, to detect elephant flows at the end hosts. We do this by observing the end hosts's socket buffers, which provide better, more efficient visibility of flow behavior. We present Mahout, a low-overhead yet effective traffic management system that follows OpenFlow-like central controller approach for network management but augments the design with our novel end host mechanism. Once an elephant flow is detected, an end host signals the network controller using in-band signaling with low overheads. Through analytical evaluation and experiments, we demonstrate the benefits of Mahout over previous solutions.
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
McKeown (2008) · doi:10.1145/1355734.1355746 · Cited by 8,513
Xen and the art of virtualization
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., Neugebauer, R., Pratt, I., & Warfield, A. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945462 · Cited by 5,915
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
Integrated Services in the Internet Architecture: an Overview
Braden, R., Clark, D., & Shenker, S. (1994) · doi:10.17487/rfc1633 · Cited by 3,145
MapReduce: Simplified Data Processing on Large Cluster
Senior Software Developer, A. U., & Dayalan, M. (2018) · International Journal of Research and Engineering · doi:10.21276/ijre.2018.5.5.4 · Cited by 2,948
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
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
Xen and the art of virtualization
Barham, P., Dragovic, B., Fraser, K., Hand, S., Harris, T., Ho, A., & Neugebauer, R. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles - SOSP '03 · doi:10.1145/945461.945462 · Cited by 1,552
Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers
Nichols, K., Blake, S., Baker, F., & Black, D. (1998) · doi:10.17487/rfc2474 · Cited by 1,530
Hedera: dynamic flow scheduling for data center networks
Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., & Vahdat, A. M. (2010) · doi:10.5555/1855711.1855730 · Cited by 1,450
The nature of data center traffic: measurements & analysis
Kandula, S., Sengupta, S., Greenberg, A., Patel, P., & Chaiken, R. (2009) · Proceedings of the 9th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1644893.1644918 · Cited by 1,030
Analysis of an Equal-Cost Multi-Path Algorithm
Hopps, C. (2000) · doi:10.17487/rfc2992 · Cited by 965
Helios: a hybrid electrical/optical switch architecture for modular data centers
Farrington, N., Porter, G., Radhakrishnan, S., Bazzaz, H. H., Subramanya, V., Fainman, Y., Papen, G., & Vahdat, A. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851223 · Cited by 918
Roughan, M., Sen, S., Spatscheck, O., & Duffield, N. (2004) · Proceedings of the 4th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1028788.1028805 · Cited by 494
Flattened butterfly: a cost-efficient topology for high-radix networks
Kim, J., Dally, W. J., & Abts, D. (2007) · Proceedings of the 34th annual international symposium on Computer architecture · doi:10.1145/1250662.1250679 · Cited by 392
HyperX: topology, routing, and packaging of efficient large-scale networks
Ahn, J. H., Binkert, N., Davis, A., McLaren, M., & Schreiber, R. S. (2009) · Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis · doi:10.1145/1654059.1654101 · Cited by 264
Applying NOX to the Datacenter.
Tavakoli, A., Casado, M., Koponen, T., & Shenker, S. J. (2009) · Cited by 238
Identifying elephant flows through periodically sampled packets
Mori, T., Uchida, M., Kawahara, R., Pan, J., & Goto, S. (2004) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1028788.1028803 · Cited by 179
Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P. K., Curtis, A. R., & Banerjee, S. (2010) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/1868447.1868448 · Cited by 132
Self-citation
Cited by
A Survey on Software-Defined Networking
Xia, W., Wen, Y., Foh, C. H., Niyato, D., & Xie, H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2330903 · Cited by 1,096
DevoFlow: scaling flow management for high-performance networks
Curtis, A. R., Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P., & Banerjee, S. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018466 · Cited by 959
Self-citationKandoo: a framework for efficient and scalable offloading of control applications
Hassas Yeganeh, S., & Ganjali, Y. (2012) · Proceedings of the first workshop on Hot topics in software defined networks · doi:10.1145/2342441.2342446 · Cited by 641
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
DevoFlow: scaling flow management for high-performance networks
Curtis, A. R., Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P., & Banerjee, S. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018466 · Cited by 543
Self-citation
Metadata
- Authors
- Curtis, A. R., Kim, W., & Yalagandula, P.
- Venue
- 2011 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2011-04
- Pages
- 1629-1637
- OpenAlex
- W2164998096
- Cited by
- 402
- References
- 19
- FWCI
- 19.14
- 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.