Exact, approximate, and recursive blocking in all-optical networks

Author

Leith, C. ; Takahara, G. ; Mansourati, Z.

Author_Institution

Dept. of Math. & Stat., Queen´´s Univ., Kingston, Ont., Canada

Volume

2

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

1460

Abstract

We present one exact and two approximate methods for calculating blocking probabilities in an all-optical network with arbitrary placement of wavelength converters. The exact method is most useful for short paths (no more than 4 links), while the first approximate method is useful for slightly longer hop paths (no more than 6 links). The second approximate method is based on a recursion and can be applied to arbitrary length paths. A simple wavelength converter placement policy is described and implemented using the blocking models in an example using the CA*Net II topology

Keywords

approximation theory; optical fibre networks; optical wavelength conversion; probability; telecommunication network routing; wavelength division multiplexing; CA*Net II topology; WDM; all-optical networks; approximate method; arbitrary length paths; blocking probabilities; exact method; recursive algorithm; short hop paths; wavelength converter placement policy; All-optical networks; Analytical models; Intelligent networks; Network topology; Optical wavelength conversion; Performance analysis; Probability; Switches; Switching circuits; Wavelength converters;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1999. GLOBECOM '99

Conference_Location

Rio de Janeireo

Print_ISBN

0-7803-5796-5

Type

conf

DOI

10.1109/GLOCOM.1999.830021

Filename

830021