Allocation of Partitioned Data by Using A Neural Network Based Approach

13 years 5 months ago

Download homepages.dsu.edu

In this paper, we investigate allocation of data partitions in the network for data objects that are partitioned by using secret sharing schemes [12] or erasure coding schemes [11]. We defined the problem as finding M nodes in the network to host the data partitions so that the total cost of reading K partitions and updating M partitions by all nodes in the network is minimized. This problem is NPhard. We proposed a SOFM-like algorithm and a heuristic algorithm for this problem. The numerical study shows both algorithms are effective for this problem. Key Words: Security, data partitioning, secret sharing, erasure coding, SOFM like Algorithm.

Manghui Tu, Dongfeng Wang, Peng Li, Nasser Tadayon

Real-time Traffic

CSREASAM 2007 | Data Partitions | Erasure Coding | Secret Sharing | Security Privacy |

claim paper

» Improved Rotational Invariance for Statistical Inverse in Electrical Impedance Tomography

» Allocation of simulation runs for simulation optimization

» Data Mining Approach for Analyzing Call Center Performance

» Efficient Data Allocation for a Cluster of Workstations

» An evolutionary artificial neural networks approach for breast cancer diagnosis

» Health Condition Prediction of Gears Using a Recurrent Neural Network Approach

» A Neural Network Model for Interproblem Adaptive Online Time Allocation

» Noiseinjected neural networks show promise for use on smallsample expression data

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	CSREASAM
Authors	Manghui Tu, Dongfeng Wang, Peng Li, Nasser Tadayon

Comments (0)

Sciweavers

Allocation of Partitioned Data by Using A Neural Network Based Approach

CSREASAM 2007 | Data Partitions | Erasure Coding | Secret Sharing | Security Privacy |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers