Distributed Resource Allocation for Data Center Networks- A Hierarchical Game Approach
Abstract
The increasing demand for cloud-based services in data computing and storage motivates large-scale data center development and deployment. This paper studies the Distributed Resource Allocation for Data Center Networks- A Hierarchical Game Approach system resource allocation problem when multiple data center operators (DCOs) serve multiple service subscribers (SSs) simultaneously. We formulate a hierarchical game to analyze this system where the DCOs and the SSs are respectively regarded as leaders and followers. In the proposed Distributed Resource Allocation for Data Center Networks- A Hierarchical Game Approach, each SS selects its preferred price serving DCO and purchases the optimal amount of resources for the computing requirements of the SS. Based on the SS’ and other DCO’s’ responses, the DCOs decide on their resource prices to get the highest profit.
System Configuration
H/W System Configuration
Speed : 1.1 GHz
RAM : 256 MB(min)
Hard Disk : 20 GB
Floppy Drive : 1.44 MB
Key Board : Standard Windows Keyboard
Mouse : Two or Three Button Mouse
Monitor : SVGA
S/W System Configuration
Platform : cloud computing
Operating system : Windows Xp,7,
Server : WAMP/Apache
Working on : Browser Like Firefox, IE
Conclusion
In this paper, we studied the resource allocation problem when multiple data center operators (DCOs) and service subscribers (SSs) coexist in the networks. To analyze the relationships between multiple DCOs and SSs, we have modeled the scenario as a multi-leader multi-follower hierarchical game where the DCOs act as leaders and the SSs act as followers. Results of simulation have shown that for the benefit of SSs, all DCOs compete with each other and all DCOs adopt the proposed sub-gradient strategies to achieve the game’s high social welfare.
