19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) (2005)
Mar. 25, 2005 to Mar. 30, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2005.176
Chia-Lung Liu , National Chung-Hsing University
Woei Lin , National Chung-Hsing University
Chin-Chi Wu , National Chung-Hsing University and Nan Kai Institute of Technology
This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method under bursty data traffic. The PPS comprises multiple packet switches operating independently and in parallel. The typical PPS dispatch algorithm uses a round-robin method (RR) . The class of PPS is characterized by deployment of parallel center-stage switches that oil memory buffers run slower than the external line rate. A novel SW packet switching method for PPS, called SW-PPS, is proposed. Under identical bursty data traffic, the SW-PPS provided improved performance when compared to RR-PPS. A mathematical, analytical model for SW-PPS is proposed. In addition, a novel bursty data traffic model is proposed: a packet-based bursty data traffic model. This packet-based bursty data traffic model can emulate more realistic network, and thus, produces more realistic simulation results.
C. Wu, W. Lin and C. Liu, "Evaluation and Analysis of the Sliding-Window Parallel Packet Switch," 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)(AINA), Taipei, Taiwan, 2005, pp. 355-358.