Design and performance evaluation of broadcast algorithms for time-constrained data retrieval

Yu Chi Chung, Chiang Lee

研究成果: Article同行評審

15 引文 斯高帕斯(Scopus)

摘要

We refer “time-constrained services” to those requests that have to be replied to within a certain client-expected time duration. If the answer cannot reach the client within this expected time, the value of the information may seriously degrade or even become useless. On-demand channels may not be able to handle all time-constrained services without degrading the performance. How to handle these services in broadcast channels becomes crucial to balance the load of wireless systems. In this paper, we study this problem and find the minimum number of broadcast channels required for such a task. Also, we propose solutions for this problem when the available channels are insufficient. Our performance result reveals that only a moderate number of channels is required to promote these time-constrained services.

原文English
頁(從 - 到)1526-1543
頁數18
期刊IEEE Transactions on Knowledge and Data Engineering
18
發行號11
DOIs
出版狀態Published - 2006 11月

All Science Journal Classification (ASJC) codes

  • 資訊系統
  • 電腦科學應用
  • 計算機理論與數學

指紋

深入研究「Design and performance evaluation of broadcast algorithms for time-constrained data retrieval」主題。共同形成了獨特的指紋。

引用此