Performance Evaluation of the Parallel Packet Switch with a Sliding Window Scheme
This study analyzes how parallel packet switching (PPS) performs with a sliding window (SW). The PPS involves numerous packet switches that operate independently and in parallel. The typical PPS dispatch algorithm applies a round-robin method (RR). The class of PPS is characterized by deploying parallel center-stage switches that enable all memory buffers run more slowly than the external line rate. A novel SW packet switching method for PPS, called SW-PPS, is developed. The SW-PPS operates in a pipeline fashion to ensure overall switching. The performance of the RR-PPS and SW-PPS is evaluated for a torus topology. Under identical Bernoulli, the SW-PPS provided considerably outperformed RR-PPS. Furthermore, this investigation proposes a mathematical analytical model for RR-PPS and SW-PPS.
KeywordsQueue Length Output Port Memory Location Memory Space Memory Module
Unable to display preview. Download preview PDF.
- 3.Aslam, A., Christensen, K.: Parallel packet switching using multiplexers with virtual input queues. In: IEEE Conference on Local Computer Networks, pp. 270–277 (2002)Google Scholar