Abstract | ||
---|---|---|
We design a peer-to-peer technique for single-source media streaming. This technique allows the media server to distribute content to many clients by organizing them into an appropriate tree rooted at the server. This application-layer multicast tree has a height O(logN)where N is the number of clients, and a node degree bounded by a constant. This helps reduce the number of processing hops on the delivery path to a client while avoiding network bottleneck. Consequently, the end-to-end delay is kept small. Although one could build a tree satisfying such properties easily, an efficient control protocol between the nodes must be in place to maintain the tree under the effects of network dynamics and unpredictable client behaviors. Our technique handles such situations gracefully requiring a constant amortized control overhead. Especially, failure recovery can be done regionally with little impact on the existing clients. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1145/641007.641056 | ACM Multimedia 2001 |
Keywords | Field | DocType |
single-source media,efficient control protocol,existing client,peer-to-peer technique,network bottleneck,appropriate tree,application-layer multicast tree,network dynamic,large peer-to-peer network,media server,constant amortized control overhead,scalable media,network dynamics,end to end delay,satisfiability | Bottleneck,Network dynamics,Peer-to-peer,Computer science,Media server,Computer network,Multicast,Bounded function,Distributed computing,Scalability | Conference |
ISBN | Citations | PageRank |
1-58113-620-X | 10 | 1.55 |
References | Authors | |
1 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Duc A. Tran | 1 | 396 | 32.06 |
Kien A Hua | 2 | 2870 | 425.79 |
Tai T. Do | 3 | 320 | 18.00 |