skip to main content
10.1145/2491172.2491182acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free Access

Experimental investigation of the google congestion control for real-time flows

Published:16 August 2013Publication History

ABSTRACT

Enabling real-time communication over the Internet is of ever increasing importance due to the use of Internet for audio/video communication. The RTCWeb IETF working group has been established with the goal of standardizing a set of protocols for inter-operable real-time communication among Web browsers. In this paper we experimentally evaluate the Google Congestion Control (GCC) which has been recently proposed in the RTCWeb IETF WG. By setting up a controlled testbed, we have evaluated to what extent GCC flows are able to track the available bandwidth, while minimizing queuing delays, and fairly share the bottleneck with other GCC or TCP flows. We have found that the algorithm works as expected when a GCC flow accesses the bottleneck in isolation, whereas it is not able to provide a fair bandwidth utilization when a GCC flow shares the bottleneck with either a GCC or a TCP flow.

References

  1. L. Budzisz et al. On the fair coexistence of loss- and delay-based tcp. IEEE/ACM Trans. Netw., 19(6):1811--1824, Dec. 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. De Cicco et al. Skype video congestion control: An experimental investigation. Computer Networks, 55(3):558--571, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. De Cicco and S. Mascolo. A Mathematical Model of the Skype VoIP Congestion Control Algorithm. IEEE Trans. on Automatic Control, 55(3):790--795, Mar. 2010.Google ScholarGoogle ScholarCross RefCross Ref
  4. S. Floyd et al. TCP Friendly Rate Control (TFRC): Protocol Specification. RFC 5348, 2008.Google ScholarGoogle Scholar
  5. J. Gettys and K. Nichols. Bufferbloat: Dark Buffers in the Internet. Comm. of the ACM, 55(1):57--65, Jan. 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. L. A. Grieco and S. Mascolo. Performance evaluation and comparison of WestwoodGoogle ScholarGoogle Scholar
  7. , New Reno, and Vegas TCP congestion control. ACM SIGCOMM CCR, 34(2):25--38, 2004.Google ScholarGoogle Scholar
  8. C. Kreibich et al. Netalyzr: illuminating the edge network. In Proc. ACM IMC '10, pages 246--259, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Loreto and S. P. Romano. Real-time communications in the web: Issues, achievements, and ongoing standardization efforts. IEEE Internet Computing, 16(5):68--73, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Lundin et al. Google congestion control algorithm for real-time communication on the world wide web. Draft IETF, 2013.Google ScholarGoogle Scholar
  11. R. S. Prasad et al. On the effectiveness of delay-based congestion avoidance. In Proc. PFLDNet '04, 2004.Google ScholarGoogle Scholar
  12. R. Rejaie et al. RAP: An End-to-End Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet. In Proc. INFOCOM '99, pages 1337--1345, 1999.Google ScholarGoogle Scholar
  13. H. Schulzrinne et al. RTP: A Transport Protocol for Real-Time Applications. RFC 3550, Standard, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. K. Winstein et al. Stochastic Forecasts Achieve High Throughput and Low Delay over Cellular Networks. In Proc. USENIX NSDI '13, April 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Y. Xu et al. Video telephony for end-consumers: measurement study of GoogleGoogle ScholarGoogle Scholar
  16. , iChat, and Skype. In Proc. ACM IMC '12, pages 371--384, 2012.Google ScholarGoogle Scholar
  17. X. Zhu and R. Pan. NADA: A Unified Congestion Control Scheme for Real-Time Media. Draft IETF, Mar. 2013.Google ScholarGoogle Scholar

Index Terms

  1. Experimental investigation of the google congestion control for real-time flows

    Recommendations

    Comments

    Login options

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

    Sign in
    • Published in

      cover image ACM Conferences
      FhMN '13: Proceedings of the 2013 ACM SIGCOMM workshop on Future human-centric multimedia networking
      August 2013
      68 pages
      ISBN:9781450321839
      DOI:10.1145/2491172

      Copyright © 2013 ACM

      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: 16 August 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      FhMN '13 Paper Acceptance Rate9of20submissions,45%Overall Acceptance Rate9of20submissions,45%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader