Spectrum and transponder optimization in survivable translucent flexible-grid optical networks

IEEE International Conference on Communications

Volumn , Issue , 2012, Pages 6235-6240

  Eira, António ^a,b   Pedro, João ^a   Pires, João ^b  

^a Siemens Portugal   (Portugal)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

flexible spectral grid; Network optimization; shared restoration

Indexed keywords

ADVANCED MODULATION FORMATS; BITRATES; FLEXIBLE SPECTRAL GRID; ILP MODELS; NETWORK OPTIMIZATION; OPTICAL CHANNELS; SHARED RESTORATION; SPECTRAL EFFICIENCIES; TRANSPORT NETWORKS; TUNABLE OPTICS; TUNING RANGES;

FIBER OPTIC NETWORKS; OPTICAL COMMUNICATION; OPTIMIZATION;

TRANSPONDERS;

EID: 84871961616     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2012.6364895     Document Type: Conference Paper

References (9)

1. A. Morea, O. Rival, "Advantages of elasticity versus fixed data-rate schemes for restorable optical networks", ECOC 2010, paper Th.10.F.5.
2. A. N. Patel, P. N. Ji, J. P. Jue, T. Wang, " Survivable transparent flexible optical WDM (FWDM) networks", OFC 2011, paper OTuI2.
3. Y. Sone, A. Watanabe, W. Imajuku, Y. Tsukishima, B. Kozicki, H. Takara, M. Jinno, "Bandwidth squeezed restoration in spectrum-sliced elastic optical path networks (SLICE)", IEEE/OSA Journal of Optical Communications and Networking, vol.3, no.3, pp.223.233, 2011.
4. A. Morea, A. F. Chong, O. Rival, "Impact of transparent network constraints on capacity gain of elastic channel spacing", OFC 2011, paper JWA62.
5. A. Eira, J. Pedro, J. Pires, "Optimized design of shared restoration in flexible-grid transparent optical networks", OFC 2012, paper JTh2A37.
6. G. Bosco, V. Curri, A. Carena, P. Poggiolini, F. Forghieri, "On the performance of Nyquist-WDM terabit superchannels based on PM-BPSK, PM-QPSK, PM-8QAM or PM-16QAM subcarriers", IEEE/OSA Journal of Lightwave Technology, vol.29, no.1, pp.53-61, 2011.
7. S. Gringeri, B. Basch, V. Shukla, R. Egorov, T.J. Xia, "Flexible architectures for optical transport nodes and networks", IEEE Communications Magazine, vol.48, no.7, pp.40-50, 2010.
8. C. Bron, J. Kerbosch, "Algorithm 457: finding all cliques of an undirected graph", Communications of the ACM, vol.16, no.9, pp.575-577, 1973.
9. R.M. Karp, Reducibility among combinatorial problems. New York: Plennum, 1972.