File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A novel two-step approach to restorable dynamic QoS routing

TitleA novel two-step approach to restorable dynamic QoS routing
Authors
KeywordsMPLS
Restorable dynamic routing
Two-step routing
Issue Date2005
PublisherI 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?
AbstractAiming 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 Identifierhttp://hdl.handle.net/10722/44826
ISSN
2015 Impact Factor: 2.567
2015 SCImago Journal Rankings: 2.006
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLi, Jen_HK
dc.contributor.authorYeung, KLen_HK
dc.date.accessioned2007-10-30T06:11:04Z-
dc.date.available2007-10-30T06:11:04Z-
dc.date.issued2005en_HK
dc.identifier.citationJournal Of Lightwave Technology, 2005, v. 23 n. 11, p. 3663-3670en_HK
dc.identifier.issn0733-8724en_HK
dc.identifier.urihttp://hdl.handle.net/10722/44826-
dc.description.abstractAiming 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.extent218148 bytes-
dc.format.extent1938 bytes-
dc.format.extent2117 bytes-
dc.format.extent8014 bytes-
dc.format.extent2671 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=50en_HK
dc.relation.ispartofJournal of Lightwave Technologyen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
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.en_HK
dc.subjectMPLSen_HK
dc.subjectRestorable dynamic routingen_HK
dc.subjectTwo-step routingen_HK
dc.titleA novel two-step approach to restorable dynamic QoS routingen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://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+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.doi10.1109/JLT.2005.856227en_HK
dc.identifier.scopuseid_2-s2.0-30344488126en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-30344488126&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume23en_HK
dc.identifier.issue11en_HK
dc.identifier.spage3663en_HK
dc.identifier.epage3670en_HK
dc.identifier.isiWOS:000234116800026-
dc.publisher.placeUnited Statesen_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