The Dual Round Robin Pseudo-grant Matching for high-speed packet switches

被引：0

作者：

Manivasakan, R ^{[1
]}

Hamdi, M ^{[1
]}

Tsang, DHK ^{[1
]}

机构：

[1] Hong Kong Univ Sci & Technol, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China

来源：

HPSR 2002: WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, PROCEEDINGS: MERGING OPTICAL AND IP TECHNOLOGIES | 2002年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Virtual Output Queueing (VoQ) in conjunction with matching algorithms have been proposed to overcome the HOL problem in input queued (IQ) high-speed switches. The Dual Round-Robin Matching (DRRM) scheme, has been shown to achieve good performance while being easy to build to high-speed and scalable switches. In this paper, we present a variant and improved version of the DRRM scheme, termed the Pseudo-grant Dual Round-Robin Matching (PDRRM) algorithm. The PDRRM gives a Pseudo-grant to a needy input to increase the number of matches per time slot. We have evaluated the PDRRM using extensive simulations. Our results will demonstrate that using the "Pseudo-grant" concept results in significant improvement in the performance of DRRM under different networking scenarios. In addition, PDRRM is conjectured to achieve an asymptotic 100% throughput for any arrival pattern.

引用

页码：64 / 68

页数：5