Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Conference paper
Stability degree of switches with finite buffers and non-negligible round-trip time
Abstract
The stability degree of switches with finite buffers and non-negligible round-trip time was reviewed. A systematic method was also proposed for determining the absolute lower bound of packet buffering required by practical switching systems. It was shown that absolute global stability (AGS) determine the inflextion point beyond which the performance gains were cancelled by the cost of over-provisioning a switch with packet-buffering capacity.
Related
Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Jihun Yun, Peng Zheng, et al.
ICML 2019