Improved online algorithms for buffer management in QoS switches

Improved online algorithms for buffer management in QoS switches

We consider the following buffer management problem arising in QoS networks: Packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total weight of forwarded packets is maximized. Packets not forwarded before their deadlines are lost. The main re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on algorithms 2007-11, Vol.3 (4), p.50
Hauptverfasser: Chrobak, Marek, Jawor, Wojciech, Sgall, Jiří, Tichý, Tomáš
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 4
container_start_page 50
container_title ACM transactions on algorithms
container_volume 3
creator Chrobak, Marek
Jawor, Wojciech
Sgall, Jiří
Tichý, Tomáš
description We consider the following buffer management problem arising in QoS networks: Packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total weight of forwarded packets is maximized. Packets not forwarded before their deadlines are lost. The main result of the article is an online 64/33 ≈ 1.939-competitive algorithm, the first deterministic algorithm for this problem with competitive ratio below 2. For the 2-uniform case we give an algorithm with ratio ≈ 1.377 and a matching lower bound.
doi_str_mv 10.1145/1290672.1290687
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_34620314</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>34620314</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-d4b180928a5d26818b0811030a78bb1de9925dffbf4ae6f5e81b14694013850c3</originalsourceid><addsrcrecordid>eNo9kE1LAzEYhIMoWKtnrzl52zZvPrbJTSlaCwUR9RyS3Tftyu6mJlvFf2-1xdPMYZgZHkKugU0ApJoCN6yc8cmf6tkJGYGSpiiFEKf_nqtzcpHzO2PCCKFH5HbZbVP8xJrGvm16pK5dx9QMmy7TEBP1uxAw0c71bo0d9gNtevocX2j-aoZqg_mSnAXXZrw66pi8Pdy_zh-L1dNiOb9bFdV-Zyhq6UEzw7VTNS81aM80ABPMzbT3UKMxXNUh-CAdlkGhBg-yNJKB0IpVYkxuDr37ux87zIPtmlxh27oe4y5bIUvOBMh9cHoIVinmnDDYbWo6l74tMPtLyh5J2SMp8QPqg1pi</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>34620314</pqid></control><display><type>article</type><title>Improved online algorithms for buffer management in QoS switches</title><source>ACM Digital Library Complete</source><creator>Chrobak, Marek ; Jawor, Wojciech ; Sgall, Jiří ; Tichý, Tomáš</creator><creatorcontrib>Chrobak, Marek ; Jawor, Wojciech ; Sgall, Jiří ; Tichý, Tomáš</creatorcontrib><description>We consider the following buffer management problem arising in QoS networks: Packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total weight of forwarded packets is maximized. Packets not forwarded before their deadlines are lost. The main result of the article is an online 64/33 ≈ 1.939-competitive algorithm, the first deterministic algorithm for this problem with competitive ratio below 2. For the 2-uniform case we give an algorithm with ratio ≈ 1.377 and a matching lower bound.</description><identifier>ISSN: 1549-6325</identifier><identifier>EISSN: 1549-6333</identifier><identifier>DOI: 10.1145/1290672.1290687</identifier><language>eng</language><ispartof>ACM transactions on algorithms, 2007-11, Vol.3 (4), p.50</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c338t-d4b180928a5d26818b0811030a78bb1de9925dffbf4ae6f5e81b14694013850c3</citedby><cites>FETCH-LOGICAL-c338t-d4b180928a5d26818b0811030a78bb1de9925dffbf4ae6f5e81b14694013850c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Chrobak, Marek</creatorcontrib><creatorcontrib>Jawor, Wojciech</creatorcontrib><creatorcontrib>Sgall, Jiří</creatorcontrib><creatorcontrib>Tichý, Tomáš</creatorcontrib><title>Improved online algorithms for buffer management in QoS switches</title><title>ACM transactions on algorithms</title><description>We consider the following buffer management problem arising in QoS networks: Packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total weight of forwarded packets is maximized. Packets not forwarded before their deadlines are lost. The main result of the article is an online 64/33 ≈ 1.939-competitive algorithm, the first deterministic algorithm for this problem with competitive ratio below 2. For the 2-uniform case we give an algorithm with ratio ≈ 1.377 and a matching lower bound.</description><issn>1549-6325</issn><issn>1549-6333</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LAzEYhIMoWKtnrzl52zZvPrbJTSlaCwUR9RyS3Tftyu6mJlvFf2-1xdPMYZgZHkKugU0ApJoCN6yc8cmf6tkJGYGSpiiFEKf_nqtzcpHzO2PCCKFH5HbZbVP8xJrGvm16pK5dx9QMmy7TEBP1uxAw0c71bo0d9gNtevocX2j-aoZqg_mSnAXXZrw66pi8Pdy_zh-L1dNiOb9bFdV-Zyhq6UEzw7VTNS81aM80ABPMzbT3UKMxXNUh-CAdlkGhBg-yNJKB0IpVYkxuDr37ux87zIPtmlxh27oe4y5bIUvOBMh9cHoIVinmnDDYbWo6l74tMPtLyh5J2SMp8QPqg1pi</recordid><startdate>200711</startdate><enddate>200711</enddate><creator>Chrobak, Marek</creator><creator>Jawor, Wojciech</creator><creator>Sgall, Jiří</creator><creator>Tichý, Tomáš</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200711</creationdate><title>Improved online algorithms for buffer management in QoS switches</title><author>Chrobak, Marek ; Jawor, Wojciech ; Sgall, Jiří ; Tichý, Tomáš</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-d4b180928a5d26818b0811030a78bb1de9925dffbf4ae6f5e81b14694013850c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chrobak, Marek</creatorcontrib><creatorcontrib>Jawor, Wojciech</creatorcontrib><creatorcontrib>Sgall, Jiří</creatorcontrib><creatorcontrib>Tichý, Tomáš</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems 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><jtitle>ACM transactions on algorithms</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chrobak, Marek</au><au>Jawor, Wojciech</au><au>Sgall, Jiří</au><au>Tichý, Tomáš</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improved online algorithms for buffer management in QoS switches</atitle><jtitle>ACM transactions on algorithms</jtitle><date>2007-11</date><risdate>2007</risdate><volume>3</volume><issue>4</issue><spage>50</spage><pages>50-</pages><issn>1549-6325</issn><eissn>1549-6333</eissn><abstract>We consider the following buffer management problem arising in QoS networks: Packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total weight of forwarded packets is maximized. Packets not forwarded before their deadlines are lost. The main result of the article is an online 64/33 ≈ 1.939-competitive algorithm, the first deterministic algorithm for this problem with competitive ratio below 2. For the 2-uniform case we give an algorithm with ratio ≈ 1.377 and a matching lower bound.</abstract><doi>10.1145/1290672.1290687</doi></addata></record>
fulltext fulltext
identifier ISSN: 1549-6325
ispartof ACM transactions on algorithms, 2007-11, Vol.3 (4), p.50
issn 1549-6325
1549-6333
language eng
recordid cdi_proquest_miscellaneous_34620314
source ACM Digital Library Complete
title Improved online algorithms for buffer management in QoS switches
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T06%3A38%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improved%20online%20algorithms%20for%20buffer%20management%20in%20QoS%20switches&rft.jtitle=ACM%20transactions%20on%20algorithms&rft.au=Chrobak,%20Marek&rft.date=2007-11&rft.volume=3&rft.issue=4&rft.spage=50&rft.pages=50-&rft.issn=1549-6325&rft.eissn=1549-6333&rft_id=info:doi/10.1145/1290672.1290687&rft_dat=%3Cproquest_cross%3E34620314%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=34620314&rft_id=info:pmid/&rfr_iscdi=true