An efficient deadline-credit-based transport scheme for prerecorded semisoft continuous media applications

In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based (DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with very small initial...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE/ACM transactions on networking 2002-10, Vol.10 (5), p.630-643
Hauptverfasser: Antoniou, Z., Stavrakakis, L.
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 643
container_issue 5
container_start_page 630
container_title IEEE/ACM transactions on networking
container_volume 10
creator Antoniou, Z.
Stavrakakis, L.
description In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based (DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with very small initial delay tolerance and, thus, for which very small amount of content may be sent in advance. The proposed policy pushes content toward the end user during the session by taking advantage of any bandwidth underutilization periods, exploiting available storage, and building up fairly a deadline credit to be consumed during periods of overutilization. The scheduling policy is studied for the single-hop case (applicable to the server of the content), as well as for the multihop case (applicable to the server and network nodes). The derived results demonstrate the ability of the proposed scheme to decrease the amount of required bandwidth (or equivalently induced losses) with respect to alternative schemes without requiring large initial delay, which is not acceptable for semisoft CM applications.
doi_str_mv 10.1109/TNET.2002.803901
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_907966599</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1041070</ieee_id><sourcerecordid>907966599</sourcerecordid><originalsourceid>FETCH-LOGICAL-c413t-9f034b806a8239945f2d53165a66f3b549e07edb57addcd424098aa21517b16b3</originalsourceid><addsrcrecordid>eNqN0T1vFDEQBuAVAokQ6JFoLAqo9hh_22UUBYIUQXPUK689K3zasxfbV_Dv8ekoEAWhGhfPjGb8DsNrCjtKwX7Yf7nb7xgA2xngFuiT4YpKaUYmlXra36D4qJRlz4cXtR4AKAemrobDTSK4LNFHTI0EdGGNCUdfMMQ2zq5iIK24VLdcGqn-Ox6RLLmQrWBBn0vooOIx1rw04nNqMZ3yqZJjH-CI27Y1etdiTvXl8Gxxa8VXv-v18O3j3f72fnz4-unz7c3D6AXlbbQLcDEbUM4wbq2QCwuSUyWdUgufpbAIGsMstQvBB8EEWOMco5LqmaqZXw_vL3O3kn-csLapb-dxXV3CvtlkQVulpLVdvvunZMZKaan5DygY1Qoeh7ofIpnq8O1f8JBPJfV_mYwRXIPQrCO4IF9yrQWXaSvx6MrPicJ0Tn06pz6dU58uqfeWN5eWiIh_cEFBA_8FloKoqw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884370472</pqid></control><display><type>article</type><title>An efficient deadline-credit-based transport scheme for prerecorded semisoft continuous media applications</title><source>IEEE Electronic Library (IEL)</source><creator>Antoniou, Z. ; Stavrakakis, L.</creator><creatorcontrib>Antoniou, Z. ; Stavrakakis, L.</creatorcontrib><description>In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based (DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with very small initial delay tolerance and, thus, for which very small amount of content may be sent in advance. The proposed policy pushes content toward the end user during the session by taking advantage of any bandwidth underutilization periods, exploiting available storage, and building up fairly a deadline credit to be consumed during periods of overutilization. The scheduling policy is studied for the single-hop case (applicable to the server of the content), as well as for the multihop case (applicable to the server and network nodes). The derived results demonstrate the ability of the proposed scheme to decrease the amount of required bandwidth (or equivalently induced losses) with respect to alternative schemes without requiring large initial delay, which is not acceptable for semisoft CM applications.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2002.803901</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Bandwidth ; Bit rate ; Delay ; Delay effects ; Disruption tolerant networking ; Encoding ; Equivalence ; Media ; Network servers ; Policies ; Prefetching ; Propagation delay ; Servers ; Servers (computers) ; Spread spectrum communication ; Stochastic processes ; Studies ; Tolerances</subject><ispartof>IEEE/ACM transactions on networking, 2002-10, Vol.10 (5), p.630-643</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2002</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c413t-9f034b806a8239945f2d53165a66f3b549e07edb57addcd424098aa21517b16b3</citedby><cites>FETCH-LOGICAL-c413t-9f034b806a8239945f2d53165a66f3b549e07edb57addcd424098aa21517b16b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1041070$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27911,27912,54745</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1041070$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Antoniou, Z.</creatorcontrib><creatorcontrib>Stavrakakis, L.</creatorcontrib><title>An efficient deadline-credit-based transport scheme for prerecorded semisoft continuous media applications</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based (DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with very small initial delay tolerance and, thus, for which very small amount of content may be sent in advance. The proposed policy pushes content toward the end user during the session by taking advantage of any bandwidth underutilization periods, exploiting available storage, and building up fairly a deadline credit to be consumed during periods of overutilization. The scheduling policy is studied for the single-hop case (applicable to the server of the content), as well as for the multihop case (applicable to the server and network nodes). The derived results demonstrate the ability of the proposed scheme to decrease the amount of required bandwidth (or equivalently induced losses) with respect to alternative schemes without requiring large initial delay, which is not acceptable for semisoft CM applications.</description><subject>Bandwidth</subject><subject>Bit rate</subject><subject>Delay</subject><subject>Delay effects</subject><subject>Disruption tolerant networking</subject><subject>Encoding</subject><subject>Equivalence</subject><subject>Media</subject><subject>Network servers</subject><subject>Policies</subject><subject>Prefetching</subject><subject>Propagation delay</subject><subject>Servers</subject><subject>Servers (computers)</subject><subject>Spread spectrum communication</subject><subject>Stochastic processes</subject><subject>Studies</subject><subject>Tolerances</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqN0T1vFDEQBuAVAokQ6JFoLAqo9hh_22UUBYIUQXPUK689K3zasxfbV_Dv8ekoEAWhGhfPjGb8DsNrCjtKwX7Yf7nb7xgA2xngFuiT4YpKaUYmlXra36D4qJRlz4cXtR4AKAemrobDTSK4LNFHTI0EdGGNCUdfMMQ2zq5iIK24VLdcGqn-Ox6RLLmQrWBBn0vooOIx1rw04nNqMZ3yqZJjH-CI27Y1etdiTvXl8Gxxa8VXv-v18O3j3f72fnz4-unz7c3D6AXlbbQLcDEbUM4wbq2QCwuSUyWdUgufpbAIGsMstQvBB8EEWOMco5LqmaqZXw_vL3O3kn-csLapb-dxXV3CvtlkQVulpLVdvvunZMZKaan5DygY1Qoeh7ofIpnq8O1f8JBPJfV_mYwRXIPQrCO4IF9yrQWXaSvx6MrPicJ0Tn06pz6dU58uqfeWN5eWiIh_cEFBA_8FloKoqw</recordid><startdate>20021001</startdate><enddate>20021001</enddate><creator>Antoniou, Z.</creator><creator>Stavrakakis, L.</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>20021001</creationdate><title>An efficient deadline-credit-based transport scheme for prerecorded semisoft continuous media applications</title><author>Antoniou, Z. ; Stavrakakis, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c413t-9f034b806a8239945f2d53165a66f3b549e07edb57addcd424098aa21517b16b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Bandwidth</topic><topic>Bit rate</topic><topic>Delay</topic><topic>Delay effects</topic><topic>Disruption tolerant networking</topic><topic>Encoding</topic><topic>Equivalence</topic><topic>Media</topic><topic>Network servers</topic><topic>Policies</topic><topic>Prefetching</topic><topic>Propagation delay</topic><topic>Servers</topic><topic>Servers (computers)</topic><topic>Spread spectrum communication</topic><topic>Stochastic processes</topic><topic>Studies</topic><topic>Tolerances</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Antoniou, Z.</creatorcontrib><creatorcontrib>Stavrakakis, L.</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 &amp; 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 &amp; 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>Antoniou, Z.</au><au>Stavrakakis, L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An efficient deadline-credit-based transport scheme for prerecorded semisoft continuous media applications</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2002-10-01</date><risdate>2002</risdate><volume>10</volume><issue>5</issue><spage>630</spage><epage>643</epage><pages>630-643</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based (DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with very small initial delay tolerance and, thus, for which very small amount of content may be sent in advance. The proposed policy pushes content toward the end user during the session by taking advantage of any bandwidth underutilization periods, exploiting available storage, and building up fairly a deadline credit to be consumed during periods of overutilization. The scheduling policy is studied for the single-hop case (applicable to the server of the content), as well as for the multihop case (applicable to the server and network nodes). The derived results demonstrate the ability of the proposed scheme to decrease the amount of required bandwidth (or equivalently induced losses) with respect to alternative schemes without requiring large initial delay, which is not acceptable for semisoft CM applications.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2002.803901</doi><tpages>14</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-6692
ispartof IEEE/ACM transactions on networking, 2002-10, Vol.10 (5), p.630-643
issn 1063-6692
1558-2566
language eng
recordid cdi_proquest_miscellaneous_907966599
source IEEE Electronic Library (IEL)
subjects Bandwidth
Bit rate
Delay
Delay effects
Disruption tolerant networking
Encoding
Equivalence
Media
Network servers
Policies
Prefetching
Propagation delay
Servers
Servers (computers)
Spread spectrum communication
Stochastic processes
Studies
Tolerances
title An efficient deadline-credit-based transport scheme for prerecorded semisoft continuous media applications
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T10%3A43%3A56IST&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=An%20efficient%20deadline-credit-based%20transport%20scheme%20for%20prerecorded%20semisoft%20continuous%20media%20applications&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Antoniou,%20Z.&rft.date=2002-10-01&rft.volume=10&rft.issue=5&rft.spage=630&rft.epage=643&rft.pages=630-643&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2002.803901&rft_dat=%3Cproquest_RIE%3E907966599%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=884370472&rft_id=info:pmid/&rft_ieee_id=1041070&rfr_iscdi=true