Michael Rosenblum, Michel X. Goemans, Vahid Tarokh  Home/Search
Context
Related
| mit.edu/~goemans/c...ssbar_revised_2.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~goemans/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we consider a type of online, traffic scheduling problem in input queued, crossbar switches. The input to a problem, at each time step, is a set of desired traffic rates. 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 switch uses in which only whole... (Update)
Active bibliography (related documents): More All
5.6: Universal Bounds on Buffer Size for Packetizing Fluid.. - Rosenblum, Goemans.. (2004) (Correct)
0.5: Scheduling and Synchronization in Distributed Systems - Bonuccelli, Ciuffoletti.. (Correct)
0.3: Implementation of Active Queue Management in a Combined.. - Wydrowski, Zukerman (Correct)
Similar documents based on text: More All
0.3: Improved Bounds for On-line Load Balancing - Matthew Andrews Andrews (1996) (Correct)
0.3: QoS Provisioning and Tracking Fluid Policies in.. - Tabatabaee.. (Correct)
0.1: Analysing Synchronization Phenomena from Bivariate Data by.. - Rosenblum, Kurths (1998) (Correct)
BibTeX entry: (Update)
@misc{ rosenblum-universal,
author = "Michael Rosenblum and Michel X. Goemans and Vahid Tarokh",
title = "Universal Bounds on Buffer Size for Packetizing Fluid Policies in Input
Queued, Crossbar Switches",
url = "citeseer.ist.psu.edu/669419.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Rivest, Cormen et al. - 1994
69 Achieving 100% throughput in an input-queued switch (context) - McKeown, Anantharam et al. - 1996
66 Linear Programming (context) - Chvatal - 1983
62 A generalized processor sharing approach to flow control in .. (context) - Parekh, Gallager - 1994
53 The throughput of data switches with and without speedup - Dai, Prabhakar - 2000
52 W F Q: worst-case fair weighted fair queueing - Bennett, Zhang - 1996
40 On representatives of subsets (context) - Hall - 1935
32 Adversarial queuing theory - Borodin, Kleinberg et al. - 2001
32 the speedup required for combined input and output queued sw.. - Prabhakar, McKeown - 1997
28 Linear complexity algorithms for maximum throughput in radio.. (context) - Tassiulas - 1998
28 Beyond the flow decomposition barrier (context) - Rao, Goldberg - 1998
21 Using euler partitions to edge color bipartite multigraphs (context) - Gabow - 1976
19 Birkhoff-von Neumann input buffered crossbar switches - Chang, Chen et al. - 2000
15 QoS provisioning and tracking fluid policies in input queuei.. - Tabatabaee, Georgiadis et al. - 2000
14 On adaptive bandwidth sharing with rate guarantees - Duffield, Lakshman et al. - 1998
12 Providing QoS guarantees in input-buffered crossbar switches.. - Charny - 1998
10 Combinatorial Optimization (context) - Schrijver - 2003
10 An efficient SS/TDMA time slot assignment algorithm (context) - Inukai - 1979
9 An n 5=2 algorithm for maximum matchings in bipartite graphs (context) - Karp, Hopcroft - 1973
8 A calculus for network delay.I. network elements in isolatio.. (context) - Cruz - 1991
6 EDD algorithm performance guarantee for periodic hard-real-t.. (context) - Bonuccelli, Clo - 1999
6 A calculus for network delay. II. network analysis (context) - Cruz - 1991
6 Competitive buffer management for shared-memory switches - Hahne, Kesselman et al. - 2001
4 Graphok es alkalmazasuk a determinansok es a halmazok elmele.. (context) - Konig - 1916
3 Optimal on demand packet scheduling in single-hop multichann.. (context) - Bonuccelli, Pelagatti - 2000
3 Scheduling in input queued switches: A survey - Gupta
2 Tracking switch fluid policies: Bounding lookahead (context) - Girone - 2002
2 Contributions to the Theory of Games (context) - von Neumann - 1953
2 Deterministic time-varying packet fair queueing for integrat.. - Stamoulis, Giannakis - 2000
2 Bipartite edge-colouring in O(m) time (context) - Schrijver - 1999
2 Providing quality of service over high speed electronic and .. (context) - Koksal - 2002
2 A proportionate fair scheduling rule with good worst-case pe.. (context) - Adler, Berenbrink et al. - 2003
2 is and J. Liebherr, "S GPS: slow-start generalized processor.. (context) - Stamoul - 1996
1 Uber trennende knotenpunkte in graphen (nebst anwendungen au.. (context) - Konig
Documents on the same site (http://www-math.mit.edu/~goemans/): More
Semidefinite Programs and Association Schemes - Goemans, Rendl (1999) (Correct)
Semidefinite Programming and Combinatorial Optimization - Goemans (Correct)
Approximate Edge Splitting - Goemans (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC