资源论文scalable constraint based virtual data center allocation

scalable constraint based virtual data center allocation

2019-10-31 | |  42 |   34 |   0
Abstract problems arising from highly diverse applications. This paper considers the problem of virtual data center (VDC) allocation, an important, emerging challenge for modern data center operators. To solve this problem, we introduce N ETSOLVER, which is based on the general-purpose constraint solver M ONO SAT. N ETSOLVER represents a major improvement over existing approaches: it is sound, complete, and scalable, providing support for end-to-end, multipath bandwidth guarantees across all the layers of hosting infrastructure, from servers to top-of-rack switches to aggregation switches to access routers. N ETSOLVER scales to realistic data center sizes and VDC topologies, typically requiring just seconds to allocate VDCs of 5–15 virtual machines to physical data centers with 1000+ servers, maintaining this efficiency even when the data center is nearly saturated. In many cases, N ETSOLVER can allocate 150%?300% as many total VDCs to the same physical data center as previous methods. Essential to our solution efficiency is our formulation of VDC allocation using monotonic theories, illustrating the practical value of the recently proposed SAT modulo monotonic theories approach.

上一篇:bernoulli rank bandits for click feedback

下一篇:fast change point detection on dynamic social networks

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...