English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88613/118155 (75%)
Visitors : 23486969      Online Users : 761
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/63001
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/63001


    Title: Optimal Services for Content Delivery based on Business Priority
    Authors: 陸行
    Luh,Hsing
    Liang, Chih-Chin
    Contributors: 應數系
    Keywords: content delivery;resource reservation;optimization
    Date: 2013
    Issue Date: 2013-12-26 10:04:52 (UTC+8)
    Abstract: In a content-delivery system, connections are viewed as resources for sending files. However, the growing business needs of large-scale networks require an effective content-delivery service for transferring files. Since connections are sparse resources, prioritizing connections is essential for efficiently delivering urgent files and regular files based on various business priorities. This study presents a loss function as a performance index for a content-delivery service. The proposed loss function was applied to a sample content-delivery system to derive the average number of regular files in the retry group, the probability of failure to transfer a regular file in the first attempt, and the probability of failure to transmit urgent files. Additionally, the loss was associated with the decreased number of reserve connections under regular hours and peak hours. The experimental results show that the proposed model finds the optimal number of reserve connections for sending high- and low-priority files, and a manager can increase the service rate to ensure that losses are tolerable when delivering urgent files. Finally, the relative probabilities of blocked urgent files and blocked regular files are used as an indicator of efficiency in reserving connections.
    Relation: Journal of the Chinese Institute of Engineers,36(4),422-440
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1080/02533839.2012.731885
    DOI: 10.1080/02533839.2012.731885
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML867View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback