A Novel Scheduling Scheme with Bandwidth Guarantees in the Multiple-Plane and Multiple-Stage Packet Switching Fabric
一种多级多平面分组交换结构中的带宽保证型调度算法

The multiple-plane and multiple-stage (MPMS) switching fabric has attractive scalability features that make it appealing as an alternative for scalable routers. However, scheduling packets in MPMS fabric is complex. In this paper, a novel scheduling scheme is proposed with bandwidth guarantees for the MPMS fabric. It can deliver 100% throughput under Bernoulli uniform traffic, 92% throughput in the worst case under nonuniform traffic and allocate bandwidth according to reserved bandwidth under overloaded traffic.