Skip to main content

Analytical Models for QoT-Aware RWA Performance

  • Chapter
  • First Online:
Cross-Layer Design in Optical Networks

Part of the book series: Optical Networks ((OPNW,volume 15))

  • 989 Accesses

Abstract

As can be seen in Chap. 3, a large number of QoT-Aware or Impairment-Aware Routing and Wavelength assignment algorithms (IA-RWA) were designed to minimize blocking in dynamic transparent optical networks. The very vast majority of those algorithms were evaluated through extensive simulations. With time, proposed IA-RWA grew in complexity, actually making their accurate evaluation possible only using full-scale simulations. Full-scale simulations, however, tend to be lengthy for the following three reasons: (a) the growing complexity of the proposed IA-RWA techniques; (b) the increasing complexity of the networks that must be modeled (spurred for instance by the increase in the number of wavelengths that can be routed in the network—note that this could be somewhat offset by the deployment of networks with fewer, higher-capacity channels); and (c) the inclusion of more complex QoT models in the simulations—more accurate QoT models are typically more simulation intensive. In addition, establishing a new lightpath may disrupt lightpaths that are already established through the addition of cross-channel effects, such as node crosstalk or non-linear effects. Such disruption is not desirable in a transparent network, and hence in simulations of IA-RWA the QoT of any lightpath that may be disrupted by the arrival of a new demand should be evaluated. Hence, for each new demand, the QoT of many lightpaths may have to be evaluated. If a blocking rate of 10− 5 or less is desired, then the simulation of the arrival of (many times more than) 105 lightpaths is required; if a network operator wants to test an IA-RWA in less than 10 min, then a decision must be reached for each demand in (much) less than 60 ms. This can prove difficult to achieve if QoT is to be estimated accurately.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We use the notation ∣X∣ to denote the cardinality of the set X.

References

  1. Birman A (1996) Computing approximate blocking probabilities for a class of all-optical networks. IEEE J Sel Areas Comm 14(5):852–857

    Google Scholar 

  2. Barry R, Humblet P (1996) Models of blocking probability in all-optical networks with and without wavelength changers. IEEE J Sel Area Comm 14(5):858–867

    Article  Google Scholar 

  3. Subramaniam S, Azizoğlu M, Somani A (1996) All-optical networks with sparse wavelength conversion. IEEE/ACM Trans Netw 4(4):544–557

    Article  Google Scholar 

  4. Harai H, Murata M, Miyahara H (1998) Performance analysis of wavelength assignment policies in all-optical networks with limited-range wavelength conversion. IEEE J Sel Area Comm 16(7):1051–1060

    Article  Google Scholar 

  5. Zhu Y, Rouskas G, Perros H (2000) A path decomposition approach for computing blocking probabilities in wavelength-routing networks. IEEE/ACM Trans Netw 8(6):747–762

    Article  Google Scholar 

  6. Xin C, Qiao C, Dixit S (2003) Analysis of single-hop traffic grooming in mesh WDM optical networks. Proc SPIE 5285:91–101

    Article  Google Scholar 

  7. Waldman H, Campelo DR, Almeida RC Jr (2003) A new analytical approach for the estimation of blocking probabilities in wavelength-routing networks. Proc SPIE 5285:324–335

    Article  Google Scholar 

  8. Sridharan A, Sivarajan K (2004) Blocking in all-optical networks. IEEE/ACM Trans Netw 12(2):384–397

    Article  Google Scholar 

  9. Lu K, Xiao G, Chlamtac I (2005) Analysis of blocking probability for distributed lightpath establishment in WDM optical networks. IEEE/ACM Trans Netw 13(1):187–197

    Article  Google Scholar 

  10. Alyatama A (2005) Wavelength decomposition approach for computing blocking probabilities in WDM optical networks without wavelength conversions. Elsevier Comput Netw 49(6):727–742

    Article  Google Scholar 

  11. Kelly F (1991) Loss networks. Ann Appl Probab 1:319–378

    Article  MathSciNet  MATH  Google Scholar 

  12. He J, Brandt-Pearce M, Subramaniam S (2011) Analysis of blocking probability for first-fit wavelength assignment in transmission-impaired optical networks. IEEE/OSA J Opt Comm Netw 3(5):411–425

    Article  Google Scholar 

  13. Pointurier Y, Brandt-Pearce M, Subramaniam S (2009) Analysis of blocking probability in noise and crosstalk-impaired all-optical networks. IEEE/OSA J Opt Comm Netw 1(6):543–554

    Article  Google Scholar 

  14. Deng T, Subramaniam S, Xu J (2004) Crosstalk-aware wavelength assignment in dynamic wavelength-routed optical networks. In: Proceedings of IEEE Broadnets, pp. 140–149

    Google Scholar 

  15. Goldstein E, Eskildsen L (1995) Scaling limitations in transparent optical networks due to low-level crosstalk. IEEE Photon Technol Lett 7(1):93–94

    Article  Google Scholar 

  16. Mukherjee B, Huang Y, Heritage J (2004) Impairment-aware routing in wavelength-routed optical networks. In: IEEE LEOS 2004, vol. 1, pp. 428–429

    Google Scholar 

  17. Azodolmolky S, Klinkowski M, Marin E, Careglio D, Solé-Pareta J, Tomkos I (2009) A survey on physical layer impairments aware routing and wavelength assignment algorithms in optical networks. Elsevier Comput Netw 53(7):926–944

    Article  MATH  Google Scholar 

  18. He J, Brandt-Pearce M, Subramaniam S (2009) QoS-aware wavelength assignment with BER and latency constraints for all-optical networks. IEEE/OSA J Lightwave Tech 27(5):462–474

    Article  Google Scholar 

  19. He J, Brandt-Pearce M, Subramaniam S (2008) Optimal RWA for static traffic in transmission-impaired wavelength-routed networks. IEEE Comm Lett 12(9):694–695

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yvan Pointurier .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Pointurier, Y., He, J. (2013). Analytical Models for QoT-Aware RWA Performance. In: Subramaniam, S., Brandt-Pearce, M., Demeester, P., Vijaya Saradhi, C. (eds) Cross-Layer Design in Optical Networks. Optical Networks, vol 15. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-5671-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-5671-1_7

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4614-5670-4

  • Online ISBN: 978-1-4614-5671-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics