Please use this identifier to cite or link to this item:
|標題:||Mathematical analysis of the parallel packet switch with a sliding window scheme||作者:||Liu, C.L.
|關鍵字:||Bernoulli data traffic;bursty data traffic;parallel packet switch;(PPS);round robin (RR);sliding window (SW);architecture||Project:||Journal of Communications and Networks||期刊/報告no：:||Journal of Communications and Networks, Volume 9, Issue 3, Page(s) 330-341.||摘要:||
This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method. 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 all memory buffers run more slowly than the external line rate. In this work, a novel SW packet switching method for PPS, called SWPPS, is proposed. The SW-PPS employs memory space more effectively than the existing PPS using RR algorithm. Under identical Bernoulli and bursty data traffic, the SW-PPS provided significantly improved performance when compared to PPS with RR method. Moreover, this investigation presents a novel mathematical analytical model to evaluate the performance of the PPS using RR and SW method. Under various operating conditions, our proposed model and analysis successfully exhibit these 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.