The high speed network usually deals with two main issues. The first is fast switching to get good throughput. At present, the state-of-the-art switches are employing input queued architecture to get high throughput. The second is providing QoS guarantees for a wide range of applications. This is generally considered in output queued switches. For these two requirements, there have been lots of scheduling mechanisms to support both better throughput and QoS guarantees in high speed switching networks. In this paper, we present a scheduling algorithm for providing QoS guarantees and higher throughput in an input queued switch. The proposed algorithm, called Weighted Fair Matching (WFM), which provides QoS guarantees without output queues, i.e., WFM is a flow based algorithm that achieves asymptotically 100% throughput with no speed up while providing QoS. © IFIP International Federation for Information Processing 2004.
CITATION STYLE
Lee, S. H., Shin, D. R., & Youn, H. Y. (2004). Weighted fair scheduling algorithm for QoS of input-queued switches. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3222, 366–373. https://doi.org/10.1007/978-3-540-30141-7_51
Mendeley helps you to discover research relevant for your work.