Abstract: This application discloses a method for assigning a task on a computer network. In response to a request received for implementing a task, a task assignment server identifies a first location associated with the task, and obtains location information that indicates locations of a plurality of servers on the computer network. In accordance with a predetermined task assignment model, each of the plurality of servers has a respective distance from the first location which is computed based on the respective location information of the respective server. The server further identifies at least one server of the plurality of servers and assigns the task to the identified at least one server, when a distance between the first location and a second location of the at least one server is less than any other distances between the first location and the other servers of the plurality of servers.

Abstract: This invention provides a structure of load-balancing packet switches with minimum buffers complexity and its concomitant methodology. It abandons the VOQ between the first stage and the second stage fabrics, which has no problems of queue delay and packets out-of-sequence. Therefore, this invention solves the packets out-of-sequence problem in load-balancing Birkhoff-von Neumann switching structure and improves the end-to-end throughput. Moreover, it greatly reduces the buffer complexity to O(N).