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
Quorum-Based Locking Protocol for Replicas in Object-Based Systems
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Cloud Computing: The Limits of Public Clouds for Business Applications
IEEE Internet Computing
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
Quorums for Replication of Multimedia Objects in P2P Overlay Networks
CISIS '12 Proceedings of the 2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems (CISIS)
| Hi-index | 0.00 |
We discuss how to efficiently make replicas of a multimedia object consistent. Multimedia objects are characterized in terms of not only data structure but also quality of service (QoS). There are two types of write operations: enriching and impoverishing types. Some data is added to a replica in an enriching type while removed in an impoverishing type. Computation resources are spent to materialize, i.e. physically update replicas of a multimedia object. We discuss an extended multimedia quorum-based (EMQB) protocol to reduce the processing overhead of each replica. Here, a replica is not materialized in an impoverishing type of write operation. Even in an enriching type of write operation, only some number, not necessarily all, of replicas in a write quorum are updated. Hence, a newest materialized replica may not be found in a read quorum. Replicas are randomly selected to be in a read quorum until an updated replica is found in the quorum. The EMQB protocol is evaluated in terms of the total processing overhead of replicas. We show that the processing overhead of each replica can be reduced in the EMQB protocol.