English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113656/144643 (79%)
Visitors : 51713925      Online Users : 580
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/39415
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/39415


    Title: Measuring the Cost of Links of a Disaster-Avoided Content-Delivering Service within a Large-scaled Company
    Authors: 陸行
    Luh, Hsing
    Contributors: 國立政治大學應用數學系
    Keywords: Disaster-Avoided Content-Delivering Service
    Date: 2009-07
    Issue Date: 2010-05-21 16:58:10 (UTC+8)
    Abstract: A content-delivering service within a large-scaled company in Taiwan has been proposed to use 40 servers to meet user requirements on the previous study. The managers of the case company want to use resources as few as possible. From previous study [19--21], we suggest them using 19 servers to deliver large files. However, because we need not only servers but also links to deliver content from the source to all destinations, we cannot discuss servers merely. Therefore, we must discuss about the reliability and cost of links that in previous study it discussed few about this matter. Since the important packets must be delivered on time, and the regular packets are flexible. Therefore, we need a proper design to make the important packets deliver to the destinations without mistake. The regular packets also need to be delivered to destinations, but they can resent to destinations until the urgent files are delivered completely. Therefore, the reliability design of links must consider following utilization: the system is used to deliver every kind of data securely, but the important packets must be delivered without delay. Therefore, this work models the reliability and cost of links to find the proper resource allocation that can help manager delivering urgent files and regular files.
    Relation: Proc. of the Fourth International Conference on Queueing Theory and Network Applications
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1145/1626553.1626555
    DOI: 10.1145/1626553.1626555
    Appears in Collections:[應用數學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    2009.pdf241KbAdobe PDF2954View/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