Wavelength routing in optical networks of diameter two
作者:
Highlights:
•
摘要
We consider optical networks with routing by wavelength division multiplexing. We show that wavelength switching is unnecessary in routings where communication paths use at most two edges. We then exhibit routings in some explicit pseudo-random graphs, showing that they achieve optimal performance subject to constraints on the number of edges and the maximal degree. We also observe the relative inefficiency of planar networks.
论文关键词:Optical networks,Wavelength routing,Graph,Vizing's theorem,Diameter
论文评审过程:Received 27 September 2000, Revised 21 February 2001, Available online 9 April 2002.
论文官网地址:https://doi.org/10.1016/S0377-0427(01)00463-0