A Scheduling Scheme for Continuous Media Data Broadcasting With a Single Channel

Yoshihisa, Tomoki; Tsukamoto, M.; Nishio, Shojiro

doi:10.1109/tbc.2005.859235

Cited by 29 publications

(17 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we explain three scheduling methods the simple method, the bisection method, and the segment insertion method [15]. Although the bisection method is a more simple method than the segment insertion method, the ratio to reduce the computation time is lower than that under the segment insertion method.…”

Section: Scheduling Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A Simple Broadcasting Method for Computation Time Reduction on Grid Computing Environment

Yoshihisa¹,

Nomura²,

Kanazawa³

2006

7th International Conference on Mobile Data Management (MDM'06)

Self Cite

View full text Add to dashboard Cite

Recently, grid computing, which exploits extra computing resources, has attracted great attention. In grid computing environment, generally, by using several clients and calculating different equations against the large data generated by a server, the computation time is reduced. However, in the case where the number of clients is large, the system load becomes high and the computation time can become long. In this paper, we propose a delivering method to reduce the computation time using broadcasting delivery. In broadcasting delivery, the server broadcasts the data to many clients concurrently. Accordingly, the system load does not change even if the number of clients increases. Although clients have to wait until their desired data are broadcast, our evaluations show that we can reduce the computation time by dividing the data into only two segments.

show abstract

Section: Scheduling Methodsmentioning

confidence: 99%

“…In this paper, we propose a delivering method for large data using broadcasting delivery [6,15]. In broadcasting delivery, the server can deliver the data to many clients concurrently.…”

Section: Figure 2 An Elapsed Time For Parallel Computingmentioning

confidence: 99%

A Simple Broadcasting Method for Computation Time Reduction on Grid Computing Environment

Yoshihisa¹,

Nomura²,

Kanazawa³

2006

7th International Conference on Mobile Data Management (MDM'06)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In broadcasting delivery, many scheduling methods have been proposed to reduce the waiting time for starting playing the data [2], [5], [6], [8], [10], [12], [14].…”

Section: B Broadcasting Typementioning

confidence: 99%

d-Cast : A Division Based Broadcasting System for IP Networks

Gotoh

Yoshihisa

Kanazawa

2007

The 9th International Conference on Advanced Communication Technology

View full text Add to dashboard Cite

Due to the recent prevalence of the Internet, broadcasting continuous media data, e.g., audio and video, on the IP (Internet Protocol) networks has attracted great attention. In broadcasting systems, generally, a server broadcasts the same data repetitively. Although the server can deliver the data to many clients concurrently, clients have to wait until their desired data are broadcast. To reduce the waiting time, several researches employ a division based broadcasting system, which reduces the waiting time by dividing the data into several segments and broadcasting precedent segments frequently. These researches often assume that there are many clients and broadcasting delivery is more effective than client-server delivery. However, these researches do not show its concrete availability. In this paper, by designing and implementing a division based broadcasting system called "d-Cast", we discuss the availability for division based broadcasting systems.

show abstract

“…We have proposed scheduling methods to reduce the waiting time for continuous media data broadcasting [10], [11]. These methods use a near-video-on-demand technique, i.e., reducing the waiting time by broadcasting the data repetitively.…”

Section: B Related Workmentioning

confidence: 99%

A Scheduling Method Considering Available Bandwidth in Selective Contents Broadcasting

Gotoh

Yoshihisa

Kanazawa

2007

2007 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

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.

show abstract

A Scheduling Scheme for Continuous Media Data Broadcasting With a Single Channel

Cited by 29 publications

References 13 publications

A Simple Broadcasting Method for Computation Time Reduction on Grid Computing Environment

A Simple Broadcasting Method for Computation Time Reduction on Grid Computing Environment

d-Cast : A Division Based Broadcasting System for IP Networks

A Scheduling Method Considering Available Bandwidth in Selective Contents Broadcasting

Contact Info

Product

Resources

About