How Scalable is Cache-and-Relay Scheme in P2P on-Demand Streaming?
Summary :
In recent years, the inherent effectiveness of Peer-to-Peer (P2P) networks has been advocated to address scalability issues in large scale Internet-based on-Demand streaming services. Most of existing works adopt Cache-and-Relay (CR) scheme to exploit a cooperative paradigm among peers. In this paper, we mainly present our practical evaluation study of the scalability of the CR scheme by taking into account of more than 20,000,000 collected real traces. Based on trace-driven simulations, we conclude that the CR scheme is not as effective as previously reported in terms of saving server bandwidth.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.4 pp.987-989
- Publication Date
- 2007/04/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.4.987
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yun TANG, Lifeng SUN, Jianguang LUO, Shiqiang YANG, Yuzhuo ZHONG, "How Scalable is Cache-and-Relay Scheme in P2P on-Demand Streaming?" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 4, pp. 987-989, April 2007, doi: 10.1093/ietcom/e90-b.4.987.
Abstract: In recent years, the inherent effectiveness of Peer-to-Peer (P2P) networks has been advocated to address scalability issues in large scale Internet-based on-Demand streaming services. Most of existing works adopt Cache-and-Relay (CR) scheme to exploit a cooperative paradigm among peers. In this paper, we mainly present our practical evaluation study of the scalability of the CR scheme by taking into account of more than 20,000,000 collected real traces. Based on trace-driven simulations, we conclude that the CR scheme is not as effective as previously reported in terms of saving server bandwidth.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.4.987/_p
Copy
@ARTICLE{e90-b_4_987,
author={Yun TANG, Lifeng SUN, Jianguang LUO, Shiqiang YANG, Yuzhuo ZHONG, },
journal={IEICE TRANSACTIONS on Communications},
title={How Scalable is Cache-and-Relay Scheme in P2P on-Demand Streaming?},
year={2007},
volume={E90-B},
number={4},
pages={987-989},
abstract={In recent years, the inherent effectiveness of Peer-to-Peer (P2P) networks has been advocated to address scalability issues in large scale Internet-based on-Demand streaming services. Most of existing works adopt Cache-and-Relay (CR) scheme to exploit a cooperative paradigm among peers. In this paper, we mainly present our practical evaluation study of the scalability of the CR scheme by taking into account of more than 20,000,000 collected real traces. Based on trace-driven simulations, we conclude that the CR scheme is not as effective as previously reported in terms of saving server bandwidth.},
keywords={},
doi={10.1093/ietcom/e90-b.4.987},
ISSN={1745-1345},
month={April},}
Copy
TY - JOUR
TI - How Scalable is Cache-and-Relay Scheme in P2P on-Demand Streaming?
T2 - IEICE TRANSACTIONS on Communications
SP - 987
EP - 989
AU - Yun TANG
AU - Lifeng SUN
AU - Jianguang LUO
AU - Shiqiang YANG
AU - Yuzhuo ZHONG
PY - 2007
DO - 10.1093/ietcom/e90-b.4.987
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2007
AB - In recent years, the inherent effectiveness of Peer-to-Peer (P2P) networks has been advocated to address scalability issues in large scale Internet-based on-Demand streaming services. Most of existing works adopt Cache-and-Relay (CR) scheme to exploit a cooperative paradigm among peers. In this paper, we mainly present our practical evaluation study of the scalability of the CR scheme by taking into account of more than 20,000,000 collected real traces. Based on trace-driven simulations, we conclude that the CR scheme is not as effective as previously reported in terms of saving server bandwidth.
ER -
English
