Efficient Wavelength Routing on Directed Fiber Trees
暂无分享,去创建一个
[1] Ramarathnam Venkatesan,et al. Design of practical and provably good random number generators , 1995, SODA '95.
[2] Daniel Minoli. Telecommunications Technology Handbook , 1991 .
[3] Eli Upfal,et al. Efficient routing in all-optical networks , 1994, STOC '94.
[4] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[5] Alok Aggarwal,et al. Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.
[6] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..
[7] N. Raghavan. Eecient Routing in All-optical Networks , 1994 .
[8] Ivan P. Kaminow,et al. A Precompetitive Consortium on Wide-band All Optical Networks , 1993 .
[9] András Frank. Edge-disjoint paths in planar graphs , 1985, J. Comb. Theory, Ser. B.
[10] Rajesh K. Pankaj. Architectures for linear lightwave networks , 1992 .
[11] A. Tucker,et al. Coloring a Family of Circular Arcs , 1975 .
[12] M. T. Smith,et al. A scalable multiwavelength multihop optical network: a proposal for research on all-optical networks , 1993 .
[13] Mark K. Goldberg,et al. Edge-coloring of multigraphs: Recoloring technique , 1984, J. Graph Theory.
[14] Stéphane Pérennes,et al. Efficient Collective Communication in Optical Networks , 1996, ICALP.
[15] Gee-Kung Chang,et al. Experimental Demonstration of a Reconfigurable WDM/ATM/SONET Multiwavelength Network Testbed , 1994 .
[16] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.
[17] Satish Rao,et al. Efficient access to optical bandwidth , 1995, FOCS 1995.