Unbalanced replication by evaluating popularity over web scalable storage

Ting Wei Chen, Carlos Madrazo, Takeshi Tsuchiya, Keiichi Koyanagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80-20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.

Original languageEnglish
Title of host publicationProceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011
Pages189-192
Number of pages4
Volume4
DOIs
Publication statusPublished - 2011
Event2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011 - Shanghai
Duration: 2011 Jun 102011 Jun 12

Other

Other2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011
CityShanghai
Period11/6/1011/6/12

Fingerprint

Availability

Keywords

  • Distributed Interval Tree
  • file sharing
  • peer-to-peer distributed system
  • popularity
  • web scalable storage

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Control and Systems Engineering

Cite this

Chen, T. W., Madrazo, C., Tsuchiya, T., & Koyanagi, K. (2011). Unbalanced replication by evaluating popularity over web scalable storage. In Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011 (Vol. 4, pp. 189-192). [5952831] https://doi.org/10.1109/CSAE.2011.5952831

Unbalanced replication by evaluating popularity over web scalable storage. / Chen, Ting Wei; Madrazo, Carlos; Tsuchiya, Takeshi; Koyanagi, Keiichi.

Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011. Vol. 4 2011. p. 189-192 5952831.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chen, TW, Madrazo, C, Tsuchiya, T & Koyanagi, K 2011, Unbalanced replication by evaluating popularity over web scalable storage. in Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011. vol. 4, 5952831, pp. 189-192, 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011, Shanghai, 11/6/10. https://doi.org/10.1109/CSAE.2011.5952831
Chen TW, Madrazo C, Tsuchiya T, Koyanagi K. Unbalanced replication by evaluating popularity over web scalable storage. In Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011. Vol. 4. 2011. p. 189-192. 5952831 https://doi.org/10.1109/CSAE.2011.5952831
Chen, Ting Wei ; Madrazo, Carlos ; Tsuchiya, Takeshi ; Koyanagi, Keiichi. / Unbalanced replication by evaluating popularity over web scalable storage. Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011. Vol. 4 2011. pp. 189-192
@inproceedings{5fcadd3dc9c74c0a9832d68cbde6cbd8,
title = "Unbalanced replication by evaluating popularity over web scalable storage",
abstract = "A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80-20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.",
keywords = "Distributed Interval Tree, file sharing, peer-to-peer distributed system, popularity, web scalable storage",
author = "Chen, {Ting Wei} and Carlos Madrazo and Takeshi Tsuchiya and Keiichi Koyanagi",
year = "2011",
doi = "10.1109/CSAE.2011.5952831",
language = "English",
isbn = "9781424487257",
volume = "4",
pages = "189--192",
booktitle = "Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011",

}

TY - GEN

T1 - Unbalanced replication by evaluating popularity over web scalable storage

AU - Chen, Ting Wei

AU - Madrazo, Carlos

AU - Tsuchiya, Takeshi

AU - Koyanagi, Keiichi

PY - 2011

Y1 - 2011

N2 - A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80-20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.

AB - A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80-20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.

KW - Distributed Interval Tree

KW - file sharing

KW - peer-to-peer distributed system

KW - popularity

KW - web scalable storage

UR - http://www.scopus.com/inward/record.url?scp=80051866551&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051866551&partnerID=8YFLogxK

U2 - 10.1109/CSAE.2011.5952831

DO - 10.1109/CSAE.2011.5952831

M3 - Conference contribution

SN - 9781424487257

VL - 4

SP - 189

EP - 192

BT - Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011

ER -