以抽樣及測量為基準之交換處理系統控制策略

A Sampling and Measurement Based Control Policy for Switched Processing Systems

林怡屏(Yi-Ping Lin)

指導教授 ： 洪英超

國立中央大學/理學院/統計研究所/碩士(2008年)

摘要

所謂的交換處理系統(Switched Processing Systems; SPS)被廣泛的應用在許多領域上，如通訊、電腦或製造業網路。這些系統通常包含不同的服務模組，其特徵是具有彈性(或可分享)且彼此之間不獨立。以往皆發展使吞吐量最大的控制策略，但近年則開始著重改善其服務品質(QoS)。本文將提出一個以抽樣及測量為基準的控制策略，此控制策略有以下之優點：(i)可大量節省資料儲存空間；(ii)可監控、預測及反應輸入流量之變動；(iii)可減少服務模組的交換次數(成本)；(iv)可達到系統的最大吞吐量(throughput)；並(v)可改善系統其他表現值(如工作的等待時間等)。最後，我們透過電腦模擬的方式來評估所提控制策略在各方面的表現。

關鍵字

指數加權移動平均管制圖 ； 流量強度 ； 均勻抽樣 ； 伯努利抽樣 ； 等待時間 ； 流體模型 ； 交換處理系統

並列摘要

Switched Processing Systems (SPS) represent a canonical model for many areas of applications of communication, computer and manufactur- ing systems. They are characterized by flexible, interdependent service capabilities and multiple classes of job traffic flows. Recently, increased attention has been paid to the issue of improving quality of service (QoS) performance in terms of delays and backlogs of the associated scheduling policies, rather than simply maximizing the system’s throughput. In this study, we investigate a sampling and measurement based control policy for switched processing systems that achieves the following objectives: (i) save a lot of memory, (ii) prediction and monitoring for intensity, (iii) re- duce the switch times of service modes, (iv) achieve maximal throughput in the systems and (v) improves performance with respect to delay. Finally, we perform the simulation study to show the performance assessment using propose policy.

並列關鍵字

Uniform Sampling ； traffic intensity ； Bernoulli Sampling ； delay ； Fluid Model ； Switched Processing System ； Exponential Weighted Moving Average Control Char

參考文獻

[2] N. Bambos and G. Michailidis, “Queueing Networks in Random Environments”, Advances in Applied Probability, 36, pp. 293-337, 2004.

[3] N. Bambos and G. Michailidis, “Queueing Networks of Random Link Topology: Stationary Dynamics of Maximal Throughput Schedules”, Queueing Systems, 50, pp. 5-52, 2005.

[4] J.G. Dai and B. Prabhakar, “The Throughput of Data Switches with and without Speedup”, Proceedings of IEEE INFOCOM, pp.556-564, 2000.

[6] G. Michailidis, “Optimal Resource Allocation in a Queueing System with Shared Resources”, Proceedings of the 42nd Conference of Decision and Control, 2003.

[7] L. Tassiulas and P.P. Bhattacharya, “Allocation of Interdependent Resources for Maximal Throughput”, Stochastic Models, 16(1), pp. 27-48, 1999.