Skip to main content

2013 | OriginalPaper | Buchkapitel

7. Analytical Models for QoT-Aware RWA Performance

verfasst von : Yvan Pointurier, Jun He

Erschienen in: Cross-Layer Design in Optical Networks

Verlag: Springer US

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
We use the notation ∣X∣ to denote the cardinality of the set X.
 
Literatur
1.
Zurück zum Zitat Birman A (1996) Computing approximate blocking probabilities for a class of all-optical networks. IEEE J Sel Areas Comm 14(5):852–857 Birman A (1996) Computing approximate blocking probabilities for a class of all-optical networks. IEEE J Sel Areas Comm 14(5):852–857
2.
Zurück zum Zitat 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–867CrossRef 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–867CrossRef
3.
Zurück zum Zitat Subramaniam S, Azizoğlu M, Somani A (1996) All-optical networks with sparse wavelength conversion. IEEE/ACM Trans Netw 4(4):544–557CrossRef Subramaniam S, Azizoğlu M, Somani A (1996) All-optical networks with sparse wavelength conversion. IEEE/ACM Trans Netw 4(4):544–557CrossRef
4.
Zurück zum Zitat 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–1060CrossRef 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–1060CrossRef
5.
Zurück zum Zitat 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–762CrossRef 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–762CrossRef
6.
Zurück zum Zitat Xin C, Qiao C, Dixit S (2003) Analysis of single-hop traffic grooming in mesh WDM optical networks. Proc SPIE 5285:91–101CrossRef Xin C, Qiao C, Dixit S (2003) Analysis of single-hop traffic grooming in mesh WDM optical networks. Proc SPIE 5285:91–101CrossRef
7.
Zurück zum Zitat 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–335CrossRef 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–335CrossRef
8.
Zurück zum Zitat Sridharan A, Sivarajan K (2004) Blocking in all-optical networks. IEEE/ACM Trans Netw 12(2):384–397CrossRef Sridharan A, Sivarajan K (2004) Blocking in all-optical networks. IEEE/ACM Trans Netw 12(2):384–397CrossRef
9.
Zurück zum Zitat 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–197CrossRef 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–197CrossRef
10.
Zurück zum Zitat Alyatama A (2005) Wavelength decomposition approach for computing blocking probabilities in WDM optical networks without wavelength conversions. Elsevier Comput Netw 49(6):727–742CrossRef Alyatama A (2005) Wavelength decomposition approach for computing blocking probabilities in WDM optical networks without wavelength conversions. Elsevier Comput Netw 49(6):727–742CrossRef
12.
Zurück zum Zitat 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–425CrossRef 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–425CrossRef
13.
Zurück zum Zitat 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–554CrossRef 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–554CrossRef
14.
Zurück zum Zitat 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 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
15.
Zurück zum Zitat Goldstein E, Eskildsen L (1995) Scaling limitations in transparent optical networks due to low-level crosstalk. IEEE Photon Technol Lett 7(1):93–94CrossRef Goldstein E, Eskildsen L (1995) Scaling limitations in transparent optical networks due to low-level crosstalk. IEEE Photon Technol Lett 7(1):93–94CrossRef
16.
Zurück zum Zitat Mukherjee B, Huang Y, Heritage J (2004) Impairment-aware routing in wavelength-routed optical networks. In: IEEE LEOS 2004, vol. 1, pp. 428–429 Mukherjee B, Huang Y, Heritage J (2004) Impairment-aware routing in wavelength-routed optical networks. In: IEEE LEOS 2004, vol. 1, pp. 428–429
17.
Zurück zum Zitat 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–944MATHCrossRef 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–944MATHCrossRef
18.
Zurück zum Zitat 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–474CrossRef 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–474CrossRef
19.
Zurück zum Zitat 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–695CrossRef 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–695CrossRef
Metadaten
Titel
Analytical Models for QoT-Aware RWA Performance
verfasst von
Yvan Pointurier
Jun He
Copyright-Jahr
2013
Verlag
Springer US
DOI
https://doi.org/10.1007/978-1-4614-5671-1_7

Neuer Inhalt