A tree-based reliable multicast scheme exploiting the temporal locality of transmission errors

International Journal of Pervasive Computing and Communications

et al. 2013

If you would like to write for this, or any other Emerald publication, then please use our Emerald for Authors service information about how to choose which publication to write for and submission guidelines are available for all. Please visit www.emeraldinsight.com/authors for more information. About Emerald www.emeraldinsight.comEmerald is a global publisher linking research and practice to the benefit of society. The company manages a portfolio of more than 290 journals and over 2,350 books and book series volumes, as well as providing an extensive range of online products and additional customer resources and services. AbstractPurpose -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 clients' available channels.

Section: Basic Ideamentioning

confidence: 99%

A scheduling method for heterogeneous clients on media data broadcasting

International Journal of Pervasive Computing and Communications

et al. 2013

“…Several methods have been proposed to reduce waiting time for broadcasting systems [3]- [10]. In Harmonic Broadcasting (HB) [11], the server divides the data into N segments of equal sizes and divides them into i subsegments (S i,1 , · · · , S i,i ) of equal sizes.…”

Section: Related Workmentioning

confidence: 99%

A Scheduling Method to Reduce Waiting Time on Immersive Contents Broadcasting

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.

“…Several methods to reduce waiting time have been proposed in continuous media data broadcasting [4,6,7,8,9].…”

Section: Related Workmentioning

confidence: 99%

A method to reduce waiting time for close-range broadcasting

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

et al. 2011

Due to the recent popularization of digital webcast systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a movie program, 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 eective broadcast schedule for continuous media data. However, these methods do not consider the broadcast schedule for two types of continuous media data. When two types of continuous media data are scheduled, waiting time that occurs from nishing 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 eective broadcast schedule considering the available bandwidth, we can eectively reduce the waiting time.