淡江大學機構典藏:Item 987654321/59956
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 55025/89277 (62%)
造访人次 : 10606906      在线人数 : 25
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/59956


    题名: Providing Data Items with Time Constraints in Multi-Channel Broadcasting Environments
    作者: Chiang, Ding-Jung;Lin, Hwei-Jen;Shih, Timothy K.
    贡献者: 淡江大學資訊工程學系
    关键词: mobile computing;multichannel broadcasting;time constrain
    日期: 2008-11
    上传时间: 2011-10-05 22:30:16 (UTC+8)
    出版者: Oulu: Academy Publisher
    摘要: In a mobile computing system, users carrying portable devices can access database services from any location without requiring a fixed position in the networking environment. Some examples of strategies supported by databases in mobile computing include location dependent queries, long-lived transactions that require migration of data into the portable devices, form-based transactions, and online information report. Within a mobile computing environment, the need for a realtime database management model is strong, because one of the basic requirements in mobile data management is to provide real-time response to transactions of the underlying strategies. However, the resource constraints of mobile computing systems make it difficult to satisfy timing requirements of supported strategies. Low bandwidth, unreliable wireless links, and frequent disconnections increase the overhead of communication between mobile hosts and fixed hosts of the system. There are many situations in which we need to incorporate real-time constraints in broadcasting systems for mobile environments. In this paper, we study broadcast scheduling strategies for pushbased broadcast with timing constraints in the form of deadlines. Unlike previously proposed scheduling algorithms for broadcast systems which aim to minimize the mean access time, our goal is to identify scheduling algorithms for broadcast systems that ensure requests meet their deadlines. We present a study of the performance of traditional real-time strategies and mobile broadcasting strategies, and demonstrate that traditional realtime algorithms do not always perform the best in a mobile environment. We propose a multichannel model based on pushbased real-time broadcast system and also provide an efficient scheduling algorithm, called dynamic adjustment with time constraint (DATC), which is designed for timely delivery of data to mobile clients.
    關聯: Journal of Software 3(8), pp.65-72
    DOI: 10.4304/jsw.3.8.65-72
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML252检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈