A Novel Traffic Dispatch Algorithm for the Parallel Packet Switch

摘要

The performance of the parallel packet switch (PPS) is limited by the size of buffer on each I/O port. Large port buffer will increase the delay time and make the PPS Impractical. A novel traffic dispatch algorithm called SQ-UA Is therefore proposed in order to downsize the port buffer of the PPS. SQ-UA chooses the shortest queue among the unused FIFO while keeping the uniformity of traffic. We use a new technique of analysis to determine the minimum bound of the port buffer and the queuing delay of the PPS in the worst case.