OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and O. Gerstel
  • Vol. 4, Iss. 6 — Jun. 1, 2012
  • pp: 457–467

Survivable Path Computation in PCE-Based Multi-domain Networks

Qiong Zhang, Mohammad M. Hasan, Xi Wang, Paparao Palacharla, and Motoyoshi Sekiya  »View Author Affiliations

Journal of Optical Communications and Networking, Vol. 4, Issue 6, pp. 457-467 (2012)

View Full Text Article

Enhanced HTML    Acrobat PDF (682 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



We propose an optimal scheme for finding end-to-end shortest disjoint paths with a given sequence of domains in path computation element-based multi-domain networks. We compute the shortest path over multiple domains in the forward direction and compute the disjoint path in the backward direction. The scheme has lower time and message complexity compared to contemporary schemes for finding optimal survivable paths across domains. We prove the optimality of the proposed scheme. To further simplify the implementations in practical scenarios, we also provide heuristic algorithms. Simulation results exhibit superior performance of the proposed optimal and heuristic algorithms compared to existing approaches.

© 2012 OSA

OCIS Codes
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms
(060.4257) Fiber optics and optical communications : Networks, network survivability

ToC Category:
Research Papers

Original Manuscript: November 22, 2011
Revised Manuscript: April 19, 2012
Manuscript Accepted: April 19, 2012
Published: May 14, 2012

Qiong Zhang, Mohammad M. Hasan, Xi Wang, Paparao Palacharla, and Motoyoshi Sekiya, "Survivable Path Computation in PCE-Based Multi-domain Networks," J. Opt. Commun. Netw. 4, 457-467 (2012)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. K. Liu, K. Nahrstedt, and S. Chen, “Routing with topology abstraction in delay-bandwidth sensitive networks,” IEEE/ACM Trans. Netw., vol. 12, no. 1, pp. 17–29, Feb.2004. [CrossRef]
  2. F. Hao and E. Zegura, “On scalable QoS routing: Performance evaluation of topology aggregation,” in Proc. of INFOCOM, Tel-Aviv, Israel, Mar. 2000, pp. 147–156.
  3. N. Ghani, Q. Liu, D. Benhaddou, N. S. V. Rao, and T. Lehman, “Control plane design in multi-domain multilayer optical networks,” IEEE Commun. Mag., vol. 46, no. 6, pp. 78–87, June2008.
  4. R. Douville, J. L. Le Roux, J. L. Rougier, and S. Secci, “A service plane over the PCE architecture for automatic multi-domain connection-oriented services,” IEEE Commun. Mag., vol. 46, no. 6, pp. 94–102, June2008.
  5. A. Farrel, J. P. Vasseur, and J. Ash, “A path computation element (PCE)-based architecture,” IETF RFC 4655, Aug.2006.
  6. K. Kumaki, T. Murai, T. Yamagata, and C. Sasaki, “BGP protocol extensions for path computation element (PCE) discovery in a BGP/MPLS IP-VPN,” IETF Internet Draft, draft-kumaki-pce-bgp-disco-attribute-06, Sept.2010.
  7. F. Cugini, F. Paolucci, L. Valcarenghi, P. Castoldi, and A. Welin, “PCE communication protocol for resource advertisement in multi-domain BGP-based networks,” in Proc. of OFC, San Diego, CA, Mar. 2009.
  8. D. King and A. Farrel, “The application of the path computation element architecture to determination of a sequence of domains in MPLS & GMPLS,” IETF Internet Draft, draft-king-pce-hierarchy-fwk-05, Sept.2010.
  9. M. Chamania, X. Chen, A. Jukan, F. Rambach, and M. Hoffman, “An adaptive inter-domain PCE framework to improve resource utilization and reduce inter-domain signaling,” Opt. Switching Netw., vol. 6, no. 4, pp. 259–267, Dec.2009. [CrossRef]
  10. J. P. Vasseur, R. Zhang, N. Bitar, and J. L. Le Roux, “A backward-recursive PCE-based computation (BRPC) procedure to compute shortest constrained inter-domain traffic engineering label switched paths,” IETF RFC 5441, Apr.2009.
  11. A. Sprintson, M. Yannuzzi, A. Orda, and X. Masip-Bruin, “Reliable routing with QoS guarantees for multi-domain IP/MPLS networks,” in Proc. of IEEE INFOCOM, Anchorage, Alaska, May 2007, pp. 1820–1828.
  12. I. Nishioka and D. King, “The use of synchronization VECtor (SVEC) list for synchronized dependent path computations,” IETF RFC 6007, Sept.2010.
  13. Y. Lee, G. Bernstein, and W. Imajuku, “Framework for GMPLS and path computation element control of wavelength switched optical networks,” IETF RFC 6163, Apr.2011.
  14. A. A. M. Saleh, “Transparent optical networking in backbone networks,” in Proc. of OFC, Baltimore, MD, Mar. 2000.
  15. J. P. Vasseur and J. L. Le Roux, “Path computation element (PCE) communication protocol (PCEP),” IETF RFC 5440, Mar.2009.
  16. J. Suurballe and R. Tarjan, “A quick method for finding shortest pairs of disjoint paths,” Networks, vol. 14, pp. 325–336, 1984. [CrossRef]
  17. R. Bhandari, Survivable Networks: Algorithms for Diverse Routing, 1st ed.Springer, 1999.
  18. S. Dasgupta, J. C. de Oliveira, and J. P. Vasseur, “Path-computation-element-based architecture for inter-domain MPLS/GMPLS traffic engineering: Overview and performance,” IEEE Netw., vol. 21, no. 4, pp. 38–45, July–Aug.2007. [CrossRef]
  19. H. Chen, “A forward-search P2P TE LSP inter-domain path computation,” IETF Internet Draft, draft-chen-pce-forward-search-p2p-path-computation-02, Oct.2011.
  20. Q. Zhang, M. M. Hasan, X. Wang, P. Palacharla, and M. Sekiya, “Efficient PCE-based survivable path computation in multi-domain networks,” in Proc. of IEEE INFOCOM High Speed Networks (HSN), Shanghai, China, Apr. 2011.
  21. R. Bradford, J. P. Vasseur, and A. Farrel, “Preserving topology confidentiality in inter-domain path computation using a path-key-based mechanism,” IETF RFC 5520, Apr.2009.
  22. P. Erdös and A. Rényi, “On random graphs. I,” Publ. Math., vol. 6, pp. 290–297, 1959.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited