On Providing Non-uniform Scheduling Guarantees in a Wireless Network
Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are of interest despite being sub-optimal, as they allow for more tractable implementation at the expense of some loss in perfo...
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 | 5 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | |
container_volume | |
creator | Bhandari, Vartika Vaidya, Nitin H |
description | Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are of interest despite being sub-optimal, as they allow for more tractable implementation at the expense of some loss in performance. However much of this prior work takes a uniform scaling approach to analyzing scheduling performance, whereby the performance of a scheduling policy is characterized in terms of a single scalar quantity, the efficiency-ratio. While suitable for characterizing worst-case performance, this approach limits one's ability to understand the different extents of performance degradation that may be experienced by different links in a network. Such an understanding is very valuable when average performance is of greater interest than the worst-case, or when certain links are more important than others. Furthermore, once one approaches scheduler design with non-uniform performance guarantees in mind, one finds that simple modifications to well-known scheduling algorithms can yield substantially improved non-uniform scaling results compared to the original algorithms. In this paper, we make a comprehensive case for adopting such an approach by presenting non-uniform scaling results for a set of algorithms that are variants of well-known algorithms from the class of maximal schedulers. |
doi_str_mv | 10.1109/INFCOM.2010.5462269 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5462269</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5462269</ieee_id><sourcerecordid>5462269</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-bb6e5357d2ead35bdd11b62745f1e809847180e20a5056ece0a092aadae5ec093</originalsourceid><addsrcrecordid>eNo1kEtOwzAYhM1LIpScoBtfIMV2_FyiQEulkiABgl3lxH_AkCbISUDcniDKbEb6ZjSLQWhOyYJSYi7W-TIrbheMTEBwyZg0Byg2SlPOOBc61eoQRUxymhit-BE6-w-kPEYRUTxNqJTPpyju-zcyiQs61SN0VbT4LnSf3vn2Beddm4ytr7uww_fVK7ix-cWr0QbbDgA99i22-MkHaKDvcQ7DVxfez9FJbZse4r3P0OPy-iG7STbFap1dbhJPlRiSspQgUqEcA-tSUTpHaSmZ4qKmoInRXFFNgBEriJBQAbHEMGudBQEVMekMzf92PQBsP4Lf2fC93R-S_gAs0lBb</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On Providing Non-uniform Scheduling Guarantees in a Wireless Network</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bhandari, Vartika ; Vaidya, Nitin H</creator><creatorcontrib>Bhandari, Vartika ; Vaidya, Nitin H</creatorcontrib><description>Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are of interest despite being sub-optimal, as they allow for more tractable implementation at the expense of some loss in performance. However much of this prior work takes a uniform scaling approach to analyzing scheduling performance, whereby the performance of a scheduling policy is characterized in terms of a single scalar quantity, the efficiency-ratio. While suitable for characterizing worst-case performance, this approach limits one's ability to understand the different extents of performance degradation that may be experienced by different links in a network. Such an understanding is very valuable when average performance is of greater interest than the worst-case, or when certain links are more important than others. Furthermore, once one approaches scheduler design with non-uniform performance guarantees in mind, one finds that simple modifications to well-known scheduling algorithms can yield substantially improved non-uniform scaling results compared to the original algorithms. In this paper, we make a comprehensive case for adopting such an approach by presenting non-uniform scaling results for a set of algorithms that are variants of well-known algorithms from the class of maximal schedulers.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 1424458366</identifier><identifier>ISBN: 9781424458363</identifier><identifier>EISSN: 2641-9874</identifier><identifier>EISBN: 9781424458387</identifier><identifier>EISBN: 1424458374</identifier><identifier>EISBN: 1424458382</identifier><identifier>EISBN: 9781424458370</identifier><identifier>DOI: 10.1109/INFCOM.2010.5462269</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Communications Society ; Degradation ; Media Access Protocol ; Performance analysis ; Performance loss ; Scheduling algorithm ; Stability ; Throughput ; Wireless networks</subject><ispartof>2010 Proceedings IEEE INFOCOM, 2010, p.1-5</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/5462269$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,781,785,790,791,2059,27929,54924</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5462269$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bhandari, Vartika</creatorcontrib><creatorcontrib>Vaidya, Nitin H</creatorcontrib><title>On Providing Non-uniform Scheduling Guarantees in a Wireless Network</title><title>2010 Proceedings IEEE INFOCOM</title><addtitle>INFCOM</addtitle><description>Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are of interest despite being sub-optimal, as they allow for more tractable implementation at the expense of some loss in performance. However much of this prior work takes a uniform scaling approach to analyzing scheduling performance, whereby the performance of a scheduling policy is characterized in terms of a single scalar quantity, the efficiency-ratio. While suitable for characterizing worst-case performance, this approach limits one's ability to understand the different extents of performance degradation that may be experienced by different links in a network. Such an understanding is very valuable when average performance is of greater interest than the worst-case, or when certain links are more important than others. Furthermore, once one approaches scheduler design with non-uniform performance guarantees in mind, one finds that simple modifications to well-known scheduling algorithms can yield substantially improved non-uniform scaling results compared to the original algorithms. In this paper, we make a comprehensive case for adopting such an approach by presenting non-uniform scaling results for a set of algorithms that are variants of well-known algorithms from the class of maximal schedulers.</description><subject>Algorithm design and analysis</subject><subject>Communications Society</subject><subject>Degradation</subject><subject>Media Access Protocol</subject><subject>Performance analysis</subject><subject>Performance loss</subject><subject>Scheduling algorithm</subject><subject>Stability</subject><subject>Throughput</subject><subject>Wireless networks</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>1424458366</isbn><isbn>9781424458363</isbn><isbn>9781424458387</isbn><isbn>1424458374</isbn><isbn>1424458382</isbn><isbn>9781424458370</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kEtOwzAYhM1LIpScoBtfIMV2_FyiQEulkiABgl3lxH_AkCbISUDcniDKbEb6ZjSLQWhOyYJSYi7W-TIrbheMTEBwyZg0Byg2SlPOOBc61eoQRUxymhit-BE6-w-kPEYRUTxNqJTPpyju-zcyiQs61SN0VbT4LnSf3vn2Beddm4ytr7uww_fVK7ix-cWr0QbbDgA99i22-MkHaKDvcQ7DVxfez9FJbZse4r3P0OPy-iG7STbFap1dbhJPlRiSspQgUqEcA-tSUTpHaSmZ4qKmoInRXFFNgBEriJBQAbHEMGudBQEVMekMzf92PQBsP4Lf2fC93R-S_gAs0lBb</recordid><startdate>201003</startdate><enddate>201003</enddate><creator>Bhandari, Vartika</creator><creator>Vaidya, Nitin H</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201003</creationdate><title>On Providing Non-uniform Scheduling Guarantees in a Wireless Network</title><author>Bhandari, Vartika ; Vaidya, Nitin H</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-bb6e5357d2ead35bdd11b62745f1e809847180e20a5056ece0a092aadae5ec093</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithm design and analysis</topic><topic>Communications Society</topic><topic>Degradation</topic><topic>Media Access Protocol</topic><topic>Performance analysis</topic><topic>Performance loss</topic><topic>Scheduling algorithm</topic><topic>Stability</topic><topic>Throughput</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Bhandari, Vartika</creatorcontrib><creatorcontrib>Vaidya, Nitin H</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>Bhandari, Vartika</au><au>Vaidya, Nitin H</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On Providing Non-uniform Scheduling Guarantees in a Wireless Network</atitle><btitle>2010 Proceedings IEEE INFOCOM</btitle><stitle>INFCOM</stitle><date>2010-03</date><risdate>2010</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>1424458366</isbn><isbn>9781424458363</isbn><eisbn>9781424458387</eisbn><eisbn>1424458374</eisbn><eisbn>1424458382</eisbn><eisbn>9781424458370</eisbn><abstract>Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are of interest despite being sub-optimal, as they allow for more tractable implementation at the expense of some loss in performance. However much of this prior work takes a uniform scaling approach to analyzing scheduling performance, whereby the performance of a scheduling policy is characterized in terms of a single scalar quantity, the efficiency-ratio. While suitable for characterizing worst-case performance, this approach limits one's ability to understand the different extents of performance degradation that may be experienced by different links in a network. Such an understanding is very valuable when average performance is of greater interest than the worst-case, or when certain links are more important than others. Furthermore, once one approaches scheduler design with non-uniform performance guarantees in mind, one finds that simple modifications to well-known scheduling algorithms can yield substantially improved non-uniform scaling results compared to the original algorithms. In this paper, we make a comprehensive case for adopting such an approach by presenting non-uniform scaling results for a set of algorithms that are variants of well-known algorithms from the class of maximal schedulers.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.2010.5462269</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0743-166X |
ispartof | 2010 Proceedings IEEE INFOCOM, 2010, p.1-5 |
issn | 0743-166X 2641-9874 |
language | eng |
recordid | cdi_ieee_primary_5462269 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Algorithm design and analysis Communications Society Degradation Media Access Protocol Performance analysis Performance loss Scheduling algorithm Stability Throughput Wireless networks |
title | On Providing Non-uniform Scheduling Guarantees in a Wireless Network |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T08%3A44%3A46IST&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=On%20Providing%20Non-uniform%20Scheduling%20Guarantees%20in%20a%20Wireless%20Network&rft.btitle=2010%20Proceedings%20IEEE%20INFOCOM&rft.au=Bhandari,%20Vartika&rft.date=2010-03&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=1424458366&rft.isbn_list=9781424458363&rft_id=info:doi/10.1109/INFCOM.2010.5462269&rft_dat=%3Cieee_6IE%3E5462269%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424458387&rft.eisbn_list=1424458374&rft.eisbn_list=1424458382&rft.eisbn_list=9781424458370&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5462269&rfr_iscdi=true |