Skip to main content
Erschienen in: Cluster Computing 4/2013

01.12.2013

Quorum-based synchronization protocols for multimedia replicas

verfasst von: Tadateru Ohkawara, Ailixier Aikebaier, Tomoya Enokido, Makoto Takizawa

Erschienen in: Cluster Computing | Ausgabe 4/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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) CrossRef 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) CrossRef
2.
Zurück zum Zitat 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) CrossRef 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) CrossRef
3.
Zurück zum Zitat 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., 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)
4.
Zurück zum Zitat 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) CrossRef 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) CrossRef
5.
Zurück zum Zitat 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 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
6.
Zurück zum Zitat Gifford, D.K.: Weighted voting for replicated data. In: Proc. of the 7th Symposium on Operation Systems Principles (SOSP ’79), pp. 150–162 (1979) CrossRef Gifford, D.K.: Weighted voting for replicated data. In: Proc. of the 7th Symposium on Operation Systems Principles (SOSP ’79), pp. 150–162 (1979) CrossRef
7.
Zurück zum Zitat Gray, J.: Notes on database operating systems. In: Lecture Notes in Computer Science, vol. 60. Springer, Berlin (1978) Gray, J.: Notes on database operating systems. In: Lecture Notes in Computer Science, vol. 60. Springer, Berlin (1978)
8.
Zurück zum Zitat 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) 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)
9.
Zurück zum Zitat Herlihy, M.: A quorum-consensus replica method for abstract data types. ACM Trans. Comput. Syst. 4(1), 32–53 (1986) CrossRef Herlihy, M.: A quorum-consensus replica method for abstract data types. ACM Trans. Comput. Syst. 4(1), 32–53 (1986) CrossRef
10.
Zurück zum Zitat Hofmann, P., Woods, D.: Cloud computing: the limits of public clouds for business applications. IEEE Internet Comput. 14, 90–93 (2010). ISBN 1089-7801 CrossRef Hofmann, P., Woods, D.: Cloud computing: the limits of public clouds for business applications. IEEE Internet Comput. 14, 90–93 (2010). ISBN 1089-7801 CrossRef
11.
Zurück zum Zitat Kim, W.: Could computing adoption. Int. J. Web Grid Serv. 7(3), 225–245 (2011) CrossRef Kim, W.: Could computing adoption. Int. J. Web Grid Serv. 7(3), 225–245 (2011) CrossRef
12.
Zurück zum Zitat 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 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
13.
Zurück zum Zitat 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) CrossRef 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) CrossRef
14.
Zurück zum Zitat 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) CrossRef 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) CrossRef
15.
Zurück zum Zitat 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) 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)
16.
Zurück zum Zitat 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) CrossRef 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) CrossRef
17.
Zurück zum Zitat Tanaka, K., Hasegawa, K., Takizawa, M.: Quorum-based replication in object-based systems. J. Inf. Sci. Eng. 6(7), 317–331 (2000) Tanaka, K., Hasegawa, K., Takizawa, M.: Quorum-based replication in object-based systems. J. Inf. Sci. Eng. 6(7), 317–331 (2000)
18.
Zurück zum Zitat 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) CrossRef 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) CrossRef
19.
Zurück zum Zitat 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 MathSciNetMATH 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 MathSciNetMATH
20.
Metadaten
Titel
Quorum-based synchronization protocols for multimedia replicas
verfasst von
Tadateru Ohkawara
Ailixier Aikebaier
Tomoya Enokido
Makoto Takizawa
Publikationsdatum
01.12.2013
Verlag
Springer US
Erschienen in
Cluster Computing / Ausgabe 4/2013
Print ISSN: 1386-7857
Elektronische ISSN: 1573-7543
DOI
https://doi.org/10.1007/s10586-012-0239-2

Weitere Artikel der Ausgabe 4/2013

Cluster Computing 4/2013 Zur Ausgabe

Premium Partner