A replica algorithm based on popularity for P2P streaming media
In this paper，a new formula of popularity was proposed. It included the term deficit bandwidth and was based on the new popularity. Those streaming media files which need to be replicated were determined. A concept named comprehensive performance indicators was proposed. Peers were sorted by their c...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
National Computer System Engineering Research Institute of China
2018-10-01
|
| Series: | Dianzi Jishu Yingyong |
| Subjects: | |
| Online Access: | http://www.chinaaet.com/article/3000092780 |
| _version_ | 1819098753849622528 |
|---|---|
| author | Yang Ge Gao Bing Huang Jing He Hui |
| author_facet | Yang Ge Gao Bing Huang Jing He Hui |
| author_sort | Yang Ge |
| collection | DOAJ |
| description | In this paper，a new formula of popularity was proposed. It included the term deficit bandwidth and was based on the new popularity. Those streaming media files which need to be replicated were determined. A concept named comprehensive performance indicators was proposed. Peers were sorted by their comprehensive performance indicators and those peers with high comprehensive performance indicators had priority to place these popular files. Replacement algorithm would be carried out if there was no enough space to cache the new file, and the file which had largest ratio of its duplicates to the desired duplicates would be replaced by the new file. Experimental results show that the workload of the proposed algorithm, compared with proportional replication algorithm, is in steady conditions earlier about 13% in advance and is smaller. Its workload in steady-state condition is about 33.3% of the workload of the proportional replication algorithm. Meanwhile, more of one in a thousand peers has the desired requested rates in steady-state. Besides, the proposed algorithm has more stationary transient process. |
| first_indexed | 2024-12-22T00:36:00Z |
| format | Article |
| id | doaj.art-0cdad8c57b474091a84387b463acadc8 |
| institution | Directory Open Access Journal |
| issn | 0258-7998 |
| language | zho |
| last_indexed | 2024-12-22T00:36:00Z |
| publishDate | 2018-10-01 |
| publisher | National Computer System Engineering Research Institute of China |
| record_format | Article |
| series | Dianzi Jishu Yingyong |
| spelling | doaj.art-0cdad8c57b474091a84387b463acadc82022-12-21T18:44:49ZzhoNational Computer System Engineering Research Institute of ChinaDianzi Jishu Yingyong0258-79982018-10-01441012212610.16157/j.issn.0258-7998.1805593000092780A replica algorithm based on popularity for P2P streaming mediaYang Ge0Gao Bing1Huang Jing2He Hui3College of Information Technology，Beijing Normal University(Zhuhai Campus)，Zhuhai 519087，ChinaCollege of Information Technology，Beijing Normal University(Zhuhai Campus)，Zhuhai 519087，ChinaCollege of Information Technology，Beijing Normal University(Zhuhai Campus)，Zhuhai 519087，ChinaCollege of Information Technology，Beijing Normal University(Zhuhai Campus)，Zhuhai 519087，ChinaIn this paper，a new formula of popularity was proposed. It included the term deficit bandwidth and was based on the new popularity. Those streaming media files which need to be replicated were determined. A concept named comprehensive performance indicators was proposed. Peers were sorted by their comprehensive performance indicators and those peers with high comprehensive performance indicators had priority to place these popular files. Replacement algorithm would be carried out if there was no enough space to cache the new file, and the file which had largest ratio of its duplicates to the desired duplicates would be replaced by the new file. Experimental results show that the workload of the proposed algorithm, compared with proportional replication algorithm, is in steady conditions earlier about 13% in advance and is smaller. Its workload in steady-state condition is about 33.3% of the workload of the proportional replication algorithm. Meanwhile, more of one in a thousand peers has the desired requested rates in steady-state. Besides, the proposed algorithm has more stationary transient process.http://www.chinaaet.com/article/3000092780p2p networkdeficit bandwidthpopularityreplication algorithmreplacement algorithm |
| spellingShingle | Yang Ge Gao Bing Huang Jing He Hui A replica algorithm based on popularity for P2P streaming media Dianzi Jishu Yingyong p2p network deficit bandwidth popularity replication algorithm replacement algorithm |
| title | A replica algorithm based on popularity for P2P streaming media |
| title_full | A replica algorithm based on popularity for P2P streaming media |
| title_fullStr | A replica algorithm based on popularity for P2P streaming media |
| title_full_unstemmed | A replica algorithm based on popularity for P2P streaming media |
| title_short | A replica algorithm based on popularity for P2P streaming media |
| title_sort | replica algorithm based on popularity for p2p streaming media |
| topic | p2p network deficit bandwidth popularity replication algorithm replacement algorithm |
| url | http://www.chinaaet.com/article/3000092780 |
| work_keys_str_mv | AT yangge areplicaalgorithmbasedonpopularityforp2pstreamingmedia AT gaobing areplicaalgorithmbasedonpopularityforp2pstreamingmedia AT huangjing areplicaalgorithmbasedonpopularityforp2pstreamingmedia AT hehui areplicaalgorithmbasedonpopularityforp2pstreamingmedia AT yangge replicaalgorithmbasedonpopularityforp2pstreamingmedia AT gaobing replicaalgorithmbasedonpopularityforp2pstreamingmedia AT huangjing replicaalgorithmbasedonpopularityforp2pstreamingmedia AT hehui replicaalgorithmbasedonpopularityforp2pstreamingmedia |