Dynamic quality of service control in packet switch scheduling
Recent research in packet switch scheduling algorithms has moved beyond throughput maximization to quality of service (QoS) control. Several classes of algorithms have been shown to achieve maximal throughput under certain system conditions. Between classes and within each class, QoS performance var...
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 | 401 Vol. 1 |
|---|---|
| container_issue | |
| container_start_page | 396 |
| container_title | |
| container_volume | 1 |
| creator | Ross, K. Bambos, N. |
| description | Recent research in packet switch scheduling algorithms has moved beyond throughput maximization to quality of service (QoS) control. Several classes of algorithms have been shown to achieve maximal throughput under certain system conditions. Between classes and within each class, QoS performance varies based on arrival traffic and properties of the scheduling algorithm being utilized. Here we compare two classes of throughput-maximizing algorithms and their performance with respect to buffer sizes. These classes are randomized algorithms, which can be characterized as offline algorithms, and projective cone scheduling algorithms, which are online since they respond to the current workload in the system. In each class, parameters can be fine-tuned to reflect the priorities of individual switch ports. We show how the online algorithms lead to significantly better quality of service performance. |
| doi_str_mv | 10.1109/ICC.2005.1494382 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1494382</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1494382</ieee_id><sourcerecordid>1494382</sourcerecordid><originalsourceid>FETCH-LOGICAL-i105t-1efec73526c7421d8d1edf1c51a35d2ac873af2b25ccd667111c8e3cb489b4463</originalsourceid><addsrcrecordid>eNotj0tLw0AUhQcfYFvdC27mDyTOnUdmshEkvgoFN7oukzs3djRNaiZV8u8t2NWB83E-OIxdg8gBRHm7rKpcCmFy0KVWTp6wGZTKZeCcOmVzYZ1Q7lDYswMwRmSqEPaCzVP6PKxkqWDG7h6mzm8j8u-9b-M48b7hiYafiMSx78ahb3ns-M7jF408_cYRNzzhhsK-jd3HJTtvfJvo6pgL9v70-Fa9ZKvX52V1v8oiCDNmQA2hVUYWaLWE4AJQaAANeGWC9Ois8o2spUEMRWEBAB0prLUra60LtWA3_95IROvdELd-mNbH3-oPgSZKQg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Dynamic quality of service control in packet switch scheduling</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ross, K. ; Bambos, N.</creator><creatorcontrib>Ross, K. ; Bambos, N.</creatorcontrib><description>Recent research in packet switch scheduling algorithms has moved beyond throughput maximization to quality of service (QoS) control. Several classes of algorithms have been shown to achieve maximal throughput under certain system conditions. Between classes and within each class, QoS performance varies based on arrival traffic and properties of the scheduling algorithm being utilized. Here we compare two classes of throughput-maximizing algorithms and their performance with respect to buffer sizes. These classes are randomized algorithms, which can be characterized as offline algorithms, and projective cone scheduling algorithms, which are online since they respond to the current workload in the system. In each class, parameters can be fine-tuned to reflect the priorities of individual switch ports. We show how the online algorithms lead to significantly better quality of service performance.</description><identifier>ISSN: 1550-3607</identifier><identifier>ISBN: 0780389387</identifier><identifier>ISBN: 9780780389380</identifier><identifier>EISSN: 1938-1883</identifier><identifier>DOI: 10.1109/ICC.2005.1494382</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Delay ; Dynamic scheduling ; Packet switching ; Personal communication networks ; Quality of service ; Scheduling algorithm ; Switches ; Telecommunication traffic ; Throughput</subject><ispartof>IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005, Vol.1, p.396-401 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/1494382$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1494382$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ross, K.</creatorcontrib><creatorcontrib>Bambos, N.</creatorcontrib><title>Dynamic quality of service control in packet switch scheduling</title><title>IEEE International Conference on Communications, 2005. ICC 2005. 2005</title><addtitle>ICC</addtitle><description>Recent research in packet switch scheduling algorithms has moved beyond throughput maximization to quality of service (QoS) control. Several classes of algorithms have been shown to achieve maximal throughput under certain system conditions. Between classes and within each class, QoS performance varies based on arrival traffic and properties of the scheduling algorithm being utilized. Here we compare two classes of throughput-maximizing algorithms and their performance with respect to buffer sizes. These classes are randomized algorithms, which can be characterized as offline algorithms, and projective cone scheduling algorithms, which are online since they respond to the current workload in the system. In each class, parameters can be fine-tuned to reflect the priorities of individual switch ports. We show how the online algorithms lead to significantly better quality of service performance.</description><subject>Algorithm design and analysis</subject><subject>Delay</subject><subject>Dynamic scheduling</subject><subject>Packet switching</subject><subject>Personal communication networks</subject><subject>Quality of service</subject><subject>Scheduling algorithm</subject><subject>Switches</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>0780389387</isbn><isbn>9780780389380</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj0tLw0AUhQcfYFvdC27mDyTOnUdmshEkvgoFN7oukzs3djRNaiZV8u8t2NWB83E-OIxdg8gBRHm7rKpcCmFy0KVWTp6wGZTKZeCcOmVzYZ1Q7lDYswMwRmSqEPaCzVP6PKxkqWDG7h6mzm8j8u-9b-M48b7hiYafiMSx78ahb3ns-M7jF408_cYRNzzhhsK-jd3HJTtvfJvo6pgL9v70-Fa9ZKvX52V1v8oiCDNmQA2hVUYWaLWE4AJQaAANeGWC9Ois8o2spUEMRWEBAB0prLUra60LtWA3_95IROvdELd-mNbH3-oPgSZKQg</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Ross, K.</creator><creator>Bambos, N.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>Dynamic quality of service control in packet switch scheduling</title><author>Ross, K. ; Bambos, N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i105t-1efec73526c7421d8d1edf1c51a35d2ac873af2b25ccd667111c8e3cb489b4463</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithm design and analysis</topic><topic>Delay</topic><topic>Dynamic scheduling</topic><topic>Packet switching</topic><topic>Personal communication networks</topic><topic>Quality of service</topic><topic>Scheduling algorithm</topic><topic>Switches</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><toplevel>online_resources</toplevel><creatorcontrib>Ross, K.</creatorcontrib><creatorcontrib>Bambos, N.</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>Ross, K.</au><au>Bambos, N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Dynamic quality of service control in packet switch scheduling</atitle><btitle>IEEE International Conference on Communications, 2005. ICC 2005. 2005</btitle><stitle>ICC</stitle><date>2005</date><risdate>2005</risdate><volume>1</volume><spage>396</spage><epage>401 Vol. 1</epage><pages>396-401 Vol. 1</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><isbn>0780389387</isbn><isbn>9780780389380</isbn><abstract>Recent research in packet switch scheduling algorithms has moved beyond throughput maximization to quality of service (QoS) control. Several classes of algorithms have been shown to achieve maximal throughput under certain system conditions. Between classes and within each class, QoS performance varies based on arrival traffic and properties of the scheduling algorithm being utilized. Here we compare two classes of throughput-maximizing algorithms and their performance with respect to buffer sizes. These classes are randomized algorithms, which can be characterized as offline algorithms, and projective cone scheduling algorithms, which are online since they respond to the current workload in the system. In each class, parameters can be fine-tuned to reflect the priorities of individual switch ports. We show how the online algorithms lead to significantly better quality of service performance.</abstract><pub>IEEE</pub><doi>10.1109/ICC.2005.1494382</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1550-3607 |
| ispartof | IEEE International Conference on Communications, 2005. ICC 2005. 2005, 2005, Vol.1, p.396-401 Vol. 1 |
| issn | 1550-3607 1938-1883 |
| language | eng |
| recordid | cdi_ieee_primary_1494382 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Delay Dynamic scheduling Packet switching Personal communication networks Quality of service Scheduling algorithm Switches Telecommunication traffic Throughput |
| title | Dynamic quality of service control in packet switch scheduling |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T03%3A06%3A33IST&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=Dynamic%20quality%20of%20service%20control%20in%20packet%20switch%20scheduling&rft.btitle=IEEE%20International%20Conference%20on%20Communications,%202005.%20ICC%202005.%202005&rft.au=Ross,%20K.&rft.date=2005&rft.volume=1&rft.spage=396&rft.epage=401%20Vol.%201&rft.pages=396-401%20Vol.%201&rft.issn=1550-3607&rft.eissn=1938-1883&rft.isbn=0780389387&rft.isbn_list=9780780389380&rft_id=info:doi/10.1109/ICC.2005.1494382&rft_dat=%3Cieee_6IE%3E1494382%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=1494382&rfr_iscdi=true |