Please use this identifier to cite or link to this item:
|標題:||Sliding-window parallel packet switch for high-speed networks||作者:||Liu, C.L.
|關鍵字:||parallel packet switch;sliding window;round robin;Bernoulli data;traffic;bursty data traffic;architecture||Project:||Journal of the Chinese Institute of Engineers||期刊/報告no：:||Journal of the Chinese Institute of Engineers, Volume 30, Issue 4, Page(s) 717-730.||摘要:||
This paper analyzes the performance of a parallel packet switch (PPS) with a sliding window (SW). The PPS involves numerous packet switches that operate independently and in parallel. The conventional PPS dispatch algorithm adopts a round-robin (RR) method. The class of PPS is characterized by deployment of parallel low-speed switches whose memory buffers run more slowly than the external line rate. In this work, a novel SW packet switching method for PPS, called SW-PPS, is proposed. The SW-PPS employs memory space more effectively than the existing PPS using an RR algorithm. Under identical Bernoulli and bursty data traffic, the SW-PPS provided significantly improved performance when compared to PPS with RR. Moreover, this investigation presents a novel mathematical analytical model to evaluate the performance of the PPS using RR and SW. Under various operating conditions, our proposed model and analysis successfully exhibit performance characteristics including throughput, cell delay, and cell drop rate.
|Appears in Collections:||期刊論文|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.