Bounds on average delays and queue size averages and variances ininput-queued cell-based switches
Leonardi, E.; Mellia, M.; Neri, F.; Ajmone Marsan, M.
INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Volume 2, Issue , 2001 Page(s):1095 - 1103 vol.2
Digital Object Identifier 10.1109/INFCOM.2001.916303
Summary:We develop a general methodology, mainly based upon Lyapunov
functions, to derive bounds on average delays, and on queue size
averages and variances of complex systems of queues. We then apply this
methodology to input-buffered, cell-based switch and router
architectures. These architectures require a scheduling algorithm to
select at each slot a subset of input-buffered cells which can be
transferred towards output ports. Although the stability properties
(i.e., the limit throughput) of input-buffered, cell-based switches was
already studied for several classes of scheduling algorithms, no
analytical results concerning cell delays or queue sizes are yet
available in the technical literature. We concentrate on purely
input-buffered switches that adopt a maximum weight matching scheduling
algorithm, that was proved to be the scheduling algorithm providing the
best performance. The derived bounds proved to be rather tight, when
compared to simulation results
View citation and abstract |
Cart
