Reduction of Processing Overhead to Synchronize Multmedia Replicas

Replicas of a multimedia object are characterized in terms of not only data structure but also quality of service (QoS). Multimedia replicas are updated by two types of write operations, i.e. enriching and impoverishing types, where some data is added and removed in a replica, respectively. Computation resources are spent to materialize, i.e. physically update multimedia replicas by encoding and decoding multimedia data. It is critical to reduce the processing overhead of each replica to materialize. In our protocol named an extended multimedia quorum-based (EMQB) protocol, a replica in a write quorum is not materialized each time a write operation is issued. Only in an enriching type of write operation, some number, not necessarily all of replicas in a write quorum are materialized. In the other replicas, write operations are just logged but not performed. The replica can be materialized by performing operations in the log if every operation is an impoverishing type because just some data in a physical state of the replica is removed. However, the replica cannot be materialized if some operation is an enriching type in the log. Hence, a newest, materialized replica may not be in a read quorum. In the EMQB protocol, replicas are randomly selected to be in a read quorum until a materialized replica is ound. We show that the processing overhead of each replica can be reduced in the EMQB protocol compared with the QB and MQB protocols in terms of the total processing overhead of replicas.

[1]  Tomoya Enokido,et al.  Quorums for Replication of Multimedia Objects in P2P Overlay Networks , 2012, 2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems.

[2]  Tomoya Enokido,et al.  Group protocol for distributed replicated objects , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[3]  Paul Hofmann,et al.  Cloud Computing: The Limits of Public Clouds for Business Applications , 2010, IEEE Internet Computing.

[4]  B. Bhargava,et al.  Performance evaluation of the quorum consensus replication method , 1995, Proceedings of 1995 IEEE International Computer Performance and Dependability Symposium.

[5]  Rüdiger Schollmeier,et al.  A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[6]  Tomoya Enokido,et al.  Quorums-based Replication of Multimedia Objects in Distributed Systems , 2011, 2011 14th International Conference on Network-Based Information Systems.

[7]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[8]  Tomoya Enokido,et al.  Completable Quorums of Multimedia Objects , 2012, 2012 IEEE 26th International Conference on Advanced Information Networking and Applications.

[9]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[10]  Tomoya Enokido,et al.  Quorum-Based Replication of Multimedia Objects in Distributed Systems , 2011, NBiS.

[11]  Michel Raynal,et al.  Quorum-Based Multi-Invocation Model for Replicated Objects , 2004, Concurr. Eng. Res. Appl..

[12]  Makoto Takizawa,et al.  Quorum-based locking protocol for replicas in object-based systems , 2001, Proceedings 5th International Symposium on Autonomous Decentralized Systems.

[13]  Makoto Takizawa,et al.  Quorum-Based Replication in Object-Based Systems , 2000, J. Inf. Sci. Eng..