A new solution to the K-shortest paths problem and its application in wavelength routed optical networks

ISSN： 1387-974X

Source： Photonic Network Communications, Vol.12, Iss.3, 2006-12, pp. : 269-284

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

QoS-Friendly Wavelength Assignment in Dynamic Wavelength-Routed Optical Networks

By Deng Tao Subramaniam Suresh

Photonic Network Communications, Vol. 10, Iss. 1, 2005-07 ,pp. : 5-22

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

By Guerriero F. Musmanno R.

Journal of Optimization Theory and Applications, Vol. 104, Iss. 1, 2000-01 ,pp. : 91-108

Springer Publishing Company

Access to resources Recommend Favorite

A Kind of Topology Aggregation Algorithm in Hierarchical Wavelength-Routed Optical Networks

By Zhang Feng Zheng Xiaoping Zhanga Hanyi Guo Yili

Photonic Network Communications, Vol. 9, Iss. 2, 2005-03 ,pp. : 167-180

Springer Publishing Company

Access to resources Recommend Favorite

Signaling Schemes for Distributed Connection Management in Wavelength-Routed Optical Mesh Networks

By Shen Lu Yang Xi Ramamurthy Byrav

Photonic Network Communications, Vol. 8, Iss. 1, 2004-06 ,pp. : 89-103

Springer Publishing Company

Access to resources Recommend Favorite

A kind of topology aggregation algorithm in hierarchical wavelength-routed optical networks

By Zhang Feng Zheng Xiaoping Zhang Hanyi Guo Yili

Photonic Network Communications, Vol. 13, Iss. 2, 2007-04 ,pp. : 155-165

Springer Publishing Company

Access to resources Recommend Favorite