Semi-rearrangeably nonblocking operation of Clos networks in the multirate environment
IEEE/ACM Transactions on Networking (TON)
ATM Input-Buffered Switches with the Guaranteed-Rate Property
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
SRR: an O(1) time-complexity packet scheduler for flows in multiservice packet networks
IEEE/ACM Transactions on Networking (TON)
Path switching-a quasi-static routing scheme for large-scale ATM packet switches
IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
To provide stringent service guarantees such as latency and backlog bounds for input-buffered switches, a set of scheduling algorithm and admission control strategy is proposed. This set of traffic control strategy is primarily based on a single-server scheduling algorithm called Smoothed Round Robin (SRR). SRR possesses a number of advantages which are very attractive to the implementation of input buffered switch. SRR is on order O(1) which requires minimal computational complexity. Secondly, SRR gives good delay bounds and fairness performance for each session. Thirdly, SRR can decompose a sequence into fixed size groups. In this way, by maintaining a SRR scheduler in each output port, scheduling can be performed in a distributed manner which largely reduces the complexity of the algorithm.