Incremental updates based on graph theory for consumer electronic devices

This paper presents a method for incremental updating on consumer electronic devices, called differential compression based on Dijkstra algorithm (DDIFF). It describes the similarities between the old and new versions as a directed weighted graph. In the graph, the shortest path between the start and end vertices corresponds to the minimal delta. As a result, the delta-encoding problem is reduced to the single-source shortest path problem. Experiments show that the proposed method is feasible, and average data transmission saving is as high as 69.3%. In comparison with the existing methods, DDIFF constructs the minimal patch, and the patch costs less time to apply1.

[1]  S. Mii,et al.  A study on program code synchronization in consumer devices , 2010, 2010 Digest of Technical Papers International Conference on Consumer Electronics (ICCE).

[2]  Sen Zhang,et al.  Two Efficient Algorithms for Linear Time Suffix Array Construction , 2011, IEEE Transactions on Computers.

[3]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[4]  S. Natarajan,et al.  DELTA++: Reducing the Size of Android Application Updates , 2015 .

[5]  Brenda S. Baker,et al.  Compressing Differences of Executable Code , 2012 .

[6]  Mea Wang,et al.  An update model for network coding in cloud storage systems , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Jari Karppanen,et al.  Lossless Differential Compression for Synchronizing Arbitrary Single-Dimensional Strings , 2012 .

[8]  Saurabh Bagchi,et al.  Efficient incremental code update for sensor networks , 2011, TOSN.

[9]  Yoshiaki Terashima,et al.  S/W upgrade for on-vehicle information devices , 2012, 2012 IEEE International Conference on Consumer Electronics (ICCE).

[10]  Johan J. Lukkien,et al.  Patching a patch - software updates using horizontal patching , 2013, IEEE Trans. Consumer Electron..

[11]  Adam B Seering.  Efficient storage of versioned matrices , 2011 .

[12]  Peter Van Roy,et al.  Lock-Free Decentralized Storage for Transactional Upgrade Rollback , 2010, 2010 19th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises.

[13]  Dana Shapira,et al.  In Place Differential File Compression , 2005, Comput. J..

[14]  Mingwei Lin,et al.  Efficient and intelligent garbage collection policy for NAND flash-based consumer electronics , 2013, IEEE Transactions on Consumer Electronics.

[15]  Johan J. Lukkien,et al.  Energy-aware Reprogramming of Sensor Networks Using Incremental Update and Compression , 2012, ANT/MobiWIS.

[16]  Jeffrey C. Mogul,et al.  The VCDIFF Generic Differencing and Compression Data Format , 2002, RFC.

[17]  Feng Xia,et al.  An experimental analysis on cloud-based mobile augmentation in mobile cloud computing , 2014, IEEE Transactions on Consumer Electronics.

[18]  Colin Percival.  Naı̈ve Differences of Executable Code , 2003 .

[19]  Kenneth J. Christensen,et al.  DELTA: Delta encoding for less traffic for apps , 2012, 37th Annual IEEE Conference on Local Computer Networks.

[20]  Torsten Suel,et al.  zdelta: An efficient delta compression tool , 2002 .

[21]  Nikolaj Bjørner,et al.  Optimizing File Replication over Limited-Bandwidth Networks using Remote Differential Compression , 2006 .

[22]  Giovanni Motta,et al.  Differential Compression of Executable Code , 2007, 2007 Data Compression Conference (DCC'07).

[23]  Johan J. Lukkien,et al.  Efficient reprogramming of wireless sensor networks using incremental updates , 2013, 2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[24]  Richard P. Brent.  Matching with mismatches and assorted applications , 2006 .

[25]  Jon Louis Bentley,et al.  Data compression using long common strings , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[26]  Andrew Tridgell,et al.  Efficient Algorithms for Sorting and Synchronization , 1999 .

[27]  Kunihiko Sadakane,et al.  Faster suffix sorting , 2007, Theoretical Computer Science.