Before revision:  Specifically, in the case of Bernoulli arrivals ,  we show that the heavy-traffic scaled queue length is \left({2n}}\right)\left( n-3{2}+1{2n} . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the \right) heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern.
After revision:  Specifically, in the case of Bernoulli arrivals , we show that the heavy-traffic scaled queue length is \left({2n}}\right)||\sigma||^2, where \sigma is the vector of the standard deviations of arrivals to each port in the heavy-traffic limit. In the special case of uniform Bernoulli arrivals, the corresponding formula is given by\left( n-3{2}+1{2n} . Our result implies that the MaxWeight algorithm has optimal queue-length scaling behavior in the \right) heavy-traffic regime with respect to the size of a switch with a uniform traffic pattern.