Scalable on-demand media streaming with packet loss recovery
Previous scalable on-demand streaming protocols do not allow clients to recover from packet loss. This paper develops new protocols that: (1) have a tunably short latency for the client to begin playing the media; (2) allow heterogeneous clients to recover lost packets without jitter as long as each...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM transactions on networking 2003-04, Vol.11 (2), p.195-209 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 209 |
|---|---|
| container_issue | 2 |
| container_start_page | 195 |
| container_title | IEEE/ACM transactions on networking |
| container_volume | 11 |
| creator | Mahanti, A. Eager, D.L. Vernon, M.K. Sundaram-Stukel, D.J. |
| description | Previous scalable on-demand streaming protocols do not allow clients to recover from packet loss. This paper develops new protocols that: (1) have a tunably short latency for the client to begin playing the media; (2) allow heterogeneous clients to recover lost packets without jitter as long as each client's cumulative loss rate is within a tunable threshold; and (3) assume a tunable upper bound on the transmission rate to each client that can be as small as a fraction (e.g., 25%) greater than the media play rate. Models are developed to compute the minimum required server bandwidth for a given loss rate and playback latency. The results of the models are used to develop the new protocols and assess their performance. The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth Skimming, are simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible media quality. Furthermore, the results show that the new reliable protocols that transmit to each client at only twice the media play rate have similar performance to previous protocols that require clients to receive at many times the play rate. |
| doi_str_mv | 10.1109/TNET.2003.810311 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28603116</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1194817</ieee_id><sourcerecordid>2428243371</sourcerecordid><originalsourceid>FETCH-LOGICAL-c383t-f34910487f77451aea840a128c5a42cfb24edba9ca7e9e4915929cd97ac2fbb33</originalsourceid><addsrcrecordid>eNqFkb1LBDEQxYMoqKe9YLNYiM2emSSbD7CRwy8QLTzrkM3O6up-nMme4n9vjhMECy2GmeL3Bt57hBwAnQJQczq_u5hPGaV8qoFygA2yA0Whc1ZIuZluKnkupWHbZDfGF0qBUyZ3yNmDd60rW8yGPq-wc32VdVg1LotjQNc1_VP20YzP2cL5VxyzdogxC-iHdwyfe2Srdm3E_e89IY-XF_PZdX57f3UzO7_NPdd8zGsuDFChVa2UKMCh04I6YNoXTjBfl0xgVTrjnUKDiS0MM74yynlWlyXnE3K8_rsIw9sS42i7JnpsW9fjsIyWGcqUSrb_BbVcZSMTePInCFIBLzhPMyFHv9CXYRn65NdqLYAzJViC6BryIQUUsLaL0HQufFqgdtWPXfVjV_3YdT9JcriWNIj4g4MRGhT_AuUIiiA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884132742</pqid></control><display><type>article</type><title>Scalable on-demand media streaming with packet loss recovery</title><source>IEEE Electronic Library (IEL)</source><creator>Mahanti, A. ; Eager, D.L. ; Vernon, M.K. ; Sundaram-Stukel, D.J.</creator><creatorcontrib>Mahanti, A. ; Eager, D.L. ; Vernon, M.K. ; Sundaram-Stukel, D.J.</creatorcontrib><description>Previous scalable on-demand streaming protocols do not allow clients to recover from packet loss. This paper develops new protocols that: (1) have a tunably short latency for the client to begin playing the media; (2) allow heterogeneous clients to recover lost packets without jitter as long as each client's cumulative loss rate is within a tunable threshold; and (3) assume a tunable upper bound on the transmission rate to each client that can be as small as a fraction (e.g., 25%) greater than the media play rate. Models are developed to compute the minimum required server bandwidth for a given loss rate and playback latency. The results of the models are used to develop the new protocols and assess their performance. The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth Skimming, are simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible media quality. Furthermore, the results show that the new reliable protocols that transmit to each client at only twice the media play rate have similar performance to previous protocols that require clients to receive at many times the play rate.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2003.810311</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Bandwidth ; Broadcasting ; Clients ; Delay ; Jitter ; Mathematical models ; Media ; Nonhomogeneous media ; Playbacks ; Propagation losses ; Protocols ; Scalability ; Servers ; Streaming media ; Studies ; Upper bound</subject><ispartof>IEEE/ACM transactions on networking, 2003-04, Vol.11 (2), p.195-209</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c383t-f34910487f77451aea840a128c5a42cfb24edba9ca7e9e4915929cd97ac2fbb33</citedby><cites>FETCH-LOGICAL-c383t-f34910487f77451aea840a128c5a42cfb24edba9ca7e9e4915929cd97ac2fbb33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1194817$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1194817$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mahanti, A.</creatorcontrib><creatorcontrib>Eager, D.L.</creatorcontrib><creatorcontrib>Vernon, M.K.</creatorcontrib><creatorcontrib>Sundaram-Stukel, D.J.</creatorcontrib><title>Scalable on-demand media streaming with packet loss recovery</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>Previous scalable on-demand streaming protocols do not allow clients to recover from packet loss. This paper develops new protocols that: (1) have a tunably short latency for the client to begin playing the media; (2) allow heterogeneous clients to recover lost packets without jitter as long as each client's cumulative loss rate is within a tunable threshold; and (3) assume a tunable upper bound on the transmission rate to each client that can be as small as a fraction (e.g., 25%) greater than the media play rate. Models are developed to compute the minimum required server bandwidth for a given loss rate and playback latency. The results of the models are used to develop the new protocols and assess their performance. The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth Skimming, are simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible media quality. Furthermore, the results show that the new reliable protocols that transmit to each client at only twice the media play rate have similar performance to previous protocols that require clients to receive at many times the play rate.</description><subject>Bandwidth</subject><subject>Broadcasting</subject><subject>Clients</subject><subject>Delay</subject><subject>Jitter</subject><subject>Mathematical models</subject><subject>Media</subject><subject>Nonhomogeneous media</subject><subject>Playbacks</subject><subject>Propagation losses</subject><subject>Protocols</subject><subject>Scalability</subject><subject>Servers</subject><subject>Streaming media</subject><subject>Studies</subject><subject>Upper bound</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqFkb1LBDEQxYMoqKe9YLNYiM2emSSbD7CRwy8QLTzrkM3O6up-nMme4n9vjhMECy2GmeL3Bt57hBwAnQJQczq_u5hPGaV8qoFygA2yA0Whc1ZIuZluKnkupWHbZDfGF0qBUyZ3yNmDd60rW8yGPq-wc32VdVg1LotjQNc1_VP20YzP2cL5VxyzdogxC-iHdwyfe2Srdm3E_e89IY-XF_PZdX57f3UzO7_NPdd8zGsuDFChVa2UKMCh04I6YNoXTjBfl0xgVTrjnUKDiS0MM74yynlWlyXnE3K8_rsIw9sS42i7JnpsW9fjsIyWGcqUSrb_BbVcZSMTePInCFIBLzhPMyFHv9CXYRn65NdqLYAzJViC6BryIQUUsLaL0HQufFqgdtWPXfVjV_3YdT9JcriWNIj4g4MRGhT_AuUIiiA</recordid><startdate>20030401</startdate><enddate>20030401</enddate><creator>Mahanti, A.</creator><creator>Eager, D.L.</creator><creator>Vernon, M.K.</creator><creator>Sundaram-Stukel, D.J.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><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><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20030401</creationdate><title>Scalable on-demand media streaming with packet loss recovery</title><author>Mahanti, A. ; Eager, D.L. ; Vernon, M.K. ; Sundaram-Stukel, D.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c383t-f34910487f77451aea840a128c5a42cfb24edba9ca7e9e4915929cd97ac2fbb33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Bandwidth</topic><topic>Broadcasting</topic><topic>Clients</topic><topic>Delay</topic><topic>Jitter</topic><topic>Mathematical models</topic><topic>Media</topic><topic>Nonhomogeneous media</topic><topic>Playbacks</topic><topic>Propagation losses</topic><topic>Protocols</topic><topic>Scalability</topic><topic>Servers</topic><topic>Streaming media</topic><topic>Studies</topic><topic>Upper bound</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mahanti, A.</creatorcontrib><creatorcontrib>Eager, D.L.</creatorcontrib><creatorcontrib>Vernon, M.K.</creatorcontrib><creatorcontrib>Sundaram-Stukel, D.J.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mahanti, A.</au><au>Eager, D.L.</au><au>Vernon, M.K.</au><au>Sundaram-Stukel, D.J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scalable on-demand media streaming with packet loss recovery</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2003-04-01</date><risdate>2003</risdate><volume>11</volume><issue>2</issue><spage>195</spage><epage>209</epage><pages>195-209</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>Previous scalable on-demand streaming protocols do not allow clients to recover from packet loss. This paper develops new protocols that: (1) have a tunably short latency for the client to begin playing the media; (2) allow heterogeneous clients to recover lost packets without jitter as long as each client's cumulative loss rate is within a tunable threshold; and (3) assume a tunable upper bound on the transmission rate to each client that can be as small as a fraction (e.g., 25%) greater than the media play rate. Models are developed to compute the minimum required server bandwidth for a given loss rate and playback latency. The results of the models are used to develop the new protocols and assess their performance. The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth Skimming, are simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible media quality. Furthermore, the results show that the new reliable protocols that transmit to each client at only twice the media play rate have similar performance to previous protocols that require clients to receive at many times the play rate.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2003.810311</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6692 |
| ispartof | IEEE/ACM transactions on networking, 2003-04, Vol.11 (2), p.195-209 |
| issn | 1063-6692 1558-2566 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28603116 |
| source | IEEE Electronic Library (IEL) |
| subjects | Bandwidth Broadcasting Clients Delay Jitter Mathematical models Media Nonhomogeneous media Playbacks Propagation losses Protocols Scalability Servers Streaming media Studies Upper bound |
| title | Scalable on-demand media streaming with packet loss recovery |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T19%3A01%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Scalable%20on-demand%20media%20streaming%20with%20packet%20loss%20recovery&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Mahanti,%20A.&rft.date=2003-04-01&rft.volume=11&rft.issue=2&rft.spage=195&rft.epage=209&rft.pages=195-209&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2003.810311&rft_dat=%3Cproquest_RIE%3E2428243371%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884132742&rft_id=info:pmid/&rft_ieee_id=1194817&rfr_iscdi=true |