Performance tradeoffs in structured peer to peer streaming |
| |
Authors: | Alix LH Chow Leana Golubchik Samir Khuller Yuan Yao |
| |
Affiliation: | 1. Nokia Research Center, Beijing, China;2. Department of Computer Science, University of Southern California, Los Angeles, CA 90089, USA;3. Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA 90089, USA;4. Department of Computer Science, University of Maryland, College Park, MD 20742, USA |
| |
Abstract: | We consider the following basic question: a source node wishes to stream an ordered sequence of packets to a collection of receivers, which are in K clusters. A node may send a packet to another node in its own cluster in one time step and to a node in a different cluster in Tc time steps (Tc>1). Each cluster has two special nodes. We assume that the source and the special nodes in each cluster have a higher capacity and thus can send multiple packets at each step, while all other nodes can both send and receive a packet at each step. We construct two (intra-cluster) data communication schemes, one based on multi-trees (using a collection of d-ary interior-disjoint trees) and the other based on hypercubes. The multi-tree scheme sustains streaming within a cluster with O(dlogN) maximum playback delay and O(dlogN) size buffers, while communicating with O(d) neighbors, where N is the maximum size of any cluster. We also show that this protocol is optimal when d=2 or 3. The hypercube scheme sustains streaming within a cluster, with O(log2(N)) maximum playback delay and O(1) size buffers, while communicating with O(log(N)) neighbors, for arbitrary N. In addition, we extend our multi-tree scheme to work when receivers depart and arrive over time. We also evaluate our dynamic schemes using simulations. |
| |
Keywords: | Peer-to-peer systems Quality-of-service guarantees Streaming |
本文献已被 ScienceDirect 等数据库收录! |
|