A Scheduling Protocol for Continuous Media Data Broadcasting With Large-Scale Data Segmentation

Yoshihisa

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

et al. 2012

Due to the recent popularization of 3-D broadcasting, 3-D broadcasting using an immersive display has been attracted great attention. In conventional 3-D broadcasting, since they watch the image with only the partial region and the view point is fixed, their realistic sensation is low. In immersive contents broadcasting, clients can play data without interruption. When the server delivers immersive contents in broadcasting, since the data size of each content is so large that the waiting time while playing it becomes unrealistic. In this paper, we propose a scheduling method to reduce waiting time on immersive contents broadcasting. In our proposed method, by dividing the immersive content into active immersive data and static immersive data and scheduling them effectively, the waiting time can be reduced.

Section: Related Workmentioning

confidence: 99%

A Scheduling Method to Reduce Waiting Time on Immersive Contents Broadcasting

Yoshihisa

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

et al. 2012

“…We previously proposed scheduling methods to reduce waiting time for division-based broadcasting [1], [2], [16]- [18]. Contents Cumulated Broadcasting Considering Bandwidth (CCB-CB) method [2] reduces waiting time effectively by acquiring bandwidth identical to the data consumption rate.…”

Section: Related Workmentioning

confidence: 99%

“…We have proposed several methods to reduce waiting time for continuous media data broadcasting that clients play without interruption [1], [2]. However, we did not consider cases where the server delivers data with packet loss in actual environments.…”

Section: Introductionmentioning

confidence: 99%

A Scheduling Scheme for Improving Error Resilience on Media Data Broadcasting

2012 15th International Conference on Network-Based Information Systems

2012

Due to the recent development of digital TV broadcasting systems, contents data broadcasting using voices or movies has attracted great attention. 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. We have proposed several methods to reduce waiting time for contents data broadcasting that clients play without interruption. However, we do not consider the packet loss that occurs in actual environments. In actual environments, we need to make the broadcast schedule considering the error resilience. In this paper, we propose a scheduling scheme to reduce the rate of packet loss considering the error resilience. Our proposed scheme can make the broadcast schedule using several replicated frames. In addition, by scheduling many replications of main frame, the error resilience is improved compared to the conventional scheme. 2012 15th International Conference on Network-Based Information Systems 978-0-7695-4779-4/12 $26.00

“…We previously proposed scheduling methods to reduce waiting time for division-based broadcasting [3,4,15,16,17,18,19]. Our proposed method supposes a delivery type of pro- …”

Section: Related Workmentioning

confidence: 99%

A method to reduce waiting time for continuous media data broadcasting considering internet advertisements

Yoshihisa

Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia

et al. 2010

Due to the continued spread of the Internet, delivering continuous media data, i.e., audio and video, has attracted great attention. In broadcasting systems, clients generally have to wait until their desired data are broadcast. Therefore, many researches have addressed ways to reduce waiting time. Although several methods to reduce waiting time in continuous media data broadcasting have been proposed, they have failed to consider cases where the server broadcasts Internet advertisements while playing the data. In this paper, we propose a scheduling method to reduce the waiting time that considers Internet advertisements. In our proposed method, by dividing the data and producing an effective broadcasting schedule based on the playing time of Internet advertisements, waiting time is reduced.