Binary-Tree Based Estimation of File Requests for Efficient Data Replication

2017 ◽  
Vol 28 (7) ◽  
pp. 1839-1852 ◽  
Author(s):  
Stavros Souravlas ◽  
Angelo Sifaleras
Entropy ◽  
2020 ◽  
Vol 22 (2) ◽  
pp. 245
Author(s):  
István Finta ◽  
Sándor Szénási ◽  
Lóránt Farkas

In this contribution, we provide a detailed analysis of the search operation for the Interval Merging Binary Tree (IMBT), an efficient data structure proposed earlier to handle typical anomalies in the transmission of data packets. A framework is provided to decide under which conditions IMBT outperforms other data structures typically used in the field, as a function of the statistical characteristics of the commonly occurring anomalies in the arrival of data packets. We use in the modeling Bernstein theorem, Markov property, Fibonacci sequences, bipartite multi-graphs, and contingency tables.


2015 ◽  
Vol 37 ◽  
pp. 399
Author(s):  
Sogand Sahabi Moghaddam ◽  
Abbas Karimi

Multicast data replication provides a possible solution for improving data accessibility in highly dynamic and fault prone mobile ad hoc environments. Our novel multicast data replication approach operates in a self-organizing manner where the network nodes that has unit host detector construct a connected dominating set (CDS) based on the topology graph by collecting information from neighboring nodes using multicast if gathered data from neighbors have two non-adjacent neighbors then use that virtual backbone for efficient data replication, data search and routing. In this study, we compare our proposed approach with SCALAR and evaluate it in average hop counts and successful delivery ratio with different node numbers and speeds.It is shown that the average hop counts increased but with falling rate and 20 percent successful delivery ratio is achieved, so it is demonstrated that PM act with respect to fault tolerance improvement, power consumption and load balancing is occurred.


2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Xianke Sun ◽  
Gaoliang Wang ◽  
Liuyang Xu ◽  
Honglei Yuan

PurposeIn data grids, replication has been regarded as a crucial optimization strategy. Computing tasks are performed on IoT gateways at the cloud edges to obtain a prompt response. So, investigating the data replication mechanisms in the IoT is necessary. Henceforth, a systematic survey of data replication strategies in IoT techniques is presented in this paper, and some suggestions are offered for the upcoming works. In two key classifications, various parameters dependent on the analysis of the prevalent approaches are considered. The pros and cons associated with chosen strategies have been explored, and the essential problems of them have been presented to boost the future of more effective data replication strategies. We have also discovered gaps in papers and provided solutions for them.Design/methodology/approachProgress in Information Technology (IT) growth has brought the Internet of Things (IoT) into life to take a vital role in our everyday lifestyles. Big IoT-generated data brings tremendous data processing challenges. One of the most challenging problems is data replication to improve fault-tolerance, reliability, and accessibility. In this way, if the primary data source fails, a replica can be swapped in immediately. There is a significant influence on the IoT created by data replication techniques, but no extensive and systematic research exists in this area. There is still no systematic and full way to address the relevant methods and evaluate them. Hence, in the present investigation, a literature review is indicated on the IoT-based data replication from papers published until 2021. Based on the given guidelines, chosen papers are reviewed. After establishing exclusion and inclusion criteria, an independent systematic search in Google Scholar, ACM, Scopus, Eric, Science Direct, Springer link, Emerald, Global ProQuest, and IEEE for relevant studies has been performed, and 21(6 paper analyzed in section 1 and 15 paper analyzed in section 3) papers have been analyzed.FindingsThe results showed that data replication mechanisms in the IoT algorithms outperform other algorithms regarding impressive network utilization, job implementation time, hit ratio, total replication number, and the portion of utilized storage in percentage. Although a few ideas have been suggested that fix different facets of IoT data management, we predict that there is still space for development and more study. Thus, in order to design innovative and more effective methods for future IoT-based structures, we explored open research directions in the domain of efficient data processing.Research limitations/implicationsThe present investigation encountered some drawbacks. First of all, only certain papers published in English were included. It is evident that some papers exist on data replication processes in the IoT written in other languages, but they were not included in our research. Next, the current report has only analyzed the mined based on data replication processes and IoT keyword discovery. The methods for data replication in the IoT would not be printed with keywords specified. In this review, the papers presented in national conferences and journals are neglected. In order to achieve the highest ability, this analysis contains papers from major global academic journals.Practical implicationsTo appreciate the significance and accuracy of the data often produced by different entities, the article illustrates that data provenance is essential. The results contribute to providing strong suggestions for future IoT studies. To be able to view the data, administrators have to modify novel abilities. The current analysis will deal with the speed of publications and suggest the findings of research and experience as a future path for IoT data replication decision-makers.Social implicationsIn general, the rise in the knowledge degree of scientists, academics, and managers will enhance administrators' positive and consciously behavioral actions in handling IoT environments. We anticipate that the consequences of the present report could lead investigators to produce more efficient data replication methods in IoT regarding the data type and data volume.Originality/valueThis report provides a detailed literature review on data replication strategies relying on IoT. The lack of such papers increases the importance of this paper. Utilizing the responses to the study queries, data replication's primary purpose, current problems, study concepts, and processes in IoT are summarized exclusively. This approach will allow investigators to establish a more reliable IoT technique for data replication in the future. To the best of our understanding, our research is the first to provide a thorough overview and evaluation of the current solutions by categorizing them into static/dynamic replication and distributed replication subcategories. By outlining possible future study paths, we conclude the article.


2018 ◽  
Vol 8 (3) ◽  
pp. 60-77
Author(s):  
Sanjaya Kumar Panda ◽  
Saswati Naik

This article describes how data replication plays an important role in distributed systems. It primarily focuses on the redundancy of data at two or more nodes, to achieve both fault tolerance and improved performance. Therefore, many researchers have proposed various data replication algorithms to manage the redundancy of data. However, they have not considered the faults that are associated with the nodes, such as permanent, transient and intermittent. Moreover, they have not incorporated any recovery approach to rejoin the failed nodes. Therefore, the authors propose a data replication algorithm, called dynamic vote-based data replication (DVDR). The main contribution of DVDR is to consider all types of faults and rejoin the failed nodes. DVDR is based on dynamic vote assignment among the connected nodes, and referred as passive and non-hierarchical one. The authors perform rigorous analysis of DVDR and compare with an existing dynamic vote assignment algorithm. The result shows the efficacy of the proposed algorithm.


Author(s):  
Sanjaya Kumar Panda ◽  
Saswati Naik

This article describes how data replication plays an important role in distributed systems. It primarily focuses on the redundancy of data at two or more nodes, to achieve both fault tolerance and improved performance. Therefore, many researchers have proposed various data replication algorithms to manage the redundancy of data. However, they have not considered the faults that are associated with the nodes, such as permanent, transient and intermittent. Moreover, they have not incorporated any recovery approach to rejoin the failed nodes. Therefore, the authors propose a data replication algorithm, called dynamic vote-based data replication (DVDR). The main contribution of DVDR is to consider all types of faults and rejoin the failed nodes. DVDR is based on dynamic vote assignment among the connected nodes, and referred as passive and non-hierarchical one. The authors perform rigorous analysis of DVDR and compare with an existing dynamic vote assignment algorithm. The result shows the efficacy of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document