ZIGZAG: an efficient peer-to-peer scheme for media streaming
ZIGZAG: an efficient peer-to-peer scheme for media streaming
复制标题
DOI：
10.1109/infcom.2003.1208964
复制
发表时间：
2003-07
期刊：
影响因子：
--
通讯作者：
D. Tran;K. Hua;T. Do
中科院分区：
文献类型：
--
作者：
D. Tran;K. Hua;T. Do
设计了一种用于单源流媒体传输的对等技术ZIGZAG。ZIGZAG允许媒体服务器通过将内容组织到以服务器为根的适当树中来将内容分发给许多客户端。该应用层组播树的高度与客户端的数量成对数关系，节点度为常数。这有助于减少到客户端的传递路径上的处理跳数，同时避免网络瓶颈。因此，端到端延迟保持较小。虽然人们可以很容易地建立一个满足这些属性的树，节点之间必须有一个有效的控制协议，以保持在网络动态和不可预测的客户端行为的影响下的树。ZIGZAG优雅地处理这种情况，需要恒定的摊销控制开销。特别是，故障恢复可以在区域内完成，对现有客户端的影响很小，并且对服务器几乎没有负担。
A peer-to-peer technique called ZIGZAG for single-source media streaming is designed . ZIGZAG allows the media server to distribute content to many clients by organizing them into an appropriate tree rooted at the server. This application-layer multicast tree has a height logarithmic with the number of clients and a node degree bounded by a constant. This helps reduce the number of processing hops on the delivery path to a client while avoiding network bottleneck. Consequently, the end-to-end delay is kept small. Although one could build a tree satisfying such properties easily, an efficient control protocol between the nodes must be in place to maintain the tree under the effects of network dynamics and unpredictable client behaviors. ZIGZAG handles such situations gracefully requiring a constant amortized control overhead. Especially, failure recovery can be done regionally with little impact on the existing clients and mostly no burden on the server.