Yusuke Gotoh

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 Available Bandwidth in Selective Contents Broadcasting

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., watching contents users selected themselves, have attracted great attention. For example, in a news program, after a user selects the desired content, he/she watches it. In selective contents broadcasting, since the server needs to deliver many contents, the necessary bandwidth for playing the data without interruptions increases. Although conventional methods reduce necessary bandwidth, they do not consider the upper limit in the bandwidth. When upper limit exists in the bandwidth, users have to wait to receive the data. In this paper, we propose a scheduling method to reduce waiting time by considering available bandwidth. In our proposed method, by acquiring the bandwidth that is the same as the data consumption rate, waiting time is effectively reduced.

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 to reduce waiting time considering transition probability for selective contents broadcasting

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watching their selected contents, have attracted 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 that meet users¿ preferences, clients have to wait until their selected contents are delivered. Conventional methods reduce the waiting time by producing an effective broadcast schedule. These methods do not consider the possibilities of which content has been selected. However, by considering the transition probability of selective contents, the waiting time can be reduced further. In this paper, we propose a scheduling method to reduce waiting time by considering transition probability. Our proposed method reduces the waiting time by allocating broadcast channels that have the same bandwidth as the contents consumption rate and scheduling contents considering transition probability.

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...

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 Method to Reduce Interruption Time for Streaming Delivery of Broadcast and Communications Integration Environments

Due to the continued popularization of broadcast and communications integration environments, streaming delivery using broadcast and communication is attracting attention. In streaming delivery on the environment, clients concurrently receive streaming data such as music or movies from broadcasting and communication systems. Although these systems compensate for the demerits of each other, the interruption time is lengthened if the system does not deliver the data efficiently. In our proposed method, the system produces a broadcast schedule of streaming data that considers communication bandwidth. In this research, we confirmed that extra bandwidth that gives shorter interruption time differs from communication bandwidth. Our proposed method reduces the interruption time by finding the extra bandwidth.

A method to reduce waiting time for P2P streaming systems

Recently, streaming systems with Peer-to-Peer (P2P) technology have attracted much attention and are changing how we watch movies. In P2P streaming systems, a peer that plays the movie receives data from other peers. By playing the received data sequentially, the user can watch the entire movie from beginning to end. In conventional methods, by receiving the first chunk of data sequentially from a peer with large bandwidth, the waiting time is reduced effectively. However, they do not consider the case where heterogeneous peers deliver data to multiple peers. In this paper, we propose a method to reduce the waiting time for selecting peers on P2P streaming by selecting peers considering the available bandwidth. Our evaluation shows that our proposed method reduces the average waiting time 62.5% more than conventional methods at maximum.

A Scheduling Method for Division Based Broadcasting of Multiple Video Considering Data Size

When watching videos, many people receive the data by broadcasting. In general broadcasting systems, even though servers can concurrently deliver data to many clients, they must wait until the first portion of the data is broadcast. To reduce the waiting time, many studies employ the division based broadcasting technique, which reduces waiting time by dividing the data into several segments and frequently broadcasting the precedent segments. In division based broadcasting, although several researchers have proposed scheduling methods to reduce the waiting time for delivering multiple video, they failed to consider cases where the data size of each video is not the same. In this paper, we propose a scheduling method for division based broadcasting of multiple video that considers their data size. Our proposed method divides the data and produces an effective broadcasting schedule based on the data size of each video. In addition, the server can reduce the required bandwidth for delivering multiple video.