Search results

1 – 4 of 4
Article
Publication date: 30 August 2011

Yusuke Gotoh, Tomoki Yoshihisa, Hideo Taniguchi and Masanori Kanazawa

The purpose of this paper is to reduce the waiting time on webcast for selective contents, by proposing a scheduling method called the “contents prefetched broadcasting…

Abstract

Purpose

The purpose of this paper is to reduce the waiting time on webcast for selective contents, by proposing a scheduling method called the “contents prefetched broadcasting considering user participation” (CPB‐CP) method.

Design/methodology/approach

The authors analyze and evaluate the performance of the proposed CPB‐CP method.

Findings

It is 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 in the case where the playing time of each content item is different.

Practical implications

In selective contents delivery, users may wait for the next bit of content to start playing after watching the previous one. In quiz programs, users may wait to receive the content data for their selected answer after they select their answer.

Originality/value

In the CPB‐CP method, when a provider node pulls out of the network while delivering contents, waiting time is reduced effectively by reconstructing a delivery schedule that considers the available bandwidth of each provider node.

Details

International Journal of Web Information Systems, vol. 7 no. 3
Type: Research Article
ISSN: 1744-0084

Keywords

Article
Publication date: 30 March 2012

Yusuke Gotoh, Tomoki Yoshihisa, Hideo Taniguchi and Masanori Kanazawa

The purpose of this paper is to propose a scheduling method called the “Asynchronous Harmonic Broadcasting Considering Commercial (AHB‐CC)” method, to reduce waiting time for…

Abstract

Purpose

The purpose of this paper is to propose a scheduling method called the “Asynchronous Harmonic Broadcasting Considering Commercial (AHB‐CC)” method, to reduce waiting time for continuous media data broadcasting.

Design/methodology/approach

The authors analyze and evaluate the performance of the proposed AHB‐CC method.

Findings

The authors confirm that the proposed method gives shorter average waiting times than the conventional methods.

Research limitations/implications

A future direction of this study will involve making a scheduling method where the server concurrently broadcasts data and commercial contents. Also, maximum buffer size needs to be considered.

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 AHB‐CC method presented in the paper further reduces waiting time by scheduling an effective broadcast that considers the playing time of commercial contents.

Details

International Journal of Pervasive Computing and Communications, vol. 8 no. 1
Type: Research Article
ISSN: 1742-7371

Keywords

Article
Publication date: 21 June 2013

Yusuke Gotoh, Tomoki Yoshihisa, Hideo Taniguchi and Masanori Kanazawa

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…

Abstract

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 clients' available channels.

Details

International Journal of Pervasive Computing and Communications, vol. 9 no. 2
Type: Research Article
ISSN: 1742-7371

Keywords

Content available
Article
Publication date: 30 August 2011

David Taniar

309

Abstract

Details

International Journal of Web Information Systems, vol. 7 no. 3
Type: Research Article
ISSN: 1744-0084

1 – 4 of 4