隨著人們生活中越來越多的設備開始與網路連接,需要確保連接來源的可靠性,提供各種頻寬給網路上訊息交換的資料流量服務,又同時保持最低的營運成本,這將會是網路工程師所面臨的挑戰之一;為了解決未預期的資料流量錯誤,必須尋找及檢查網路路徑,但同時營運商也必須盡可能地將路徑距離縮小,才可以保持其合理利潤。本研究中在變化式雙向成本的演算法 TDC (Toggling Dual Cost Algorithm)的基礎上,我們開發一套α+1路徑保護系統來優化營運成本,該演算法是建立於派翠網路之上,作為一個可同時應用於非同步模組化開發系統(modeling asynchronous)及現階段系統中的強大工具,最後我們也利用派翠網路中具備的有邊界性(Boundedness)和存活性(Liveness),來確保執行時沒有溢位(Overflow)或死結(Deadlock)的問題發生。在此運作模式下,網路工程師可以利用優化的TDC演算法(Optimized TDC Algorithm),在不犧牲網路可靠性的前提下獲得最合理的利潤。
As the people become more and more connected to each other through Internet services, the need for ensuring reliability in Internet connection becomes unavoidable. To serve data traffic with varying degree of importance while maintaining the lowest operational expense is one of challenges faced by network engineers. Critical data traffic must be protected from termination caused by unwanted failure that could happen along the path, but at the same time, the operational expense spent on the path protection must be as minimum as possible, which ensures the Internet provider gains reasonable profit from its services. In this study, we optimize the operational expense of α+1 path protection system based on Toggling Dual Cost (TDC) algorithm. The algorithm is modeled by a Petri net, a powerful tool for modeling asynchronous and concurrent systems. The model is analyzed based on Petri net properties, namely, boundedness and liveness. Based on boundedness and liveness properties, we make sure that the proposed model has no overflow or deadlock problem in its implementation. From the proposed model, the network engineers can optimize the TDC algorithm to reach maximum efficiency, in order to obtain reasonable profit without sacrificing the network reliability.