Routing and design in K-shared networks
暂无分享,去创建一个
[1] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .
[2] Thomas E. Stern,et al. Multiwavelength Optical Networks: A Layered Approach , 1999 .
[3] Biswanath Mukherjee,et al. Light trees: optical multicasting for improved performance in wavelength routed networks , 1999, IEEE Commun. Mag..
[4] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.
[5] Brian W. Kernighan,et al. AMPL: A Modeling Language for Mathematical Programming , 1993 .
[6] J. W. Suuballe,et al. Disjoint Paths in a Network , 2022 .
[7] Chitra Phadke,et al. FASTeR: shared restoration without signalling , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..
[8] Leon J. Osterweil,et al. On Two Problems in the Generation of Program Test Paths , 1976, IEEE Transactions on Software Engineering.
[9] Brunilde Sansò,et al. Telecommunications Network Planning , 1998 .