Some optimal inapproximability results
Journal of the ACM (JACM)
Broadcasting Multiple Messages in Hypercubes (preliminary version)
ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Broadcasting on networks of workstations
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Analyzing BitTorrent and related peer-to-peer networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the minimum delay peer-to-peer video streaming: how realtime can it be?
Proceedings of the 15th international conference on Multimedia
Performance bounds for peer-assisted live streaming
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding hybrid CDN-P2P: why limelight needs its own Red Swoosh
Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
On generalized gossiping and broadcasting
Journal of Algorithms
On collaborative content distribution using multi-message gossip
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A case for end system multicast
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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 T"c time steps (T"c1). 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(log^2(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.