Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications pose special channel-specific problems such as time-varying link capacities and location-dependent errors. These proble...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on wireless communications 2008-06, Vol.7 (6), p.2094-2105 |
|---|---|
| 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 | 2105 |
|---|---|
| container_issue | 6 |
| container_start_page | 2094 |
| container_title | IEEE transactions on wireless communications |
| container_volume | 7 |
| creator | Yaxin Cao Ka-Cheong Leung Li, V.O.K. |
| description | Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications pose special channel-specific problems such as time-varying link capacities and location-dependent errors. These problems make designing efficient and effective traffic scheduling algorithms for wireless networks very challenging. Although many wireless packet scheduling algorithms have been proposed in recent years, issues such as how to improve bandwidth efficiency and maintain goodput fairness with various link qualities for power-constrained mobile hosts remain unresolved. In this paper, we devise a simple wireless packet scheduling algorithm called bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation (BGFS-EBA), which addresses these issues. Our studies reveal that BGFS-EBA effectively distributes excess bandwidth, strikes a balance between effort-fair and outcome- fair, and provides a delay bound for error-free flows and transmission effort guarantees for error-prone flows. |
| doi_str_mv | 10.1109/TWC.2008.05650 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TWC_2008_05650</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4543062</ieee_id><sourcerecordid>875066930</sourcerecordid><originalsourceid>FETCH-LOGICAL-c451t-21d2eb3234fd567b153daeecb58d2d5801226850f1546fa01d7733425cf7a9723</originalsourceid><addsrcrecordid>eNqFkT1vFDEQhlcIJEKgpaGxkIBqj_G3twynS0CKoCAopeWzx5zDZjfYuxz8e7xcdAUFVGNpnnc8o6dpnlNYUQrd26vr9YoBmBVIJeFBc0KlNC1jwjxc3ly1lGn1uHlSyg0A1UrKkwbfuSHsU5h27cXsshsmxEDOXcrks99hmPs0fCX7NO3IJkb0U_qBZPPTYynkGCVnfT96N6VxIHHM5Dpl7BfiI077MX8rT5tH0fUFn93X0-bL-eZq_b69_HTxYX122Xoh6dQyGhhuOeMiBqn0ti4dHKLfShNYkAYoY8pIiFQKFR3QoDXngkkftes046fNm8Pcuzx-n7FM9jYVj33vBhznYjvginEtuv-SRktQquNQydf_JLnghkowFXz5F3gzznmo91qj6pYM2PLv6gD5PJaSMdq7nG5d_mUp2EWjrRrtotH-0VgDr-6nuuJdH6sin8oxxUDQjlFeuRcHLiHisS2k4FBP_g1VwaRM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>863422029</pqid></control><display><type>article</type><title>Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks</title><source>IEEE Electronic Library (IEL)</source><creator>Yaxin Cao ; Ka-Cheong Leung ; Li, V.O.K.</creator><creatorcontrib>Yaxin Cao ; Ka-Cheong Leung ; Li, V.O.K.</creatorcontrib><description>Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications pose special channel-specific problems such as time-varying link capacities and location-dependent errors. These problems make designing efficient and effective traffic scheduling algorithms for wireless networks very challenging. Although many wireless packet scheduling algorithms have been proposed in recent years, issues such as how to improve bandwidth efficiency and maintain goodput fairness with various link qualities for power-constrained mobile hosts remain unresolved. In this paper, we devise a simple wireless packet scheduling algorithm called bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation (BGFS-EBA), which addresses these issues. Our studies reveal that BGFS-EBA effectively distributes excess bandwidth, strikes a balance between effort-fair and outcome- fair, and provides a delay bound for error-free flows and transmission effort guarantees for error-prone flows.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2008.05650</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>Piscataway, NJ: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Allocations ; Applied sciences ; Bandwidth ; Base stations ; Channel allocation ; Exact sciences and technology ; Links ; Networks ; Operation, maintenance, reliability ; Organization, operation and development plans ; Processor scheduling ; Quality of service ; Radiocommunications ; Scheduling ; Scheduling algorithm ; Systems, networks and services of telecommunications ; Telecommunication traffic ; Telecommunications ; Telecommunications and information theory ; Teletraffic ; Traffic engineering ; Transmission and modulation (techniques and equipments) ; Wireless communication ; Wireless networks</subject><ispartof>IEEE transactions on wireless communications, 2008-06, Vol.7 (6), p.2094-2105</ispartof><rights>2008 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c451t-21d2eb3234fd567b153daeecb58d2d5801226850f1546fa01d7733425cf7a9723</citedby><cites>FETCH-LOGICAL-c451t-21d2eb3234fd567b153daeecb58d2d5801226850f1546fa01d7733425cf7a9723</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4543062$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4543062$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20419213$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yaxin Cao</creatorcontrib><creatorcontrib>Ka-Cheong Leung</creatorcontrib><creatorcontrib>Li, V.O.K.</creatorcontrib><title>Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications pose special channel-specific problems such as time-varying link capacities and location-dependent errors. These problems make designing efficient and effective traffic scheduling algorithms for wireless networks very challenging. Although many wireless packet scheduling algorithms have been proposed in recent years, issues such as how to improve bandwidth efficiency and maintain goodput fairness with various link qualities for power-constrained mobile hosts remain unresolved. In this paper, we devise a simple wireless packet scheduling algorithm called bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation (BGFS-EBA), which addresses these issues. Our studies reveal that BGFS-EBA effectively distributes excess bandwidth, strikes a balance between effort-fair and outcome- fair, and provides a delay bound for error-free flows and transmission effort guarantees for error-prone flows.</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Allocations</subject><subject>Applied sciences</subject><subject>Bandwidth</subject><subject>Base stations</subject><subject>Channel allocation</subject><subject>Exact sciences and technology</subject><subject>Links</subject><subject>Networks</subject><subject>Operation, maintenance, reliability</subject><subject>Organization, operation and development plans</subject><subject>Processor scheduling</subject><subject>Quality of service</subject><subject>Radiocommunications</subject><subject>Scheduling</subject><subject>Scheduling algorithm</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunication traffic</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teletraffic</subject><subject>Traffic engineering</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Wireless communication</subject><subject>Wireless networks</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqFkT1vFDEQhlcIJEKgpaGxkIBqj_G3twynS0CKoCAopeWzx5zDZjfYuxz8e7xcdAUFVGNpnnc8o6dpnlNYUQrd26vr9YoBmBVIJeFBc0KlNC1jwjxc3ly1lGn1uHlSyg0A1UrKkwbfuSHsU5h27cXsshsmxEDOXcrks99hmPs0fCX7NO3IJkb0U_qBZPPTYynkGCVnfT96N6VxIHHM5Dpl7BfiI077MX8rT5tH0fUFn93X0-bL-eZq_b69_HTxYX122Xoh6dQyGhhuOeMiBqn0ti4dHKLfShNYkAYoY8pIiFQKFR3QoDXngkkftes046fNm8Pcuzx-n7FM9jYVj33vBhznYjvginEtuv-SRktQquNQydf_JLnghkowFXz5F3gzznmo91qj6pYM2PLv6gD5PJaSMdq7nG5d_mUp2EWjrRrtotH-0VgDr-6nuuJdH6sin8oxxUDQjlFeuRcHLiHisS2k4FBP_g1VwaRM</recordid><startdate>20080601</startdate><enddate>20080601</enddate><creator>Yaxin Cao</creator><creator>Ka-Cheong Leung</creator><creator>Li, V.O.K.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</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>20080601</creationdate><title>Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks</title><author>Yaxin Cao ; Ka-Cheong Leung ; Li, V.O.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c451t-21d2eb3234fd567b153daeecb58d2d5801226850f1546fa01d7733425cf7a9723</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Allocations</topic><topic>Applied sciences</topic><topic>Bandwidth</topic><topic>Base stations</topic><topic>Channel allocation</topic><topic>Exact sciences and technology</topic><topic>Links</topic><topic>Networks</topic><topic>Operation, maintenance, reliability</topic><topic>Organization, operation and development plans</topic><topic>Processor scheduling</topic><topic>Quality of service</topic><topic>Radiocommunications</topic><topic>Scheduling</topic><topic>Scheduling algorithm</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunication traffic</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teletraffic</topic><topic>Traffic engineering</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Wireless communication</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yaxin Cao</creatorcontrib><creatorcontrib>Ka-Cheong Leung</creatorcontrib><creatorcontrib>Li, V.O.K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</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 transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yaxin Cao</au><au>Ka-Cheong Leung</au><au>Li, V.O.K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2008-06-01</date><risdate>2008</risdate><volume>7</volume><issue>6</issue><spage>2094</spage><epage>2105</epage><pages>2094-2105</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications pose special channel-specific problems such as time-varying link capacities and location-dependent errors. These problems make designing efficient and effective traffic scheduling algorithms for wireless networks very challenging. Although many wireless packet scheduling algorithms have been proposed in recent years, issues such as how to improve bandwidth efficiency and maintain goodput fairness with various link qualities for power-constrained mobile hosts remain unresolved. In this paper, we devise a simple wireless packet scheduling algorithm called bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation (BGFS-EBA), which addresses these issues. Our studies reveal that BGFS-EBA effectively distributes excess bandwidth, strikes a balance between effort-fair and outcome- fair, and provides a delay bound for error-free flows and transmission effort guarantees for error-prone flows.</abstract><cop>Piscataway, NJ</cop><pub>IEEE</pub><doi>10.1109/TWC.2008.05650</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1536-1276 |
| ispartof | IEEE transactions on wireless communications, 2008-06, Vol.7 (6), p.2094-2105 |
| issn | 1536-1276 1558-2248 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TWC_2008_05650 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Algorithms Allocations Applied sciences Bandwidth Base stations Channel allocation Exact sciences and technology Links Networks Operation, maintenance, reliability Organization, operation and development plans Processor scheduling Quality of service Radiocommunications Scheduling Scheduling algorithm Systems, networks and services of telecommunications Telecommunication traffic Telecommunications Telecommunications and information theory Teletraffic Traffic engineering Transmission and modulation (techniques and equipments) Wireless communication Wireless networks |
| title | Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-20T08%3A50%3A43IST&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=Bandwidth-Guaranteed%20Fair%20Scheduling%20with%20Effective%20Excess%20Bandwidth%20Allocation%20for%20Wireless%20Networks&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Yaxin%20Cao&rft.date=2008-06-01&rft.volume=7&rft.issue=6&rft.spage=2094&rft.epage=2105&rft.pages=2094-2105&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2008.05650&rft_dat=%3Cproquest_RIE%3E875066930%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=863422029&rft_id=info:pmid/&rft_ieee_id=4543062&rfr_iscdi=true |