A scheduling algorithm for IQ switching with QoS guarantee
Bin Wang · Dalian Ligong Daxue xuebao · 2003
IQ switching can support high speed permutation with low cost. Based on the study of Chang, a scheduling algorithm with QoS Guarantees is proposed by using the stochastic process theory and network calculus, and also, the upper bounds of delay and the backlog for data flow are analyzed by the theory of network calculus.