Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On Peer-to-Peer Media Streaming
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
NCM '09 Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC
A scheduling method to reduce waiting time for P2P streaming systems
Journal of Mobile Multimedia
Enhanced harmonic data broadcasting and receiving scheme for popular video service
IEEE Transactions on Consumer Electronics
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Due to the recent popularisation of digital webcast systems, delivering continuous media data, i.e. audio and video, has been attracted great attention. In node relay-based webcast, the server has better load balance by receiving data concurrently from other several nodes. Conventional methods reduce waiting time by sharing channels and receiving data from them. However, since the number of nodes by which the user can receive the data is one, occupation time of available bandwidth of the node increases. In this paper, we propose a scheduling method to reduce the waiting time for node relay-based webcast. In our proposed method, by considering available bandwidth of each node and producing an effective schedule, the waiting time is reduced.