Priority Based Resource Allocation in Hybrid Network Environment

Yuvaraj Rengasamy ； Adiline Magrica

《International Journal of Electronics and Information Engineering》 3卷2期 (2015/12) Pp. 81-90

https://doi.org/10.6636/IJEIE.201512.3(2).03

並列摘要

This paper deals about the resource allocation hybrid cloud computing environment. Many papers deal about the resource allocation in a static environment. Some special author occasionally expressed the details of resource allocation in dynamic mobile environment. Many authors strongly explain the implementation of BigData concepts in cloud computing concept. Our proposed scheme is the combination of all. For handling of BigData we take Hadoop Frame work. In a static environment, we include the mobile nodes to handle the some of the data which is already occupied in 2 locations static network. Then prove to move that information into one dynamic wireless node for easy accessing the data. Kept the data in three location is slightly create the resemblance of Hadoop framework. The priority for resource allocation is done by on the basis of shortest length in many papers. Here we use two kinds of shortest distance using Dijkstra's algorithm shortest path algorithm for static network. Kruskal's algorithm shortest path in the dynamic mobile network. To increase the efficiency of the priority based resource allocation is the main objective of this architecture. This architecture also reduces the lagging time after fetch the request towards the server.

並列關鍵字

BigData ； Hadoop ； Resource Allocation