Scheduling Packets with Values and Deadlines in Size-Bounded Buffers
Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing i...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Fei [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2011 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of combinatorial optimization - Springer US, 1997, 25(2011), 2 vom: 08. Okt., Seite 165-175 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2011 ; number:2 ; day:08 ; month:10 ; pages:165-175 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10878-011-9419-x |
|---|
| Katalog-ID: |
OLC2044615983 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2044615983 | ||
| 003 | DE-627 | ||
| 005 | 20230503135010.0 | ||
| 007 | tu | ||
| 008 | 200819s2011 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10878-011-9419-x |2 doi | |
| 035 | |a (DE-627)OLC2044615983 | ||
| 035 | |a (DE-He213)s10878-011-9419-x-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Li, Fei |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Scheduling Packets with Values and Deadlines in Size-Bounded Buffers |
| 264 | 1 | |c 2011 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2011 | ||
| 520 | |a Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. | ||
| 650 | 4 | |a Buffer management algorithm | |
| 650 | 4 | |a Packet scheduling algorithm | |
| 650 | 4 | |a Multi-buffer model | |
| 650 | 4 | |a Bounded-buffer model | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of combinatorial optimization |d Springer US, 1997 |g 25(2011), 2 vom: 08. Okt., Seite 165-175 |w (DE-627)216539323 |w (DE-600)1339574-9 |w (DE-576)094421935 |x 1382-6905 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2011 |g number:2 |g day:08 |g month:10 |g pages:165-175 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10878-011-9419-x |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2108 | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2011 |e 2 |b 08 |c 10 |h 165-175 | ||
| author_variant |
f l fl |
|---|---|
| matchkey_str |
article:13826905:2011----::ceuigaktwtvleadedieis |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1007/s10878-011-9419-x doi (DE-627)OLC2044615983 (DE-He213)s10878-011-9419-x-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Li, Fei verfasserin aut Scheduling Packets with Values and Deadlines in Size-Bounded Buffers 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. Buffer management algorithm Packet scheduling algorithm Multi-buffer model Bounded-buffer model Enthalten in Journal of combinatorial optimization Springer US, 1997 25(2011), 2 vom: 08. Okt., Seite 165-175 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:25 year:2011 number:2 day:08 month:10 pages:165-175 https://doi.org/10.1007/s10878-011-9419-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 AR 25 2011 2 08 10 165-175 |
| spelling |
10.1007/s10878-011-9419-x doi (DE-627)OLC2044615983 (DE-He213)s10878-011-9419-x-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Li, Fei verfasserin aut Scheduling Packets with Values and Deadlines in Size-Bounded Buffers 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. Buffer management algorithm Packet scheduling algorithm Multi-buffer model Bounded-buffer model Enthalten in Journal of combinatorial optimization Springer US, 1997 25(2011), 2 vom: 08. Okt., Seite 165-175 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:25 year:2011 number:2 day:08 month:10 pages:165-175 https://doi.org/10.1007/s10878-011-9419-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 AR 25 2011 2 08 10 165-175 |
| allfields_unstemmed |
10.1007/s10878-011-9419-x doi (DE-627)OLC2044615983 (DE-He213)s10878-011-9419-x-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Li, Fei verfasserin aut Scheduling Packets with Values and Deadlines in Size-Bounded Buffers 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. Buffer management algorithm Packet scheduling algorithm Multi-buffer model Bounded-buffer model Enthalten in Journal of combinatorial optimization Springer US, 1997 25(2011), 2 vom: 08. Okt., Seite 165-175 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:25 year:2011 number:2 day:08 month:10 pages:165-175 https://doi.org/10.1007/s10878-011-9419-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 AR 25 2011 2 08 10 165-175 |
| allfieldsGer |
10.1007/s10878-011-9419-x doi (DE-627)OLC2044615983 (DE-He213)s10878-011-9419-x-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Li, Fei verfasserin aut Scheduling Packets with Values and Deadlines in Size-Bounded Buffers 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. Buffer management algorithm Packet scheduling algorithm Multi-buffer model Bounded-buffer model Enthalten in Journal of combinatorial optimization Springer US, 1997 25(2011), 2 vom: 08. Okt., Seite 165-175 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:25 year:2011 number:2 day:08 month:10 pages:165-175 https://doi.org/10.1007/s10878-011-9419-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 AR 25 2011 2 08 10 165-175 |
| allfieldsSound |
10.1007/s10878-011-9419-x doi (DE-627)OLC2044615983 (DE-He213)s10878-011-9419-x-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Li, Fei verfasserin aut Scheduling Packets with Values and Deadlines in Size-Bounded Buffers 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. Buffer management algorithm Packet scheduling algorithm Multi-buffer model Bounded-buffer model Enthalten in Journal of combinatorial optimization Springer US, 1997 25(2011), 2 vom: 08. Okt., Seite 165-175 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:25 year:2011 number:2 day:08 month:10 pages:165-175 https://doi.org/10.1007/s10878-011-9419-x lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 AR 25 2011 2 08 10 165-175 |
| language |
English |
| source |
Enthalten in Journal of combinatorial optimization 25(2011), 2 vom: 08. Okt., Seite 165-175 volume:25 year:2011 number:2 day:08 month:10 pages:165-175 |
| sourceStr |
Enthalten in Journal of combinatorial optimization 25(2011), 2 vom: 08. Okt., Seite 165-175 volume:25 year:2011 number:2 day:08 month:10 pages:165-175 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Buffer management algorithm Packet scheduling algorithm Multi-buffer model Bounded-buffer model |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Journal of combinatorial optimization |
| authorswithroles_txt_mv |
Li, Fei @@aut@@ |
| publishDateDaySort_date |
2011-10-08T00:00:00Z |
| hierarchy_top_id |
216539323 |
| dewey-sort |
3510 |
| id |
OLC2044615983 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2044615983</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503135010.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-011-9419-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2044615983</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-011-9419-x-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Fei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling Packets with Values and Deadlines in Size-Bounded Buffers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Buffer management algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packet scheduling algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-buffer model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bounded-buffer model</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">25(2011), 2 vom: 08. Okt., Seite 165-175</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:2</subfield><subfield code="g">day:08</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:165-175</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-011-9419-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2011</subfield><subfield code="e">2</subfield><subfield code="b">08</subfield><subfield code="c">10</subfield><subfield code="h">165-175</subfield></datafield></record></collection>
|
| author |
Li, Fei |
| spellingShingle |
Li, Fei ddc 510 ssgn 3,2 misc Buffer management algorithm misc Packet scheduling algorithm misc Multi-buffer model misc Bounded-buffer model Scheduling Packets with Values and Deadlines in Size-Bounded Buffers |
| authorStr |
Li, Fei |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)216539323 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1382-6905 |
| topic_title |
510 VZ 3,2 ssgn Scheduling Packets with Values and Deadlines in Size-Bounded Buffers Buffer management algorithm Packet scheduling algorithm Multi-buffer model Bounded-buffer model |
| topic |
ddc 510 ssgn 3,2 misc Buffer management algorithm misc Packet scheduling algorithm misc Multi-buffer model misc Bounded-buffer model |
| topic_unstemmed |
ddc 510 ssgn 3,2 misc Buffer management algorithm misc Packet scheduling algorithm misc Multi-buffer model misc Bounded-buffer model |
| topic_browse |
ddc 510 ssgn 3,2 misc Buffer management algorithm misc Packet scheduling algorithm misc Multi-buffer model misc Bounded-buffer model |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of combinatorial optimization |
| hierarchy_parent_id |
216539323 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Journal of combinatorial optimization |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 |
| title |
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers |
| ctrlnum |
(DE-627)OLC2044615983 (DE-He213)s10878-011-9419-x-p |
| title_full |
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers |
| author_sort |
Li, Fei |
| journal |
Journal of combinatorial optimization |
| journalStr |
Journal of combinatorial optimization |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
165 |
| author_browse |
Li, Fei |
| container_volume |
25 |
| class |
510 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Li, Fei |
| doi_str_mv |
10.1007/s10878-011-9419-x |
| dewey-full |
510 |
| title_sort |
scheduling packets with values and deadlines in size-bounded buffers |
| title_auth |
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers |
| abstract |
Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. © Springer Science+Business Media, LLC 2011 |
| abstractGer |
Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. © Springer Science+Business Media, LLC 2011 |
| abstract_unstemmed |
Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature. © Springer Science+Business Media, LLC 2011 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_24 GBV_ILN_26 GBV_ILN_70 GBV_ILN_2108 |
| container_issue |
2 |
| title_short |
Scheduling Packets with Values and Deadlines in Size-Bounded Buffers |
| url |
https://doi.org/10.1007/s10878-011-9419-x |
| remote_bool |
false |
| ppnlink |
216539323 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10878-011-9419-x |
| up_date |
2024-07-04T00:10:13.987Z |
| _version_ |
1803605050904281088 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2044615983</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503135010.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-011-9419-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2044615983</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-011-9419-x-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Fei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling Packets with Values and Deadlines in Size-Bounded Buffers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motivated by providing quality-of-service differentiated services in the Internet, we consider buffer management algorithms for network switches. We study a multi-buffer model. A network switch consists of multiple size-bounded buffers such that at any time, the number of packets residing in each individual buffer cannot exceed its capacity. Packets arrive at the network switch over time; they have values, deadlines, and designated buffers. In each time step, at most one pending packet is allowed to be sent and this packet can be from any buffer. The objective is to maximize the total value of the packets sent by their respective deadlines. A 9.82-competitive online algorithm (Azar and Levy in Lect Notes Comput Sci 4059:5–16 2006) and a 4.73-competitive online algorithm (Li in Lect Notes Comput Sci 5564:265–278, 2009) have been provided for this model, but no offline algorithms have yet been described. In this paper, we study the offline setting of the multi-buffer model. Our contributions include a few optimal offline algorithms for some variants of the model. Each variant has its unique and interesting algorithmic feature.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Buffer management algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packet scheduling algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-buffer model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bounded-buffer model</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">25(2011), 2 vom: 08. Okt., Seite 165-175</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:2</subfield><subfield code="g">day:08</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:165-175</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-011-9419-x</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2011</subfield><subfield code="e">2</subfield><subfield code="b">08</subfield><subfield code="c">10</subfield><subfield code="h">165-175</subfield></datafield></record></collection>
|
| score |
7.3993883 |