Improved Competitive Guarantees for QoS Buffering

Alex Kesselman; Yishay Mansour; Rob Van Stee

doi:10.1007/978-3-540-39658-1_34

Improved Competitive Guarantees for QoS Buffering

Alex Kesselman^*, Yishay Mansour, Rob Van Stee

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

25 Scopus citations

Abstract

We consider a network providing Differentiated Services (Diffserv) which allow Internet service providers (ISP) to offer different levels of Quality of Service (QoS) to different traffic streams. We study FIFO buffering algorithms, where packets must be transmitted in the order they arrive. The buffer space is limited, and packets are lost if the buffer is full. Each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets. Our main contribution is an algorithm for arbitrary packet values that for the first time achieves a competitive ratio better than 2, namely 2 - ε for a constant ε > 0.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Giuseppe di Battista, Uri Zwick
Publisher	Springer Verlag
Pages	361-372
Number of pages	12
ISBN (Print)	3540200649, 9783540200642
DOIs	https://doi.org/10.1007/978-3-540-39658-1_34
State	Published - 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2832
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-3-540-39658-1_34

Cite this

Kesselman, A., Mansour, Y., & Van Stee, R. (2003). Improved Competitive Guarantees for QoS Buffering. In G. di Battista, & U. Zwick (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 361-372). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2832). Springer Verlag. https://doi.org/10.1007/978-3-540-39658-1_34

Kesselman, Alex ; Mansour, Yishay ; Van Stee, Rob. / Improved Competitive Guarantees for QoS Buffering. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Giuseppe di Battista ; Uri Zwick. Springer Verlag, 2003. pp. 361-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{bc76d64e80dd4c54b27ecb9fefcdeff7,

title = "Improved Competitive Guarantees for QoS Buffering",

abstract = "We consider a network providing Differentiated Services (Diffserv) which allow Internet service providers (ISP) to offer different levels of Quality of Service (QoS) to different traffic streams. We study FIFO buffering algorithms, where packets must be transmitted in the order they arrive. The buffer space is limited, and packets are lost if the buffer is full. Each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets. Our main contribution is an algorithm for arbitrary packet values that for the first time achieves a competitive ratio better than 2, namely 2 - ε for a constant ε > 0.",

author = "Alex Kesselman and Yishay Mansour and {Van Stee}, Rob",

year = "2003",

doi = "10.1007/978-3-540-39658-1_34",

language = "אנגלית",

isbn = "3540200649",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "361--372",

editor = "{di Battista}, Giuseppe and Uri Zwick",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Kesselman, A, Mansour, Y & Van Stee, R 2003, Improved Competitive Guarantees for QoS Buffering. in G di Battista & U Zwick (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2832, Springer Verlag, pp. 361-372. https://doi.org/10.1007/978-3-540-39658-1_34

Improved Competitive Guarantees for QoS Buffering. / Kesselman, Alex; Mansour, Yishay; Van Stee, Rob.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Giuseppe di Battista; Uri Zwick. Springer Verlag, 2003. p. 361-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2832).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Improved Competitive Guarantees for QoS Buffering

AU - Kesselman, Alex

AU - Mansour, Yishay

AU - Van Stee, Rob

PY - 2003

Y1 - 2003

N2 - We consider a network providing Differentiated Services (Diffserv) which allow Internet service providers (ISP) to offer different levels of Quality of Service (QoS) to different traffic streams. We study FIFO buffering algorithms, where packets must be transmitted in the order they arrive. The buffer space is limited, and packets are lost if the buffer is full. Each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets. Our main contribution is an algorithm for arbitrary packet values that for the first time achieves a competitive ratio better than 2, namely 2 - ε for a constant ε > 0.

AB - We consider a network providing Differentiated Services (Diffserv) which allow Internet service providers (ISP) to offer different levels of Quality of Service (QoS) to different traffic streams. We study FIFO buffering algorithms, where packets must be transmitted in the order they arrive. The buffer space is limited, and packets are lost if the buffer is full. Each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets. Our main contribution is an algorithm for arbitrary packet values that for the first time achieves a competitive ratio better than 2, namely 2 - ε for a constant ε > 0.

UR - http://www.scopus.com/inward/record.url?scp=0142214929&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-39658-1_34

DO - 10.1007/978-3-540-39658-1_34

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:0142214929

SN - 3540200649

SN - 9783540200642

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 372

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - di Battista, Giuseppe

A2 - Zwick, Uri

PB - Springer Verlag

ER -

Kesselman A, Mansour Y, Van Stee R. Improved Competitive Guarantees for QoS Buffering. In di Battista G, Zwick U, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 361-372. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-39658-1_34

Improved Competitive Guarantees for QoS Buffering

Abstract

Publication series

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this