Improved competitive performance bounds for CIOQ switches

Alex Kesselman; Kirill Kogan; Michael Segal

doi:10.1007/s00453-011-9539-9

Improved competitive performance bounds for CIOQ switches

Alex Kesselman, Kirill Kogan, Michael Segal

Research output: Contribution to journal › Article › peer-review

26 Scopus citations

Abstract

Abstract Combined Input and Output Queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch.We analyze the performance of a switch policy by means of competitive analysis, where a uniform worst-case performance guarantee is provided for all traffic patterns. Azar and Richter (ACM Trans. Algorithms 2(2):282-295, 2006) proposed the β-PG algorithm (Preemptive Greedy with a preemption factor of β) that is 8-competitive for an arbitrary speedup value when β = 3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for β = 3 and β = 2.8, respectively. Basically, we demonstrate that β-PG is at most ^β2+2β _β-1 and at least ^β2 _β-1 -competitive.

Original language	English
Pages (from-to)	411-424
Number of pages	14
Journal	Algorithmica
Volume	63
Issue number	1-2
DOIs	https://doi.org/10.1007/s00453-011-9539-9
State	Published - 1 Jun 2011
Externally published	Yes

Keywords

Buffered crossbar switches
Competitive analysis
Control policies

Access to Document

10.1007/s00453-011-9539-9

Cite this

@article{797ca2f0cfac43cd820103dddd747c50,

title = "Improved competitive performance bounds for CIOQ switches",

abstract = "Abstract Combined Input and Output Queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch.We analyze the performance of a switch policy by means of competitive analysis, where a uniform worst-case performance guarantee is provided for all traffic patterns. Azar and Richter (ACM Trans. Algorithms 2(2):282-295, 2006) proposed the β-PG algorithm (Preemptive Greedy with a preemption factor of β) that is 8-competitive for an arbitrary speedup value when β = 3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for β = 3 and β = 2.8, respectively. Basically, we demonstrate that β-PG is at most β2+2β β-1 and at least β2 β-1 -competitive.",

keywords = "Buffered crossbar switches, Competitive analysis, Control policies",

author = "Alex Kesselman and Kirill Kogan and Michael Segal",

year = "2011",

month = jun,

day = "1",

doi = "10.1007/s00453-011-9539-9",

language = "אנגלית",

volume = "63",

pages = "411--424",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "1-2",

}

TY - JOUR

T1 - Improved competitive performance bounds for CIOQ switches

AU - Kesselman, Alex

AU - Kogan, Kirill

AU - Segal, Michael

PY - 2011/6/1

Y1 - 2011/6/1

N2 - Abstract Combined Input and Output Queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch.We analyze the performance of a switch policy by means of competitive analysis, where a uniform worst-case performance guarantee is provided for all traffic patterns. Azar and Richter (ACM Trans. Algorithms 2(2):282-295, 2006) proposed the β-PG algorithm (Preemptive Greedy with a preemption factor of β) that is 8-competitive for an arbitrary speedup value when β = 3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for β = 3 and β = 2.8, respectively. Basically, we demonstrate that β-PG is at most β2+2β β-1 and at least β2 β-1 -competitive.

AB - Abstract Combined Input and Output Queued (CIOQ) architectures with a moderate fabric speedup S > 1 have come to play a major role in the design of high performance switches. In this paper we study CIOQ switches with First-In-First-Out (FIFO) buffers providing Quality of Service (QoS) guarantees. The goal of the switch policy is to maximize the total value of packets sent out of the switch.We analyze the performance of a switch policy by means of competitive analysis, where a uniform worst-case performance guarantee is provided for all traffic patterns. Azar and Richter (ACM Trans. Algorithms 2(2):282-295, 2006) proposed the β-PG algorithm (Preemptive Greedy with a preemption factor of β) that is 8-competitive for an arbitrary speedup value when β = 3. We improve upon their result by showing that this algorithm achieves a competitive ratio of 7.5 and 7.47 for β = 3 and β = 2.8, respectively. Basically, we demonstrate that β-PG is at most β2+2β β-1 and at least β2 β-1 -competitive.

KW - Buffered crossbar switches

KW - Competitive analysis

KW - Control policies

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

U2 - 10.1007/s00453-011-9539-9

DO - 10.1007/s00453-011-9539-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84858864357

SN - 0178-4617

VL - 63

SP - 411

EP - 424

JO - Algorithmica

JF - Algorithmica

IS - 1-2

ER -

Improved competitive performance bounds for CIOQ switches

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this