A New GA-based RWA Algorithm with Availability Guarantee in WDM Networks
碩士 === 國立高雄第一科技大學 === 資訊管理所 === 96 === In WDM networks, the survivability is one of the most important design properties. To reduce the possibility of losing large amount of data, some protection mechanism is necessary. However, different users may have different requirements and network providers...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/uq9677 |
| Summary: | 碩士 === 國立高雄第一科技大學 === 資訊管理所 === 96 === In WDM networks, the survivability is one of the most important design properties. To reduce the possibility of losing large amount of data, some protection mechanism is necessary. However, different users may have different requirements and network providers must prove different SLAs to satisfy all customers’ needs. Therefore, it is an important issue to devise an RWA algorithm with availability guarantee in WDM networks.
In this thesis, we propose a new GA-based RWA algorithm which can provision lightpaths with different availability-aware requirements. Our algorithm improves the previous algorithm by adding an availability parameter in the fitness function. Compared with previous research, our algorithm performs better in terms of blocking probability.
|
|---|