Usage
  • 13 views
  • 22 downloads

Dynamic Network Resource Allocation

  • Author / Creator
    Sheng, Yu
  • A fair and optimal mechanism is required for allocating bandwidth to virtual machine migration in a WAN environment. In this thesis, we propose a dynamic resource allocation algorithm running in either centralized or distributed environments. The centralized version of our algorithm collects information from individual users and dynamically allocates bandwidth according to their demands. The distributed version of our algorithm is running on the internal nodes (e.g. routers) in the network. In the distributed case, we show that even when the routers and the users do not exchange allocation information, the allocation is still stable and optimal if the users are elastic users. Another interesting problem we solved is emergency handling, which is also critical in virtual machine live migration.

  • Subjects / Keywords
  • Graduation date
    2010-11
  • Type of Item
    Thesis
  • Degree
    Master of Science
  • DOI
    https://doi.org/10.7939/R35148
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
  • Language
    English
  • Institution
    University of Alberta
  • Degree level
    Master's
  • Department
    • Department of Computing Science
  • Supervisor / co-supervisor and their department(s)
    • MacGregor, Mike (Computing Science)
  • Examining committee members and their departments
    • MacGregor, Mike (Computing Science)
    • Tellambura, Chinthananda (Electrical & Computer Engineering)
    • Nikolaidis, Ioanis (Computing Science)