File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Dynamic service-level-agreement aware shared-path protection in WDM mesh networks

TitleDynamic service-level-agreement aware shared-path protection in WDM mesh networks
Authors
KeywordsAvailability
Partial Link-Disjoint Protection
Restoration Time
Service Level Agreement (Sla)
Issue Date2007
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jnca
Citation
Journal of Network and Computer Applications, 2007, v. 30 n. 2, p. 429-444 How to Cite?
AbstractThe notion of service level agreements (SLA) has been proposed to capture qualitatively and quantitatively defined performance contracts between service providers and their customers. How to provision satisfiable connections for customers according to their SLA parameters to avoid penalty as well as minimizing cost is one of the main concerns for a service provider. Connection reliability and restoration time are two important SLA parameters for a customer, and should be carefully considered in survivable wavelength-division-multiplexing (WDM) networks. A sound scheme should guarantee customers' reliability and reduce restoration time while benefiting a service provider in resource efficiency. Under the SLA constraints and the assumption of single link failure, we first investigate a partial link-disjoint protection (PLDP) and analyze its availability and average restoration time. We then propose a dynamic constraint shared path protection (DCSP) algorithm in WDM mesh networks. Based on the basic ideas of the K-shortest path algorithm and PLDP, DCSP can provide differentiated services for customers according to their SLA parameters while being favorable for reducing average restoration time and optimizing resource utilization. Simulation results show that DCSP can efficiently guarantee the specific SLA requirements of customers with a slight increase in the blocking probability while still achieving spare resource sharing and restoration time optimizations. © 2006 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/90954
ISSN
2023 Impact Factor: 7.7
2023 SCImago Journal Rankings: 2.417
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorHe, Ren_HK
dc.contributor.authorLin, Ben_HK
dc.contributor.authorLi, Len_HK
dc.date.accessioned2010-09-17T10:10:52Z-
dc.date.available2010-09-17T10:10:52Z-
dc.date.issued2007en_HK
dc.identifier.citationJournal of Network and Computer Applications, 2007, v. 30 n. 2, p. 429-444en_HK
dc.identifier.issn1084-8045en_HK
dc.identifier.urihttp://hdl.handle.net/10722/90954-
dc.description.abstractThe notion of service level agreements (SLA) has been proposed to capture qualitatively and quantitatively defined performance contracts between service providers and their customers. How to provision satisfiable connections for customers according to their SLA parameters to avoid penalty as well as minimizing cost is one of the main concerns for a service provider. Connection reliability and restoration time are two important SLA parameters for a customer, and should be carefully considered in survivable wavelength-division-multiplexing (WDM) networks. A sound scheme should guarantee customers' reliability and reduce restoration time while benefiting a service provider in resource efficiency. Under the SLA constraints and the assumption of single link failure, we first investigate a partial link-disjoint protection (PLDP) and analyze its availability and average restoration time. We then propose a dynamic constraint shared path protection (DCSP) algorithm in WDM mesh networks. Based on the basic ideas of the K-shortest path algorithm and PLDP, DCSP can provide differentiated services for customers according to their SLA parameters while being favorable for reducing average restoration time and optimizing resource utilization. Simulation results show that DCSP can efficiently guarantee the specific SLA requirements of customers with a slight increase in the blocking probability while still achieving spare resource sharing and restoration time optimizations. © 2006 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jncaen_HK
dc.relation.ispartofJournal of Network and Computer Applicationsen_HK
dc.subjectAvailabilityen_HK
dc.subjectPartial Link-Disjoint Protectionen_HK
dc.subjectRestoration Timeen_HK
dc.subjectService Level Agreement (Sla)en_HK
dc.titleDynamic service-level-agreement aware shared-path protection in WDM mesh networksen_HK
dc.typeArticleen_HK
dc.identifier.emailLin, B:blin@hku.hken_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.jnca.2006.06.005en_HK
dc.identifier.scopuseid_2-s2.0-33846251798en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33846251798&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume30en_HK
dc.identifier.issue2en_HK
dc.identifier.spage429en_HK
dc.identifier.epage444en_HK
dc.identifier.eissn1095-8592-
dc.identifier.isiWOS:000245508600001-
dc.identifier.issnl1084-8045-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats