File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Dynamic shared path protection algorithm in WDM mesh networks under service level agreement constraints
Title | Dynamic shared path protection algorithm in WDM mesh networks under service level agreement constraints |
---|---|
Authors | |
Keywords | Algorithms Constraint Theory Probability Resource Allocation Telecommunication Services |
Issue Date | 2005 |
Citation | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 2005, v. 2005, p. 205-209 How to Cite? |
Abstract | Connection 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 Identifier | http://hdl.handle.net/10722/91170 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | He, R | en_HK |
dc.contributor.author | Lin, B | en_HK |
dc.contributor.author | Li, L | en_HK |
dc.contributor.author | Gu, C | en_HK |
dc.date.accessioned | 2010-09-17T10:14:05Z | - |
dc.date.available | 2010-09-17T10:14:05Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, 2005, v. 2005, p. 205-209 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/91170 | - |
dc.description.abstract | Connection 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.language | eng | en_HK |
dc.relation.ispartof | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings | en_HK |
dc.subject | Algorithms | en_HK |
dc.subject | Constraint Theory | en_HK |
dc.subject | Probability | en_HK |
dc.subject | Resource Allocation | en_HK |
dc.subject | Telecommunication Services | en_HK |
dc.title | Dynamic shared path protection algorithm in WDM mesh networks under service level agreement constraints | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Lin, B:blin@hku.hk | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-33745134708 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33745134708&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 2005 | en_HK |
dc.identifier.spage | 205 | en_HK |
dc.identifier.epage | 209 | en_HK |