By Topic

Quorums for Replication of Multimedia Objects in P2P Overlay Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ohkawara, T. ; Seikei Univ., Tokyo, Japan ; Aikebaier, A. ; Enokido, T. ; Takizawa, M.

Replicas of multimedia objects are distributed to peers through downloading and caching in peer-to-peer(P2P) overlay networks. Every replica has to be consistent. In quorum-based (QB) protocols, every replica may not be up-to-date and the up-to-date replicas can be found in the version counters. On the other hand, multimedia objects are characterized in terms of not only data structure parameter but also quality of service (QoS) parameters like frame rates. Replicas of a multimedia object are partially ordered in terms of the newness precedent relation on data structure and QoS. Each parameter of a replica is manipulated in read and write operations. In addition, there is a read operation to read a whole replica. A parameter of an object is changed through a write operation. 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 every replica is not updated. If a transaction issues an enriching operation, every replica in the 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. Then, impoverishing operations are later performed on a replica. The MQB protocol is evaluated in terms of the processing overhead in replicas.0

Published in:

Complex, Intelligent and Software Intensive Systems (CISIS), 2012 Sixth International Conference on

Date of Conference:

4-6 July 2012