Scheduling deadline driven packet flows in HiperAccess
Wireless communication systems are by nature and by regulations limited in bandwidth and hence capacity. Services with high demands on quality of service (QoS) will enforce high demands on the available capacity. This observation motivates the development of schedulers that can deliver the required...
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 | 113 vol.1 |
|---|---|
| container_issue | |
| container_start_page | 108 |
| container_title | |
| container_volume | |
| creator | Holmberg, T. Karlsson, J.M. |
| description | Wireless communication systems are by nature and by regulations limited in bandwidth and hence capacity. Services with high demands on quality of service (QoS) will enforce high demands on the available capacity. This observation motivates the development of schedulers that can deliver the required QoS as well as being resource efficient. In this paper, we provide expressions of the worst case delivery time for schedulers based in the first in first out (FIFO) and the earliest due-date (EDD) principles which are applied to the HiperAccess point-to-multipoint radio communication system. Further, we propose modifications of the schedulers, which are more resource efficient at the expense of rare deadline misses. Despite the deadline misses, the modified scheduling algorithms can still provide an average delivery time well within the required deadline. |
| doi_str_mv | 10.1109/ISCC.2003.1214109 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>swepub_6IE</sourceid><recordid>TN_cdi_ieee_primary_1214109</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1214109</ieee_id><sourcerecordid>oai_lup_lub_lu_se_72186350_43ca_42b9_b99e_df0161ba78d6</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1596-7af97fa979989b27e9ae02de0b6ed05a4eb3a40f0c3f5bb10e30c10ae6c7f6823</originalsourceid><addsrcrecordid>eNo9kMtOwzAURC0eEqX0AxCb_EDKtZ3YucsqAlqpEovC2vLjGgyhjWJKxd8TqRWLoxnN4iyGsVsOc84B71ebtp0LADnnglfjcsYmQlWi1LLBczZD3YBWWHNUXF2wCa8llFxW6opd5_wBAE0t9ISpjX-nsO_S9q0IZMNYqAhD-qFt0Vv_Sd9F7HaHXKRtsUw9DQvvKecbdhltl2l2yil7fXx4aZfl-vlp1S7WZeI1qlLbiDpa1IgNOqEJLYEIBE5RgNpW5KStIIKXsXaOA0nwHCwpr6NqhJyy9dGbD9TvnemH9GWHX7OzyXT7fsSNmExGC94oWYOppLemEg6NQyQTInDFndVNUKPu7qhLRPQvOz0o_wBJMmGu</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Scheduling deadline driven packet flows in HiperAccess</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Holmberg, T. ; Karlsson, J.M.</creator><creatorcontrib>Holmberg, T. ; Karlsson, J.M.</creatorcontrib><description>Wireless communication systems are by nature and by regulations limited in bandwidth and hence capacity. Services with high demands on quality of service (QoS) will enforce high demands on the available capacity. This observation motivates the development of schedulers that can deliver the required QoS as well as being resource efficient. In this paper, we provide expressions of the worst case delivery time for schedulers based in the first in first out (FIFO) and the earliest due-date (EDD) principles which are applied to the HiperAccess point-to-multipoint radio communication system. Further, we propose modifications of the schedulers, which are more resource efficient at the expense of rare deadline misses. Despite the deadline misses, the modified scheduling algorithms can still provide an average delivery time well within the required deadline.</description><identifier>ISSN: 1530-1346</identifier><identifier>ISBN: 9780769519616</identifier><identifier>ISBN: 076951961X</identifier><identifier>EISSN: 2642-7389</identifier><identifier>DOI: 10.1109/ISCC.2003.1214109</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Communication Systems ; deadline misses ; Delay ; earliest due-date ; Electrical Engineering, Electronic Engineering, Information Engineering ; Elektroteknik och elektronik ; Engineering and Technology ; FIFO scheduling ; first in first out ; HiperAccess ; Kommunikationssystem ; Packet radio networks ; point-to-multipoint radio communication system ; Processor scheduling ; QoS ; Quality of service ; Radio communication ; resource efficiency ; Scheduling algorithm ; scheduling deadline driven packet flows ; system capacity ; Teknik ; Throughput ; Wireless communication ; wireless communication systems ; Wireless LAN ; worst case delivery time</subject><ispartof>ISCC 2003 - International Symposium on Computers and Communications,Kemer-Antalya, Turkey,2003-06-30 - 2003-07-03, 2003, p.108-113 vol.1</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/1214109$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,309,310,780,784,789,790,885,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1214109$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://lup.lub.lu.se/record/612395$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><creatorcontrib>Holmberg, T.</creatorcontrib><creatorcontrib>Karlsson, J.M.</creatorcontrib><title>Scheduling deadline driven packet flows in HiperAccess</title><title>ISCC 2003 - International Symposium on Computers and Communications,Kemer-Antalya, Turkey,2003-06-30 - 2003-07-03</title><addtitle>ISCC</addtitle><description>Wireless communication systems are by nature and by regulations limited in bandwidth and hence capacity. Services with high demands on quality of service (QoS) will enforce high demands on the available capacity. This observation motivates the development of schedulers that can deliver the required QoS as well as being resource efficient. In this paper, we provide expressions of the worst case delivery time for schedulers based in the first in first out (FIFO) and the earliest due-date (EDD) principles which are applied to the HiperAccess point-to-multipoint radio communication system. Further, we propose modifications of the schedulers, which are more resource efficient at the expense of rare deadline misses. Despite the deadline misses, the modified scheduling algorithms can still provide an average delivery time well within the required deadline.</description><subject>Bandwidth</subject><subject>Communication Systems</subject><subject>deadline misses</subject><subject>Delay</subject><subject>earliest due-date</subject><subject>Electrical Engineering, Electronic Engineering, Information Engineering</subject><subject>Elektroteknik och elektronik</subject><subject>Engineering and Technology</subject><subject>FIFO scheduling</subject><subject>first in first out</subject><subject>HiperAccess</subject><subject>Kommunikationssystem</subject><subject>Packet radio networks</subject><subject>point-to-multipoint radio communication system</subject><subject>Processor scheduling</subject><subject>QoS</subject><subject>Quality of service</subject><subject>Radio communication</subject><subject>resource efficiency</subject><subject>Scheduling algorithm</subject><subject>scheduling deadline driven packet flows</subject><subject>system capacity</subject><subject>Teknik</subject><subject>Throughput</subject><subject>Wireless communication</subject><subject>wireless communication systems</subject><subject>Wireless LAN</subject><subject>worst case delivery time</subject><issn>1530-1346</issn><issn>2642-7389</issn><isbn>9780769519616</isbn><isbn>076951961X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kMtOwzAURC0eEqX0AxCb_EDKtZ3YucsqAlqpEovC2vLjGgyhjWJKxd8TqRWLoxnN4iyGsVsOc84B71ebtp0LADnnglfjcsYmQlWi1LLBczZD3YBWWHNUXF2wCa8llFxW6opd5_wBAE0t9ISpjX-nsO_S9q0IZMNYqAhD-qFt0Vv_Sd9F7HaHXKRtsUw9DQvvKecbdhltl2l2yil7fXx4aZfl-vlp1S7WZeI1qlLbiDpa1IgNOqEJLYEIBE5RgNpW5KStIIKXsXaOA0nwHCwpr6NqhJyy9dGbD9TvnemH9GWHX7OzyXT7fsSNmExGC94oWYOppLemEg6NQyQTInDFndVNUKPu7qhLRPQvOz0o_wBJMmGu</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Holmberg, T.</creator><creator>Karlsson, J.M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>ADTPV</scope><scope>BNKNJ</scope><scope>D95</scope></search><sort><creationdate>2003</creationdate><title>Scheduling deadline driven packet flows in HiperAccess</title><author>Holmberg, T. ; Karlsson, J.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1596-7af97fa979989b27e9ae02de0b6ed05a4eb3a40f0c3f5bb10e30c10ae6c7f6823</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Bandwidth</topic><topic>Communication Systems</topic><topic>deadline misses</topic><topic>Delay</topic><topic>earliest due-date</topic><topic>Electrical Engineering, Electronic Engineering, Information Engineering</topic><topic>Elektroteknik och elektronik</topic><topic>Engineering and Technology</topic><topic>FIFO scheduling</topic><topic>first in first out</topic><topic>HiperAccess</topic><topic>Kommunikationssystem</topic><topic>Packet radio networks</topic><topic>point-to-multipoint radio communication system</topic><topic>Processor scheduling</topic><topic>QoS</topic><topic>Quality of service</topic><topic>Radio communication</topic><topic>resource efficiency</topic><topic>Scheduling algorithm</topic><topic>scheduling deadline driven packet flows</topic><topic>system capacity</topic><topic>Teknik</topic><topic>Throughput</topic><topic>Wireless communication</topic><topic>wireless communication systems</topic><topic>Wireless LAN</topic><topic>worst case delivery time</topic><toplevel>online_resources</toplevel><creatorcontrib>Holmberg, T.</creatorcontrib><creatorcontrib>Karlsson, J.M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>SwePub</collection><collection>SwePub Conference</collection><collection>SWEPUB Lunds universitet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Holmberg, T.</au><au>Karlsson, J.M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Scheduling deadline driven packet flows in HiperAccess</atitle><btitle>ISCC 2003 - International Symposium on Computers and Communications,Kemer-Antalya, Turkey,2003-06-30 - 2003-07-03</btitle><stitle>ISCC</stitle><date>2003</date><risdate>2003</risdate><spage>108</spage><epage>113 vol.1</epage><pages>108-113 vol.1</pages><issn>1530-1346</issn><eissn>2642-7389</eissn><isbn>9780769519616</isbn><isbn>076951961X</isbn><abstract>Wireless communication systems are by nature and by regulations limited in bandwidth and hence capacity. Services with high demands on quality of service (QoS) will enforce high demands on the available capacity. This observation motivates the development of schedulers that can deliver the required QoS as well as being resource efficient. In this paper, we provide expressions of the worst case delivery time for schedulers based in the first in first out (FIFO) and the earliest due-date (EDD) principles which are applied to the HiperAccess point-to-multipoint radio communication system. Further, we propose modifications of the schedulers, which are more resource efficient at the expense of rare deadline misses. Despite the deadline misses, the modified scheduling algorithms can still provide an average delivery time well within the required deadline.</abstract><pub>IEEE</pub><doi>10.1109/ISCC.2003.1214109</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1530-1346 |
| ispartof | ISCC 2003 - International Symposium on Computers and Communications,Kemer-Antalya, Turkey,2003-06-30 - 2003-07-03, 2003, p.108-113 vol.1 |
| issn | 1530-1346 2642-7389 |
| language | eng |
| recordid | cdi_ieee_primary_1214109 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Bandwidth Communication Systems deadline misses Delay earliest due-date Electrical Engineering, Electronic Engineering, Information Engineering Elektroteknik och elektronik Engineering and Technology FIFO scheduling first in first out HiperAccess Kommunikationssystem Packet radio networks point-to-multipoint radio communication system Processor scheduling QoS Quality of service Radio communication resource efficiency Scheduling algorithm scheduling deadline driven packet flows system capacity Teknik Throughput Wireless communication wireless communication systems Wireless LAN worst case delivery time |
| title | Scheduling deadline driven packet flows in HiperAccess |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-31T00%3A26%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-swepub_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Scheduling%20deadline%20driven%20packet%20flows%20in%20HiperAccess&rft.btitle=ISCC%202003%20-%20International%20Symposium%20on%20Computers%20and%20Communications,Kemer-Antalya,%20Turkey,2003-06-30%20-%202003-07-03&rft.au=Holmberg,%20T.&rft.date=2003&rft.spage=108&rft.epage=113%20vol.1&rft.pages=108-113%20vol.1&rft.issn=1530-1346&rft.eissn=2642-7389&rft.isbn=9780769519616&rft.isbn_list=076951961X&rft_id=info:doi/10.1109/ISCC.2003.1214109&rft_dat=%3Cswepub_6IE%3Eoai_lup_lub_lu_se_72186350_43ca_42b9_b99e_df0161ba78d6%3C/swepub_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=1214109&rfr_iscdi=true |