Approximating fluid schedules in crossbar packet-switches and Banyan networks

  • Authors:

  • Michael Rosenblum;Constantine Caramanis;Michel X. Goemans;Vahid Tarokh

  • Affiliations:

  • Electrical Engineering and Computer Science Department, University of California, Berkeley, CA and Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX;Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA;Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the switch network. These traffic rates in general cannot be exactly achieved since they assume arbitrarily small fractions of packets can be transmitted at each time step. The goal of the traffic scheduling problem is to closely approximate the given sequence of traffic rates by a sequence of transmissions in which only whole packets are sent. We prove worst-case bounds on the additional buffer use, which we call backlog, that results from using such an approximation.We first consider the N × N, input queued, crossbar switch. Our main result is an online packet-scheduling algorithm using no speedup that guarantees backlog at most (N+1)2/4 packets at each input port and each output port. Upper bounds on worst-case backlog have been proved for the case of constant fluid schedules, such as the N2-2N+2 bound of Chang, Chen, and Huang (INFOCOM, 2000). Our main result for the crossbar switch is the first, to our knowledge, to bound backlog in terms of switch size N for arbitrary, time-varying fluid schedules, without using speedup.Our main result for Banyan networks is an exact characterization of the speedup required to maintain bounded backlog, in terms of polytopes derived from the network topology.