Please use this identifier to cite or link to this item:
|Title:||Probabilistic-bandwidth guarantees with pricing in data-center networks|
|Source:||Divakaran, D.M.,Gurusamy, M. (2013). Probabilistic-bandwidth guarantees with pricing in data-center networks. IEEE International Conference on Communications : 3716-3720. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2013.6655132|
|Abstract:||Bandwidth-sharing in data-center networks is an important problem that affects the growth of multi-tenant datacenters. A promising solution approach is the use of advance reservations. Such systems are usually based on deterministic models, assuming users to have precise knowledge of bandwidth they require, which is unlikely. This work takes a deviation and proposes a probabilistic model, where bandwidth requirements are specified along with some probabilities. As user-estimate of bandwidth depends on the cost they incur, we tie up the model with differential pricing; and formulate bandwidth allocation as a two-phase - static and dynamic - optimization problem. We show that the problem in each phase is NP-hard. We develop a bandwidth-allocator that processes requests and defines bandwidth profiles for accepted requests by solving the optimization problems. Numerical studies show that, in comparison to the deterministic model, our model brings down the number of rejected requests significantly, while allocating more bandwidth and thereby increasing revenue for providers. © 2013 IEEE.|
|Source Title:||IEEE International Conference on Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.