Routing in all-optical ring networks revisited
暂无分享,去创建一个
[1] Tamra J. Carpenter,et al. Demand Routing and Slotting on Ring Networks , 1997 .
[2] Biing-Feng Wang. Linear time algorithms for the ring loading problem with demand splitting , 2005, J. Algorithms.
[3] Iraj Saniee,et al. An optimization problem related to balancing loads on SONET rings , 1994, Telecommun. Syst..
[4] Peter Winkler,et al. Ring routing and wavelength translation , 1998, SODA '98.
[5] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.
[6] Nobuji Saito,et al. Algorithms for Routing around a Rectangle , 1992, Discret. Appl. Math..
[7] Sanjeev Khanna,et al. A polynomial time approximation scheme for the SONET ring loading problem , 1997, Bell Labs Technical Journal.
[8] George N. Rouskas,et al. On optimal traffic grooming in WDM rings , 2001, SIGMETRICS '01.
[9] Xiang-Yang Li,et al. Wavelength assignment in WDM rings to minimize SONET ADMs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[10] A. Tucker,et al. Coloring a Family of Circular Arcs , 1975 .
[11] Wei-Kuan Shih,et al. An O(n log n+m log log n) Maximum Weight Clique Algorithm for Circular-Arc Graphs , 1989, Inf. Process. Lett..
[12] Steven Cosares,et al. Comparing Heuristics for Demand Routing and Slot Assignment on Ring Networks , 2002, Telecommun. Syst..
[13] Biing-Feng Wang,et al. Efficient Algorithms for the Ring Loading Problem with Demand Splitting , 2003, ESA.
[14] Armando N. Pinto,et al. Optical Networks: A Practical Perspective, 2nd Edition , 2002 .
[15] Peter Winkler,et al. The Ring Loading Problem , 1998, SIAM Rev..
[16] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.
[17] Thomas Erlebach,et al. Wavelength conversion in networks of bounded treewidth , 2002 .
[18] A.L. Chiu,et al. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.
[19] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[20] Vijay Kumar,et al. Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks , 1998, APPROX.
[21] Klaus Jansen,et al. The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..
[22] Christine T. Cheng. A New Approximation Algorithm for the Demand Rouring and Slotting Problem with Unit Demands on Rings , 1999, RANDOM-APPROX.