Computing approximate blocking probabilities for a class of all-optical networks

Author

Birman, A.

Author_Institution

IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

fYear

1995

fDate

2-6 Apr 1995

Firstpage

651

Abstract

Studies a class of all-optical networks using wavelength division multiplexing 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 the authors calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing

Keywords

optical fibre networks; probability; telecommunication network routing; wavelength division multiplexing; all-optical networks; approximate blocking probabilities; fixed routing; generalized reduced load approximation scheme; least loaded routing; path; routing schemes; wavelength division multiplexing; wavelength routing; All-optical networks; Computer networks; Heuristic algorithms; Integer linear programming; Optical fiber networks; Probability; Switching circuits; WDM networks; Wavelength assignment; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings. IEEE

Conference_Location

Boston, MA

ISSN

0743-166X

Print_ISBN

0-8186-6990-X

Type

conf

DOI

10.1109/INFCOM.1995.515932

Filename

515932