Virtualization of elastic optical networks and regenerators with traffic grooming

K. D. R. Assis; A. F. Santos; R. C. Almeida; M. J. Reed; B. Jaumard; D. Simeonidou

doi:10.1364/JOCN.398749

Journal of Optical Communications and Networking
Vol. 12,
Issue 12,
pp. 428-442
(2020)
•https://doi.org/10.1364/JOCN.398749

Virtualization of elastic optical networks and regenerators with traffic grooming

K. D. R. Assis, A. F. Santos, R. C. Almeida, M. J. Reed, B. Jaumard, and D. Simeonidou

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
K. D. R. Assis, A. F. Santos, R. C. Almeida, M. J. Reed, B. Jaumard, and D. Simeonidou, "Virtualization of elastic optical networks and regenerators with traffic grooming," J. Opt. Commun. Netw. 12, 428-442 (2020)

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

Abstract

An elastic optical network (EON) plays an important role in transport technology for virtualization of networks. A key aspect of EONs is to establish lightpaths (virtual links) with exactly the amount of spectrum that is needed and with the possibility of grooming, the process of grouping many small traffic flows into larger units, creating a super-lightpath. Grooming eliminates the need for many guard bands between lightpaths and also saves transceivers; however, it often leads to the need to perform optical–electrical–optical conversions to multiple-data-rate optical signals at intermediate nodes. The aim of this paper is to provide a mixed-integer linear programming (MILP) formulation, as well as heuristic and meta-heuristic approaches, for the design of multiple virtual optical networks (VONs) in an elastic optical substrate network with bandwidth-variable lightpaths, modulation format constraints, and virtual elastic regenerator placement. Traffic grooming is allowed inside each VON, and a distance-adaptive modulation format technique is employed to guarantee efficiency in terms of bandwidth for a physical substrate, subject to several virtual topologies. A reduced MILP formulation without grooming capability is also proposed for comparison. The complete MILP formulation jointly solves the virtual topology design, regenerator placement, and grooming problems, as well as the routing, modulation, and spectrum assignment (RMSA) problem. The reduced MILP formulation, heuristics, and meta-heuristic, on the other hand, separate the virtual topology design problem from the RMSA problem. It is shown that the grooming approach can provide good results, since it solves the problem for a complete design when compared to the approach without grooming. Furthermore, heuristic solutions for large networks are proposed, which present good performance (in terms of saving spectrum) for the design with large instances.

Full Article | PDF Article

More Like This

Regeneration and grooming in MPLS over WDM networks

Bruna Nogueira, Ricardo Mendes, Lúcia Martins, Teresa Gomes, Rita Girão-Silva, João Santos, and Tibor Cinkler
J. Opt. Commun. Netw. 11(8) 465-477 (2019)

SLA Formulation for Squeezed Protection in Elastic Optical Networks Considering the Modulation Format

K. D. R. Assis, R. C. Almeida, H. Waldman, A. F. Santos, M. S. Alencar, M. J. Reed, A. Hammad, and D. Simeonidou
J. Opt. Commun. Netw. 11(5) 202-212 (2019)

Network Virtualization Over Elastic Optical Networks With Different Protection Schemes

K. D. R. Assis, S. Peng, R. C. Almeida, H. Waldman, A. Hammad, A. F. Santos, and D. Simeonidou
J. Opt. Commun. Netw. 8(4) 272-281 (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 (10)

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 (10)

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 (31)

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

Reference	Virtualization	Multiple VONs	Grooming	EON	Regen. Placement	MILP/ILP	Heuristic	Survivability/Energy Efficiency
[1]	$X$	–	$X$	–	–	$X$	$X$	–
[3–5,22]	$X$	$X$	–	$X$	–	$X$	$X$	–
[11]	$X$	–	–	$X$	$X$	–	–	–
[12]	$X$	$X$	–	$X$	$X$	$X$	$X$	$X$
[13]	$X$	–	$X$	–	$X$	$X$	$X$	–
[23]	$X$	–	$X$	$X$	$X$	–	$X$	–
Our proposals	$X$	$X$	$X$	$X$	$X$	$X$	$X$	–

Heuristics
	Grooming VTD-H				Non-grooming
Node	$r i_{k}$	$r o_{k}$	${S S R}_{k}$	( $G A - C$ )	( $G A - C$ )	(BL-M $C$ )	(SP-M $C$ )
1	7	7	7
2	12	12	12
3	6	6	6	16	35	36	36
4	6	6	6	(gap = 0%)	(gap = 12%)	(gap = 13.8%)	(gap = 13.8%)
5	12	12	12	$(< 10 s)$	$(< 10 s)$	$(< 10 s)$	$(< 10 s)$
6	7	7	7

MILP
	Grooming				Non-grooming
Node	$r i_{k}$	$r o_{k}$	$S S R_{k}$	$C$	$C$
1	21	21	21
2	31	31	31
3	18	18	18	50*	97*
4	23	23	23
5	33	33	33
6	21	21	21

Heuristics
	Grooming VTD-H				Non-grooming
Node	$r i_{k}$	$r o_{k}$	$S S R_{k}$	(GA- $C$ )	(GA- $C$ )	(BL-M $C$ )	(SP-M $C$ )
1	23	23	23
2	39	39	39
3	20	20	20	50	99	100	100
4	21	21	21	(gap = 0%)	(gap = 2.02%)	(gap = 3%)	(gap = 3%)
5	40	40	40	$(< 10 s)$	$(< 10 s)$	$(< 10 s)$	$(< 10 s)$
6	23	23	23

MILP
	Grooming				Non-grooming
Node	$r i_{k}$	$r o_{k}$	$S S R_{k}$	$C$	$C$
1	5	5	5
2	7	7	7
3	5	4	5	11	23
4	6	6	6		(67 s)
5	8	8	8
6	4	5	5

					Grooming		Non-Grooming
					VTD-H(GA)		(GA)		(BL-M)		(SP-M)
					$T = 1$	$T = 3$	$T = 1$	$T = 3$	$T = 1$	$T = 3$	$T = 1$	$T = 3$
Network ID	Name	$N$ (Number of Nodes)	$L$ (Links)	Nodal Degree (Mean)	$C$	$C$	C	C	C	C	C	C
1	8-NODES NET	8	$2 \times 12$	3	11	35	25	67	27	70	35	98
2	METRO	10	$2 \times 16$	3.2	21	65	32	95	35	98	38	107
3	ABILENE	11	$2 \times 14$	2.55	60	182	130	362	145	386	187	553
4	PAN EUROP	11	$2 \times 26$	4.72	10	32	22	71	27	71	62	158
5	FINLAND	12	$2 \times 19$	3.16	24	74	55	160	57	163	86	248
6	BRAZILIAN	12	$2 \times 20$	3.33	35	107	76	220	86	249	112	281
7	NSFNET	14	$2 \times 21$	3	98	296	115	342	144	371	189	554
8	JAPAN	14	$2 \times 22$	3.15	33	101	71	201	71	201	82	235
9	DEUTSCHE	14	$2 \times 23$	3.28	27	83	57	177	69	200	75	217
10	PACIFIC BELL	17	$2 \times 23$	2.7	100	314	196	553	196	553	221	584
11	EON	19	$2 \times 38$	4	136	410	176	530	221	589	266	744
12	USA	24	$2 \times 43$	3.58	256	610	328	963	355	981	585	1721

Node $k$		1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20	21	22	23	24	$n_{t}$
1	EIGHT	7	16	15	12	12	12	8	12	.	.	.	.	.	.	.	.	.	.	.	.	.	.	.	.	94
2	METRO	25	26	26	26	17	18	17	17	9	9	.	.	.	.	.	.	.	.	.	.	.	.	.	.	190
3	ABIL	25	36	35	18	12	18	35	35	23	19	10	.	.	.	.	.	.	.	.	.	.	.	.	.	266
4	PAN E	15	24	16	20	19	20	20	20	19	15	16	.	.	.	.	.	.	.	.	.	.	.	.	.	204
5	FINLA	18	36	24	24	23	18	23	22	25	26	23	22	.	.	.	.	.	.	.	.	.	.	.	.	284
6	BRAZ	11	16	29	33	34	41	33	26	11	19	22	14	.	.	.	.	.	.	.	.	.	.	.	.	289
7	NSF	22	25	27	38	37	51	19	24	31	43	27	23	23	21	.	.	.	.	.	.	.	.	.	.	411
8	JAPAN	16	25	25	42	71	35	36	36	33	30	14	53	14	16	.	.	.	.	.	.	.	.	.	.	446
9	DT	16	15	33	48	62	33	16	7	25	28	43	19	63	33	19	.	.	.	.	.	.	.	.	.	460
10	PA.BE	112	35	28	100	74	42	66	18	17	28	32	25	35	42	25	16	25	.	.	.	.	.	.	.	720
11	EON	33	36	24	18	18	83	99	57	26	36	23	34	64	33	25	25	82	26	18	.	.	.	.	.	760
12	USA	23	35	47	24	23	126	123	69	143	125	120	95	95	66	56	104	97	53	50	36	40	46	39	23	1658

Abstract

Cited By

Figures (10)

Tables (10)

Equations (31)

Journal of Optical Communications and Networking