A method to reduce waiting time on node relay-based webcast for selective contents

Yusuke Gotoh, Tomoki Yoshihisa, Hideo Taniguchi, Masanori Kanazawa

Research output: Contribution to journalArticle

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.

Original languageEnglish
Article number1949217
Pages (from-to)223-239
Number of pages17
JournalInternational Journal of Web Information Systems
Volume7
Issue number3
DOIs
Publication statusPublished - 2011

Fingerprint

Broadcasting
Scheduling
Bandwidth

Keywords

  • Available bandwidth
  • Data streaming
  • Internet
  • Node relays
  • Playsequence graph
  • Scheduling
  • Selective contents
  • Waiting time
  • Web sites
  • Webcast

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

A method to reduce waiting time on node relay-based webcast for selective contents. / Gotoh, Yusuke; Yoshihisa, Tomoki; Taniguchi, Hideo; Kanazawa, Masanori.

In: International Journal of Web Information Systems, Vol. 7, No. 3, 1949217, 2011, p. 223-239.

Research output: Contribution to journalArticle

@article{e4f789732cae4a24b0cb8d4f5cc3200d,
title = "A method to reduce waiting time on node relay-based webcast for selective contents",
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.",
keywords = "Available bandwidth, Data streaming, Internet, Node relays, Playsequence graph, Scheduling, Selective contents, Waiting time, Web sites, Webcast",
author = "Yusuke Gotoh and Tomoki Yoshihisa and Hideo Taniguchi and Masanori Kanazawa",
year = "2011",
doi = "10.1108/17440081111165875",
language = "English",
volume = "7",
pages = "223--239",
journal = "International Journal of Web Information Systems",
issn = "1744-0084",
publisher = "Emerald Group Publishing Ltd.",
number = "3",

}

TY - JOUR

T1 - A method to reduce waiting time on node relay-based webcast for selective contents

AU - Gotoh, Yusuke

AU - Yoshihisa, Tomoki

AU - Taniguchi, Hideo

AU - Kanazawa, Masanori

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Available bandwidth

KW - Data streaming

KW - Internet

KW - Node relays

KW - Playsequence graph

KW - Scheduling

KW - Selective contents

KW - Waiting time

KW - Web sites

KW - Webcast

UR - http://www.scopus.com/inward/record.url?scp=84886376688&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84886376688&partnerID=8YFLogxK

U2 - 10.1108/17440081111165875

DO - 10.1108/17440081111165875

M3 - Article

AN - SCOPUS:84886376688

VL - 7

SP - 223

EP - 239

JO - International Journal of Web Information Systems

JF - International Journal of Web Information Systems

SN - 1744-0084

IS - 3

M1 - 1949217

ER -