Abstract:
Abstract — In this paper, we consider a type of on-line, 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 packets are sent. The focus of this paper is bounding the costs incurred in using such an approximation, in terms of the additional buffer size required. We establish universal bounds on the additional buffer size due to sending only whole packets; these bounds do not depend on the particular distribution of the input traffic, require no speedup, and guarantee 100 % throughput. Specifically, for an N × N input queued, crossbar switch, an on-line, packetizing algorithm is presented that guarantees 100 % throughput with a buffer requirement of (N +1) 2 /4 packets per input port with no speedup. The algorithm can be improved to run in O(N log N) time, using a fast algorithm for edge-coloring bipartite multigraphs. In the reverse direction, it is shown for an N × N input queued, crossbar switch, that any on-line, packetizing algorithm with no speedup requires a buffer size of N/e − 2 packets per input port. We also extend the main packetizing algorithm in this paper to a general class of switch architectures.
Citations
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1992
|
|
1409
|
A generalized processor sharing approach to flow control in integrated services network
– Parekh
- 1992
|
|
360
|
An n 5/2 algorithm for maximum matchings in bipartite graphs
– Hopcroft, Karp
- 1973
|
|
249
|
Achieving 100% throughput in an input-queued switch
– McKeown, Anantharam, et al.
- 1996
|
|
224
|
WF2Q: Worst-case fair weighted fair queueing
– Bennett, Zhang
- 1996
|
|
159
|
On representatives of subsets
– Hall
- 1935
|
|
98
|
The Throughput of Data Switches with and without Speedup
– Dai, Prabhakar
|
|
66
|
complexity algorithms for maximum throughput in radio networks and input queued switches
– Tassiulas, “Linear
- 1998
|
|
53
|
Adversarial Queuing Theory
– Borodin, Kleinberg, et al.
- 2001
|
|
52
|
Beyond the flow decomposition barrier
– Goldberg, Rao
- 1998
|
|
48
|
On the speedup required for combined input and output queued switching
– Prabhakar, McKowen
- 1999
|
|
41
|
An efficient SS/TDMA time slot assignment algorithm
– Inukai
- 1979
|
|
39
|
Combinatorial optimization
– Schrijver
- 2003
|
|
29
|
Birkhoff-von neumann input buffered crossbar switches
– Chang, Chen, et al.
- 2000
|
|
25
|
Graphok 'es alkalmaz'asuk a determin'asok 'es a halmazok elm'elet'ere. Mathematikai 'es Term'eszettudom'anyi
– Konig
- 1916
|
|
21
|
Using Euler partitions to edge color bipartite multigraphs
– Gabow
- 1976
|
|
15
|
On adaptive bandwidth sharing with rate guarantees
– Duffield, Lakshman, et al.
- 1998
|
|
13
|
QoS Provisioning and Tracking Fluid Policies in Input Queueing Switches
– Tabatabaee, Georgiadis, et al.
- 2001
|
|
12
|
A calculus for network delay. II. Network Analysis
– Cruz
- 1991
|
|
12
|
Competitive buffer management for shared-memoryswitches
– Hahne, Kesselman, et al.
- 2001
|
|
7
|
trennende Knotenpunkte in Graphen (nebst Anwendungen auf Determinanten und Matrizen), Acta Litterarum ac Scientiarum Regiae Universitatis Hungaricae FranciscoJosephinae, Sectio Scientiarum Mathematicarum [Szeged
– Konig, Uber
|
|
6
|
S GPS: Slow-Start Generalized Processor Sharing
– Stamoulis, Liebherr
- 1996
|
|
6
|
EDD algorithm performance guarantee for periodic hard-real-time scheduling in distributed systems
– Bonuccelli, Clo
- 1999
|
|
6
|
Bipartite Edge-Colouring in O(∆m) Time
– Schrijver
- 1999
|
|
5
|
A proportionate fair scheduling rule with good worst-case performance
– Adler, Berenbrink, et al.
- 2003
|
|
5
|
Providing QoS Guarantees in Input-Buffered Crossbar Switches with Speedup
– Charny
- 1998
|
|
4
|
Deterministic TimeVarying Packet Fair Queuing for Integrated Services Networks
– Stamoulis, Giannakis
- 2000
|
|
4
|
Contributions to the Theory
– Neumann
- 1953
|
|
3
|
Optimal on demand packet scheduling in single-hop multichannel communication systems
– Bonuccelli, Pelagatti
- 2000
|
|
2
|
A calculus for network delay.I. network elements in isolation
– Cruz
- 1991
|
|
2
|
Tracking switch fluid policies: Bounding lookahead
– Girone
- 2002
|
|
1
|
Koksal, “Providing quality of service over high speed electronic and optical switches
– E
- 2002
|
|
1
|
Scheduling in input queued switches: A survey,” unpublished manuscript
– Gupta
|
