Routing, Modulation Level, and Spectrum Assignment in Optical Metro Ring Networks Using Elastic Transceivers

Cristina Rottondi; Massimo Tornatore; Achille Pattavina; Giancarlo Gavioli

doi:10.1364/JOCN.5.000305

Journal of Optical Communications and Networking
Vol. 5,
Issue 4,
pp. 305-315
(2013)
•https://doi.org/10.1364/JOCN.5.000305

Routing, Modulation Level, and Spectrum Assignment in Optical Metro Ring Networks Using Elastic Transceivers

Cristina Rottondi, Massimo Tornatore, Achille Pattavina, and Giancarlo Gavioli

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Cristina Rottondi, Massimo Tornatore, Achille Pattavina, and Giancarlo Gavioli, "Routing, Modulation Level, and Spectrum Assignment in Optical Metro Ring Networks Using Elastic Transceivers," J. Opt. Commun. Netw. 5, 305-315 (2013)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Abstract

For decades, optical networks have provided larger bandwidths than could be utilized, but with the increasing growth of the global Internet traffic demand, new optical transmission technologies are required to provide a much higher data rate per channel and to enable more flexibility in the allocation of traffic flow. Currently, researchers are investigating innovative transceiver architectures capable of dynamically adapting the modulation format to the transmission link properties. These transceivers are referred to as elastic and enable flexible allocation of optical bandwidth resources. To exploit their capabilities, the conventional fixed spectrum grid has to evolve to provide a more scalable and flexible system that can provide the spectral resources requireded to serve the client demand. The benefits of elastic transceivers with distance-adaptive data rates have been evaluated in optical core networks, but their application to metro ring networks has still not been addressed. This paper proposes methods based on integer linear programs and heuristic approaches to solve the routing, modulation level, and spectrum assignment problem in optical rings with elastic transceivers and rate-adaptive modulation formats. Moreover, we discuss how to analytically compute feasible solutions that provide useful upper bounds. Results show a significant reduction in terms of transceiver utilization and spectrum occupation.

Full Article | PDF Article

More Like This

On the Complexity of Routing and Spectrum Assignment in Flexible-Grid Ring Networks [Invited]

Massimo Tornatore, Cristina Rottondi, Roza Goscien, Krzysztof Walkowiak, Giuseppe Rizzelli, and Annalisa Morea
J. Opt. Commun. Netw. 7(2) A256-A267 (2015)

Optimal Route, Spectrum, and Modulation Level Assignment in Split-Spectrum-Enabled Dynamic Elastic Optical Networks

Albert Pagès, Jordi Perelló, Salvatore Spadaro, and Jaume Comellas
J. Opt. Commun. Netw. 6(2) 114-126 (2014)

Graph-Model-Based Dynamic Routing and Spectrum Assignment in Elastic Optical Networks

Ching-Fang Hsu, Yuan-Chih Chang, and Siou-Ci Sie
J. Opt. Commun. Netw. 8(7) 507-520 (2016)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (9)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (6)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (12)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

All-to-all	$\| N \| = odd$	$\min [(⌈ \frac{N (N - 1) t}{2 C R_{1}} ⌉ F + G) N, (⌈ \frac{\sum_{i = 1}^{\frac{N - 1}{2}} i t}{C R_{1}} ⌉ F + G) 2 N]$
All-to-all	$\| N \| = even$	$\min [(⌈ \frac{N (N - 1) t}{2 C R_{1}} ⌉ F + G) N, (⌈ \frac{\sum_{i = 1}^{\frac{N}{2}} i t}{C R_{1}} ⌉ F + ⌈ \frac{\sum_{i = 1}^{\frac{N}{2} - 1} i t}{C R_{1}} ⌉ F + 2 G) N]$
One-to-all	$\| N \| = odd$	$\min [(⌈ \frac{(N - 1) t}{C R_{1}} ⌉ F + G) N, \sum_{i = 1}^{\frac{N - 1}{2}} (⌈ \frac{i t}{C R_{1}} ⌉ F + G) 4]$
One-to-all	$\| N \| = even$	$\min [(⌈ \frac{(N - 1) t}{C R_{1}} ⌉ F + G) N, \sum_{i = 1}^{\frac{N}{2} - 1} (⌈ \frac{i t}{C R_{1}} ⌉ F + G) 2 N + \sum_{i = 1}^{\frac{N}{2}} (⌈ \frac{i t}{C R_{1}} ⌉ F + G) 2]$

	All-to-all	One-to-all
$\| N \| = odd$	$\min [2 N ⌈ \frac{N (N - 1) t}{2 \bar{T} C R_{1}} ⌉, 4 N ⌈ \frac{\sum_{i = 1}^{\frac{N - 1}{2}} i t}{\bar{T} C R_{1}} ⌉]$	$\min [2 N ⌈ \frac{(N - 1) t}{\bar{T} C R_{1}} ⌉, 8 \sum_{i = 1}^{\frac{N - 1}{2}} ⌈ \frac{i t}{\bar{T} C R_{1}} ⌉]$
$\| N \| = even$	$\min [2 N ⌈ \frac{N (N - 1) t}{2 \bar{T} C R_{1}} ⌉, 2 N ⌈ \frac{\sum_{i = 1}^{\frac{N}{2}} i t}{\bar{T} C R_{1}} ⌉ + 2 N ⌈ \frac{\sum_{i = 1}^{\frac{N}{2} - 1} i t}{\bar{T} C R_{1}} ⌉]$	$\min [2 N ⌈ \frac{(N - 1) t}{\bar{T} C R_{1}} ⌉, 4 \sum_{i = 1}^{\frac{N}{2}} ⌈ \frac{i t}{\bar{T} C R_{1}} ⌉ + 4 \sum_{i = 1}^{\frac{N}{2} - 1} ⌈ \frac{i t}{\bar{T} C R_{1}} ⌉]$

F (GHz)	B/F	8 QAM	16 QAM	32 QAM	64 QAM
31.25	$\approx 0.9$	1010	495	198	138
37.5	$\approx 0.75$	1140	540	205	142
50	0.56	1400	630	220	150

Tr. Matrix	$R$ [km]	$F$ [GHz]	$G$ [GHz]	Gap Alg. 1	Gap Alg. 2
All-to-all	100	6.25	0	0%	11.81%
			6.25	0.53%
			12.5	1.53%
		12.5	0	0.50%
			12.5	0.90%
			25	1.02%
	200	6.25	6.25	0.23%	17.42%
	200	12.5	12.5	0.30%	17.42%
One-to-all	100	6.25	0	0%	19.29%
			6.25	0%
			12.5	0%
		12.5	0	2.91%
			12.5	2.38%
			25	3.81%
	200	6.25	6.25	0.71%	27.13%
	200	12.5	12.5	0.96%	27.13%

All-to-all	$\| N \| = odd$	$\min [(⌈ \frac{N (N - 1) t}{2 C R_{1}} ⌉ F + G) N, (⌈ \frac{\sum_{i = 1}^{\frac{N - 1}{2}} i t}{C R_{1}} ⌉ F + G) 2 N]$
All-to-all	$\| N \| = even$	$\min [(⌈ \frac{N (N - 1) t}{2 C R_{1}} ⌉ F + G) N, (⌈ \frac{\sum_{i = 1}^{\frac{N}{2}} i t}{C R_{1}} ⌉ F + ⌈ \frac{\sum_{i = 1}^{\frac{N}{2} - 1} i t}{C R_{1}} ⌉ F + 2 G) N]$
One-to-all	$\| N \| = odd$	$\min [(⌈ \frac{(N - 1) t}{C R_{1}} ⌉ F + G) N, \sum_{i = 1}^{\frac{N - 1}{2}} (⌈ \frac{i t}{C R_{1}} ⌉ F + G) 4]$
One-to-all	$\| N \| = even$	$\min [(⌈ \frac{(N - 1) t}{C R_{1}} ⌉ F + G) N, \sum_{i = 1}^{\frac{N}{2} - 1} (⌈ \frac{i t}{C R_{1}} ⌉ F + G) 2 N + \sum_{i = 1}^{\frac{N}{2}} (⌈ \frac{i t}{C R_{1}} ⌉ F + G) 2]$

Abstract

Cited By

Figures (9)

Tables (6)

Equations (12)

Journal of Optical Communications and Networking