Paper
22 September 2000 Approach for bounding blocking with application to all-optical unconstrained routing
Ehab S. Elmallah
Author Affiliations +
Abstract
This paper considers a problem concerning the blocking analysis of all-optical networks with arbitrary topologies and unconstrained routing. That is, we consider designs where the underlying routing and wavelength assignment algorithm selects a route from the set of all available routes for connection setup. Unconstrained routing is a natural strategy to consider for harnessing all-optical bandwidth; its strength has been demonstrated by recent simulation studies. Unfortunately, exact computations of blocking for unconstrained routing is computationally intensive due to the presence of a potentially exponential number of paths in mesh networks. In fact, exact computation of the source-destination blocking probability for unconstrained routing is #P-complete, even with the simplifying assumption that the per-link blocking distribution can be estimated a priori.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ehab S. Elmallah "Approach for bounding blocking with application to all-optical unconstrained routing", Proc. SPIE 4233, OptiComm 2000: Optical Networking and Communications, (22 September 2000); https://doi.org/10.1117/12.401819
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Reliability

Algorithm development

Systems modeling

Astatine

Current controlled current source

Lawrencium

C++

Back to Top