File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2004.1312683
- Scopus: eid_2-s2.0-4143074925
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A two-step approach to restorable dynamic QoS routing
Title | A two-step approach to restorable dynamic QoS routing |
---|---|
Authors | |
Keywords | Communications |
Issue Date | 2004 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104 |
Citation | 2004 IEEE International Conference on Communications, Paris, France, 20-24 June 2004. In 2004 IEEE International Conference on Communications, 2004, v. 2, p. 1166-1170 How to Cite? |
Abstract | Aiming at minimizing the combined bandwidth cost of a pair of disjoint active and backup paths, a popular approach to designing Restorable Dynamic QoS Routing schemes is based on 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 a simple alternative approach, called two-step routing. In the first step, 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 and Composite-SWP. Combining both steps, three novel restorable routing algorithms, SBW, SAW and SCW, are obtained. Comparing with the existing best-known algorithms, we show that our two-step routing approach yields noticeably lower call blocking probability, shorter active path length, and adjustable 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 attractive for dynamic routing. |
Persistent Identifier | http://hdl.handle.net/10722/46455 |
ISSN | 2020 SCImago Journal Rankings: 0.451 |
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:50:14Z | - |
dc.date.available | 2007-10-30T06:50:14Z | - |
dc.date.issued | 2004 | en_HK |
dc.identifier.citation | 2004 IEEE International Conference on Communications, Paris, France, 20-24 June 2004. In 2004 IEEE International Conference on Communications, 2004, v. 2, p. 1166-1170 | en_HK |
dc.identifier.issn | 0536-1486 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/46455 | - |
dc.description.abstract | Aiming at minimizing the combined bandwidth cost of a pair of disjoint active and backup paths, a popular approach to designing Restorable Dynamic QoS Routing schemes is based on 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 a simple alternative approach, called two-step routing. In the first step, 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 and Composite-SWP. Combining both steps, three novel restorable routing algorithms, SBW, SAW and SCW, are obtained. Comparing with the existing best-known algorithms, we show that our two-step routing approach yields noticeably lower call blocking probability, shorter active path length, and adjustable 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 attractive for dynamic routing. | en_HK |
dc.format.extent | 465102 bytes | - |
dc.format.extent | 1768 bytes | - |
dc.format.extent | 8014 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104 | en_HK |
dc.relation.ispartof | 2004 IEEE International Conference on Communications | en_HK |
dc.rights | ©2004 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 | Communications | en_HK |
dc.title | A two-step approach to restorable dynamic QoS routing | en_HK |
dc.type | Conference_Paper | 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/ICC.2004.1312683 | - |
dc.identifier.scopus | eid_2-s2.0-4143074925 | en_HK |
dc.identifier.hkuros | 90908 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-4143074925&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 2 | en_HK |
dc.identifier.spage | 1166 | en_HK |
dc.identifier.epage | 1170 | en_HK |
dc.identifier.scopusauthorid | Li, J=8699153700 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.issnl | 0536-1486 | - |