Time-constrained service on air

Yu Chi Chung, Chao-Chun Chen, Chiang Lee

研究成果: Paper

11 引文 (Scopus)

摘要

Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.

原文English
頁面739-748
頁數10
出版狀態Published - 2005 一月 1
事件25th IEEE International Conference on Distributed Computing Systems - Columbus, OH, United States
持續時間: 2005 六月 62005 六月 10

Other

Other25th IEEE International Conference on Distributed Computing Systems
國家United States
城市Columbus, OH
期間05-06-0605-06-10

指紋

Broadcasting
Scheduling
Air

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

引用此文

Chung, Y. C., Chen, C-C., & Lee, C. (2005). Time-constrained service on air. 739-748. 論文發表於 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.
Chung, Yu Chi ; Chen, Chao-Chun ; Lee, Chiang. / Time-constrained service on air. 論文發表於 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.10 p.
@conference{4696858d07044e7bb8498769ead6debc,
title = "Time-constrained service on air",
abstract = "Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.",
author = "Chung, {Yu Chi} and Chao-Chun Chen and Chiang Lee",
year = "2005",
month = "1",
day = "1",
language = "English",
pages = "739--748",
note = "25th IEEE International Conference on Distributed Computing Systems ; Conference date: 06-06-2005 Through 10-06-2005",

}

Chung, YC, Chen, C-C & Lee, C 2005, 'Time-constrained service on air' 論文發表於 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States, 05-06-06 - 05-06-10, 頁 739-748.

Time-constrained service on air. / Chung, Yu Chi; Chen, Chao-Chun; Lee, Chiang.

2005. 739-748 論文發表於 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.

研究成果: Paper

TY - CONF

T1 - Time-constrained service on air

AU - Chung, Yu Chi

AU - Chen, Chao-Chun

AU - Lee, Chiang

PY - 2005/1/1

Y1 - 2005/1/1

N2 - Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.

AB - Data broadcasting is an efficient and highly scalable technique for delivering data to mobile clients in wireless environments. In this paper, we study the problem of scheduling broadcast data that are with an expected time within which the client is expecting to receive the data item. We analyze the problem and derive the minimum number of broadcast channels required for such a task. Also, we discuss the problems when the number of available channels is not enough. We propose novel solutions for both of the cases and the performance study indicates that our method is much better than the previous ones and performs very close to optimal.

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

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

M3 - Paper

AN - SCOPUS:27944449332

SP - 739

EP - 748

ER -

Chung YC, Chen C-C, Lee C. Time-constrained service on air. 2005. 論文發表於 25th IEEE International Conference on Distributed Computing Systems, Columbus, OH, United States.