| Summary: | 碩士 === 國立高雄第一科技大學 === 資訊管理所 === 98 === Next-generation SONET/SDH networks have three main technologies including generic framing procedure, virtual concatenation, and link-capacity adjustment scheme. These technologies can help operators provide multipath provision and flexible capacity allocation. This thesis assumes that the demand of the traffic capacity exceeds the bandwidth of the wavelength of the WDM network. Therefore, we have to provision these flows in inverse multiplexing. We propose several feasible routing algorithms and analyze them in the following phases. In the first phase, we consider the minimum cost algorithm that would produce three path sets including a single shortest path set, a disjoint multipath set, and a non-disjoint multipath set to carry ultra-high traffic flows. The simulation shows the non-disjoint multipath solution, under the same cost rule, performs effectiveness in terms of blocking probability. In the second phase, we consider the least load principle for non-disjoint multipath. Compared with above non-disjoint multipath solution, the least load algorithm achieves lower blocking probability in light network load. In the final phase, we improve the provision algorithms in previous phases with the technique that balances the load of paths, called least load with balanced algorithm. It performs most effectively among all algorithms we have devised.
|
|---|
