R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photonic Netw. Commun. 8, 239–249 (2004).

[Crossref]

C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for sharedpath protection in WDM mesh networks,” J. Lightwave. Technol. 22, 1223–1232 (2004).

[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

Y. Wang, Q. Zeng, and H. Zhao, “Dynamic survivability in WDM mesh networks under dynamic traffic,” Photonic Netw. Commun. 6, 5–24 (2003).

[Crossref]

H. Wen, S. Wang, and L. Li, “A routing algorithm for finding low-cost pair of no shared-risk paths,” J. Electron. Info. Technol. 25, 824–830 (2003).

S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks,” J. Lightwave. Technol. 21, 870–883 (2003).

[Crossref]

M. Barbehenn, “A note on the complexity of Dijkstra’s algorithm for graphs with weighted vertices,” IEEE Trans. Comp. 47, 263 (1998).

[Crossref]

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

[Crossref]

M. Barbehenn, “A note on the complexity of Dijkstra’s algorithm for graphs with weighted vertices,” IEEE Trans. Comp. 47, 263 (1998).

[Crossref]

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photonic Netw. Commun. 8, 239–249 (2004).

[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photonic Netw. Commun. 8, 239–249 (2004).

[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

H. Wen, S. Wang, and L. Li, “A routing algorithm for finding low-cost pair of no shared-risk paths,” J. Electron. Info. Technol. 25, 824–830 (2003).

C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for sharedpath protection in WDM mesh networks,” J. Lightwave. Technol. 22, 1223–1232 (2004).

[Crossref]

S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks,” J. Lightwave. Technol. 21, 870–883 (2003).

[Crossref]

C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for sharedpath protection in WDM mesh networks,” J. Lightwave. Technol. 22, 1223–1232 (2004).

[Crossref]

S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks,” J. Lightwave. Technol. 21, 870–883 (2003).

[Crossref]

C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for sharedpath protection in WDM mesh networks,” J. Lightwave. Technol. 22, 1223–1232 (2004).

[Crossref]

S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks,” J. Lightwave. Technol. 21, 870–883 (2003).

[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

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

[Crossref]

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

[Crossref]

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photonic Netw. Commun. 8, 239–249 (2004).

[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

H. Wen, S. Wang, and L. Li, “A routing algorithm for finding low-cost pair of no shared-risk paths,” J. Electron. Info. Technol. 25, 824–830 (2003).

Y. Wang, Q. Zeng, and H. Zhao, “Dynamic survivability in WDM mesh networks under dynamic traffic,” Photonic Netw. Commun. 6, 5–24 (2003).

[Crossref]

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photonic Netw. Commun. 8, 239–249 (2004).

[Crossref]

H. Wen, S. Wang, and L. Li, “A routing algorithm for finding low-cost pair of no shared-risk paths,” J. Electron. Info. Technol. 25, 824–830 (2003).

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for sharedpath protection in WDM mesh networks,” J. Lightwave. Technol. 22, 1223–1232 (2004).

[Crossref]

Y. Wang, Q. Zeng, and H. Zhao, “Dynamic survivability in WDM mesh networks under dynamic traffic,” Photonic Netw. Commun. 6, 5–24 (2003).

[Crossref]

C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for sharedpath protection in WDM mesh networks,” J. Lightwave. Technol. 22, 1223–1232 (2004).

[Crossref]

Y. Wang, Q. Zeng, and H. Zhao, “Dynamic survivability in WDM mesh networks under dynamic traffic,” Photonic Netw. Commun. 6, 5–24 (2003).

[Crossref]

M. Barbehenn, “A note on the complexity of Dijkstra’s algorithm for graphs with weighted vertices,” IEEE Trans. Comp. 47, 263 (1998).

[Crossref]

H. Wen, S. Wang, and L. Li, “A routing algorithm for finding low-cost pair of no shared-risk paths,” J. Electron. Info. Technol. 25, 824–830 (2003).

C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for sharedpath protection in WDM mesh networks,” J. Lightwave. Technol. 22, 1223–1232 (2004).

[Crossref]

S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Survivable WDM mesh networks,” J. Lightwave. Technol. 21, 870–883 (2003).

[Crossref]

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

[Crossref]

R. He, H. Wen, L. Li, and G. Wang, “Shared sub-path protection algorithm in traffic-grooming WDM mesh networks,” Photonic Netw. Commun. 8, 239–249 (2004).

[Crossref]

H. Wen, L. Li, R. He, H. Yu, S. Wang, and N. Song, “Dynamic grooming algorithms for survivable WDM mesh networks,” Photonic Netw. Commun. 7, 253–263 (2003).

[Crossref]

Y. Wang, Q. Zeng, and H. Zhao, “Dynamic survivability in WDM mesh networks under dynamic traffic,” Photonic Netw. Commun. 6, 5–24 (2003).

[Crossref]