A scheduling method for waiting time reduction in node relay-based webcast considering available bandwidth

Yusuke Gotoh, Tomoki Yoshihisa, Hideo Taniguchi, Masanori Kanazawa

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Due to the recent popularisation of digital webcast systems, delivering continuous media data, i.e. audio and video, has been attracted great attention. In node relay-based webcast, the server has better load balance by receiving data concurrently from other several nodes. Conventional methods reduce waiting time by sharing channels and receiving data from them. However, since the number of nodes by which the user can receive the data is one, occupation time of available bandwidth of the node increases. In this paper, we propose a scheduling method to reduce the waiting time for node relay-based webcast. In our proposed method, by considering available bandwidth of each node and producing an effective schedule, the waiting time is reduced.

Original languageEnglish
Pages (from-to)295-302
Number of pages8
JournalInternational Journal of Grid and Utility Computing
Volume2
Issue number4
DOIs
Publication statusPublished - Oct 2011

Fingerprint

Waiting Time
Relay
Scheduling
Bandwidth
Vertex of a graph
Servers
Occupation Time
Load Balance
Continuous System
Node
Waiting time
Sharing
Schedule
Server

Keywords

  • Continuous media data
  • Node relay-based webcast
  • Scheduling
  • Waiting time

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Management Information Systems

Cite this

A scheduling method for waiting time reduction in node relay-based webcast considering available bandwidth. / Gotoh, Yusuke; Yoshihisa, Tomoki; Taniguchi, Hideo; Kanazawa, Masanori.

In: International Journal of Grid and Utility Computing, Vol. 2, No. 4, 10.2011, p. 295-302.

Research output: Contribution to journalArticle

@article{38a7048140a04ccb90f396e977ce948d,
title = "A scheduling method for waiting time reduction in node relay-based webcast considering available bandwidth",
abstract = "Due to the recent popularisation of digital webcast systems, delivering continuous media data, i.e. audio and video, has been attracted great attention. In node relay-based webcast, the server has better load balance by receiving data concurrently from other several nodes. Conventional methods reduce waiting time by sharing channels and receiving data from them. However, since the number of nodes by which the user can receive the data is one, occupation time of available bandwidth of the node increases. In this paper, we propose a scheduling method to reduce the waiting time for node relay-based webcast. In our proposed method, by considering available bandwidth of each node and producing an effective schedule, the waiting time is reduced.",
keywords = "Continuous media data, Node relay-based webcast, Scheduling, Waiting time",
author = "Yusuke Gotoh and Tomoki Yoshihisa and Hideo Taniguchi and Masanori Kanazawa",
year = "2011",
month = "10",
doi = "10.1504/IJGUC.2011.042945",
language = "English",
volume = "2",
pages = "295--302",
journal = "International Journal of Grid and Utility Computing",
issn = "1741-847X",
publisher = "Inderscience Enterprises Ltd",
number = "4",

}

TY - JOUR

T1 - A scheduling method for waiting time reduction in node relay-based webcast considering available bandwidth

AU - Gotoh, Yusuke

AU - Yoshihisa, Tomoki

AU - Taniguchi, Hideo

AU - Kanazawa, Masanori

PY - 2011/10

Y1 - 2011/10

N2 - Due to the recent popularisation of digital webcast systems, delivering continuous media data, i.e. audio and video, has been attracted great attention. In node relay-based webcast, the server has better load balance by receiving data concurrently from other several nodes. Conventional methods reduce waiting time by sharing channels and receiving data from them. However, since the number of nodes by which the user can receive the data is one, occupation time of available bandwidth of the node increases. In this paper, we propose a scheduling method to reduce the waiting time for node relay-based webcast. In our proposed method, by considering available bandwidth of each node and producing an effective schedule, the waiting time is reduced.

AB - Due to the recent popularisation of digital webcast systems, delivering continuous media data, i.e. audio and video, has been attracted great attention. In node relay-based webcast, the server has better load balance by receiving data concurrently from other several nodes. Conventional methods reduce waiting time by sharing channels and receiving data from them. However, since the number of nodes by which the user can receive the data is one, occupation time of available bandwidth of the node increases. In this paper, we propose a scheduling method to reduce the waiting time for node relay-based webcast. In our proposed method, by considering available bandwidth of each node and producing an effective schedule, the waiting time is reduced.

KW - Continuous media data

KW - Node relay-based webcast

KW - Scheduling

KW - Waiting time

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

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

U2 - 10.1504/IJGUC.2011.042945

DO - 10.1504/IJGUC.2011.042945

M3 - Article

VL - 2

SP - 295

EP - 302

JO - International Journal of Grid and Utility Computing

JF - International Journal of Grid and Utility Computing

SN - 1741-847X

IS - 4

ER -