Skip to Main Content
We show an isomorphism between maximal matching for packet scheduling in crossbar switches and strictly non-blocking circuit switching in three-stage Clos networks. We use the analogy for a crossbar switch of size n times n to construct a simple multicast packet scheduler of complexity O(n log n) based on maximal matching. We show that, with this simple scheduler, a speedup of O(log n/log log n) is necessary to support 100% throughput for any admissible multicast traffic. If fanout splitting of multicast packets is not allowed, we show that an extra speedup of 2 is necessary, even when the arrival rates are within the admissible region for mere unicast traffic. Also we revisit some problems in unicast switch scheduling. We illustrate that the analogy provides useful perspectives and we give a simple proof for a well known result.