English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113311/144292 (79%)
Visitors : 50931807      Online Users : 996
RC Version 6.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
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/68182
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/68182


    Title: Disaster Avoidance Mechanism for Content-Delivering Service
    Authors: 梁直青
    Liang,Chih-Chin
    王嘉宏
    Wang,Chia-Hung
    陸行
    Luh,Hsing
    許秉諭
    Hsu,Ping-Yu
    Contributors: 應數系
    Keywords: Disaster avoidance;DRP for information systems;Fault tolerance;Content delivery
    Date: 2009.01
    Issue Date: 2014-08-05 16:31:37 (UTC+8)
    Abstract: Many software applications have been developed on client-server and web-based architectures, with client software installed in numerous clerks’ devices spread over the whole of Taiwan along the hierarchical organization of large-scaled service companies. The damage for a large-scaled service company would be caused by an inconsistent system, in which client software fails to receive updated content causing loss of emergency calls and possibility of recovery. Therefore, a reliable content-delivering service is needed for such a large-scaled service company to ensure system consistency whenever a disaster occurs. This study analyses the error situations of a proposed content-delivering service that has been implemented in a large-scaled company in Taiwan. Moreover, its disaster avoidance mechanism provides a reliability model with the waiting-time distribution of disconnected links. The proposed disaster avoidance mechanism prevents damage from terminating operations of a company caused by disasters, such as earthquakes, tsunamis, nuclear plant explosions or wars. Empirical results demonstrate that the proposed design run on 19 servers distributes content with less than 3.4 content-delivery failures per million hours.
    Relation: Computers & Operations Research,36(1), 27-39
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/j.cor.2007.09.001
    DOI: 10.1016/j.cor.2007.09.001
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML21298View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback