A. Farrel, J. P. Vasseur, and J. Ash, “A path computation element (PCE)-based architecture,” IETF RFC 4655, Aug.2006.

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.

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.

R. Bhandari, Survivable Networks: Algorithms for Diverse Routing, 1st ed.Springer, 1999.

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.

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.

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.

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]

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.

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]

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]

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.

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]

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]

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.

P. Erdös and A. Rényi, “On random graphs. I,” Publ. Math., vol. 6, pp. 290–297, 1959.

A. Farrel, J. P. Vasseur, and J. Ash, “A path computation element (PCE)-based architecture,” IETF RFC 4655, Aug.2006.

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.

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.

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.

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.

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.

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]

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.

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]

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.

I. Nishioka and D. King, “The use of synchronization VECtor (SVEC) list for synchronized dependent path computations,” IETF RFC 6007, Sept.2010.

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.

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.

J. P. Vasseur and J. L. Le Roux, “Path computation element (PCE) communication protocol (PCEP),” IETF RFC 5440, Mar.2009.

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.

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.

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.

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]

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.

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.

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.

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]

I. Nishioka and D. King, “The use of synchronization VECtor (SVEC) list for synchronized dependent path computations,” IETF RFC 6007, Sept.2010.

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.

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.

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.

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]

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.

P. Erdös and A. Rényi, “On random graphs. I,” Publ. Math., vol. 6, pp. 290–297, 1959.

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.

A. A. M. Saleh, “Transparent optical networking in backbone networks,” in Proc. of OFC, Baltimore, MD, Mar. 2000.

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.

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.

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.

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.

J. Suurballe and R. Tarjan, “A quick method for finding shortest pairs of disjoint paths,” Networks, vol. 14, pp. 325–336, 1984.

[CrossRef]

J. Suurballe and R. Tarjan, “A quick method for finding shortest pairs of disjoint paths,” Networks, vol. 14, pp. 325–336, 1984.

[CrossRef]

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.

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]

A. Farrel, J. P. Vasseur, and J. Ash, “A path computation element (PCE)-based architecture,” IETF RFC 4655, Aug.2006.

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.

J. P. Vasseur and J. L. Le Roux, “Path computation element (PCE) communication protocol (PCEP),” IETF RFC 5440, Mar.2009.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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]

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]

J. Suurballe and R. Tarjan, “A quick method for finding shortest pairs of disjoint paths,” Networks, vol. 14, pp. 325–336, 1984.

[CrossRef]

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]

P. Erdös and A. Rényi, “On random graphs. I,” Publ. Math., vol. 6, pp. 290–297, 1959.

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.

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.

I. Nishioka and D. King, “The use of synchronization VECtor (SVEC) list for synchronized dependent path computations,” IETF RFC 6007, Sept.2010.

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.

A. A. M. Saleh, “Transparent optical networking in backbone networks,” in Proc. of OFC, Baltimore, MD, Mar. 2000.

J. P. Vasseur and J. L. Le Roux, “Path computation element (PCE) communication protocol (PCEP),” IETF RFC 5440, Mar.2009.

A. Farrel, J. P. Vasseur, and J. Ash, “A path computation element (PCE)-based architecture,” IETF RFC 4655, Aug.2006.

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.

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.

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.

R. Bhandari, Survivable Networks: Algorithms for Diverse Routing, 1st ed.Springer, 1999.

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.

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.

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.

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.