A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Group Protocol for Distributed Replicated Objects
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Quorum-Based Locking Protocol for Replicas in Object-Based Systems
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
Performance evaluation of the quorum consensus replication method
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Cloud Computing: The Limits of Public Clouds for Business Applications
IEEE Internet Computing
Adjustable flooding-based discovery with multiple QoSs for cloud services acquisition
International Journal of Web and Grid Services
Quorum-Based Replication of Multimedia Objects in Distributed Systems
NBIS '11 Proceedings of the 2011 14th International Conference on Network-Based Information Systems
Completable Quorums of Multimedia Objects
AINA '12 Proceedings of the 2012 IEEE 26th International Conference on Advanced Information Networking and Applications
Journal of Computer and System Sciences
Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks
Information Sciences: an International Journal
Ontology as a Service (OaaS): a case for sub-ontology merging on the cloud
The Journal of Supercomputing
A pure peer-to-peer approach for kNN query processing in mobile ad hoc networks
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
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.