File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A two-step approach to restorable dynamic QoS routing

TitleA two-step approach to restorable dynamic QoS routing
Authors
KeywordsCommunications
Issue Date2004
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2004, v. 2, p. 1166-1170 How to Cite?
AbstractAiming 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 Identifierhttp://hdl.handle.net/10722/46455
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorLi, Jen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2007-10-30T06:50:14Z-
dc.date.available2007-10-30T06:50:14Z-
dc.date.issued2004en_HK
dc.identifier.citationIeee International Conference On Communications, 2004, v. 2, p. 1166-1170en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46455-
dc.description.abstractAiming 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.extent465102 bytes-
dc.format.extent1768 bytes-
dc.format.extent8014 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
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.en_HK
dc.subjectCommunicationsen_HK
dc.titleA two-step approach to restorable dynamic QoS routingen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=2&spage=1166&epage=1170&date=2004&atitle=A+two-step+approach+to+restorable+dynamic+QoS+routingen_HK
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_HK
dc.identifier.authorityYeung, KL=rp00204en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.scopuseid_2-s2.0-4143074925en_HK
dc.identifier.hkuros90908-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-4143074925&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2en_HK
dc.identifier.spage1166en_HK
dc.identifier.epage1170en_HK
dc.identifier.scopusauthoridLi, J=8699153700en_HK
dc.identifier.scopusauthoridYeung, KL=7202424908en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats