Content Based Scheduling of Virtual Machines Using Merkle Tree

Rajat Jangir, Sagar Bajaj, Akshit Pandey · 2014

In today's scenario most of the companies are relying on cloud for storing their applications and services. Cloud deployment involves deployment of VM at particular compute node in data centre which requires transfer of VM disk image to compute node. Everyday thousands of VM are deployed in data centres this leads to increase in traffic in data centres. In this paper we proposed a scheme to reduce volume of data being transferred by using Content base scheduling and Merkle tree. In this scheme Merkle tree is used to find content similarity between VMs running on compute node and VM being deployed. The compute node which runs a VM which is most similar is chosen for deployment and hence only dissimilar contents are transferred. This helps in reducing traffic in data centres. Keywords- Content based scheduling, Merkle tree, Deduplication, SHA1, Content similarity

Read the paper · More papers on PaperTik