research-article

How to improve your network performance by asking your provider for worse service

Authors:

Radhika Mittal,

Justine Sherry,

Sylvia Ratnasamy,

Scott ShenkerAuthors Info & Claims

HotNets-XII: Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks

Article No.: 25, Pages 1 - 7

https://doi.org/10.1145/2535771.2535775

Published: 21 November 2013 Publication History

Get Access

Abstract

TCP's congestion control is deliberately "cautious", avoiding overloads by starting with a small initial window and then iteratively ramping up. As a result, it often takes flows several round-trip times to fully utilize the available bandwidth. In this paper we propose using several levels of lower priority service and a modified TCP behavior to achieve significantly improved flow completion times while preserving fairness.

References

[1]

ns-3. http://www.nsnam.org.

Google Scholar

[2]

M. Alizadeh, S. Yang, S. Katti, N. McKeown, B. Prabhakar, and S. Shenker. Deconstructing Datacenter Packet Transport. In Proc. ACM Workshop on Hot Topics in Networks (HotNets), 2012.

Digital Library

Google Scholar

[3]

M. Allman. Comments on bufferbloat. SIGCOMM Comput. Commun. Rev., 2012.

Digital Library

Google Scholar

[4]

M. Allman, S. Floyd, and C. Partridge. Increasing TCP's Initial Window. RFC 3390.

Digital Library

Google Scholar

[5]

E. Blanton, M. Allman, K. Fall, and L. Wang. A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517.

Digital Library

Google Scholar

[6]

N. Dukkipati and N. McKeown. Why Flow-Completion Time is the Right Metric for Congestion Control. ACM SIGCOMM Computer Communication Review, 36(1): 59--62, Jan. 2006.

Digital Library

Google Scholar

[7]

N. Dukkipati, T. Refice, Y. Cheng, J. Chu, T. Herbert, A. Agarwal, A. Jain, and N. Sutin. An Argument for Increasing TCP's Initial Congestion Window. ACM SIGCOMM Computer Communication Review, 40(3), June 2010.

Digital Library

Google Scholar

[8]

C. Fraleigh, S. Moon, B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, and C. Diot. Packet-level traffic measurements from the sprint ip backbone. IEEE Network, 17: 6--16, 2003.

Digital Library

Google Scholar

[9]

S. Ha, I. Rhee, and L. Xu. CUBIC: a New TCP-friendly High-Speed TCP Variant. ACM SIGOPS Operating System Review, 42(5): 64--74, July 2008.

Digital Library

Google Scholar

[10]

S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot. An approach to alleviate link overload as observed on an ip backbone, 2003.

Google Scholar

[11]

M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgment Options. RFC 2018.

Digital Library

Google Scholar

[12]

S. Nedevschi, L. Popa, G. Iannaccone, S. Ratnasamy, and D. Wetherall. Reducing network energy consumption via sleeping and rate-adaptation. NSDI'08, pages 323--336. USENIX Association.

Digital Library

Google Scholar

[13]

Sally Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582.

Digital Library

Google Scholar

[14]

K. Tan, J. Song, Q. Zhang, and M. Sridharan. A Compound TCP Approach for High-Speed and Long Distance Networks. In IEEE INFOCOM, 2006.

Crossref

Google Scholar

Cited By

View all

Qadir JSathiaseelan AWang LCrowcroft JNardi BRaghavan BPargman D(2016)Taming limits with approximate networkingProceedings of the Second Workshop on Computing within Limits10.1145/2926676.2926678(1-8)Online publication date: 8-Jun-2016
https://dl.acm.org/doi/10.1145/2926676.2926678
Geng YJeyakumar VKabbani AAlizadeh MCadar CPietzuch PKeeton KRodrigues R(2016)JugglerProceedings of the Eleventh European Conference on Computer Systems10.1145/2901318.2901334(1-16)Online publication date: 18-Apr-2016
https://dl.acm.org/doi/10.1145/2901318.2901334

Index Terms

How to improve your network performance by asking your provider for worse service
1. Networks
  1. Network protocols

Recommendations

Comments

Information & Contributors

Information

Published In

HotNets-XII: Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks

November 2013

188 pages

ISBN:9781450325967

DOI:10.1145/2535771

General Chair:
Dave Levine
UMD
,
Program Chairs:
Sachin Katti
Stanford University
,
Dave Oran
Cisco

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 November 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

HotNets-XII

Sponsor:

SIGCOMM

HotNets-XII: Twelfth ACM Workshop on Hot Topics in Networks

November 21 - 22, 2013

Maryland, College Park

Acceptance Rates

HotNets-XII Paper Acceptance Rate 26 of 110 submissions, 24%;

Overall Acceptance Rate 110 of 460 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
162
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Qadir JSathiaseelan AWang LCrowcroft JNardi BRaghavan BPargman D(2016)Taming limits with approximate networkingProceedings of the Second Workshop on Computing within Limits10.1145/2926676.2926678(1-8)Online publication date: 8-Jun-2016
https://dl.acm.org/doi/10.1145/2926676.2926678
Geng YJeyakumar VKabbani AAlizadeh MCadar CPietzuch PKeeton KRodrigues R(2016)JugglerProceedings of the Eleventh European Conference on Computer Systems10.1145/2901318.2901334(1-16)Online publication date: 18-Apr-2016
https://dl.acm.org/doi/10.1145/2901318.2901334

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Cited By

Index Terms

Recommendations

An evolutionary approach to improve end-to-end performance in tcp/ip networks

Using signaling methods to improve the performance of tcp congestion control

RFC 7041: Extensions to the Virtual Private LAN Service (VPLS) Provider Edge (PE) Model for Provider Backbone Bridging

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

An evolutionary approach to improve end-to-end performance in tcp/ip networks

Using signaling methods to improve the performance of tcp congestion control

RFC 7041: Extensions to the Virtual Private LAN Service (VPLS) Provider Edge (PE) Model for Provider Backbone Bridging

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations