Skip to main content
Log in

An enhanced backward recursive PCE-based computation scheme for end-to-end disjoint paths in multi-domain networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

To efficiently provide two disjoint end-to-end paths for working and protecting in multi-domain networks is challenging the network industry. The Backward Recursive PCE-based parallel approach (PA) for disjoint paths can achieve best computation performance at high cost of computation complexity and communication overhead. In this paper, we propose an enhanced PA (EPA), based on a no-differentiated in-BNs pair strategy to decrease the computation complex and communication overhead. The simulation results show that the EPA scheme can effectively reduce the computation and communication overhead.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chamania M., Jukan A.: A survey of inter-domain peering and provisioning solutions for the next generation optical networks. IEEE Commun. Surv. Tutor. 11(1), 33–51 (2009)

    Article  Google Scholar 

  2. Yannuzzi M., Bruin X.M., Sanchez S., Pascual J.D.: On the challenges of establishing disjoint QoS IP/MPLS paths across multiple domains. IEEE Commun. Mag. 44(12), 138–146 (2006)

    Article  Google Scholar 

  3. Vasseur, J.P., Zhang, R., Bitar, N., Le Roux, J.L.: A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths, IETF RFC 5441 (2009)

  4. Vasseur, J.P., Roux, J.L.: Path Computation Element (PCE) Communication Protocol (PCEP), IETF RFC 5440(2009)

  5. Takeda, T., Oki, E., Shiomoto, K.: Diverse Path Setup Schemes in Multi-Domain Optical Networks, ’BROADNETS’2008, pp. 523–530. London (2008)

  6. Suurballe J.W., Tarjan R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–336 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  7. Nishioka, I., King, D.: The Use of SVEC (Synchronization VECtor) List for Synchronized Dependent Path Computations, IETF RFC 6007 (2010)

  8. Vasseur, J.P., Roux, J.L.: Path Computation Element (PCE) Communication Protocol (PCEP), IETF RFC 5440 (2009)

  9. Ricciato F., Monaco U., Ali D.: Distributed schemes for diverse path computation in multi-domain MPLS networks. IEEE Commun. Mag. 43(6), 138–146 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yunfeng Peng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Z., Peng, Y., Wang, Z. et al. An enhanced backward recursive PCE-based computation scheme for end-to-end disjoint paths in multi-domain networks. Photon Netw Commun 24, 22–28 (2012). https://doi.org/10.1007/s11107-011-0363-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-011-0363-6

Keywords

Navigation