A coordination scheduling mechanism to guarantee packet ordering in parallel packet switch. (1st December 2008)

• Record Type: Journal Article
• Authors: Dai, Yi; Su, Jin-Shu; Zhang, Ying
• Is Part Of: International journal of electronic security and digital forensics. Volume 1:Number 4(2008)
• Page Start: 362
• Page End: 373
• Publication Date: 2008-12-01
• Subjects: CIOQ switches -- coordination scheduling -- parallel packet switching -- packet ordering -- cooperation -- delay performance; Computer crimes -- Periodicals; Computer crimes -- Investigation -- Periodicals; Computer security -- Periodicals; Electronic commerce -- Law and legislation -- Periodicals; Information warfare -- Periodicals; 005.805
• Languages: English
• ISSNs: 1751-911X

Abstract

A packet switch with parallel switching planes is a parallel packet switch (PPS). It is an open problem to design a PPS that is feasible to guarantee packet ordering with lower computation and communication overhead. Many solutions proposed previously are essentially impractical because of high communication complexity. In this paper, we attempt to make a PPS practical by using a simple cooperating scheduling mechanism between the round-robin demultiplexing at the inputs and the enhanced longest queue first (ELQF) scheduling at the central scheduler. In our scheme, no communication is needed during normal operation, and only sporadic communication between the central scheduler and demultiplexors is launched during the occurrence of starvation instead of each cell slot. As the experiment results demonstrate, our PPS offers improved delay performance compared with existing PPS designs.