Neighbor selection algorithm in cloud-assistant P2P-VoD system
A neighbor selection algorithm was proposed which was composed of sub-algorithms of peer selection and chunk selection.The peer selection algorithm assured that the peers could find the neighbors providing the video data at a high probability.The chunk selection algorithm helped peers choose the met...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.05.020/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850123225495764992 |
|---|---|
| author | Xin CONG Kai SHUANG Sen SU Fang-chun YANG Xin SUN |
| author_facet | Xin CONG Kai SHUANG Sen SU Fang-chun YANG Xin SUN |
| author_sort | Xin CONG |
| collection | DOAJ |
| description | A neighbor selection algorithm was proposed which was composed of sub-algorithms of peer selection and chunk selection.The peer selection algorithm assured that the peers could find the neighbors providing the video data at a high probability.The chunk selection algorithm helped peers choose the methods of downloading data,from which the data chunks could be used at a high availability.The experiment demonstrates that the algorithm can further decrease the server bandwidth costs and the refusal rate of peers' requisition,and improve the download rate of peers. |
| format | Article |
| id | doaj-art-de1a7c904f4641d4a63eb4912ac61fb8 |
| institution | OA Journals |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-05-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-de1a7c904f4641d4a63eb4912ac61fb82025-08-20T02:34:39ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-05-013417618359672420Neighbor selection algorithm in cloud-assistant P2P-VoD systemXin CONGKai SHUANGSen SUFang-chun YANGXin SUNA neighbor selection algorithm was proposed which was composed of sub-algorithms of peer selection and chunk selection.The peer selection algorithm assured that the peers could find the neighbors providing the video data at a high probability.The chunk selection algorithm helped peers choose the methods of downloading data,from which the data chunks could be used at a high availability.The experiment demonstrates that the algorithm can further decrease the server bandwidth costs and the refusal rate of peers' requisition,and improve the download rate of peers.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.05.020/peer selection algorithmchunk selection algorithmcloud-assistantP2P-VoD |
| spellingShingle | Xin CONG Kai SHUANG Sen SU Fang-chun YANG Xin SUN Neighbor selection algorithm in cloud-assistant P2P-VoD system Tongxin xuebao peer selection algorithm chunk selection algorithm cloud-assistant P2P-VoD |
| title | Neighbor selection algorithm in cloud-assistant P2P-VoD system |
| title_full | Neighbor selection algorithm in cloud-assistant P2P-VoD system |
| title_fullStr | Neighbor selection algorithm in cloud-assistant P2P-VoD system |
| title_full_unstemmed | Neighbor selection algorithm in cloud-assistant P2P-VoD system |
| title_short | Neighbor selection algorithm in cloud-assistant P2P-VoD system |
| title_sort | neighbor selection algorithm in cloud assistant p2p vod system |
| topic | peer selection algorithm chunk selection algorithm cloud-assistant P2P-VoD |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.05.020/ |
| work_keys_str_mv | AT xincong neighborselectionalgorithmincloudassistantp2pvodsystem AT kaishuang neighborselectionalgorithmincloudassistantp2pvodsystem AT sensu neighborselectionalgorithmincloudassistantp2pvodsystem AT fangchunyang neighborselectionalgorithmincloudassistantp2pvodsystem AT xinsun neighborselectionalgorithmincloudassistantp2pvodsystem |