A Proposal for High Availability of HDFS Architecture based on Threshold Limit and Saturation Limit of the Namenode
Author(s) -
Sabyasachi Chakraborty,
Kashyap Barua,
Manjusha Pandey,
Siddharth Swarup Rautaray
Publication year - 2017
Publication title -
international journal of information engineering and electronic business
Language(s) - English
Resource type - Journals
eISSN - 2074-9023
pISSN - 2074-9031
DOI - 10.5815/ijieeb.2017.06.04
Subject(s) - computer science , distributed file system , big data , single point of failure , architecture , limit (mathematics) , file system , node (physics) , field (mathematics) , high availability , operating system , database , distributed computing , engineering , mathematical analysis , mathematics , art , structural engineering , pure mathematics , visual arts
Big Data which is one of the newest technologies in the present field of science and technology has created an enormous drift of technology to a salient data architecture. The next thing that comes right after big data is Hadoop which has motivated the complete Big Data Environment to its jurisdiction and has reinforced the complete storage and analysis of big data. This paper discusses a hierarchical architecture of Hadoop Nodes namely Namenodes and Datanodes for maintaining a High Availability Hadoop Distributed File System. The High Availability Hadoop Distributed File System architecture establishes itself onto the two fundamental model of Hadoop that is Master-Slave Architecture and elimination of single point node failure. The architecture will be of such utilization that there will be an optimum load on the data nodes and moreover there will be no loss of any data in comparison to the size of data.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom