Priority-aware optical shared protection: An offline evaluation study

Fawaz, Wissam; Sawah, Timothy; Abou-Rjeily, Chadi

doi:10.1016/j.comcom.2009.06.010

Cited by 12 publications

(14 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 shows that the proposed algorithm has better blocking rate than the conventional scheme for the offered loads bigger than 25 Erlangs. It also shows that the algorithm does not degrade BR performance significantly and has almost the same BR as the priority-aware algorithm presented in [14]. As noticed in Fig.…”

Section: B Performance Analysissupporting

confidence: 63%

“…As noticed in Fig. 5, in average 60% of high priority connections, Gold class, which are impossible to accommodate by the algorithm presented in [14] are pre-provisioned and are not blocked anymore. This proves that the proposed pre-provisioning algorithm increases the level of the priority awareness in comparison to other algorithms.…”

Section: B Performance Analysismentioning

confidence: 97%

“…In fact, Gold connection requests are more preserved in the SPA algorithm than any other priority-aware algorithms. Although the SPA algorithm has no significant effect on the lower priority traffic flows, Silver connection requests, in terms of ASR compared to the algorithm proposed in [14], the SPA still has better performance than the SSPP. Fig.…”

Section: B Performance Analysismentioning

confidence: 98%

“…The results show considerable improvements on the connections with higher class of traffic. Unlike the static traffic type [14], in dynamic traffic pattern, lightpaths are requested dynamically with randomly generated availability requests. In this case, the algorithm has no knowledge about the coming request.…”

Section: B Performance Analysismentioning

confidence: 99%

“…The simulation was performed to compare the performance of no protection (NP) scheme [12], standard shared mesh path protection (SSPP) algorithm [12] and [13], conventional shared path protection,the priority-aware algorithm (PAA) algorithm presented in [14], and the SPA algorithm discussed in [7].The CSPP algorithmhas been considered in this paper as a generalized case of the SSPP scheme in which link availabilities are involved in the path calculation process. The results show considerable improvements on the connections with higher class of traffic.…”

Section: B Performance Analysismentioning

confidence: 99%

See 4 more Smart Citations

Dynamic SLA Negotiation Infrastructure in Protected Shared Mesh Optical Networks

Nafarieh¹,

Robertson²,

Phillips³

et al. 2013

IJCTE

View full text Add to dashboard Cite

Abstract-This paper presents a dynamic service level agreement negotiation mechanism considering intra/inter-domain communications over shared mesh optical networks. The intra-domain negotiation mechanism propagates the link-availability as service level agreement parameters while inter-domain mechanism advertises a proposed service level agreement based traffic engineering constraint called maximum path availability. The paper shows how service level agreement negotiation protocols along with the proposedtraffic engineering metric improvethe performance of priority-aware algorithms.Index Terms-Priority-aware algorithm, service level agreement, dynamic service level agreement negotiation, maximum path availability algorithm, OSPF-TE extensions, BGP-TE extensions

show abstract

Section: B Performance Analysissupporting

confidence: 63%

Section: B Performance Analysismentioning

confidence: 97%

Section: B Performance Analysismentioning

confidence: 98%

Section: B Performance Analysismentioning

confidence: 99%

Section: B Performance Analysismentioning

confidence: 99%

See 3 more Smart Citations

Dynamic SLA Negotiation Infrastructure in Protected Shared Mesh Optical Networks

Nafarieh¹,

Robertson²,

Phillips³

et al. 2013

IJCTE

View full text Add to dashboard Cite

show abstract

Availability‐driven optimal design of shared path protection in WDM networks

2016

View full text Add to dashboard Cite

2016. Availability-driven optimal design of shared path protection in WDM networks. Networks, 68(3), pp. 224-237. ISSN 0028-3045 [Article]Abstract Availability, defined as the fraction of time a network service is operative, is a key network service parameter.Dedicated protection increases availability but also the cost. Shared protection instead decreases the cost, but also the availability.In this paper, we formulate and solve an integer linear programming (ILP) model for the problem of minimizing the backup resources required by a shared-protected static optical network whilst guaranteeing an availability target per connection. The main research challenge is dealing with the non-linear expression for the availability constraint.Taking the working/backup routes and the availability requirements as input data, the ILP model identifies the set of connections sharing backup resources in any given network link.We also propose a greedy heuristic to solve large instances in much shorter time than the ILP model with low levels of relative error (2.49% average error in the instances studied) and modify the ILP model to evaluate the impact of wavelength conversion.Results show that considering availability requirements can lead up to 56.4% higher backup resource requirements than not considering them at all, highlighting the importance of availability requirements in budget estimation.

show abstract