政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/81311
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109927/140876 (78%)
Visitors : 45969884      Online Users : 733
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
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/81311


    Title: Cost Estimation Queueing Model For A Large-Scaled File Delivering Service
    Authors: Liang, Chih-Chin
    梁直青
    Wang, Chia-Hung
    王嘉宏
    Luh, Hsing
    陸行
    Contributors: 應數系
    Keywords: cost estimation;content delivery
    Date: 2011-06
    Issue Date: 2016-02-18 13:37:29 (UTC+8)
    Abstract: A large-scale content delivery service within a company in Taiwan uses 40 servers to deliver files from the company`s ordering system. In a content delivery system, servers and connections are the resources for sending files. However, because of increasing business needs, the content delivery service must be used for transferring various files rather than just a single business unit. This increases the content delivery frequency. Once a connection is used for delivering a file, the occupied connection serves no other file delivery purpose. Because each connection has a cost, the use of a connection that delivers no other packets represents an opportunity loss, with the necessity of delivering a higher number of packets creating a higher opportunity loss for the existing service. Further, each file sent through this content delivery service has its specified importance because of the different business needs. The average loss caused by the failure to send an important file is considerably larger than that when sending a regular file. That is, the opportunity costs of sending various types of files are different. Because the connections are sparse resources, it is important to discuss a way to use these connections efficiently for delivering various files. In other words, the manager must find a way to control the loss caused by the content delivery service because the opportunity cost of failing to deliver content with different priorities must be endurable. Therefore, this work analyzes the cost function of the queuing model of the proposed content delivery service. The results show that a manager can control the reservation of connections in order to deliver important packets with a minimum cost. That is, the manager can manage content delivery as efficiently as possible.
    Relation: International Journal of Electronic Commerce Studies, 2(1), 19-34
    Data Type: article
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    19-34.pdf571KbAdobe PDF2560View/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