中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/51568
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78937/78937 (100%)
Visitors : 39612787      Online Users : 212
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51568


    Title: Quality of Service Provisioning Scheme for Data Dissemination with Time Constraints in Ubiquitous Environments
    Authors: Chiang,DJ;Chen,CL;Deng,DJ;Shih,TK;Hsu,HH
    Contributors: 資訊工程學系
    Keywords: DEMAND DATA BROADCAST;DELAY ANALYSIS;NETWORKS
    Date: 2010
    Issue Date: 2012-03-27 18:56:24 (UTC+8)
    Publisher: 國立中央大學
    Abstract: This paper considers the support of time-constraint services to mobile users in a ubiquitous environment The challenge for a database with time constraint services becomes more important in a ubiquitous computing environment Low bandwidth, unreliable wireless links, and frequent disconnections of ubiquitous environments make it difficult to satisfy the timing requirements of supported strategies This study investigates broadcast scheduling strategies for push-based broadcast with timing constraints in the form of deadlines, and proposes a multichannel scheduling algorithm for push-based broadcast with timing constraints Under such a scheme, modifying the access method in the broadcast period supports data allocation on multiple channels, allowing time-constraint property to be satisfied in ubiquitous environments The proposed dissemination policy and adaptive bandwidth allocation scheme obtain sufficient conditions such that all the time-bounded traffic sources satisfy their timing constraints to provide various quality-of-service (QoS) guarantees in the broadcast period Our goal is to identify scheduling algorithms for broadcast systems that ensure requests meet their deadlines This study examines the performance of traditional real-time strategies and mobile broadcasting strategies, and demonstrates that traditional real-time algorithms do not always perform the best in a mobile environment The proposed design Indeed achieves good performance in ubiquitous environments
    Relation: JOURNAL OF INTERNET TECHNOLOGY
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML550View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明