A High Performance Variable-Length Packet Iterative Matching Algorithm

碩士 === 國立交通大學 === 電信工程系 === 91 === Fixed-length switching technology is widely adopted for the high-performance switches. In order to resolve the HOL problem of input queuing (IQ) switch, Virtual Output Queuing architectures with different matching algorithms are used. The Exhaustive DRRM...

Full description

Bibliographic Details
Main Authors: Hung-Shiun Fu, 傅洪勛
Other Authors: Tsern-Huei Lee
Format: Others
Language:en_US
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/39101452405380386780
Description
Summary:碩士 === 國立交通大學 === 電信工程系 === 91 === Fixed-length switching technology is widely adopted for the high-performance switches. In order to resolve the HOL problem of input queuing (IQ) switch, Virtual Output Queuing architectures with different matching algorithms are used. The Exhaustive DRRM (EDRRM) algorithm possesses the lower delay under bursty and nonuniform traffics and the Output Reassemble Unit (ORU) is not needed, however, EDRRM performs worse under the uniform i.i.d. traffic. In the thesis, we propose a busy notification mechanism and modified the EDRRM algorithm into an improved version, EDRRM/BN. The EDRRM/BN avoids the useless requests and increases the efficiency of setting up the matching. We have evaluated the EDRRM/BN using extensive simulations and we will show that the EDRRM/BN yields the lowest delay comparing with other algorithms under all traffic patterns.