Throughput Region of Finite-Buffered Networks
IEEE Transactions on Parallel and Distributed Systems
Achieving 100% throughput in reconfigurable optical networks
IEEE/ACM Transactions on Networking (TON)
Projective cone scheduling (PCS) algorithms for packet switches of maximal throughput
IEEE/ACM Transactions on Networking (TON)
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
INFOCOM'10 Proceedings of the 29th conference on Information communications
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
IEEE/ACM Transactions on Networking (TON)
On the interaction between TCP-like sources and throughput-efficient scheduling policies
Performance Evaluation
| Hi-index | 754.84 |
In this correspondence, we discuss the stability of scheduling algorithms for input-queueing (IQ) and combined input/output queueing (CIOQ) packet switches. First, we show that a wide class of IQ schedulers operating on multiple traffic classes can achieve 100% throughput. Then, we address the problem of the maximum throughput achievable in a network of interconnected IQ switches and CIOQ switches loaded by multiclass traffic, and we devise some simple scheduling policies that guarantee 100% throughput. Both the Lyapunov function methodology and the fluid modeling approach are used to obtain our results.