Logarithmic delay for N/spl times/N packet switches

We consider the fundamental delay bounds for scheduling packets in an N/spl times/N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the best known delay bound for packet switches, and is the first analytical proof that sublinear delay is achievable in a packet switch with random inputs. The algorithm is shown to be implementable with very low complexity, requiring O(N/sup 1.5/ log(N)) total operations per timeslot.