Effective algorithms for finding optimum pairs of link-disjoint paths in α +1 path protection

ISSN： 1018-4864

Source： Telecommunication Systems, Vol.52, Iss.2, 2013-02, pp. : 783-797

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks

By Srinivas Anand

Wireless Networks, Vol. 11, Iss. 4, 2005-07 ,pp. : 401-417

Springer Publishing Company

Access to resources Recommend Favorite

Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost

By Gomes Teresa Simões Carlos Fernandes Luís

Telecommunication Systems, Vol. 52, Iss. 2, 2013-02 ,pp. : 737-749

Springer Publishing Company

Access to resources Recommend Favorite

Fast reroute paths algorithms

By Jarry Aubin

Telecommunication Systems, Vol. 52, Iss. 2, 2013-02 ,pp. : 881-888

Springer Publishing Company

Access to resources Recommend Favorite

Restoration performance study of k -shortest disjoint paths in WDM optical networks

By Tak Sungwoo

Telecommunication Systems, Vol. 34, Iss. 1-2, 2007-02 ,pp. : 13-26

Springer Publishing Company

Access to resources Recommend Favorite

Optimum Arrangement of Reliable Label-Switched Paths in MPLS Over Optical Networks

By Ogino Nagao Tanaka Hideaki

Telecommunication Systems, Vol. 31, Iss. 1, 2006-01 ,pp. : 29-41

Springer Publishing Company

Access to resources Recommend Favorite