Deadline credit scheduling policy for prerecorded sources
In this paper a scheduling policy is proposed, called the deadline credit (DC) policy, which focuses on the efficient scheduling of prerecorded continuous media traffic. Its objectives are (a) to utilize all (if possible) of the available capacity by allocating bandwidth dynamically to a number of d...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 78 vol.1a |
|---|---|
| container_issue | |
| container_start_page | 74 |
| container_title | |
| container_volume | 1A |
| creator | Antoniou, Z. Stavrakakis, I. |
| description | In this paper a scheduling policy is proposed, called the deadline credit (DC) policy, which focuses on the efficient scheduling of prerecorded continuous media traffic. Its objectives are (a) to utilize all (if possible) of the available capacity by allocating bandwidth dynamically to a number of data streams, (b) to distribute the available bandwidth fairly between all competing data streams and (c) to maximise the number of application data units (ADUs) that are served by always giving priority to the one with the shortest time to expiration. Numerical results are presented and the induced ADUs loss rates under the proposed policy are compared against those of some alternative schemes. |
| doi_str_mv | 10.1109/GLOCOM.1999.831611 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_831611</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>831611</ieee_id><sourcerecordid>831611</sourcerecordid><originalsourceid>FETCH-ieee_primary_8316113</originalsourceid><addsrcrecordid>eNp9jrsOgkAQRTcxJr74Aar9AXEmhMfW-Co0NPSE7A66Bl0yKwV_L4nW3uYk5zRXiBAhQgS1O13KorxGqJSK8hhTxJlYQZZDnGQqTRYi8P4B0xLIAHAp1J4a09kXSc1k7Ft6fSczTOYme9dZPcrWseyZmLRjQ0Z6N7AmvxHztuk8BT-uRXg8VMV5a4mo7tk-Gx7r74n4b_wACyU2mA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Deadline credit scheduling policy for prerecorded sources</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Antoniou, Z. ; Stavrakakis, I.</creator><creatorcontrib>Antoniou, Z. ; Stavrakakis, I.</creatorcontrib><description>In this paper a scheduling policy is proposed, called the deadline credit (DC) policy, which focuses on the efficient scheduling of prerecorded continuous media traffic. Its objectives are (a) to utilize all (if possible) of the available capacity by allocating bandwidth dynamically to a number of data streams, (b) to distribute the available bandwidth fairly between all competing data streams and (c) to maximise the number of application data units (ADUs) that are served by always giving priority to the one with the shortest time to expiration. Numerical results are presented and the induced ADUs loss rates under the proposed policy are compared against those of some alternative schemes.</description><identifier>ISBN: 0780357965</identifier><identifier>ISBN: 9780780357969</identifier><identifier>DOI: 10.1109/GLOCOM.1999.831611</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Buffer overflow ; Displays ; Encoding ; Image reconstruction ; Informatics ; Propagation losses ; Streaming media ; Telecommunication traffic ; Video on demand</subject><ispartof>Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042), 1999, Vol.1A, p.74-78 vol.1a</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/831611$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,2054,4038,4039,27912,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/831611$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Antoniou, Z.</creatorcontrib><creatorcontrib>Stavrakakis, I.</creatorcontrib><title>Deadline credit scheduling policy for prerecorded sources</title><title>Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)</title><addtitle>GLOCOM</addtitle><description>In this paper a scheduling policy is proposed, called the deadline credit (DC) policy, which focuses on the efficient scheduling of prerecorded continuous media traffic. Its objectives are (a) to utilize all (if possible) of the available capacity by allocating bandwidth dynamically to a number of data streams, (b) to distribute the available bandwidth fairly between all competing data streams and (c) to maximise the number of application data units (ADUs) that are served by always giving priority to the one with the shortest time to expiration. Numerical results are presented and the induced ADUs loss rates under the proposed policy are compared against those of some alternative schemes.</description><subject>Bandwidth</subject><subject>Buffer overflow</subject><subject>Displays</subject><subject>Encoding</subject><subject>Image reconstruction</subject><subject>Informatics</subject><subject>Propagation losses</subject><subject>Streaming media</subject><subject>Telecommunication traffic</subject><subject>Video on demand</subject><isbn>0780357965</isbn><isbn>9780780357969</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNp9jrsOgkAQRTcxJr74Aar9AXEmhMfW-Co0NPSE7A66Bl0yKwV_L4nW3uYk5zRXiBAhQgS1O13KorxGqJSK8hhTxJlYQZZDnGQqTRYi8P4B0xLIAHAp1J4a09kXSc1k7Ft6fSczTOYme9dZPcrWseyZmLRjQ0Z6N7AmvxHztuk8BT-uRXg8VMV5a4mo7tk-Gx7r74n4b_wACyU2mA</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Antoniou, Z.</creator><creator>Stavrakakis, I.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>1999</creationdate><title>Deadline credit scheduling policy for prerecorded sources</title><author>Antoniou, Z. ; Stavrakakis, I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_8316113</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Bandwidth</topic><topic>Buffer overflow</topic><topic>Displays</topic><topic>Encoding</topic><topic>Image reconstruction</topic><topic>Informatics</topic><topic>Propagation losses</topic><topic>Streaming media</topic><topic>Telecommunication traffic</topic><topic>Video on demand</topic><toplevel>online_resources</toplevel><creatorcontrib>Antoniou, Z.</creatorcontrib><creatorcontrib>Stavrakakis, I.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Antoniou, Z.</au><au>Stavrakakis, I.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Deadline credit scheduling policy for prerecorded sources</atitle><btitle>Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)</btitle><stitle>GLOCOM</stitle><date>1999</date><risdate>1999</risdate><volume>1A</volume><spage>74</spage><epage>78 vol.1a</epage><pages>74-78 vol.1a</pages><isbn>0780357965</isbn><isbn>9780780357969</isbn><abstract>In this paper a scheduling policy is proposed, called the deadline credit (DC) policy, which focuses on the efficient scheduling of prerecorded continuous media traffic. Its objectives are (a) to utilize all (if possible) of the available capacity by allocating bandwidth dynamically to a number of data streams, (b) to distribute the available bandwidth fairly between all competing data streams and (c) to maximise the number of application data units (ADUs) that are served by always giving priority to the one with the shortest time to expiration. Numerical results are presented and the induced ADUs loss rates under the proposed policy are compared against those of some alternative schemes.</abstract><pub>IEEE</pub><doi>10.1109/GLOCOM.1999.831611</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0780357965 |
| ispartof | Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042), 1999, Vol.1A, p.74-78 vol.1a |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_831611 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Bandwidth Buffer overflow Displays Encoding Image reconstruction Informatics Propagation losses Streaming media Telecommunication traffic Video on demand |
| title | Deadline credit scheduling policy for prerecorded sources |
| 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%3A26%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Deadline%20credit%20scheduling%20policy%20for%20prerecorded%20sources&rft.btitle=Seamless%20Interconnection%20for%20Universal%20Services.%20Global%20Telecommunications%20Conference.%20GLOBECOM'99.%20(Cat.%20No.99CH37042)&rft.au=Antoniou,%20Z.&rft.date=1999&rft.volume=1A&rft.spage=74&rft.epage=78%20vol.1a&rft.pages=74-78%20vol.1a&rft.isbn=0780357965&rft.isbn_list=9780780357969&rft_id=info:doi/10.1109/GLOCOM.1999.831611&rft_dat=%3Cieee_6IE%3E831611%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=831611&rfr_iscdi=true |