Masanori Kanazawa

A Broadcasting Scheme for Selective Contents Considering Available Bandwidth

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., watching contents selected by users themselves, have attracted great attention. For example, in a news program, after a user selects an interesting content, he/she watches it. In selective contents broadcasting, since the server needs to deliver many contents, the necessary bandwidth for continuously playing the data increases. Conventional schemes reduce the necessary bandwidth by producing an effective broadcast schedule. However, they do not consider the upper limit in the bandwidth. When an upper limit exists in the bandwidth, users may wait to play the data. In this paper, we propose a broadcasting scheme that reduces waiting time by considering available bandwidth. In our proposed scheme, by acquiring the channel bandwidth that is the same as the data consumption rate, we effectively reduce the waiting time.

A scheduling method considering playing time in selective contents broadcasting

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., watching contents selected by the users themselves, have attracted great attention. For example, in news programs, after watching a summary of each story, a user selects one and watches it. By providing selective contents, clients can watch programs that reflect their preferences. However, the server has to deliver several contents to give clients choices. This increases the waiting time for clients. In this paper, we propose a scheduling method that reduces waiting time by considering playing time for contents. The waiting time is effectively reduced compared to previous works.

A scheduling method for heterogeneous clients on media data broadcasting

Purpose – The purpose of this paper is to propose a scheduling method called the “Hierarchical Asynchronous Harmonic Broadcasting (H‐AHB)” method, to reduce the waiting time for heterogeneous clients.Design/methodology/approach – The authors analyze and evaluate the performance of the proposed H‐AHB method.Findings – It was confirmed that the proposed method gives shorter average waiting time than the conventional methods.Research limitations/implications – A future direction of this study will involve making a scheduling method where the server broadcasts multiple videos.Practical implications – In general broadcasting systems, the server broadcasts the same data repetitively and clients wait until the first portion of the data is broadcast. Although the server can deliver the data to many clients concurrently, clients have to wait until their desired data are broadcast.Originality/value – The H‐AHB method further reduces waiting time by scheduling an effective broadcast that considers the number of clie...

A scheduling method considering heterogeneous clients for NVoD systems

Due to the recent development of digital TV broadcasting systems, Near Video-on-Demand (NVoD) systems has attracted a great deal of attention. In general NVoD systems, the server broadcasts the same data repetitively and clients wait until the first portion of the data is broadcast. Although there are many studies on how to reduce the waiting time, these studies assume that there is only one type of clients, and they do not consider cases in which there are many types of clients such as mobile phones, digital video receivers, and so on. In such cases, these methods cannot reduce the waiting time effectively because the available band-widths for clients differ depending on their performances. In this paper, we propose a scheduling method to reduce the waiting time considering heterogeneous clients. Our proposed method further reduces the waiting time by producing an effective broadcast schedule considering the number of clients available channels.

Evaluation of P2P streaming systems for webcast

Due to the recent spread of streaming delivery of movies, streaming using Peer-to-Peer (P2P) streaming technology has attracted much attention. In P2P streaming systems, to distribute the network load, peers from which the user receives data is selected at random. For this, clients have to wait until their desired data is delivered. Therefore, there are many researches to reduce the waiting time. However, because of the complexity of the implementation, they usually evaluate these methods using computer simulations. In actual environment, indeed, interruption time is not always reduced by increasing clients to deliver data. To evaluate the effectiveness of P2P streaming systems, it is important to implement an actual P2P streaming system. In this paper, we evaluate a P2P streaming system. By using our implemented P2P streaming system, we investigate situations that its system is effective. As a result of our evaluation, we confirmed that interruption time is reduced effectively.

A scheduling method for waiting time reduction in node relay-based webcast considering available bandwidth

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.

A Scheduling Method on Selective Contents Broadcasting with Node Relay Based Webcast Considering Available Bandwidth

Due to the recent popularization of digital broadcasting systems, selective contents broadcasting depending on viewers preference have attracted great attention. For example, a user selects his answer and watches the video content for the answer in a quiz program. The conventional methods reduce the waiting time by producing an effective broadcast schedule. Although the server can deliver programs that meet users preferences, clients have to wait until their selected contents are delivered. In this paper, we propose a method to reduce the waiting time on selective contents delivery with node relay based webcast that relay data among nodes. Our proposed method reduces the waiting time by scheduling contents considering available bandwidth of each nodes.

A Scheduling Method for Node Relay-based Webcast Considering Reconnection

Due to the recent popularization of digital broadcasting systems, selective contents broadcasting depending on users preferences with node relay-based web cast have attracted much attention. In node relay-based web cast, waiting time is reduced by receiving contents from several nodes. However, when a node that delivers contents disconnects from the network or reconnects to it while delivering contents, waiting time increases by changing a delivery schedule. In this paper, we propose a scheduling method considering reconnection on selective contents delivery with node relay-based web cast that relay data among nodes. Our proposed method reduces waiting time by restructuring the delivery schedule considering the disconnection and the reconnection of the node.

A scheduling method for continuous media data broadcasting considering commercial contents

Purpose – The purpose of this paper is to propose a scheduling method called the “Asynchronous Harmonic Broadcasting Considering Commercial (AHB‐CC)” method, to reduce waiting time for continuous media data broadcasting.Design/methodology/approach – The authors analyze and evaluate the performance of the proposed AHB‐CC method.Findings – The authors confirm that the proposed method gives shorter average waiting times than the conventional methods.Research limitations/implications – A future direction of this study will involve making a scheduling method where the server concurrently broadcasts data and commercial contents. Also, maximum buffer size needs to be considered.Practical implications – In general broadcasting systems, the server broadcasts the same data repetitively and clients wait until the first portion of the data is broadcast. Although the server can deliver the data to many clients concurrently, clients have to wait until their desired data are broadcast.Originality/value – The AHB‐CC meth...

A scheduling method to reduce waiting time for close-range broadcasting

Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main program continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. However, these methods do not consider the broadcast schedule for two types of continuous media data. When the server schedules two types of continuous media data, waiting time that occurs from finishing the highlight scene to starting the main scene, may increase. In this paper, we propose a scheduling method to reduce the waiting time for close-range broadcasting. In our proposed method, by dividing two types of data and producing an effective broadcast schedule considering the available bandwidth, we can reduce the waiting time.