Providing multiple service classes for bursty data traffic in cellular networks
This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traffic. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE (Enhanced data rate...
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 | 1096 vol.3 |
|---|---|
| container_issue | |
| container_start_page | 1087 |
| container_title | |
| container_volume | 3 |
| creator | Zhimei Jiang Li Fung Chang Shankaranarayanan, N.K. |
| description | This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traffic. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE (Enhanced data rate for GSM evolution) system. The results show that, due to the burstiness of data traffic, traditional work-conserving packet scheduling algorithms such as weighted fair queueing cannot achieve the desired performance unless the system is heavily loaded. Similar results hold even when using priority queueing, which is an extreme form of weighted fair queueing. We also find that best effort traffic should be managed carefully to avoid inefficient usage of the network, especially in a low capacity cellular environment. |
| doi_str_mv | 10.1109/INFCOM.2000.832462 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_832462</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>832462</ieee_id><sourcerecordid>832462</sourcerecordid><originalsourceid>FETCH-LOGICAL-i87t-ff6a061b47e3ae00b13a1fc7c6cd1678c06ea7f062b5b6eec32bd52ec02454a13</originalsourceid><addsrcrecordid>eNotkMtqAjEYRkMv0MH6Aq7yAmP_3DPLIrUVbKcLF91JJvOnpI0XktHi21dQ-OCszll8hEwYTBmD5mnxMZ-171MOAFMruNT8hlRcS1Y31shbMm6MhfOEshbUHanASFEzrb8eyLiUn7MHUjGuVUXaz7w7xj5uv-nmkIa4T0gL5mP0SH1ypWChYZdpd8hlONHeDY4O2YUQPY1b6jGlQ3KZbnH42-Xf8kjug0sFx1eOyGr-spq91cv2dTF7XtbRmqEOQTvQrJMGhUOAjgnHgjde-55pYz1odCaA5p3qNKIXvOsVRw9cKumYGJHJJRsRcb3PcePyaX05Q_wDoSNS_g</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Providing multiple service classes for bursty data traffic in cellular networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhimei Jiang ; Li Fung Chang ; Shankaranarayanan, N.K.</creator><creatorcontrib>Zhimei Jiang ; Li Fung Chang ; Shankaranarayanan, N.K.</creatorcontrib><description>This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traffic. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE (Enhanced data rate for GSM evolution) system. The results show that, due to the burstiness of data traffic, traditional work-conserving packet scheduling algorithms such as weighted fair queueing cannot achieve the desired performance unless the system is heavily loaded. Similar results hold even when using priority queueing, which is an extreme form of weighted fair queueing. We also find that best effort traffic should be managed carefully to avoid inefficient usage of the network, especially in a low capacity cellular environment.</description><identifier>ISSN: 0743-166X</identifier><identifier>ISBN: 9780780358805</identifier><identifier>ISBN: 0780358805</identifier><identifier>EISSN: 2641-9874</identifier><identifier>DOI: 10.1109/INFCOM.2000.832462</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cellular networks ; Communication system traffic control ; Delay ; Intelligent networks ; Land mobile radio cellular systems ; Quality of service ; Scheduling algorithm ; Telecommunication traffic ; Traffic control ; Wireless networks</subject><ispartof>Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000, Vol.3, p.1087-1096 vol.3</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/832462$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,4036,4037,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/832462$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhimei Jiang</creatorcontrib><creatorcontrib>Li Fung Chang</creatorcontrib><creatorcontrib>Shankaranarayanan, N.K.</creatorcontrib><title>Providing multiple service classes for bursty data traffic in cellular networks</title><title>Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)</title><addtitle>INFCOM</addtitle><description>This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traffic. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE (Enhanced data rate for GSM evolution) system. The results show that, due to the burstiness of data traffic, traditional work-conserving packet scheduling algorithms such as weighted fair queueing cannot achieve the desired performance unless the system is heavily loaded. Similar results hold even when using priority queueing, which is an extreme form of weighted fair queueing. We also find that best effort traffic should be managed carefully to avoid inefficient usage of the network, especially in a low capacity cellular environment.</description><subject>Cellular networks</subject><subject>Communication system traffic control</subject><subject>Delay</subject><subject>Intelligent networks</subject><subject>Land mobile radio cellular systems</subject><subject>Quality of service</subject><subject>Scheduling algorithm</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><subject>Wireless networks</subject><issn>0743-166X</issn><issn>2641-9874</issn><isbn>9780780358805</isbn><isbn>0780358805</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2000</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkMtqAjEYRkMv0MH6Aq7yAmP_3DPLIrUVbKcLF91JJvOnpI0XktHi21dQ-OCszll8hEwYTBmD5mnxMZ-171MOAFMruNT8hlRcS1Y31shbMm6MhfOEshbUHanASFEzrb8eyLiUn7MHUjGuVUXaz7w7xj5uv-nmkIa4T0gL5mP0SH1ypWChYZdpd8hlONHeDY4O2YUQPY1b6jGlQ3KZbnH42-Xf8kjug0sFx1eOyGr-spq91cv2dTF7XtbRmqEOQTvQrJMGhUOAjgnHgjde-55pYz1odCaA5p3qNKIXvOsVRw9cKumYGJHJJRsRcb3PcePyaX05Q_wDoSNS_g</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Zhimei Jiang</creator><creator>Li Fung Chang</creator><creator>Shankaranarayanan, N.K.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2000</creationdate><title>Providing multiple service classes for bursty data traffic in cellular networks</title><author>Zhimei Jiang ; Li Fung Chang ; Shankaranarayanan, N.K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i87t-ff6a061b47e3ae00b13a1fc7c6cd1678c06ea7f062b5b6eec32bd52ec02454a13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Cellular networks</topic><topic>Communication system traffic control</topic><topic>Delay</topic><topic>Intelligent networks</topic><topic>Land mobile radio cellular systems</topic><topic>Quality of service</topic><topic>Scheduling algorithm</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><topic>Wireless networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhimei Jiang</creatorcontrib><creatorcontrib>Li Fung Chang</creatorcontrib><creatorcontrib>Shankaranarayanan, N.K.</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>Zhimei Jiang</au><au>Li Fung Chang</au><au>Shankaranarayanan, N.K.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Providing multiple service classes for bursty data traffic in cellular networks</atitle><btitle>Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)</btitle><stitle>INFCOM</stitle><date>2000</date><risdate>2000</risdate><volume>3</volume><spage>1087</spage><epage>1096 vol.3</epage><pages>1087-1096 vol.3</pages><issn>0743-166X</issn><eissn>2641-9874</eissn><isbn>9780780358805</isbn><isbn>0780358805</isbn><abstract>This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traffic. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE (Enhanced data rate for GSM evolution) system. The results show that, due to the burstiness of data traffic, traditional work-conserving packet scheduling algorithms such as weighted fair queueing cannot achieve the desired performance unless the system is heavily loaded. Similar results hold even when using priority queueing, which is an extreme form of weighted fair queueing. We also find that best effort traffic should be managed carefully to avoid inefficient usage of the network, especially in a low capacity cellular environment.</abstract><pub>IEEE</pub><doi>10.1109/INFCOM.2000.832462</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0743-166X |
| ispartof | Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000, Vol.3, p.1087-1096 vol.3 |
| issn | 0743-166X 2641-9874 |
| language | eng |
| recordid | cdi_ieee_primary_832462 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Cellular networks Communication system traffic control Delay Intelligent networks Land mobile radio cellular systems Quality of service Scheduling algorithm Telecommunication traffic Traffic control Wireless networks |
| title | Providing multiple service classes for bursty data traffic in cellular networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T12%3A37%3A49IST&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=Providing%20multiple%20service%20classes%20for%20bursty%20data%20traffic%20in%20cellular%20networks&rft.btitle=Proceedings%20IEEE%20INFOCOM%202000.%20Conference%20on%20Computer%20Communications.%20Nineteenth%20Annual%20Joint%20Conference%20of%20the%20IEEE%20Computer%20and%20Communications%20Societies%20(Cat.%20No.00CH37064)&rft.au=Zhimei%20Jiang&rft.date=2000&rft.volume=3&rft.spage=1087&rft.epage=1096%20vol.3&rft.pages=1087-1096%20vol.3&rft.issn=0743-166X&rft.eissn=2641-9874&rft.isbn=9780780358805&rft.isbn_list=0780358805&rft_id=info:doi/10.1109/INFCOM.2000.832462&rft_dat=%3Cieee_6IE%3E832462%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=832462&rfr_iscdi=true |