English  |  正體中文  |  简体中文  |  Items with full text/Total items : 74010/74010 (100%)
Visitors : 24005012      Online Users : 372
RC Version 7.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: http://ir.lib.ncu.edu.tw/handle/987654321/8000

    Title: 以訊務相關性為基礎的整合性服務可調整QoS排程器之研究;Study of the adjustable QoS scheduler for Integrated Services with traffic correlation
    Authors: 胡世熙;Shih-Hsi Hu
    Contributors: 通訊工程研究所
    Keywords: 服務品質保證;時間數列分析與預測;頻寬分配;排程機制;QoS;Time Series Analysis and Forecast;Bandwidth Allocation;Scheduling algorithm
    Date: 2002-06-19
    Issue Date: 2009-09-22 11:15:30 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 在這篇論文當中,藉由考慮到達網路節點之訊務量間的相關性質 (correlation property),我們提出了一套在整合性服務架構 (Integrated Services) 中,提供服務品質 (QoS) 的排程機制設計方法。在所提出的方法中,我們採用了權重公平排隊機制 (Weighted Fair Queueing) 的基本概念。我們應用訊務流的相關性性質給我們帶來的啟發,設計動態地去調整每種服務型態的頻寬分享參數 (share weight factors)。在論文中,我們應用了自我迴歸整合移動平均 (Auto Regressive Integrated Moving Average) 模型來描述相關性性質,並且藉由模型中 AR 部分和 MA 部分的係數導出頻寬分享參數。我們做了一些實驗性質的模擬,來驗證說明所提出之機制的效能表現﹔此外,為了檢驗此機制所能提供給各種服務型態間的公平性指標,我們也定義了一個公平競爭參數 (Fair Play Parameter)。模擬結果顯示此機制可實現各服務類型之間的公平性,特別是在鏈結頻寬受限制的情況下。 In this thesis, the design of a QoS scheduling scheme for the integrated services is proposed by considering the correlation property of the arriving traffic. The basic concept of the Weighted Fair Queueing (WFQ) is adopted in the proposed scheme. However, the correlation property of the traffic stream is applied as the heuristic to adjust the share weight factors of each traffic type dynamically. The Auto Regressive Integrated Moving Average (ARIMA) model is applied in this thesis to characterize the correlation property. And the share weight factors are derived from the parameters of the AR part and MA part. Experimental simulations are performed to illustrate the effectiveness of the proposed scheme. In addition to comparing the performance of each service types, we also define a fair play parameter (FPP) to examine the fairness index among various traffic streams of the proposed scheme. The experimental results indicate that the fairness among service classes can be achieved, especially when link capacity is limited.
    Appears in Collections:[通訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明