Search

Your search keyword '"Dong, Jiankang"' showing total 3 results
Start Over Author "Dong, Jiankang" Topic cloud computing
3 results on '"Dong, Jiankang"'

1. Virtual machine scheduling for improving energy efciency in IaaS cloud

Author

Dong Jiankang, Cheng Shiduan, Wang Hongbo, and Li Yangyang

Subjects
Job shop scheduling, Computer Networks and Communications, Computer science, Quadratic assignment problem, Bin packing problem, business.industry, Distributed computing, Cloud computing, Dynamic priority scheduling, Energy consumption, Fair-share scheduling, Two-level scheduling, Electrical and Electronic Engineering, business
Abstract

In IaaS Cloud, different mapping relationships between virtual machines (VMs) and physical machines (PMs) cause different resource utilization, so how to place VMs on PMs to reduce energy consumption is becoming one of the major concerns for cloud providers. The existing VM scheduling schemes propose optimize PMs or network resources utilization, but few of them attempt to improve the energy effciency of these two kinds of resources simultaneously. This paper proposes a VM scheduling scheme meeting multiple resource constraints, such as the physical server size (CPU, memory, storage, bandwidth, etc.) and network link capacity to reduce both the numbers of active PMs and network elements so as to finally reduce energy consumption. Since VM scheduling problem is abstracted as a combination of bin packing problem and quadratic assignment problem, which is also known as a classic combinatorial optimization and NP-hard problem. Accordingly, we design a two-stage heuristic algorithm to solve the issue, and the simulations show that our solution outperforms the existing PM- or network-only optimization solutions.

Published
2014
Full Text
View/download PDF

2. D4D: Inter-datacenter Bulk Transfers with ISP Friendliness.

Author

Li, Yangyang, Wang, Hongbo, Zhang, Peng, Dong, Jiankang, and Cheng, Shiduan

Abstract

Cloud infrastructure providers (CIPs) usually build a large number of geo-distributed data centers to cater to the recent proliferation of Cloud Computing. The CIPs commonly use multiple internet service providers (ISPs) to interconnect their geo-distributed data centers. Diurnal patterns and leftover bandwidth were effectively exploited by past studies to improve bandwidth utilization and minimize cost on inter-data center traffic. However, the growing number of inter-domain traffic was neglected. Inter-domain communications may become the potential bottleneck of inter-data center bulk transfers. Moreover, the rising inter-domain traffic increases the ISP operational cost, which will be not beneficial to reduce the CIPs' bandwidth cost or improve the quality of services over a long run. In this paper, we present a scheduling scheme that considers both bandwidth utilization and ISPs friendliness via a store-and-forward mechanism. The problem is modeled on a time-expanded graph. We compared our scheme with general bulk transfers mechanism under several different simulation settings. The results demonstrate that our strategy reduces the inter-domain traffic tremendously and achieves the ISP-friendliness significantly. [ABSTRACT FROM PUBLISHER]

Published
2012
Full Text
View/download PDF

3. Differentiated Bandwidth Guarantees for Cloud Data Centers.

Author

LI, YANGYANG, WANG, HONGBO, DONG, JIANKANG, LI, JUNBO, and CHENG, SHIDUAN

Subjects
BANDWIDTH allocation, CLOUD computing, SERVER farms (Computer network management), DIFFERENTIATED services networks, GENETIC algorithms
Abstract

By means of virtualization, computing and storage resources are effectively multiplexed by different applications in cloud data centers. However, there lacks useful approaches to share the internal network resource of cloud data centers. Invalid network sharing not only degrade the performance of applications, but also affect the efficiency of data center operation. To guarantee network performance of applications and provide fine-grained service differentiation, in this paper, we propose a differentiated bandwidth guarantee scheme for data center networks. Utility functions are constructed according to the throughput and delay sensitive characteristics of different applications. Aiming to maximize the utility of all applications, the problem is formulated as a multi-objective optimization problem. We solve this problem using a heuristic algorithm: the elitist Non-Dominated Sorted Genetic Algorithm-II(NSGA-II), and we make a multi-attribute decision to refine the solutions. Extensive simulations are conducted to show that our scheme provides minimum band-width guarantees and achieves more fine-grained service differentiation than existing approaches. The simulation also verifies that the proposed mechanism is suitable for arbitrary data center architectures. [ABSTRACT FROM AUTHOR]

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results