On Sparse Placement of Regenerator Nodes in Translucent Optical Network
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] J. M. Simmons,et al. Network design in realistic "all-optical" backbone networks , 2006, IEEE Communications Magazine.
[3] Rodney S. Tucker,et al. Translucent optical networks: the way forward [Topics in Optical Communications] , 2007, IEEE Communications Magazine.
[4] Madhav V. Marathe,et al. Formal Language Constrained Path Problems , 1998, SWAT.
[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[6] Rodney S. Tucker,et al. Translucent Optical Networks: The Way Forward , 2007 .
[7] Byrav Ramamurthy,et al. Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing , 2005, Photonic Network Communications.
[8] Steven S. Lumetta,et al. Rapid and Efficient Protection for All-Optical WDM Mesh Networks , 2007, IEEE Journal on Selected Areas in Communications.
[9] David Eppstein,et al. Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[10] Byrav Ramamurthy,et al. Dynamic routing in translucent WDM optical networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).