File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/JLT.2005.856227
- Scopus: eid_2-s2.0-30344488126
- WOS: WOS:000234116800026
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A novel two-step approach to restorable dynamic QoS routing
Title | A novel two-step approach to restorable dynamic QoS routing |
---|---|
Authors | |
Keywords | MPLS Restorable dynamic routing Two-step routing |
Issue Date | 2005 |
Publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=50 |
Citation | Journal Of Lightwave Technology, 2005, v. 23 n. 11, p. 3663-3670 How to Cite? |
Abstract | Aiming at minimizing the combined bandwidth cost of a pair disjoint active and backup paths, a popular approach to designing restorable dynamic quality of service (QoS) routing schemes is based on the integer linear programming (ILP) formulation. Owing to the very different natures of active and backup paths, we found this approach problematic. In this paper, we propose an alternative approach, called two-step restorable QoS routing. In the first step, an active path is found using the widest shortest path (WSP) routing. In the second step, the corresponding backup path is determined using one of the three variants of shortest widest path (SWP) routing: basic SWP, approximate SWP or composite SWP. Combining the two steps, three novel two-step routing algorithms, denoted by SBW, SAW, and SCW, are obtained. Comparing with the best known algorithms, we show that our two-step routing approach yields noticeably lower call blocking probability, shorter active-path length, and additional flexibility of adjusting backup-path length (depending on the SWP variant adopted). Besides, our two-step routing approach gives a much shorter running time than the ILP approach, which makes it more suitable for dynamic routing. © 2005 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/44826 |
ISSN | 2023 Impact Factor: 4.1 2023 SCImago Journal Rankings: 1.370 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, J | en_HK |
dc.contributor.author | Yeung, KL | en_HK |
dc.date.accessioned | 2007-10-30T06:11:04Z | - |
dc.date.available | 2007-10-30T06:11:04Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Journal Of Lightwave Technology, 2005, v. 23 n. 11, p. 3663-3670 | en_HK |
dc.identifier.issn | 0733-8724 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/44826 | - |
dc.description.abstract | Aiming at minimizing the combined bandwidth cost of a pair disjoint active and backup paths, a popular approach to designing restorable dynamic quality of service (QoS) routing schemes is based on the integer linear programming (ILP) formulation. Owing to the very different natures of active and backup paths, we found this approach problematic. In this paper, we propose an alternative approach, called two-step restorable QoS routing. In the first step, an active path is found using the widest shortest path (WSP) routing. In the second step, the corresponding backup path is determined using one of the three variants of shortest widest path (SWP) routing: basic SWP, approximate SWP or composite SWP. Combining the two steps, three novel two-step routing algorithms, denoted by SBW, SAW, and SCW, are obtained. Comparing with the best known algorithms, we show that our two-step routing approach yields noticeably lower call blocking probability, shorter active-path length, and additional flexibility of adjusting backup-path length (depending on the SWP variant adopted). Besides, our two-step routing approach gives a much shorter running time than the ILP approach, which makes it more suitable for dynamic routing. © 2005 IEEE. | en_HK |
dc.format.extent | 218148 bytes | - |
dc.format.extent | 1938 bytes | - |
dc.format.extent | 2117 bytes | - |
dc.format.extent | 8014 bytes | - |
dc.format.extent | 2671 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | I E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=50 | en_HK |
dc.relation.ispartof | Journal of Lightwave Technology | en_HK |
dc.rights | ©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | MPLS | en_HK |
dc.subject | Restorable dynamic routing | en_HK |
dc.subject | Two-step routing | en_HK |
dc.title | A novel two-step approach to restorable dynamic QoS routing | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0733-8724&volume=23&issue=11&spage=3663&epage=3670&date=2005&atitle=A+novel+two-step+approach+to+restorable+dynamic+QoS+routing | en_HK |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_HK |
dc.identifier.authority | Yeung, KL=rp00204 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/JLT.2005.856227 | en_HK |
dc.identifier.scopus | eid_2-s2.0-30344488126 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-30344488126&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 23 | en_HK |
dc.identifier.issue | 11 | en_HK |
dc.identifier.spage | 3663 | en_HK |
dc.identifier.epage | 3670 | en_HK |
dc.identifier.isi | WOS:000234116800026 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Li, J=8699153700 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.issnl | 0733-8724 | - |