Answers are grounded in this paper and cite their sources.
We study a class of all-optical networks using wavelength-division multiplexing (WDM) and wavelength routing, in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing.
No takes yet. Share an insight, caveat, or question.
Alexander Birman (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: