Approximating fluid schedules in crossbar packet-switches and Banyan networks

Michael Aaron Rosenblum, Constantine Caramanis, Michel X. Goemans, Vahid Tarokh

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)1374-1386
Number of pages13
JournalIEEE/ACM Transactions on Networking
Volume14
Issue number6
DOIs
StatePublished - Dec 2006
Externally publishedYes

Fingerprint

Switches
Fluids
Scheduling
Scheduling algorithms
Quality of service
Topology

Keywords

  • Combinatorics
  • Graph theory
  • Network calculus
  • Packet-switching
  • Scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Approximating fluid schedules in crossbar packet-switches and Banyan networks. / Rosenblum, Michael Aaron; Caramanis, Constantine; Goemans, Michel X.; Tarokh, Vahid.

In: IEEE/ACM Transactions on Networking, Vol. 14, No. 6, 12.2006, p. 1374-1386.

Research output: Contribution to journalArticle

Rosenblum, Michael Aaron ; Caramanis, Constantine ; Goemans, Michel X. ; Tarokh, Vahid. / Approximating fluid schedules in crossbar packet-switches and Banyan networks. In: IEEE/ACM Transactions on Networking. 2006 ; Vol. 14, No. 6. pp. 1374-1386.
@article{02bef33916bc4fe387037182f727618a,
title = "Approximating fluid schedules in crossbar packet-switches and Banyan networks",
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.",
keywords = "Combinatorics, Graph theory, Network calculus, Packet-switching, Scheduling",
author = "Rosenblum, {Michael Aaron} and Constantine Caramanis and Goemans, {Michel X.} and Vahid Tarokh",
year = "2006",
month = "12",
doi = "10.1109/TNET.2006.886320",
language = "English (US)",
volume = "14",
pages = "1374--1386",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Approximating fluid schedules in crossbar packet-switches and Banyan networks

AU - Rosenblum, Michael Aaron

AU - Caramanis, Constantine

AU - Goemans, Michel X.

AU - Tarokh, Vahid

PY - 2006/12

Y1 - 2006/12

N2 - 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.

AB - 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.

KW - Combinatorics

KW - Graph theory

KW - Network calculus

KW - Packet-switching

KW - Scheduling

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

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

U2 - 10.1109/TNET.2006.886320

DO - 10.1109/TNET.2006.886320

M3 - Article

AN - SCOPUS:33947211736

VL - 14

SP - 1374

EP - 1386

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

ER -