On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Measuring link bandwidths using a deterministic model of packet delay
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Topology-aware overlay networks for group communication
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
On the k-Splittable Flow Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Layered peer-to-peer streaming
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
On Peer-to-Peer Media Streaming
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Streaming performance in multiple-tree-based overlays
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Providing consistent service for structured p2p streaming system
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
| Hi-index | 0.00 |
A fundamental problem in peer-to-peer streaming is building and maintaining high-bandwidth routing structure, which optimizes the receiver throughput. In this paper, we aim to design practical routing algorithms to this problem. The desired solution should accommodate the reality that nodes can frequently join and leave the overlay session, avoid global reorganization of the routingstructure, let each node decide on its own how to attach to the existing tree, and maximally utilize the partial knowledge of the underlying physical network to optimize its performance. Based on these objectives, we design the dynamic high-bandwidth routing algorithm for peer-to-peer streaming. We prove the algorithm's approximation bound to the optimal rate. Experimental results show our algorithm to greatly outperform its theoretical bound at low management overhead and small number of multicast trees.