Share Email Print

Proceedings Paper

Approach for bounding blocking with application to all-optical unconstrained routing
Author(s): Ehab S. Elmallah
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 22 September 2000
PDF: 9 pages
Proc. SPIE 4233, OptiComm 2000: Optical Networking and Communications, (22 September 2000); doi: 10.1117/12.401819
Show Author Affiliations
Ehab S. Elmallah, Univ. of Alberta (Canada)

Published in SPIE Proceedings Vol. 4233:
OptiComm 2000: Optical Networking and Communications
Imrich Chlamtac, Editor(s)

© SPIE. Terms of Use
Back to Top