Finding Link Disjoint Routing Paths Based on Traffic Intensity for Alternate Routing
碩士 === 國立清華大學 === 資訊工程學系 === 95 === An alternate routing algorithm requires a set of predetermined routing paths for each sourcedestination pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-destination pair be link-disjoint....
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27775067472401303114 |