返回
Optimizing the Throughput of Data-Driven Peer-to-Peer Streaming
DOI:10.1109/TPDS.2008.69.png)
摘要
En 中文
During recent years, the Internet has witnessed a rapid growth in deployment of data-driven (or swarming based) peer-to-peer (P2P) media streaming. In these applications, each node independently selects some other nodes as its neighbors (i.e., gossip-style overlay construction) and exchanges streaming data with the neighbors (i.e., data scheduling). To improve the performance of such protocol, many existing works focus on the gossip-style overlay construction issue. However, few of them concentrate on optimizing the streaming data scheduling to maximize the throughput of a constructed overlay. In this paper, we analytically study the scheduling problem in data-driven streaming system and model it as a classical min-cost network flow problem. We then propose both the global optimal scheduling scheme and distributed heuristic algorithm to optimize the system throughput. Furthermore, we introduce layered video coding into data-driven protocol and extend our algorithm to deal with the end-host heterogeneity. The results of simulation with the real-world traces indicate that our distributed algorithm significantly outperforms conventional ad hoc scheduling strategies especially in stringent buffer and bandwidth constraints.
Keyword:
Peer-to-peer
data driven
block scheduling
min cost flow
throughput
delivery ratio
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Molecular analysis of radiation-induced albino (c)-locus mutations that cause death at preimplantation stages of development.
Genetics
IF0
A Domain in TNF Receptors That Mediates Ligand-Independent Receptor Assembly and SignalingTNF受体中介导非配体依赖性受体组装和信号传导的结构域
Science
IF0

