THREE DIMENSIONAL GRID STRUCTURE FOR EFFICIENT ACCESS OF REPLICATED DATA

2001 ◽  
Vol 02 (03) ◽  
pp. 317-329 ◽  
Author(s):  
MUSTAFA MAT DERIS ◽  
ALI MAMAT ◽  
PUA CHAI SENG ◽  
MOHD YAZID SAMAN

This article addresses the performance of data replication protocol in terms of data availability and communication costs. Specifically, we present a new protocol called Three Dimensional Grid Structure (TDGS) protocol, to manage data replication in distributed system. The protocol provides high availability for read and write operations with limited fault-tolerance at low communication cost. With TDGS protocol, a read operation is limited to two data copies, while a write operation is required with minimal number of copies. In comparison to other protocols. TDGS requires lower communication cost for an operation, while providing higher data availability.

2004 ◽  
Vol 05 (03) ◽  
pp. 299-312 ◽  
Author(s):  
M. D. MUSTAFA ◽  
B. NATHRAH ◽  
M. H. SUZURI ◽  
M. T. ABU OSMAN

Replication is an important technique in peer-to-peer environment, where it increases data availability and accessibility to users despite site or communication failure. However, determining the number of replication and where to replicate the data are the major issues. This paper proposes a hybrid replication model for fixed and mobile network in order to achieve high data availability. For the fixed network, a data will be replicated synchronously in a diagonal manner of logical grid structure, while for the mobile network, a data will be replicated asynchronously based on commonly visited sites for each user. In comparison to the previous techniques, diagonal replication technique (DRG) on fixed network requires lower communication cost for an operation, while providing higher data availability, which is preferred for large systems.


Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 539 ◽  
Author(s):  
Arun Kumar Sangaiah ◽  
Ali Asghar Rahmani Hosseinabadi ◽  
Morteza Babazadeh Shareh ◽  
Seyed Yaser Bozorgi Rad ◽  
Atekeh Zolfagharian ◽  
...  

The Internet of Things (IoT) is a distributed system that connects everything via internet. IoT infrastructure contains multiple resources and gateways. In such a system, the problem of optimizing IoT resource allocation and scheduling (IRAS) is vital, because resource allocation (RA) and scheduling deals with the mapping between recourses and gateways and is also responsible for optimally allocating resources to available gateways. In the IoT environment, a gateway may face hundreds of resources to connect. Therefore, manual resource allocation and scheduling is not possible. In this paper, the whale optimization algorithm (WOA) is used to solve the RA problem in IoT with the aim of optimal RA and reducing the total communication cost between resources and gateways. The proposed algorithm has been compared to the other existing algorithms. Results indicate the proper performance of the proposed algorithm. Based on various benchmarks, the proposed method, in terms of “total communication cost”, is better than other ones.


Author(s):  
Ali A. Amer

In distributed database systems (DDBS), the utmost purpose of data distribution and replication aims at shrinking transmission costs (TC), including communication costs, and response time. In this chapter, therefore, an enhanced heuristic clustering-based technique for data fragmentation and replicated based allocation is efficaciously presented. This work is mainly sought to further enhance an existing technique so TC is to be significantly minimized. In fact, the approached enhancement is applied by suggesting different replication scenarios. Off these scenarios, one scenario is to be selected based on competitive performance evaluation process. DDBS performance is measured via its being exposed on objective function (TC). Despite the fact that this work is mildly improved, yet evaluation results show that it has been promising, particularly as TC being the foremost design objective of DDBS System. Experimental results have been analyzed under all presented scenarios as an internal evaluation and are vividly provided to demonstrate the undeniable impact of data replication on DDBS performance.


2020 ◽  
Vol 10 (18) ◽  
pp. 6205
Author(s):  
Maria Cerreta ◽  
Roberta Mele ◽  
Giuliano Poli

The complexity of the urban spatial configuration, which affects human wellbeing and landscape functioning, necessitates data acquisition and three-dimensional (3D) visualisation to support effective decision-making processes. One of the main challenges in sustainability research is to conceive spatial models adapting to changes in scale and recalibrate the related indicators, depending on scale and data availability. From this perspective, the inclusion of the third dimension in the Urban Ecosystem Services (UES) identification and assessment can enhance the detail in which urban structure–function relationships can be studied. Moreover, improving the modelling and visualisation of 3D UES indicators can aid decision-makers in localising, analysing, assessing, and managing urban development strategies. The main goal of the proposed framework is concerned with evaluating, planning, and monitoring UES within a 3D virtual environment, in order to improve the visualisation of spatial relationships among services and to support site-specific planning choices.


2013 ◽  
Vol 756-759 ◽  
pp. 4429-4432
Author(s):  
Wu Ye ◽  
Ruo Yu Liang

Gives the method of 3D CAD parametric design under the guidance of the theory of reverse engineering. Describes the application of the method development process of complex-shaped surface mold. Analysis of the mold characteristics, coordinate measuring equipment accurate and efficient access to the basic outline of the data, the integration of CAD software to design mold forms, re-use processing module directly form processing code, complete mold processing and validation.


2014 ◽  
Vol 14 (2) ◽  
pp. 24-30 ◽  
Author(s):  
Gundala Swathi ◽  
R. Saravanan

Abstract In recent years synchronization plays a major issue for secure transmission in mobile adhoc networks. When an attacker modifies the time synchronization algorithm, the nodes will have faulty estimates of other nodes location, leading to chaos. While transmitting under these adverse conditions, packets might be lost or might be sent to wrong locations. Data replication and data diffusion are two methods which are used to solve the problem of data availability. In this paper we propose an algorithm for secure multi hop transmission used for external attacks.


2014 ◽  
Vol 631-632 ◽  
pp. 882-888
Author(s):  
Zong Xiao Lan ◽  
Ge Ming Xia ◽  
Ao Long Zhou

With the extensively applying of Wireless Sensor Networks (WSN), its' security drew more and more attention. In all the security issues in WSN, session key is fundamental one with great challenge. Due to the constraints of limited hardware resources and computational capabilities, use asymmetric encryption mechanisms in session key are not suitable for WSN. And there are usually a puzzle for existing symmetric encryption mechanisms that they produced heavy communication cost. In this paper, we presented a session key transmission scheme based on an algorithm ofData Partitioning with Coding, namedDPC. By using of non-perfect secret sharing, we optimized the communication costs significantly and keep the security in high level. The analysis and simulations prove that our scheme has good performance.


Sign in / Sign up

Export Citation Format

Share Document