Efficient and Fair Bandwidth Scheduling in Cloud Environments

  • Khaleel M
  • Zhu M
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Hundreds of thousands of servers from data centers are operated to provide users with pay-as-yougo infrastructure as a service, platform as a service, and software as a service. Many different types of virtual machine (VM) instances hosted on these servers oftentimes need to efficiently communicate with data movement under current bandwidth capacity. This motivates providers to seek for a bandwidth scheduler to satisfy objectives, namely assuring the minimum bandwidth per VM for the guaranteed deadline and eliminating network congestion as much as possible. Based on some rigorous mathematical models, we formulated a cloud-based bandwidth scheduling algorithm which enables dynamic and fair bandwidth management by categorizing the total bandwidth into several categories and adjusting the allocated bandwidth limit per VM for both upstream and downstream traffics in real time. The simulation showed that paradigm was able to utilize the total assigned bandwidth more efficiently compared to algorithms such as bandwidth efficiency persistence proportional sharing (PPS), PPS, and PS at the network level.

Cite

CITATION STYLE

APA

Khaleel, M., & Zhu, M. (2018). Efficient and Fair Bandwidth Scheduling in Cloud Environments. ARO-THE SCIENTIFIC JOURNAL OF KOYA UNIVERSITY, 6(2), 20. https://doi.org/10.14500/aro.10441

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free