Broadcast scheduling optimization for heterogeneous cluster systems
Journal of Algorithms
Efficient Collective Communication on Heterogeneous Networks of Workstations
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
ACM Transactions on Computer Systems (TOCS)
Efficient collective communication in distributed heterogeneous systems
Journal of Parallel and Distributed Computing
On broadcasting in heterogenous networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Analyzing peer-to-peer traffic across large networks
IEEE/ACM Transactions on Networking (TON)
On Cooperative Content Distribution and the Price of Barter
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
CREW: A Gossip-based Flash-Dissemination System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast
IEEE Transactions on Parallel and Distributed Systems
Analysis of peer-to-peer file dissemination amongst users of different upload capacities
ACM SIGMETRICS Performance Evaluation Review
Maintaining high bandwidth under dynamic network conditions
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Optimizing the BitTorrent performance using an adaptive peer selection strategy
Future Generation Computer Systems
Heuristics for flash-dissemination in heterogenous networks
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
A robust and scalable peer-to-peer gossiping protocol
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Gossiping With Multiple Messages
IEEE Transactions on Information Theory
A secure broadcasting cryptosystem and its application to grid computing
Future Generation Computer Systems
| Hi-index | 0.00 |
How to minimize the time of disseminating a large file from a single source to a large number of users is a fundamental question in peer-to-peer applications. Most previous works do not present a lower bound on the dissemination time, and fail to show how close the dissemination time of their algorithms are to the lower bound. In this paper, we analyze how to decrease the dissemination time by efficiently utilizing the upstream bandwidths of nodes. We first present a tight lower bound on the dissemination time that can serve as a benchmark for evaluating the performance of peer-to-peer file transfer algorithms. Then we find an equivalent condition along with a sufficient condition for fully utilizing the upstream bandwidths of nodes, in the networks where only the upstream bandwidths of nodes can constrain the transfer rates between nodes. Based on the theoretical analysis, we also design an algorithm called Receiver-schedule for fast dissemination, which can efficiently utilize the upstream bandwidths of nodes by dynamically adjusting the chunk distribution among nodes. Our simulation results show that, by using the algorithm the dissemination time is more than the lower bound by at most four percent in many cases in the networks with the upstream bandwidth constraint.