Clustering‐based quality selection heuristics for HTTP adaptive streaming over cache networks
Summary HyperText Transfer Protocol (HTTP) Adaptive Streaming (HAS) has become the de facto standard video‐streaming technology. The benefits of HAS are manifold: reliable transmission of video data avoiding artifacts caused by packet loss, easy fire wall, and Network Address Translation (NAT) trave...
Gespeichert in:
Veröffentlicht in: | International journal of network management 2018-11, Vol.28 (6), p.n/a |
---|---|
Hauptverfasser: | , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | n/a |
---|---|
container_issue | 6 |
container_start_page | |
container_title | International journal of network management |
container_volume | 28 |
creator | Hooft, Jeroen Bouten, Niels De Vleeschauwer, Danny Van Leekwijck, Werner Wauters, Tim Latré, Steven De Turck, Filip |
description | Summary
HyperText Transfer Protocol (HTTP) Adaptive Streaming (HAS) has become the de facto standard video‐streaming technology. The benefits of HAS are manifold: reliable transmission of video data avoiding artifacts caused by packet loss, easy fire wall, and Network Address Translation (NAT) traversal and the seamless reuse of existing HTTP caching infrastructure. However, introducing transparent, intermediary caching nodes on the delivery path can impact the Quality of Experience (QoE) perceived by the end user. In cache‐assisted HAS, segments can be served from different origins based on the content of the caches, causing highly fluctuating throughput and Round‐Trip Time (RTT) measurements, negatively impacting the stability and optimality of the quality decisions due to incorrect throughput estimations. In this paper, we propose heuristics that are able to use information on the streaming origin and intermediary cache contents to optimize the quality selection process. Using more accurate per origin throughput measurements, buffer starvations can be avoided. Moreover, including the cache state information in the decision process can positively impact the streaming quality. Furthermore, approximation techniques based on unsupervised incremental clustering are proposed to detect the streaming origin in absence of an external information channel. Similarly, a cache probability‐based heuristic is proposed to predict the content of the expected delivery location when this information is not transferred. With perfect information, the proposed heuristics improve the QoE with 0.52 on a scale between 1 and 5, while the approximation techniques result in a performance gain between 0.04 and 0.36 for a dynamic scenario and a reduction of buffer starvations with a factor 3 to 7.
Introducing intermediary caching nodes on the delivery path can affect the Quality of Experience of HyperText Transfer Protocol Adaptive Streaming services. To tackle this issue, the proposed quality adaptation heuristics take into account the streaming location and segments stored at these locations. Furthermore, approximation techniques based on clustering and probabilistic cache content estimation are proposed to improve the adaptation in absence of external information. |
doi_str_mv | 10.1002/nem.2046 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2130872475</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2130872475</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3326-1b0cf50fc29e59f8589a48eac4d0a33c62c92cb93bdad8aa24addd6f47642183</originalsourceid><addsrcrecordid>eNp10L1OwzAUBWALgUQpSDyCJRaWFNtxfjyiqlCk8jNktxz7hrqkSWs7rbLxCDwjT0JKWZnuHT6dIx2ErimZUELYXQPrCSM8PUEjSoSIKBXk9PAnSZRRnp-jC-9XZKBUZCMkp3XnAzjbvH9_fpXKg8HbTtU29NhDDTrYtsFL6Jz1wWqPq9bheVG8YWXUJtgdYB8cqPUQgNsdOKyVXgJuIOxb9-Ev0Vmlag9Xf3eMiodZMZ1Hi9fHp-n9ItJxzNKIlkRXCak0E5CIKk9yoXgOSnNDVBzrlGnBdCni0iiTK8W4MsakFc9Szmgej9HNMXbj2m0HPshV27lmaJSMxiTPGM-SQd0elXat9w4quXF2rVwvKZGH9eSwnjysN9DoSPe2hv5fJ19mz7_-B2c6czU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2130872475</pqid></control><display><type>article</type><title>Clustering‐based quality selection heuristics for HTTP adaptive streaming over cache networks</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Hooft, Jeroen ; Bouten, Niels ; De Vleeschauwer, Danny ; Van Leekwijck, Werner ; Wauters, Tim ; Latré, Steven ; De Turck, Filip</creator><creatorcontrib>Hooft, Jeroen ; Bouten, Niels ; De Vleeschauwer, Danny ; Van Leekwijck, Werner ; Wauters, Tim ; Latré, Steven ; De Turck, Filip</creatorcontrib><description>Summary
HyperText Transfer Protocol (HTTP) Adaptive Streaming (HAS) has become the de facto standard video‐streaming technology. The benefits of HAS are manifold: reliable transmission of video data avoiding artifacts caused by packet loss, easy fire wall, and Network Address Translation (NAT) traversal and the seamless reuse of existing HTTP caching infrastructure. However, introducing transparent, intermediary caching nodes on the delivery path can impact the Quality of Experience (QoE) perceived by the end user. In cache‐assisted HAS, segments can be served from different origins based on the content of the caches, causing highly fluctuating throughput and Round‐Trip Time (RTT) measurements, negatively impacting the stability and optimality of the quality decisions due to incorrect throughput estimations. In this paper, we propose heuristics that are able to use information on the streaming origin and intermediary cache contents to optimize the quality selection process. Using more accurate per origin throughput measurements, buffer starvations can be avoided. Moreover, including the cache state information in the decision process can positively impact the streaming quality. Furthermore, approximation techniques based on unsupervised incremental clustering are proposed to detect the streaming origin in absence of an external information channel. Similarly, a cache probability‐based heuristic is proposed to predict the content of the expected delivery location when this information is not transferred. With perfect information, the proposed heuristics improve the QoE with 0.52 on a scale between 1 and 5, while the approximation techniques result in a performance gain between 0.04 and 0.36 for a dynamic scenario and a reduction of buffer starvations with a factor 3 to 7.
Introducing intermediary caching nodes on the delivery path can affect the Quality of Experience of HyperText Transfer Protocol Adaptive Streaming services. To tackle this issue, the proposed quality adaptation heuristics take into account the streaming location and segments stored at these locations. Furthermore, approximation techniques based on clustering and probabilistic cache content estimation are proposed to improve the adaptation in absence of external information.</description><identifier>ISSN: 1055-7148</identifier><identifier>EISSN: 1099-1190</identifier><identifier>DOI: 10.1002/nem.2046</identifier><language>eng</language><publisher>Chichester: Wiley Subscription Services, Inc</publisher><subject>Approximation ; Buffers ; Caching ; Clustering ; Heuristic ; Hypertext ; Mathematical analysis ; Optimization ; Protocol (computers) ; Quality ; State (computer science) ; Trip estimation ; User satisfaction ; Variations ; Video data ; Video transmission</subject><ispartof>International journal of network management, 2018-11, Vol.28 (6), p.n/a</ispartof><rights>2018 John Wiley & Sons, Ltd.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3326-1b0cf50fc29e59f8589a48eac4d0a33c62c92cb93bdad8aa24addd6f47642183</citedby><cites>FETCH-LOGICAL-c3326-1b0cf50fc29e59f8589a48eac4d0a33c62c92cb93bdad8aa24addd6f47642183</cites><orcidid>0000-0002-9416-9661</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnem.2046$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnem.2046$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Hooft, Jeroen</creatorcontrib><creatorcontrib>Bouten, Niels</creatorcontrib><creatorcontrib>De Vleeschauwer, Danny</creatorcontrib><creatorcontrib>Van Leekwijck, Werner</creatorcontrib><creatorcontrib>Wauters, Tim</creatorcontrib><creatorcontrib>Latré, Steven</creatorcontrib><creatorcontrib>De Turck, Filip</creatorcontrib><title>Clustering‐based quality selection heuristics for HTTP adaptive streaming over cache networks</title><title>International journal of network management</title><description>Summary
HyperText Transfer Protocol (HTTP) Adaptive Streaming (HAS) has become the de facto standard video‐streaming technology. The benefits of HAS are manifold: reliable transmission of video data avoiding artifacts caused by packet loss, easy fire wall, and Network Address Translation (NAT) traversal and the seamless reuse of existing HTTP caching infrastructure. However, introducing transparent, intermediary caching nodes on the delivery path can impact the Quality of Experience (QoE) perceived by the end user. In cache‐assisted HAS, segments can be served from different origins based on the content of the caches, causing highly fluctuating throughput and Round‐Trip Time (RTT) measurements, negatively impacting the stability and optimality of the quality decisions due to incorrect throughput estimations. In this paper, we propose heuristics that are able to use information on the streaming origin and intermediary cache contents to optimize the quality selection process. Using more accurate per origin throughput measurements, buffer starvations can be avoided. Moreover, including the cache state information in the decision process can positively impact the streaming quality. Furthermore, approximation techniques based on unsupervised incremental clustering are proposed to detect the streaming origin in absence of an external information channel. Similarly, a cache probability‐based heuristic is proposed to predict the content of the expected delivery location when this information is not transferred. With perfect information, the proposed heuristics improve the QoE with 0.52 on a scale between 1 and 5, while the approximation techniques result in a performance gain between 0.04 and 0.36 for a dynamic scenario and a reduction of buffer starvations with a factor 3 to 7.
Introducing intermediary caching nodes on the delivery path can affect the Quality of Experience of HyperText Transfer Protocol Adaptive Streaming services. To tackle this issue, the proposed quality adaptation heuristics take into account the streaming location and segments stored at these locations. Furthermore, approximation techniques based on clustering and probabilistic cache content estimation are proposed to improve the adaptation in absence of external information.</description><subject>Approximation</subject><subject>Buffers</subject><subject>Caching</subject><subject>Clustering</subject><subject>Heuristic</subject><subject>Hypertext</subject><subject>Mathematical analysis</subject><subject>Optimization</subject><subject>Protocol (computers)</subject><subject>Quality</subject><subject>State (computer science)</subject><subject>Trip estimation</subject><subject>User satisfaction</subject><subject>Variations</subject><subject>Video data</subject><subject>Video transmission</subject><issn>1055-7148</issn><issn>1099-1190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp10L1OwzAUBWALgUQpSDyCJRaWFNtxfjyiqlCk8jNktxz7hrqkSWs7rbLxCDwjT0JKWZnuHT6dIx2ErimZUELYXQPrCSM8PUEjSoSIKBXk9PAnSZRRnp-jC-9XZKBUZCMkp3XnAzjbvH9_fpXKg8HbTtU29NhDDTrYtsFL6Jz1wWqPq9bheVG8YWXUJtgdYB8cqPUQgNsdOKyVXgJuIOxb9-Ev0Vmlag9Xf3eMiodZMZ1Hi9fHp-n9ItJxzNKIlkRXCak0E5CIKk9yoXgOSnNDVBzrlGnBdCni0iiTK8W4MsakFc9Szmgej9HNMXbj2m0HPshV27lmaJSMxiTPGM-SQd0elXat9w4quXF2rVwvKZGH9eSwnjysN9DoSPe2hv5fJ19mz7_-B2c6czU</recordid><startdate>201811</startdate><enddate>201811</enddate><creator>Hooft, Jeroen</creator><creator>Bouten, Niels</creator><creator>De Vleeschauwer, Danny</creator><creator>Van Leekwijck, Werner</creator><creator>Wauters, Tim</creator><creator>Latré, Steven</creator><creator>De Turck, Filip</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-9416-9661</orcidid></search><sort><creationdate>201811</creationdate><title>Clustering‐based quality selection heuristics for HTTP adaptive streaming over cache networks</title><author>Hooft, Jeroen ; Bouten, Niels ; De Vleeschauwer, Danny ; Van Leekwijck, Werner ; Wauters, Tim ; Latré, Steven ; De Turck, Filip</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3326-1b0cf50fc29e59f8589a48eac4d0a33c62c92cb93bdad8aa24addd6f47642183</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Approximation</topic><topic>Buffers</topic><topic>Caching</topic><topic>Clustering</topic><topic>Heuristic</topic><topic>Hypertext</topic><topic>Mathematical analysis</topic><topic>Optimization</topic><topic>Protocol (computers)</topic><topic>Quality</topic><topic>State (computer science)</topic><topic>Trip estimation</topic><topic>User satisfaction</topic><topic>Variations</topic><topic>Video data</topic><topic>Video transmission</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hooft, Jeroen</creatorcontrib><creatorcontrib>Bouten, Niels</creatorcontrib><creatorcontrib>De Vleeschauwer, Danny</creatorcontrib><creatorcontrib>Van Leekwijck, Werner</creatorcontrib><creatorcontrib>Wauters, Tim</creatorcontrib><creatorcontrib>Latré, Steven</creatorcontrib><creatorcontrib>De Turck, Filip</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of network management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hooft, Jeroen</au><au>Bouten, Niels</au><au>De Vleeschauwer, Danny</au><au>Van Leekwijck, Werner</au><au>Wauters, Tim</au><au>Latré, Steven</au><au>De Turck, Filip</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Clustering‐based quality selection heuristics for HTTP adaptive streaming over cache networks</atitle><jtitle>International journal of network management</jtitle><date>2018-11</date><risdate>2018</risdate><volume>28</volume><issue>6</issue><epage>n/a</epage><issn>1055-7148</issn><eissn>1099-1190</eissn><abstract>Summary
HyperText Transfer Protocol (HTTP) Adaptive Streaming (HAS) has become the de facto standard video‐streaming technology. The benefits of HAS are manifold: reliable transmission of video data avoiding artifacts caused by packet loss, easy fire wall, and Network Address Translation (NAT) traversal and the seamless reuse of existing HTTP caching infrastructure. However, introducing transparent, intermediary caching nodes on the delivery path can impact the Quality of Experience (QoE) perceived by the end user. In cache‐assisted HAS, segments can be served from different origins based on the content of the caches, causing highly fluctuating throughput and Round‐Trip Time (RTT) measurements, negatively impacting the stability and optimality of the quality decisions due to incorrect throughput estimations. In this paper, we propose heuristics that are able to use information on the streaming origin and intermediary cache contents to optimize the quality selection process. Using more accurate per origin throughput measurements, buffer starvations can be avoided. Moreover, including the cache state information in the decision process can positively impact the streaming quality. Furthermore, approximation techniques based on unsupervised incremental clustering are proposed to detect the streaming origin in absence of an external information channel. Similarly, a cache probability‐based heuristic is proposed to predict the content of the expected delivery location when this information is not transferred. With perfect information, the proposed heuristics improve the QoE with 0.52 on a scale between 1 and 5, while the approximation techniques result in a performance gain between 0.04 and 0.36 for a dynamic scenario and a reduction of buffer starvations with a factor 3 to 7.
Introducing intermediary caching nodes on the delivery path can affect the Quality of Experience of HyperText Transfer Protocol Adaptive Streaming services. To tackle this issue, the proposed quality adaptation heuristics take into account the streaming location and segments stored at these locations. Furthermore, approximation techniques based on clustering and probabilistic cache content estimation are proposed to improve the adaptation in absence of external information.</abstract><cop>Chichester</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/nem.2046</doi><tpages>22</tpages><orcidid>https://orcid.org/0000-0002-9416-9661</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1055-7148 |
ispartof | International journal of network management, 2018-11, Vol.28 (6), p.n/a |
issn | 1055-7148 1099-1190 |
language | eng |
recordid | cdi_proquest_journals_2130872475 |
source | Wiley Online Library Journals Frontfile Complete |
subjects | Approximation Buffers Caching Clustering Heuristic Hypertext Mathematical analysis Optimization Protocol (computers) Quality State (computer science) Trip estimation User satisfaction Variations Video data Video transmission |
title | Clustering‐based quality selection heuristics for HTTP adaptive streaming over cache networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T00%3A08%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Clustering%E2%80%90based%20quality%20selection%20heuristics%20for%20HTTP%20adaptive%20streaming%20over%20cache%20networks&rft.jtitle=International%20journal%20of%20network%20management&rft.au=Hooft,%20Jeroen&rft.date=2018-11&rft.volume=28&rft.issue=6&rft.epage=n/a&rft.issn=1055-7148&rft.eissn=1099-1190&rft_id=info:doi/10.1002/nem.2046&rft_dat=%3Cproquest_cross%3E2130872475%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2130872475&rft_id=info:pmid/&rfr_iscdi=true |