| dc.contributor | 企管系 | |
| dc.creator (作者) | Kuo, Geng-Sheng | |
| dc.creator (作者) | 郭更生 | zh_TW |
| dc.date (日期) | 2006-10 | |
| dc.date.accessioned | 6-Mar-2015 11:09:24 (UTC+8) | - |
| dc.date.available | 6-Mar-2015 11:09:24 (UTC+8) | - |
| dc.date.issued (上傳時間) | 6-Mar-2015 11:09:24 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/73683 | - |
| dc.description.abstract (摘要) | One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements. | |
| dc.format.extent | 130 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | IEEE communications magazine ,44(10), 104-111 | |
| dc.title (題名) | Minimum interference routing with fast protection | |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1109/MCOM.2006.1710421 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/MCOM.2006.1710421 | en_US |
