English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93244/123616 (75%)
Visitors : 27848219      Online Users : 585
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: http://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 PDF756View/Open

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback