Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution
Due to the fact that leftover bandwidth appears during non-overlapping time intervals, an approach of using such bandwidth to distribute delay tolerant data was proposed, and then a distributs and scalable leftover band-width-aware peer selection algorithm named LBAPS was designed. LBAPS avoids cent...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2013-07-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.07.003/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539814348816384 |
---|---|
author | Yong-feng HUANG Yong-qiang DONG Shan-feng ZHANG Guo-xin WU |
author_facet | Yong-feng HUANG Yong-qiang DONG Shan-feng ZHANG Guo-xin WU |
author_sort | Yong-feng HUANG |
collection | DOAJ |
description | Due to the fact that leftover bandwidth appears during non-overlapping time intervals, an approach of using such bandwidth to distribute delay tolerant data was proposed, and then a distributs and scalable leftover band-width-aware peer selection algorithm named LBAPS was designed. LBAPS avoids centralized optimization method that fails to effectively utilize leftover bandwidth when multiple destinations occur. In LBAPS, a node selection strategy based on synthetical evaluation was presented in order to find appropriate nodes h leftover bandwidth currently. In addition, two other strategies, i.e., resource reservation based on threshold and exiting upload upon the length of time slice, were put forward. With these two strategies, nodes with more leftover bandwidth get higher priority to obtain file blocks; be-sides, different file blocks can be delivered to different nodes as soon as possible. On the basis of LBAPS, a content cloud prototype, P2PStitcher was implemented. Experimental results on PlanetlLab show that the strategies proposed in LBAPS are effective to decrease the average delivery time. |
format | Article |
id | doaj-art-7670ec6189ef43fe8ab4667064e0d998 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2013-07-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-7670ec6189ef43fe8ab4667064e0d9982025-01-14T06:40:47ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-07-0134243359673326Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distributionYong-feng HUANGYong-qiang DONGShan-feng ZHANGGuo-xin WUDue to the fact that leftover bandwidth appears during non-overlapping time intervals, an approach of using such bandwidth to distribute delay tolerant data was proposed, and then a distributs and scalable leftover band-width-aware peer selection algorithm named LBAPS was designed. LBAPS avoids centralized optimization method that fails to effectively utilize leftover bandwidth when multiple destinations occur. In LBAPS, a node selection strategy based on synthetical evaluation was presented in order to find appropriate nodes h leftover bandwidth currently. In addition, two other strategies, i.e., resource reservation based on threshold and exiting upload upon the length of time slice, were put forward. With these two strategies, nodes with more leftover bandwidth get higher priority to obtain file blocks; be-sides, different file blocks can be delivered to different nodes as soon as possible. On the basis of LBAPS, a content cloud prototype, P2PStitcher was implemented. Experimental results on PlanetlLab show that the strategies proposed in LBAPS are effective to decrease the average delivery time.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.07.003/content cloudP2PCDNaverage delivery timePlanetLab |
spellingShingle | Yong-feng HUANG Yong-qiang DONG Shan-feng ZHANG Guo-xin WU Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution Tongxin xuebao content cloud P2P CDN average delivery time PlanetLab |
title | Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution |
title_full | Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution |
title_fullStr | Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution |
title_full_unstemmed | Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution |
title_short | Leftover bandwidth-aware peer selection algorithm for inter-datacenter content distribution |
title_sort | leftover bandwidth aware peer selection algorithm for inter datacenter content distribution |
topic | content cloud P2P CDN average delivery time PlanetLab |
url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.07.003/ |
work_keys_str_mv | AT yongfenghuang leftoverbandwidthawarepeerselectionalgorithmforinterdatacentercontentdistribution AT yongqiangdong leftoverbandwidthawarepeerselectionalgorithmforinterdatacentercontentdistribution AT shanfengzhang leftoverbandwidthawarepeerselectionalgorithmforinterdatacentercontentdistribution AT guoxinwu leftoverbandwidthawarepeerselectionalgorithmforinterdatacentercontentdistribution |