A threshold based on-line RWA algorithm with end-to-end reliability guarantees

Pandi, Z.; Tacca, Marco; Fumagalli, Andrea

doi:10.1109/ondm.2005.1427027

Cited by 11 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some results show that only highly connected communication networks can allow for short backup segments, as they can provide better availability and network performance level. These research studies , however, do not support dynamic traffic grooming with differentiated availability services. The study in investigates differentiated availability services in terms of blocking probability and backup resources required for dynamic traffic connections in WDM networks that do not support wavelength conversion .…”

Section: Related Workmentioning

confidence: 95%

“…The service availability is used as a metric to dynamically allocate routes to traffic connections . Pandi et al introduced a mechanism that sets a threshold for sharing backup resources among dynamic traffic connections. This threshold determines the upper bound of the service unavailability of connections arriving and already established over a network link .…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic connection provisioning with shared protection in IP/WDM networks

Alshaer

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYInternet protocol (IP) traffic connections arrive dynamically at wavelength‐division multiplexing (WDM) network edges with low data rates compared with the wavelength capacity, availability, and quality‐of‐service (QoS) constraints. This paper introduces a scheme to be integrated into the control and management plane of IP/WDM networks to satisfy the availability and QoS required for IP traffic connections bundled onto a single wavelength (lightpath) in WDM networks protected by shared‐backup path protection (SBPP). This scheme consists of two main operations: (i) routing multi‐granular connections and traffic grooming policies, and (ii) providing appropriate shared protection on the basis of subscribers’ service‐level agreements in terms of data rate, availability, and blocking probability. Using the Markov chain process, a probabilistic approach is developed to conceive connection blocking probability models, which can quantify the blocking probability and service utilization of M:N and 1:N SBPP schemes. The proposed scheme and developed mathematical models have been evaluated in terms of bandwidth blocking ratio, availability satisfaction rate, network utilization, and connection blocking probability performance metrics. The obtained research results in this paper provide network operators an operational setting parameter, which controls the allocation of working and backup resources to dynamic IP traffic connections on the basis of their priority and data rate while satisfying their requirements in terms of bandwidth and availability. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Section: Related Workmentioning

confidence: 95%

Section: Related Workmentioning

confidence: 99%

Dynamic connection provisioning with shared protection in IP/WDM networks

Alshaer

2013

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The service availability is used as a metric to dynamically allocate routes to traffic connections [12]. In [13] the authors introduced a mechanism which sets a threshold for sharing backup resources among dynamic traffic connections. This threshold determines the upper bound of the service unavailability of connections arriving and already established over a network link.…”

Section: Related Workmentioning

confidence: 99%

“…Recall that, in this paper, we assume that network nodes • h+£<M II(h, £)(Ah + Ae + hf.Lh + £f.Le) = II(h + 1, £)(h + 1) f.Lh +II(h, £ + 1)(£ + 1)f.Le + II(h -1, £)Ah + II(h, £ -I)Ae (11) II(h,£ + 1)((£ + 1)f.Le) = II(h,£)Ae (12) II(h+l,£)((h+l)f.Lh) =II(h,£)Ah (13) II(h,£ -1)Ae = II(h,£)£f.Le (14) II(h -1,£)Ah = II(h,£)f.Lh (IS) II(h, £)+II(h, £+I)+II(h+l, £)+II(h, £-I)+II(h-l, £) = 1.…”

Section: Probabilistic Protection Services Schemementioning

confidence: 99%

Probabilistic differentiated availability services in WDM networks protected by shared protection schemes

Alshaer

Elmirghani

2011

12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops

View full text Add to dashboard Cite

This paper derives and evaluates mathematical mod els for supporting differentiated availability services in WDM networks protected by shared backup path protection (SBPP) schemes. These models aim to enable network operators to allocate working and backup resources for dynamic IP traffic connections based on their priority and availability requirements.The resource allocation process is based on optimal trade-off between the amount of allocated backup resources and degree of service availability (quality-of-recovery (QoR)) required for traffic connections arriving dynamically. Using a probabilistic approach based on Markov chain process, mathematical models have been conceived to quantify service availability, disrup tion rate and blocking probability of M:N and l:N SBPP schemes in WDM networks. These models have been analytically and through simulation evaluated in terms of network service availability, disruption rate, network utilization and blocking probability.

show abstract

“…Reference [5] proposes a strategy for dynamic traffic in a single fiber link failure scenario. Reference [6] limits the sharing of backup capacity introducing a link-based threshold which results in a conservative upper bound on the unavailability of connections in a dynamic traffic scenario. Reference [7] proposes a doublefault shared path protection scheme with constrained connection downtime for static traffic which also uses conservative unavailability estimates.…”

Section: Introductionmentioning

confidence: 99%

Dynamic provisioning of shared-backup path protected connections with guaranteed availability requirements

Mello

Pelegrini

Ribeiro

et al. 2005

2nd International Conference on Broadband Networks, 2005.

View full text Add to dashboard Cite

In optical networks, shared-backup path protection (SBPP) can optimize network resources utilization in scenarios where connection resilience requirements are not achieved without protection, but are exceeded with dedicated-path protection (DPP). However, savings in capacity allowed by backup capacity sharing are achieved at the cost of connection availability degradation. This paper presents a strategy for provisioning connections with guaranteed availability in a dynamic traffic scenario that attempts to minimize the allocation of spare capacity. Connections can be unprotected or protected by SBPP -which in some cases degenerate to DPP -depending on the connection availability requirements. This provisioning strategy employs the previously published matrix-based approach for connection unavailability estimation in SBPP protected networks which offers accurate results for networks of national size. We investigate the performance, in terms of blocking and resource sharing, of three availability classes (availability of 0.999, 0.9999 and 0.99999) that coexist in two representative network topologies without wavelength conversion. The results indicate that SBPP is a viable option for networks of national dimensions, but the backup sharing of high availability connections is strongly limited in networks of continental dimensions.

show abstract

A threshold based on-line RWA algorithm with end-to-end reliability guarantees

Cited by 11 publications

References 7 publications

Dynamic connection provisioning with shared protection in IP/WDM networks

Dynamic connection provisioning with shared protection in IP/WDM networks

Probabilistic differentiated availability services in WDM networks protected by shared protection schemes

Dynamic provisioning of shared-backup path protected connections with guaranteed availability requirements

Contact Info

Product

Resources

About