Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show an isomorphism beten maximal matching for packet scheduling in crossbar switches and strictly non-blocking circuit switching in three-stage Clos networks.  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.  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 allod,  show that an extra speedup of 2 is necessary, even when the arrival rates are within the admissible region for mere unicast traffic. Also  revisit some problems in unicast switch scheduling.  illustrate that the analogy provides useful perspectives and  give a simple proof for a ll known result.
['Can Emre Koksal']
I am writing a research paper on a idea On the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches
[{"from": "human", "value": "I am writing a research paper on a idea On the Speedup Required to Achieve 100% Throughput for Multicast Over Crossbar Switches"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show an isomorphism beten maximal matching for packet scheduling in crossbar switches and strictly non-blocking circuit switching in three-stage Clos networks.  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.  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 allod,  show that an extra speedup of 2 is necessary, even when the arrival rates are within the admissible region for mere unicast traffic. Also  revisit some problems in unicast switch scheduling.  illustrate that the analogy provides useful perspectives and  give a simple proof for a ll known result."}]