Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Dynamic queue length thresholds for shared-memory packet switches
IEEE/ACM Transactions on Networking (TON)
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Computer networks: a systems approach
Computer networks: a systems approach
Providing bandwidth guarantees in an input-buffered crossbar switch
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
This paper addresses scheduling and memory management in input queued switches having finite buffer with the objective of improving the performance in terms of throughput and average delay. Most of the prior works on scheduling related to input queued switches assume infinite buffer space. In practice, buffer space being a finite resource, special memory management scheme becomes essential. Maximum weighted matching (MWM) algorithm, which is known to be the optimal in terms of throughput for infinite buffer case turns out to be sub optimal in the presence of memory limitations. We introduce a buffer management scheme called iSMM (Integrated Scheduling and Memory Management) that can be employed jointly with any deterministic iterative scheduling algorithm. We applied iSMM over iSLIP, a popular scheduling algorithm, and study its effect under various input traffic conditions. Simulation results indicate iSMM to perform better than iSLIP and MWM both in terms of throughput and delay especially under non-uniform traffic. Finally, we show that the scheme is easy-to-implement and has negligible impact on the switching speed.