STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Optimal distributed algorithm for minimum spanning trees revisited
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Generating all the acyclic orientations of an undirected graph
Information Processing Letters
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
MST construction in O(log log n) communication rounds
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Parametric and Kinetic Minimum Spanning Trees
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics
IEEE Transactions on Mobile Computing
Proceedings of the 2003 ACM symposium on Applied computing
Network robustness and graph topology
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
A linear-time optimal-message distributed algorithm for minimum spanning trees
Distributed Computing
A sub-linear time distributed algorithm for minimum-weight spanning trees
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On the History of the Minimum Spanning Tree Problem
IEEE Annals of the History of Computing
| Hi-index | 0.00 |
Peer-to-Peer (P1P) file downloading and streaming applications have recently attracted a large number of users on the Internet. Currently, several P1P video streaming systems have been deployed to reduce server cost. They can be classified into two categories live and on-demand streaming systems. The live streaming systems disseminate live video contents to all the peers in real time. On the other hand, the on-demand video (VoD) streaming system enablespeers to enjoy the flexibility ofwatching a video. An implicit, self-organized and unstructured Multicast Overlay Network (MON) ofpeers has been proposed [1], It is organized into MON-Clusters. Each MON-Cluster is composed of independent edge-disjoint Hamilton cycles. The existence ofcycles leads to duplication ofpackets. MON was designed to multicast/flood small-data size (e.g. warning messages) to all peers. Duplication caused due to flooding of small data-packets does not have significant impacts on network traffic. However, duplication of video-packets will have significant impacts on network traffic. Thus the proposed MON is not appropriateto multicast videopackets. This paper proposes a novel (Minimum Spanning Treej-Cluster (MST-Cluster) algorithm over each cluster to avoid duplicated packets. As a result, the MST-Cluster algorithm reduces the network traffic for efficient video streaming.