TY - GEN
T1 - OBN
T2 - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006
AU - Liao, Chi Shiang
AU - Sun, Wen Hung
AU - King, Chung Ta
AU - Hsiao, Hung Chang
PY - 2006/12/1
Y1 - 2006/12/1
N2 - A critical issue in peer-to-peer (P2P) streaming systems is to find a peer that can provide required streaming data (eligibility determination) with good quality (quality optimization) to a given peer. For P2P on-demand streaming systems that fetch data directly from the streaming buffer of the supplying peer, e.g. buffer chaining, the content of the streaming buffer change constantly, but the requesting peer may jump to any point in the stream. It is very expensive to track buffer contents for eligibility determination. This paper presents a novel eligibility determination strategy, which, instead of using directories, embeds relationship of buffer contents through the interconnection of peers. The resultant peering structure is called the Overlapping Buffer Network (OBN). We will discuss why this interconnection-based approach is more desirable than directory-based approaches, such as distributed hash table. Performance of OBN will be evaluated with simulation.
AB - A critical issue in peer-to-peer (P2P) streaming systems is to find a peer that can provide required streaming data (eligibility determination) with good quality (quality optimization) to a given peer. For P2P on-demand streaming systems that fetch data directly from the streaming buffer of the supplying peer, e.g. buffer chaining, the content of the streaming buffer change constantly, but the requesting peer may jump to any point in the stream. It is very expensive to track buffer contents for eligibility determination. This paper presents a novel eligibility determination strategy, which, instead of using directories, embeds relationship of buffer contents through the interconnection of peers. The resultant peering structure is called the Overlapping Buffer Network (OBN). We will discuss why this interconnection-based approach is more desirable than directory-based approaches, such as distributed hash table. Performance of OBN will be evaluated with simulation.
UR - http://www.scopus.com/inward/record.url?scp=34047199044&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34047199044&partnerID=8YFLogxK
U2 - 10.1109/ICPADS.2006.69
DO - 10.1109/ICPADS.2006.69
M3 - Conference contribution
AN - SCOPUS:34047199044
SN - 0769526128
SN - 9780769526126
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 235
EP - 242
BT - Proceedings - 12th International Conference on Parallel and Distributed Systems, ICPADS 2006
Y2 - 12 July 2006 through 15 July 2006
ER -