Abstract
Multiple replicas of multimedia objects are distributed to peers in overlay networks. In quorum-based (QB) protocols, every replica may not be up-to-date and the up-to-date replica can be found in the version counter. Multimedia objects are characterized in terms of not only data structure but also quality of service (QoS) parameters like frame rate. A transaction reads a parameter of a replica while there is a type of read operation to read a whole state of a replica. Each parameter of a replica is changed through a write operation. Thus, the data structure and QoS parameters of a replica are independently manipulated. In the multimedia quorum-based (MQB) protocol, multiple replicas of a multimedia object are synchronized based on the newness precedent relation. An object is an encapsulation of data and abstract operations for manipulating the data. There are enriching and impoverishing types of write operations. Some data is added to a replica in an enriching operation. On the other hand, some data in a replica is removed in an impoverishing operation. In order to reduce the overhead to write every replica in a quorum, we take an approach that the state of each replica is not always updated. If a transaction issues an enriching write operation, every replica in the write quorum is updated in the same way as the QB protocol. On the other hand, if an impoverishing write operation is issued, every replica is not updated in the quorum. Impoverishing operations are just recorded in replicas. On receipt of a read operation to read a whole state, impoverishing operations recorded are performed on a replica. The MQB protocol is evaluated in terms of the processing overhead of replicas. We show that the processing overhead of each replica can be reduced in the MQB protocol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chuang, C., Kao, S.: Adjustable flooding-based discovery with multiple QoSs for cloud services acquisition. Int. J. Web Grid Serv. 7(2), 208–224 (2011)
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon’s Highly Available Key-value Store. ACM SIGOPS Oper. Syst. Rev. 14(6), 205–220 (2007)
Enokido, T., Higaki, H., Takizawa, M.: Group protocol for distributed replicated objects. In: Proc. of the 27th International Conference on Parallel Processing (ICPP-98), pp. 570–577 (1998)
Enokido, T., Hori, K., Takizawa, M., Raynal, M.: Quorum-based multi-invocation model for replicated objects. J. Concurr. Eng. Res. Appl. 12(3), 185–194 (2004)
Flahive, A., Taniar, D., Rahayu, W.: Ontology as a service (OaaS): a case for sub-ontology merging on the cloud. J. Supercomput. (2012, to appear). doi:10.1007/s11227-011-0711-4
Gifford, D.K.: Weighted voting for replicated data. In: Proc. of the 7th Symposium on Operation Systems Principles (SOSP ’79), pp. 150–162 (1979)
Gray, J.: Notes on database operating systems. In: Lecture Notes in Computer Science, vol. 60. Springer, Berlin (1978)
Helal, A., Bhargava, B.: Performance evaluation of the quorum consensus replication method. In: Proc. of Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium, pp. 165–172 (1995)
Herlihy, M.: A quorum-consensus replica method for abstract data types. ACM Trans. Comput. Syst. 4(1), 32–53 (1986)
Hofmann, P., Woods, D.: Cloud computing: the limits of public clouds for business applications. IEEE Internet Comput. 14, 90–93 (2010). ISBN 1089-7801
Kim, W.: Could computing adoption. Int. J. Web Grid Serv. 7(3), 225–245 (2011)
Nghiem, T.P., Waluyo, A.B., Tanier, D.: A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks. Pers. Ubiquitous Comput. (2012, to appear). doi:10.1007/s00779-012-0545-y
Ohkawara, T., Aikebaier, A., Enokido, T., Takizawa, M.: Quorums-based replication of multimedia objects in distributed systems. In: Proc. of the International Conference on Network-Based Information Systems (NBiS-2011), pp. 333–340 (2011)
Ohkawara, T., Aikebaier, A., Enokido, T., Takizawa, M.: Completable quorums of multimedia objects. In: Proc. of IEEE the 26th International Conference on Advanced Information Networking and Applications (AINA-2012), pp. 597–604 (2012)
Schollmeier, R.: A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In: Proc. of the First International Conference on Peer-to-Peer Computing (P2P-2001), pp. 101–102 (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proc. of ACM the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM ’01), pp. 149–160 (2001)
Tanaka, K., Hasegawa, K., Takizawa, M.: Quorum-based replication in object-based systems. J. Inf. Sci. Eng. 6(7), 317–331 (2000)
Tanaka, K., Takizawa, M.: Quorum-based locking protocol for replicas in object-based systems. In: Proc. of IEEE the 5th International Symposium or Autonomous Decentralized Systems (ISORC-2001), pp. 196–203 (2001)
Waluyo, A.B., Taniar, D., Rahayu, W., Aikebaier, A., Takizawa, M., Srinivasan, B.: Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments. J. Comput. Syst. Sci. (2012, to appear). doi:10.1016/j.jcss.2011.10.019
Waluyo, A.B., Taniar, D., Rahayu, W., Aikebaier, A., Takizawa, M., Srinivasan, B.: Mobile peer-to-peer data dissemination in wireless ad-hoc networks. J. Inf. Sci. (2012, to appear). doi:10.1016/j.ins.2012.07.035
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ohkawara, T., Aikebaier, A., Enokido, T. et al. Quorum-based synchronization protocols for multimedia replicas. Cluster Comput 16, 979–988 (2013). https://doi.org/10.1007/s10586-012-0239-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10586-012-0239-2