Performance analysis of the sliding-window parallel packet switch

The paper is concerned with performance analysis of the parallel packet switch (PPS) with sliding window (SW) scheme. The PPS is composed of multiple packet switches operating independently and in parallel. The traditional PPS dispatch algorithm uses round-robin (RR) (Iyer, S., IEEE Trans. Networking, vol.11, no.2, p.314-24, 2003; Aslam, A. and Christensen, K., LCN 2002, p.270-7, 2002). The class of PPS is characterized by the deployment of parallel center-stage switches such that all memory buffers run slower than the external line rate. We propose a new SW packet switching scheme for the PPS, called SW-PPS. The SW-PPS can operate in a pipeline fashion to achieve the overall switching operation. Under Bernoulli data traffic, the SW-PPS provides significantly higher performance when compared with RR-PPS. The paper presents a mathematical analytical model for RR-PPS and SW-PPS.

[1]  Nick McKeown,et al.  Making parallel packet switches practical , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  Nick McKeown,et al.  Analysis of the parallel packet switch architecture , 2003, TNET.

[3]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[4]  Nick McKeown,et al.  Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..

[5]  Sanjeev Kumar.  The sliding-window packet switch: a new class of packet switch architecture with plural memory modules and decentralized control , 2003, IEEE J. Sel. Areas Commun..

[6]  Kenneth J. Christensen,et al.  Parallel packet switching using multiplexors with virtual input queues , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..