4th International IEEE Conference on Broadband Communications, Networks, Systems

Research Article

Connection Provisioning in QoT-Guaranteed Distributed All-Optical Networks

  • @INPROCEEDINGS{10.1109/BROADNETS.2007.4550518,
        author={Jun He and Maıt\^{e} Brandt-Pearce and Suresh Subramaniam},
        title={Connection Provisioning in QoT-Guaranteed Distributed All-Optical Networks},
        proceedings={4th International IEEE Conference on Broadband Communications, Networks, Systems},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2010},
        month={5},
        keywords={},
        doi={10.1109/BROADNETS.2007.4550518}
    }
    
  • Jun He
    Maıté Brandt-Pearce
    Suresh Subramaniam
    Year: 2010
    Connection Provisioning in QoT-Guaranteed Distributed All-Optical Networks
    BROADNETS
    IEEE
    DOI: 10.1109/BROADNETS.2007.4550518
Jun He1,*, Maıté Brandt-Pearce1,*, Suresh Subramaniam2,*
  • 1: Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Charlottesville, Virginia 22904
  • 2: Department of Electrical and Computer Engineering, George Washington University, Washington, DC 20052
*Contact email: jh2eu@virginia.edu, mb-p@virginia.edu, suresh@gwu.edu

Abstract

As an optical signal propagates along a lightpath to its destination in wavelength-routed optical networks (WRONs), the quality of transmission (QoT) is degraded by transmission impairments such as crosstalk and amplified spontaneous emission noise. Consequently, the signal’s bit error rate at the destination’s receiver can become unacceptably high. Recently, many BER-aware connection provisioning algorithms have been proposed that incorporate physical layer impairments in terms of increased blocking rate from the BER constraint. However, they have a high computational complexity compared to traditional connection provisioning schemes because of the complexity of BER estimation. The delay involved in the computation greatly affects the performance in distributed networks because the latency worsens the contention and makes instantaneous network status impossible to obtain. In this paper, distributed connection provisioning schemes are compared using two BER estimation procedures and several wavelength assignment algorithms. Simulation results show the effects of delay in connection provisioning and measure the performance in terms of blocking probability.