A Broadcasting Scheme Considering Units to Play Continuous Media Data

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

doi:10.1109/tbc.2007.903639

Cited by 19 publications

(11 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section introduces AB [15], HI [16], SingBroad [17], PAS [18], and ROS [19]. Table 1 defines the terms used in this study.…”

Section: Related Workmentioning

confidence: 99%

“…In addition, numerous practical systems, such as digital video broadcasting-handheld (DVB-H) and integrated services digital broadcasting-handheld (ISDBH), do not permit a client to download video data from multiple channels, because the client typically has only one tuner [15,16]. To solve these problems caused by multiple-channel broadcasting, many studies were proposed to broadcast segments over a single channel, such as the alternative broadcasting (AB) scheme [15], the hopping insertion (HI) scheme [16], SingBroad [17], PAS [18], and the reverse-order scheduling (ROS) scheme [19]. The basic concept behind these schemes is to partition a video into equal-sized segments, which are classified into several groups and transferred over a single channel according to a predefined arrangement.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Single-Channel Data Broadcasting under Small Waiting Latency

2013

Journal of Applied Mathematics

View full text Add to dashboard Cite

Due to the advancement of network technology, video-on-demand (VoD) services are growing in popularity. However, individual stream allocation for client requests easily causes a VoD system overload; when its network and disk bandwidth cannot match client growth. This study thus presents a fundamentally different approach by focusing solely on a class of applications identified as latency tolerant applications. Because video broadcasting does not provide interactive (i.e., VCR) functions, a client is able to tolerate playback latency from a video server. One efficient broadcasting method is periodic broadcasting, which divides a video into smaller segments and broadcasts these segments periodically on multiple channels. However, numerous practical systems, such as digital video broadcasting-handheld (DVB-H), do not allow clients to download video data from multiple channels because clients usually only have one tuner. To resolve this problem in multiple-channel broadcasting, this study proposes a novel single-channel broadcasting scheme, which leverages segment-broadcasting capability further for more efficient video delivery. The comparison results show that, with the same settings of broadcasting bandwidth, the proposed scheme outperforms the alternative broadcasting scheme, the hopping insertion scheme, SingBroad, PAS, and the reverse-order scheduling scheme for the maximal waiting time.

show abstract

“…This section introduces AB [15], HI [16], SingBroad [17], PAS [18], and ROS [19]. Table 1 defines the terms used in this study.…”

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Single-Channel Data Broadcasting under Small Waiting Latency

2013

Journal of Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…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%

A Scheduling Scheme for Improving Error Resilience on Media Data Broadcasting

Gotoh

Takahashi

2012

2012 15th International Conference on Network-Based Information Systems

View full text Add to dashboard Cite

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

show abstract

“…The same authors in [57], proposed novel broadcasting and proxy caching techniques in order to offer more scalability to the video delivery and to increase the overall performance of the system. In [58], the authors proposed a scheme to reduce the waiting time of the video application client side. The video traffic considered by authors was MPEG2.…”

Section: Call Admission Control Algorithmsmentioning

confidence: 99%