A Minimum Cost Density Based Dynamic Multicast Traffic Grooming Algorithm in Optical WDM Networks
碩士 === 國立清華大學 === 資訊工程學系 === 100 === This thesis studies the dynamic multicast traffic grooming problem in optical WDM networks. Path establishment and light-tree selection are the key issues of the problem. This thesis defines a cost density and uses it to develop a new algorithm to find the minimu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/57936665537482565480 |