DMCA
Universal Bounds on Buffer Size for Packetizing Fluid Policies in Input Queued, Crossbar Switches (2004)
Cached
Download Links
- [www-math.mit.edu]
- [www.ieee-infocom.org]
- [infocom2004.ieee-infocom.org]
- DBLP
Other Repositories/Bibliography
| Citations: | 3 - 2 self |
BibTeX
@MISC{Rosenblum04universalbounds,
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},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
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 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.
