Research on Graphic Model of the Novel Multiple-plane and Multiple-stage Packet Switching System

Abstract

In this paper, we present a graphic model of multiple-plane and multiple-stage packet switching system based on its topological architecture. We found that there are two vertex sub-sets belonging to the balanced vertex set and another two vertex sub-sets belonging to the competitive vertex set in MPMS model, respectively. Therefore, we only need to use balancing policies for the balanced vertex sets and use scheduling policies for the competitive vertex set to switch packets. Moreover, switching path counts (SPC) was proved to be equal to the multiplication of vertex out-degree of the balanced vertex sub-sets. Lastly, we studied the sufficient condition, is the SPC value is not less than parameter n, to offer enough non-conflicting switching paths for any vertex pair matching between DEMs and MUXs in MPMS.