摘要
本文著重在具有通用多重協定標籤交換(GMPLS)技術網際網路通訊協定之網路環境的探討，因為目前網路光網路已經成為未來網路的趨勢。而IETF也針對光網路提出GMPLS控制及管理光網路的規範。因為光網路的特性，所以每各波長(Wavelength)都可以攜帶大量的流量，波長的數量越多，頻寬越大，但是波長選擇上的複雜度也會隨之增加，並跟著網路規則增加而複雜組因為複雜化所以阻塞率也會增加，因此阻塞率會是一個很大的問題。 本文使用一個最短路徑選擇演算法(Dijkstra algorithm)來進行模擬。此演算法是以某一節點為出發點，計算從該節點出發到所有其他節點的最短路徑。此演算法在選擇一條光路徑時，考量資料鏈結層中目前可用的波長資訊之外，也會依據演算法來建立一條新的路徑或者是使用既有的路徑。模擬結果可以顯示GMPLS在不同情況下的阻塞率。
並列摘要
Since current optical network has become the trend for future network development and IETF had proposed GMPLS control and defined the standard for optical network management ， this study focused on the discussion of network environment which has General Multi-Protocol Label Switching (GMPLS) technical internet communication protocol. The characteristic of optical network is that each wavelength can carry a huge amount of data flow， as the wavelength quantity increases， the bigger bandwidth becomes. But the complication of wavelength selection also increases as more network standards being defined. Such complication leads to higher blocking rate， which becomes a big headache。 This study utilized a shortest path algorithm (Dijkstra algorithm) to proceed the simulation. This algorithm starts from a certain node and calculates the shortest path from this node to all the other nodes. When selecting an optical path， this algorithm considers not only the current feasible wavelength information in the data link layer， but also builds a new path or uses an existing path according to the algorithm. The simulation result showed GMPLS blocking rates under different conditions。