Multiwavelength distribution networks

We propose a graph model for the qualitative and quantitative analyses of wavelength division multiplexed (WDM) multicast/broadcast switching networks. The graph model, called [w, f]-distributor, turns out to be a generalized version of the graph model for classical circuit switching theory, which includes important classes of graphs, such as the distributors (also called generalized connectors). We then give lower bounds for [w, f]-distributors and [w, f]-distributors of a fixed depth. Many of the results generalize corresponding results from circuit switching. We also show that, under two prominent request models, strictly nonblocking [w, f]-distributors are equivalent.