模糊臨界值空間優先排序器之研究

Analysis of Space Priority Queue with Fuzzy Set Threshold

蔡復翔(Fu-Hsiang Tsai)

指導教授 ： 王振興 ； 王永鐘

國立臺北科技大學/機電學院/電機工程系所/博士(2009年)

摘要

本文提出一個利用模糊臨界值構成之空間優先排序器的訊務模型，並完成了其於真實網路條件下的各種效能分析，其中利用矩陣分析方法(matrix-analytic method)驗證了在高訊務流量以及低訊務流量條件下的封包遺失率。

基於既有的網路基礎架構上，本研究利用模糊臨界值構成之空間優先排序器來評估分析訊務模型的效能。經數值分析的結果顯示，在固定的臨界值設定方式下，一旦網路環境有突然大量的訊務流量湧入時，將會造成高優先權的封包遺失率上升之現象。反觀在不同的訊務流量模型的情況下，模糊臨界值構成之空間優先排序器確實能滿足高、低優先權封包遺失率的實際需求，在此以連續以及離散時間型群組馬可夫來模擬抵達過程。

關鍵字

矩陣分析方法 ； 封包遺失率 ； 離散時間型群組馬可夫抵達過程

並列摘要

In this dissertation, we develop both continuous-time and discrete-time queueing model of fuzzy threshold-based space priority buffer management and study its performance under realistic conditions. It applies a matrix-analytic approach to analyze the relevant performance measure, including the packet loss probability of high-priority traffic and the packet loss probability of low-priority traffic.

Based on the proposed framework, we explore the properties of the fuzzy threshold-based space priority buffer management scheme. Numerical results reveal that the fixed threshold scheme, through its abrupt nature, causes a relatively higher low-priority packet drop. Intuitively, the fuzzy threshold adapts well to different input traffic conditions and packet loss rate requirements of high-priority packet, yielding a lower packet loss probability for low-priority packet. The input process is adopted by discrete-time batch Markovian arrival process.

並列關鍵字

Matrix-analytic method ； fuzzy threshold-based space priority queue ； loss probability ； discrete-time batch Markovian

參考文獻

[1] S.J. Golestani, A self-clocked fair queueing scheme for high speed application, IEEE INFOCOM’94, pp. 636–646.

[2] A. Hung, G. Kesidis, Bandwidth scheduling for wide-area ATM networks using virtual finishing times, IEEE/ACM Trans. Netw. 4 (1) (1996) pp. 49–54.

[3] J.L. Rexford, A.G. Greenberg, F.G. Bonomi, Hardware-efficient fair queueing architecture for high speed networks, IEEE INFOCOM’96, pp. 638–646.

[4] D. Stiliadis, A. Varma, A general methodology for designing efficient traffic scheduling and shaping algorithms, IEEE INFOCOM’97, pp. 326–335.

[6] G. Xie, S.S. Lam, Delay guarantee of virtual clock server, IEEE/ACM Trans. Netw. 3 (6) (1995) pp. 683–689.