Chapter

Algorithms - ESA 2008

Volume 5193 of the series Lecture Notes in Computer Science pp 577-588

Improved Competitive Performance Bounds for CIOQ Switches

  • Alex KesselmanAffiliated withGoogle, Inc.
  • , Kirill KoganAffiliated withCisco Systems, South Netanya, Israel and Communication Systems Engineering Dept., Ben Gurion University
  • , Michael SegalAffiliated withCommunication Systems Engineering Dept., Ben Gurion University

* Final gross prices may vary according to local VAT.

Get Access

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 performance guarantee is provided for all traffic patterns. Azar and Richter [8] proposed an algorithm β-PG (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 \(\frac{\beta^2 + 2\beta}{\beta - 1}\) and at least \(\frac{\beta^2 - \beta + 1}{\beta - 1}\)-competitive.