File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Dynamic shared path protection algorithm in WDM mesh networks under service level agreement constraints

TitleDynamic shared path protection algorithm in WDM mesh networks under service level agreement constraints
Authors
KeywordsAlgorithms
Constraint Theory
Probability
Resource Allocation
Telecommunication Services
Issue Date2005
Citation
Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 2005, v. 2005, p. 205-209 How to Cite?
AbstractConnection reliability is one important service level agreement (SLA) parameter for a customer and should be carefully considered in survivable WDM networks. A sound scheme should guarantee customers' reliability and simultaneously benefit a service provider in resource efficiency. Under the SLA constraints and the assumption of shared risk link group (SRLG) failures, a novel dynamic differentiated shared path-protection algorithm (DDSP) in WDM mesh networks is proposed. Based on the basic ideas of the K-shortest path algorithm and partial SRLG-disjoint protection, DDSP can provide differentiated services for customers according to their SLA parameters while optimizing resource utilization. Simulation results show that DDSP not only can efficiently guarantee the specific SLA requirements of customers, but also can achieve significant performance gain and lead to remarkable reduction in blocking probability. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/91170
References

 

DC FieldValueLanguage
dc.contributor.authorHe, Ren_HK
dc.contributor.authorLin, Ben_HK
dc.contributor.authorLi, Len_HK
dc.contributor.authorGu, Cen_HK
dc.date.accessioned2010-09-17T10:14:05Z-
dc.date.available2010-09-17T10:14:05Z-
dc.date.issued2005en_HK
dc.identifier.citationParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 2005, v. 2005, p. 205-209en_HK
dc.identifier.urihttp://hdl.handle.net/10722/91170-
dc.description.abstractConnection reliability is one important service level agreement (SLA) parameter for a customer and should be carefully considered in survivable WDM networks. A sound scheme should guarantee customers' reliability and simultaneously benefit a service provider in resource efficiency. Under the SLA constraints and the assumption of shared risk link group (SRLG) failures, a novel dynamic differentiated shared path-protection algorithm (DDSP) in WDM mesh networks is proposed. Based on the basic ideas of the K-shortest path algorithm and partial SRLG-disjoint protection, DDSP can provide differentiated services for customers according to their SLA parameters while optimizing resource utilization. Simulation results show that DDSP not only can efficiently guarantee the specific SLA requirements of customers, but also can achieve significant performance gain and lead to remarkable reduction in blocking probability. © 2005 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedingsen_HK
dc.subjectAlgorithmsen_HK
dc.subjectConstraint Theoryen_HK
dc.subjectProbabilityen_HK
dc.subjectResource Allocationen_HK
dc.subjectTelecommunication Servicesen_HK
dc.titleDynamic shared path protection algorithm in WDM mesh networks under service level agreement constraintsen_HK
dc.typeArticleen_HK
dc.identifier.emailLin, B:blin@hku.hken_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-33745134708en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33745134708&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2005en_HK
dc.identifier.spage205en_HK
dc.identifier.epage209en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats