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...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/39101452405380386780 |
id |
ndltd-TW-091NCTU0435016 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091NCTU04350162016-06-22T04:14:27Z http://ndltd.ncl.edu.tw/handle/39101452405380386780 A High Performance Variable-Length Packet Iterative Matching Algorithm 高性能可變長度封包反覆相匹配演算法 Hung-Shiun Fu 傅洪勛 碩士 國立交通大學 電信工程系 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. Tsern-Huei Lee 李程輝 2003 學位論文 ; thesis 56 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 電信工程系 === 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.
|
author2 |
Tsern-Huei Lee |
author_facet |
Tsern-Huei Lee Hung-Shiun Fu 傅洪勛 |
author |
Hung-Shiun Fu 傅洪勛 |
spellingShingle |
Hung-Shiun Fu 傅洪勛 A High Performance Variable-Length Packet Iterative Matching Algorithm |
author_sort |
Hung-Shiun Fu |
title |
A High Performance Variable-Length Packet Iterative Matching Algorithm |
title_short |
A High Performance Variable-Length Packet Iterative Matching Algorithm |
title_full |
A High Performance Variable-Length Packet Iterative Matching Algorithm |
title_fullStr |
A High Performance Variable-Length Packet Iterative Matching Algorithm |
title_full_unstemmed |
A High Performance Variable-Length Packet Iterative Matching Algorithm |
title_sort |
high performance variable-length packet iterative matching algorithm |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/39101452405380386780 |
work_keys_str_mv |
AT hungshiunfu ahighperformancevariablelengthpacketiterativematchingalgorithm AT fùhóngxūn ahighperformancevariablelengthpacketiterativematchingalgorithm AT hungshiunfu gāoxìngnéngkěbiànzhǎngdùfēngbāofǎnfùxiāngpǐpèiyǎnsuànfǎ AT fùhóngxūn gāoxìngnéngkěbiànzhǎngdùfēngbāofǎnfùxiāngpǐpèiyǎnsuànfǎ AT hungshiunfu highperformancevariablelengthpacketiterativematchingalgorithm AT fùhóngxūn highperformancevariablelengthpacketiterativematchingalgorithm |
_version_ |
1718315215010922496 |