—On administrating a computer system, its configuration data is important. Thus, the system usually treats to protect the configuration data. Moreover, recently, computer systems that consist of large scale network, such as distributed systems, cloud systems and so on, have been developed. For these systems, it is an important issue to administrate the configuration data of each computer of the system. On the other hand, in general, a computer system becomes more complicated because of not only its scale but also its improvement of the services. Then, this causes increase in size of its configuration data.
In this paper, we introduce the k-monitoring remote data problem where the remote data rarely happens to be changed. The data is expected to be changed in at most k bits. We assume that a remote computer and a local computer are connected by network, and share the same data of length N at the beginning. We also assume that some of bits of the remote data are expected to be changed, after a while. Then, the problem is finding the protocol between the computers so that the local computer outputs the each position of the changed bits.
In this paper, we propose the protocols within the communication bits of length θ(logN)
for 1- and 2-Monitoring Remote Data Protocol.
—Humming distance, communication complexity, redundant coding.
N. Sakamoto is with the Department of Information and Communication Engineering, Tokyo Denki University, Tokyo, Japan (e-mail: firstname.lastname@example.org).
Cite:Naoshi Sakamoto, "Monitoring Remote Data Problem," International Journal of Computer Theory and Engineering vol. 8, no. 1, pp. 36-40, 2016.