Scheduling multi-rate traffic in a time-multiplex switch
Scheduling algorithms are investigated for multi-rate traffic, both point-to-point and multicast. In particular, blocking probability is evaluated for the random and optimal scheduling algorithms. It is established that for multicast calls, optimal scheduling provides considerable improvement over random scheduling. The performance of the call splitting algorithm is also evaluated for multicast calls. It is demonstrated that, in the case of multi-rate traffic, call splitting is unable to bridge the gap between optimal and random scheduling. A novel scheduling algorithm called slot splitting is then introduced. The performance of slot splitting is evaluated and it is shown that it achieves a performance close to the optimal schedule. © 1994 IEEE.
Publication Source (Journal or Book title)
IEEE International Symposium on Information Theory - Proceedings
Naraghi-Pour, M., Hegde, M., & Suresh, S. (1994). Scheduling multi-rate traffic in a time-multiplex switch. IEEE International Symposium on Information Theory - Proceedings, 406. https://doi.org/10.1109/ISIT.1994.394614