政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/54069
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 114205/145239 (79%)
造访人次 : 52843517      在线人数 : 1076
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/54069


    题名: 以群聚計算法求解叉狀型等候系統之穩態機率(I)
    其它题名: Calculating Balance Equations of a Fork-Type Queue by State-Aggregate Approach
    作者: 陸行
    贡献者: 國立政治大學應用數學學系
    行政院國家科學委員會
    关键词: 類生死過程之馬可夫鏈;等候理論;穩態機率
    日期: 2011
    上传时间: 2012-10-24 16:14:25 (UTC+8)
    摘要: 這是一個為期兩年的研究計畫，於計畫中進行調查一個新的計算方式於求解叉狀等候系統的穩態機率。我們初步證明此推導計算方式，縮減了以往複雜的矩陣計算。我們希望在這個研究計畫中可以演繹和推導此方法於一般服務時間的系統中。在第一年，我們希望將此結果運用於phase-type 的服務系統中。在第二年，則可以將第一年的結果應用於叉狀等候系統。這種計算法的好處是在大型的矩陣計算時可以顯著地減少計算量，提供使用者快速而且正確的解。
    Stationary probabilities are fundamental in response to various measures of performance in queueing networks. Solving stationary probabilities in Quasi-Birth-and-Death (QBD) type Markov Chain normally are dependent on the structure of the queueing network. In this two-year project, a new computing scheme is developed for attaining stationary probabilities in queueing networks of the fork-type. This scheme provides a general approach to reducing the complexity of computing algorithm. The result becomes more significant when a large buffer size is involved but it cannot be ignorant. The preliminary result of this approach is proved and provided with an illustrated example in this proposal. In the first year, it is supposed to apply the approach to a more general case where the service time is of the phase-type. Based on the result in the first year, a similar approach is used to study a folk-type queueing model during the second year.
    關聯: 基礎研究
    學術補助
    研究期間:10008~ 10107
    研究經費:604仟元
    数据类型: report
    显示于类别:[應用數學系] 國科會研究計畫

    文件中的档案:

    档案 描述 大小格式浏览次数
    100-2221-E004-003.pdf2746KbAdobe PDF2460检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 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 ©   - 回馈