IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v28y2018i4ne2023.html
   My bibliography  Save this article

Deadline‐aware TCP congestion control for HTTP adaptive streaming services

Author

Listed:
  • Maxim Claeys
  • Niels Bouten
  • Danny De Vleeschauwer
  • Koen De Schepper
  • Werner Van Leekwijck
  • Steven Latré
  • Filip De Turck

Abstract

Over the last decades, video streaming services have gained a lot of popularity, representing over 70% of the total consumer Internet traffic worldwide. While originally dedicated streaming protocols have been used to deliver these services, for several years, the video streaming industry is steadily shifting to HTTP adaptive streaming (HAS)–based delivery over TCP. With each video segment, implicit delivery deadlines are associated in order to avoid playout interruptions. However, TCP is known to be far from minimizing the number of deadline‐missing streams. In this paper, 2 deadline‐aware congestion control mechanisms are proposed, based on a parametrization of the traditional TCP New Reno congestion control strategy. By introducing deadline awareness at the transport layer, the modulation of the congestion window size is dynamically adapted to steer the aggressiveness of the considered stream to optimize the delivery of video streaming services. The proposed approaches are thoroughly evaluated in an HAS video‐on‐demand scenario over tree‐based delivery networks. It was shown that in a realistic scenario, the proposed approaches can outperform traditional congestion control strategies by up to 12% in terms of estimated mean opinion score, mainly by reducing the average video freezing time by more than 85%.

Suggested Citation

  • Maxim Claeys & Niels Bouten & Danny De Vleeschauwer & Koen De Schepper & Werner Van Leekwijck & Steven Latré & Filip De Turck, 2018. "Deadline‐aware TCP congestion control for HTTP adaptive streaming services," International Journal of Network Management, John Wiley & Sons, vol. 28(4), July.
  • Handle: RePEc:wly:intnem:v:28:y:2018:i:4:n:e2023
    DOI: 10.1002/nem.2023
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2023
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2023?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:28:y:2018:i:4:n:e2023. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.