| dc.contributor | SPIE | en_US |
| dc.creator (作者) | Huang Qing;郭更生 | en_US |
| dc.date (日期) | 2004-09 | en_US |
| dc.date.accessioned | 14-Jan-2009 16:44:52 (UTC+8) | - |
| dc.date.available | 14-Jan-2009 16:44:52 (UTC+8) | - |
| dc.date.issued (上傳時間) | 14-Jan-2009 16:44:52 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/24910 | - |
| dc.description.abstract (摘要) | In order to enhance the survivability of networks, network community must provide efficient recovery techniques to guarantee service continuity. In future generalized multi-protocol label switching (GMPLS)-based networks, several kinds of protection and restoration (P&R) mechanisms are provisioned. Finding physically disjoint label switched paths (LSPs) with shared risk link group (SRLG) is a crucial factor for all P&R mechanisms in GMPLS-based networks. The purpose of this paper is to propose an efficient disjoint-LSP selection scheme with SRLG (DLSSWS) in GMPLS-based networks. The proposed scheme can utilize SRLG information correctly and efficiently. Most important, it provides a common framework for conventional disjoint-path selection algorithms to find SRLG disjoint LSPs in GMPLS-based networks. In addition, the proposed scheme has lower cost than that of others (E. Oki, et al, 2002). | - |
| dc.format | application/ | en_US |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IP Operations and Management, 2004. Proceedings IEEE Workshop on Date of Conference: 11-13 Oct. 2004 Page(s): 160 - 164 | en_US |
| dc.title (題名) | A Novel Disjoint-LSP Selection Scheme with SRLG in GMPLS-Based Networks | en_US |
| dc.type (資料類型) | conference | en |
