Load Balancing on Two Identical Facilities

Work is sent to a pair of identical facilities in amounts Y sub 1...., Y sub N that are independent samples from a given exponential distribution. We analyze the transient behavior of the Markov chain that describes the work imbalance created by the online greedy policy for load balancing, i.e., the policy that successively assigns the Y sub i to the more lightly loaded facility.