A sliding‐window parallel packet switch for high‐speed networks
| Autor: | Chin-Chi Wu, Chia-Lung Liu, Woei Lin |
|---|---|
| Rok vydání: | 2007 |
| Předmět: | |
| Zdroj: | Journal of the Chinese Institute of Engineers. 30:717-730 |
| ISSN: | 2158-7299 0253-3839 |
| DOI: | 10.1080/02533839.2007.9671297 |
| Popis: | 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 ... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|