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)
A scheduling method to reduce waiting time for P2P streaming systems
Journal of Mobile Multimedia
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Due to the recent popularization of digital broadcasting systems, selective contents broadcasting depending on users' preferences have attracted great attention. For example, in a quiz program, a user selects his or her answer and watches the video content for the answer. Although the server can deliver programs reflecting users' preferences, clients have to wait until their selected contents start playing. Conventional methods reduce the waiting time by producing an effective broadcast schedule. However, the server has to deliver several content items so that users have choices. This requires more bandwidth than for non-selective contents. In this paper, we propose a method to reduce the waiting time considering user behavior on selective contents broadcasting with node relay-based webcast that relays data among nodes. When a client pulls out of the network while delivering contents, our proposed method reduces waiting time by selecting other clients and reconstructing a broadcast schedule considering the available bandwidth of each client.