Utilization of temporary reservation of path computed resources for multi-domain path computation element protocols in WDM networks

Alvarez, Diego F.; López, Vı́ctor; Anamuro, Jose Luis; Vergara, Jorge E. López de; Dios, Óscar González de; Aracil, Javier

doi:10.1109/nof.2011.6126666

Cited by 8 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work [33] performs a comparison of per-domain, BRPC and H-PCE in terms of blocking probability and a validation of temporary reservation mechanisms for reducing resource contentions similar to the one proposed in [32]. The paper concludes that H-PCE has better performance in terms of blocking probability and its scalability is better than the BRPC mechanism.…”

Section: Hierarchical Pcementioning

confidence: 96%

“…A similar approach is also considered in work [33], in which the PCE, upon path computation, performs temporary pre-reservation of the computed resources within the TED by means of timers, thus eliminating contentions. The value of the timer is required to be selected properly, in order to not affect the blocking probability due to resources unavailability, especially in highly dynamic scenarios.…”

Section: Pce Traffic Engineering Database Updatementioning

confidence: 99%

See 1 more Smart Citation

A Survey on the Path Computation Element (PCE) Architecture

Paolucci

Cugini

Giorgetti

et al. 2013

IEEE Commun. Surv. Tutorials

113

View full text Add to dashboard Cite

Quality of Service-enabled applications and services rely on Traffic Engineering-based (TE) Label Switched Paths (LSP) established in core networks and controlled by the GMPLS control plane. Path computation process is crucial to achieve the desired TE objective. Its actual effectiveness depends on a number of factors. Mechanisms utilized to update topology and TE information, as well as the latency between path computation and resource reservation, which is typically distributed, may affect path computation efficiency. Moreover, TE visibility is limited in many network scenarios, such as multi-layer, multidomain and multi-carrier networks, and it may negatively impact resource utilization. The Internet Engineering Task Force (IETF) has promoted the Path Computation Element (PCE) architecture, proposing a dedicated network entity devoted to path computation process. The PCE represents a flexible instrument to overcome visibility and distributed provisioning inefficiencies. Communications between path computation clients (PCC) and PCEs, realized through the PCE Protocol (PCEP), also enable inter-PCE communications offering an attractive way to perform TE-based path computation among cooperating PCEs in multi-layer/domain scenarios, while preserving scalability and confidentiality. This survey presents the state-of-the-art on the PCE architecture for GMPLS-controlled networks carried out by research and standardization community. In this work, packet (i.e., MPLS-TE and MPLS-TP) and wavelength/spectrum (i.e., WSON and SSON) switching capabilities are the considered technological platforms, in which the PCE is shown to achieve a number of evident benefits.

show abstract

Section: Hierarchical Pcementioning

confidence: 96%

Section: Pce Traffic Engineering Database Updatementioning

confidence: 99%

A Survey on the Path Computation Element (PCE) Architecture

Paolucci

Cugini

Giorgetti

et al. 2013

IEEE Commun. Surv. Tutorials

113

View full text Add to dashboard Cite

show abstract

“…Since all backup paths are computed at the PCE considering the same TED, the applied routing and spectrum assignment scheme can be designed so that spectrum contentions are almost avoided [35,36]. Conversely, nodeconfiguration contentions are still likely in this scenario because the signaling sessions required for establishing the several backup paths are independently triggered for each disrupted lightpath.…”

Section: B Gmpls/pce Restorationmentioning

confidence: 99%

Dynamic Restoration With GMPLS and SDN Control Plane in Elastic Optical Networks [Invited]

Giorgetti¹,

Paolucci²,

Cugini

et al. 2014

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Optical transport networks typically deploy dynamic restoration mechanisms in order to automatically recover optical connections disrupted by network failures. Elastic optical networks (EONs), currently emerging as the next-generation technology to be adopted in optical transport, introduce new challenges for traditional generic multiprotocol label-switching (GMPLS)-based restoration that may seriously impact the achievable recovery time. At the same time, the software-defined networking (SDN) framework is emerging as an alternative control plane. It is therefore important to investigate possible benefits provided by SDN in the implementation of restoration mechanisms for EONs. This paper proposes a dynamic restoration scheme for EONs based on the SDN framework. The proposed scheme contemporarily exploits centralized path computation and node configuration to avoid contentions during the recovery procedure with the final aim of minimizing the recovery time. The performance of the proposed scheme is evaluated by means of simulations in terms of recovery time and restoration blocking probability and compared against three reference schemes based on GMPLS and SDN.

show abstract

“…However, the root cause of the problem is in the path computation, and there it is where the use of a centralized PCE can help. Authors in [13] studied a mechanism to perform temporal reservations in the PCE's TED after a path has been computed waiting for arrival of the corresponding OSPF-TE LSA update.…”

Section: A Related Workmentioning

confidence: 99%