| Summary: | 碩士 === 國立雲林科技大學 === 資訊工程研究所 === 93 === In order to use WDM networks efficiently and effectively, a lightpath is dynamically established upon the arrival of a connection request. Dynamic routing is usually determined by conventional shortest path algorithm. However, by assigning different link weight, it results in different network performance especially in call blocking probability.
Furthermore, to avoid consuming too much network resources by accepting a path with long hop count, a new call control algorithm named Random Early Blocking (REB) is proposed. By randomly rejecting call with long path in network under heavy load, the whole network blocking probability can be greatly improved.
In cooperation with REB, all of the three adaptive routing approaches can significantly improve their performance. Finally, we also consider the fairness problem of REB, and propose the fair version of REB, we called FREB (Fairness Random Early Blocking). The FREB can obtain fairness among s-d pairs with different location by only sacrificing a little blocking performance.
|
|---|
