Shortest Expected Delay Scheduling

The shortest expected delay scheduling algorithm assigns network connections to the server with the shortest expected delay. The expected delay that the job will experience is (C_i + 1) / U_i if sent to the ith server, in which C_i is the number of connections on the the ith server and U_i is the fixed service rate (weight) of the ith server.