Please prove that the maximum throughput of input queued switch is 0.586 when switch size N approaches infinity. Assume the incoming traffic is uniformly distributed.
Please demonstrate that for virtual output queuing, maximum weight scheduling is better that maximum size scheduling.
Please draw 16 × 16 Batcher sorting network. What is the complexity of this network?
Explain why worst-case fair WFQ can have the absolute fairness bound.