2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
June 25, 2007 to June 27, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2007.99
Ben Liang , University of Toronto
Baochun Li , University of Toronto
Yunfeng Lin , University of Toronto
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable. As such, maintaining the persistence of periodically measured data in a scalable fashion has become a critical challenge in such systems, without the use of centralized servers. To better cope with node dynamics and failures, we propose priority random linear codes, as well as their affiliated pre-distribution protocols, to maintain measurement data in different priorities, such that critical data have a higher opportunity to survive node failures than data of less importance. A salient feature of priority random linear codes is the ability to partially recover more important subsets of the original data with higher priorities, when it is not feasible to recover all of them due to node dynamics. We present extensive analytical and experimental results to show the effectiveness of priority random linear codes.
Ben Liang, Baochun Li, Yunfeng Lin, "Differentiated Data Persistence with Priority Random Linear Codes", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 47, 2007, doi:10.1109/ICDCS.2007.99