A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting

Yusuke Gotoh, Tomoki Yoshihisa, Masanori Kanazawa, Yutaka Takahashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watching their selected contents, have attracted attention. For example, in a quiz program, a user selects his or her answer and watches the video content for the answer. Although the server can deliver programs that meet users' preferences, clients have to wait until their selected contents are delivered. Conventional methods reduce the waiting time by producing an effective broadcast schedule. These methods do not consider the possibilities of which content has been selected. However, by considering the transition probability of selective contents, the waiting time can be reduced further. In this paper, we propose a scheduling method to reduce waiting time by considering transition probability. Our proposed method reduces the waiting time by allocating broadcast channels that have the same bandwidth as the contents consumption rate and scheduling contents considering transition probability.

Original languageEnglish
Title of host publicationISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems
Pages149-153
Number of pages5
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 IEEE International Symposium on Wireless Communication Systems, ISWCS'08 - ReykjavIk, Iceland
Duration: Oct 21 2008Oct 24 2008

Other

Other2008 IEEE International Symposium on Wireless Communication Systems, ISWCS'08
CountryIceland
CityReykjavIk
Period10/21/0810/24/08

Fingerprint

broadcasting
Broadcasting
scheduling
Scheduling
Watches
Servers
broadcast
Bandwidth
popularization
time
quiz
video

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Cite this

Gotoh, Y., Yoshihisa, T., Kanazawa, M., & Takahashi, Y. (2008). A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting. In ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems (pp. 149-153). [4726036] https://doi.org/10.1109/ISWCS.2008.4726036

A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting. / Gotoh, Yusuke; Yoshihisa, Tomoki; Kanazawa, Masanori; Takahashi, Yutaka.

ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems. 2008. p. 149-153 4726036.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gotoh, Y, Yoshihisa, T, Kanazawa, M & Takahashi, Y 2008, A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting. in ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems., 4726036, pp. 149-153, 2008 IEEE International Symposium on Wireless Communication Systems, ISWCS'08, ReykjavIk, Iceland, 10/21/08. https://doi.org/10.1109/ISWCS.2008.4726036
Gotoh Y, Yoshihisa T, Kanazawa M, Takahashi Y. A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting. In ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems. 2008. p. 149-153. 4726036 https://doi.org/10.1109/ISWCS.2008.4726036
Gotoh, Yusuke ; Yoshihisa, Tomoki ; Kanazawa, Masanori ; Takahashi, Yutaka. / A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting. ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems. 2008. pp. 149-153
@inproceedings{344864c1e5f5431995b2bbed09c50190,
title = "A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting",
abstract = "Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watching their selected contents, have attracted attention. For example, in a quiz program, a user selects his or her answer and watches the video content for the answer. Although the server can deliver programs that meet users' preferences, clients have to wait until their selected contents are delivered. Conventional methods reduce the waiting time by producing an effective broadcast schedule. These methods do not consider the possibilities of which content has been selected. However, by considering the transition probability of selective contents, the waiting time can be reduced further. In this paper, we propose a scheduling method to reduce waiting time by considering transition probability. Our proposed method reduces the waiting time by allocating broadcast channels that have the same bandwidth as the contents consumption rate and scheduling contents considering transition probability.",
author = "Yusuke Gotoh and Tomoki Yoshihisa and Masanori Kanazawa and Yutaka Takahashi",
year = "2008",
doi = "10.1109/ISWCS.2008.4726036",
language = "English",
isbn = "9781424424894",
pages = "149--153",
booktitle = "ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems",

}

TY - GEN

T1 - A scheduling method to reduce waiting time considering transition probability for selective contents broadcasting

AU - Gotoh, Yusuke

AU - Yoshihisa, Tomoki

AU - Kanazawa, Masanori

AU - Takahashi, Yutaka

PY - 2008

Y1 - 2008

N2 - Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watching their selected contents, have attracted attention. For example, in a quiz program, a user selects his or her answer and watches the video content for the answer. Although the server can deliver programs that meet users' preferences, clients have to wait until their selected contents are delivered. Conventional methods reduce the waiting time by producing an effective broadcast schedule. These methods do not consider the possibilities of which content has been selected. However, by considering the transition probability of selective contents, the waiting time can be reduced further. In this paper, we propose a scheduling method to reduce waiting time by considering transition probability. Our proposed method reduces the waiting time by allocating broadcast channels that have the same bandwidth as the contents consumption rate and scheduling contents considering transition probability.

AB - Due to the recent popularization of digital broadcasting systems, selective contents, i.e., users watching their selected contents, have attracted attention. For example, in a quiz program, a user selects his or her answer and watches the video content for the answer. Although the server can deliver programs that meet users' preferences, clients have to wait until their selected contents are delivered. Conventional methods reduce the waiting time by producing an effective broadcast schedule. These methods do not consider the possibilities of which content has been selected. However, by considering the transition probability of selective contents, the waiting time can be reduced further. In this paper, we propose a scheduling method to reduce waiting time by considering transition probability. Our proposed method reduces the waiting time by allocating broadcast channels that have the same bandwidth as the contents consumption rate and scheduling contents considering transition probability.

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

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

U2 - 10.1109/ISWCS.2008.4726036

DO - 10.1109/ISWCS.2008.4726036

M3 - Conference contribution

AN - SCOPUS:62449268629

SN - 9781424424894

SP - 149

EP - 153

BT - ISWCS'08 - Proceedings of the 2008 IEEE International Symposium on Wireless Communication Systems

ER -