• DocumentCode
    334025
  • Title

    Computing approximate blocking probabilities in wavelength routed all-optical networks with limited-range wavelength conversion

  • Author

    Tripathi, Tushar ; Sivarajan, Kumar N.

  • Author_Institution
    Dept. of Electr. Commun. Eng., Indian Inst. of Sci., Bangalore, India
  • Volume
    1
  • fYear
    1999
  • fDate
    21-25 Mar 1999
  • Firstpage
    329
  • Abstract
    We propose a method to calculate the average blocking probability in all-optical networks using limited-range wavelength conversion. Previous works have shown that there is a remarkable improvement in blocking probability while using limited-range wavelength conversion but these analytical models were either for a path or for a mesh-torus network. Using a graph-theoretical approach, we extend Birman´s model (see IEEE JSAC/JLT Special I on Optical Networks, vol.14, no.5, p.852-57, 1996) for no wavelength conversion and derive an analytical expression to compute the blocking probabilities in networks with limited-range wavelength conversion for fixed routing. The proposed analytical model is a generalization of Birman´s model and is applicable to any network topology. We consider the case where an incoming wavelength can be converted to d adjacent outgoing wavelengths on either side of the input wavelength, in addition to the input wavelength itself, where d is the degree of conversion. Using this model we demonstrate that the performance improvement obtained by full wavelength conversion over no wavelength conversion can almost be achieved by using limited-wavelength conversion with the degree of conversion, d, being only 1 or 2. In a few example networks we considered, for blocking probabilities up to a few percent, the carried traffic with limited-conversion degree d=2 was almost equal to the carried traffic for full wavelength conversion. The results obtained show that significant improvements in blocking performance can be obtained by providing limited-range wavelength conversion of small degree within the network
  • Keywords
    approximation theory; graph theory; network topology; optical wavelength conversion; probability; telecommunication network routing; wavelength division multiplexing; Birman´s model; WDM; analytical model; approximate blocking probabilities; average blocking probability; carried traffic; fixed routing; graph-theoretical approach; input wavelength; limited-range wavelength conversion; network topology; wavelength routed all-optical networks; All-optical networks; Analytical models; Computer networks; Optical computing; Optical fiber networks; Optical wavelength conversion; Probability; Telecommunication traffic; Wavelength conversion; Wavelength routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
  • Conference_Location
    New York, NY
  • ISSN
    0743-166X
  • Print_ISBN
    0-7803-5417-6
  • Type

    conf

  • DOI
    10.1109/INFCOM.1999.749299
  • Filename
    749299