標題: ATM網路中對延遲敏感與漏失敏感的流量之近似最佳化排程
A Near Optimal Departure Scheduling Scheme For Delay and Loss Sensitive Traffics in ATM Network
作者: 洪國傳
KUOCHUAN HONG
王熹偉
SHIWEI WANG
資訊科學與工程研究所
關鍵字: 非同步傳輸模式;離去排程;延遲敏感;流失敏感;ATM;Departure Scheduling;Delay Sensitive;Loss sensitive
公開日期: 1993
摘要: 在未來以ATM為架構的寬頻整體服務數位網路上會提供許多不同種類的服 務。用戶對這些服務有很不相同的服務品質要求。通常是在對延遲的時間 跟資料的流失率上有一定的要求標準。如何滿足這些服務品質的要求便成 了這個領域的一個很重要的課題。在這篇論文中,我們著眼於如何做資料 的排程,期使在未來能夠避免損失。也就是決定在下一刻我們應該安排那 一種資料送出,能使未來造成損失的機率最小。我們發現 Value- Iteration Algorithm可以幫我們找到最佳化的解。但是這個演算法的運 算太複雜了,無法應用在真正的網路上。因此,我們提出一個近似最佳化 的排程方法。這個方法在大部分的情況下會做出最佳化的排程。我們同時 也以程式架構了一個模擬的網路環境,然後使用我們提出的方法在這個環 境之下做資料排程。 Broadband integrated services digital network based on asynchronous transfer mode (B_ISDN/ATM) will provide diverse services in the near future. Those services have quite different quality of service (QOS) requirements in terms of delay and loss. How to fulfill those QOS in topic in this field. In this thesis we aim at departure scheduling that is to decide which traffic if served next will cause less penalty in the future. We found that the Value Iteration Algorithm can gives an optimal solution to our departure scheduling problem. However, this approach is not practical in real network application due to its computational complexity. So, we propose a near optimal departure scheduling scheme. We will show that in most cases our scheme gives a optimal decision. Furthermore, we build a simulation to simulate the real network operation and apply our scheduling scheme to control the departure.
URI: http://140.113.39.130/cdrfb3/record/nctu/#NT820392030
http://hdl.handle.net/11536/57835
Appears in Collections:Thesis