Before revision:  We show that our resource allocation  algorithms are arbitrarily close to the optimal performance at the price of reduced convergence rate  .
After revision:  We show that our resource allocation algorithms are arbitrarily close to the optimal performance at the price of reduced convergence rate . We also calculate the overhead of our algorithms in a realistic set-up and propose solutions for the implementation issues .