候伺網路阻塞機率之平行計算

Abstract

傳統上, 候伺網路阻塞機率的計算是一件非常困難的事, 因為每個候 伺系統彼此間都會相互的影響, 這使得阻塞機率的考慮因素變得相當的複 雜而不容易計算. 在這篇論文中, 我們首先分析阻塞發生的特性, 並且找 出環狀網路的阻塞機率. 接著我們提出一個方法來求得阻塞機率的近似 解, 並且分析這個近似解和確切解的誤差值. 最後我們分別在循序和平行 計算的環境上, 設計我們的程式, 來求得阻塞機率的解, 並且分析其結 果. Traditionally, computing blocking probability of queueing networks is difficult. Every queueing system in the network will be effect by others in this network. The topology of the network will effect their relationships. In this thesis, we will discuss the behavior of blocking. And we will analyze the blocking probability of the ring networks. We give the exact solution of blocking probability and an approximation of this solution. Then we evaluate the difference between exact solution and approximation. We implement our approximation method in both sequential and parallel environment. We also implement a simulator to simulator the ring network. Finally we analyze these results and evaluate our approximation.