Migration Plan With Minimum Overall Migration Time or Cost

Brigitte Jaumard; Hamed Pouya

doi:10.1364/JOCN.10.000001

Journal of Optical Communications and Networking
Vol. 10,
Issue 1,
pp. 1-13
(2018)
•https://doi.org/10.1364/JOCN.10.000001

Migration Plan With Minimum Overall Migration Time or Cost

Brigitte Jaumard and Hamed Pouya

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Brigitte Jaumard and Hamed Pouya, "Migration Plan With Minimum Overall Migration Time or Cost," J. Opt. Commun. Netw. 10, 1-13 (2018)

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

Abstract

Telecommunication is a fast growing industry entailing regular technology developments. Communication service providers (CSPs) have to adapt to the latest technologies by upgrading their networks. For instance, most CSPs are expected to operate SONET/SDH infrastructures until the end of this decade (2020), before ultimately migrating to IP-centric software-defined networks (SDNs). Such a migration is a major undertaking. CSPs need effective optimization algorithms in order to predict the time and resources required for the circuit migration of large networks, which can stretch up to several years. We propose an optimization framework that builds a migration plan with minimum overall migration time or cost, i.e., that estimates the number of maintenance windows, engineers, and technicians required to perform the network migration. The network migration problem is formulated as a set of circuit migration problems, each requiring technician synchronization to minimize outages. We propose a two-phase algorithm that relies on the solution of column generation models to provide accurate migration plans for realistic size networks. Extensive numerical experiments are conducted on several network migration data instances arising from customers of Ciena.

Full Article | PDF Article

More Like This

Efficient Routing and Bandwidth Assignment for Inter-Data-Center Live Virtual-Machine Migrations

Omran Ayoub, Francesco Musumeci, Massimo Tornatore, and Achille Pattavina
J. Opt. Commun. Netw. 9(3) B12-B21 (2017)

Rational Agent-Based Decision Algorithm for Strategic Converged Network Migration Planning

Sai Kireet Patri, Elena Grigoreva, Wolfgang Kellerer, and Carmen Mas Machuca
J. Opt. Commun. Netw. 11(7) 371-382 (2019)

Methodology for a Cost Evaluation of Migration Toward NGOA Networks

Carmen Mas Machuca, Mario Kind, Kun Wang, Koen Casier, Mozhgan Mahloo, and Jiajia Chen
J. Opt. Commun. Netw. 5(12) 1456-1466 (2013)

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

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

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

				Site		Region
Data Sets	# of Circuits	# of Sites	# of Regions	$μ$	$s d$	$μ$	$s d$
DS-I	133	43	23	6.18	8.6	11.56	14.44
DS-II	247	20	14	24.70	14.0	35.28	34.70
DS-III	5824	9	7	1294.22	690.1	1664.00	1001.27
DS-IV	24,268	301	172	161.24	350.84	282.19	519.13

							Cost					Full Shifts
Data Set	$\sum_{r \in R} {\bar{n}}_{r}^{TECH}$	${\bar{n}}_{MAX}^{ENG}$	${\bar{n}}_{MAX}^{CIR}$	# MW	Technicians Used	Average Usage of Shifts (%)	Tech	Eng	Travel	Total	Cost Per Circuit	6 h	8 h
DS-I	35	2	30	6	29	26.71	36,288	9408	582	46,278	347.95	0	4
		2	40	5	30	28.94	34,344	8904	544	43,792	329.26	0	4
		3	30	6	29	28.98	33,912	8792	537	43,241	325.12	0	4
		3	40	5	30	30.98	31,752	8232	503	40,487	304.41	0	4
		4	30	5	28	32.08	31,104	8064	493	39,661	298.20	0	4
		4	40	5	28	32.13	30,888	8008	489	39,385	296.13	0	4
	46	2	30	6	29	26.71	36,288	9408	575	46,271	347.90	0	4
		2	40	5	28	28.95	34,128	8848	540	43,516	327.19	0	4
		3	30	6	29	28.98	33,912	8792	527	43,231	325.05	0	4
		3	40	5	30	30.98	31,752	8232	496	40,480	304.36	0	4
		4	30	5	28	32.13	30,888	8008	489	39,385	296.13	0	4
		4	40	5	28	32.50	30,456	7896	482	38,834	291.99	0	4
DS-II	25	3	30	9	19	30.70	55,512	14,392	423	70,327	284.72	1	5
		3	40	9	18	33.14	51,624	13,384	393	65,401	264.78	1	3
		4	30	7	18	34.73	49,248	12,768	375	62,391	252.60	1	5
		4	40	7	19	36.53	46,656	12,096	356	59,108	239.30	1	3
	42	3	30	9	19	31.97	53,784	13,944	412	68,140	275.87	2	4
		3	40	9	18	34.11	50,328	13,048	386	63,762	258.14	3	4
		4	30	7	18	34.82	49,032	12,712	376	62,120	251.50	3	4
		4	40	7	19	37.58	45,360	11,760	347	57,467	232.66	3	4
DS-III	28	4	40	231	11	93.57	441,288	114,408	0	555,696	95.41	0	462
		4	50	122	14	93.89	439,992	114,072	0	554,064	95.13	0	474
		5	40	231	11	93.57	441,288	114,408	0	555,696	95.41	0	462
		5	50	122	15	94.57	437,616	113,456	0	551,072	94.62	1	472
	63	4	40	231	11	93.57	441,288	114,408	0	555,696	95.41	0	462
		4	50	122	16	97.39	427,896	110,936	0	538,832	92.52	2	473
		5	40	231	11	93.57	441,288	114,408	0	555,696	95.41	0	462
		5	50	122	16	97.39	427,896	110,936	0	538,832	92.52	2	473
DS-IV	344	4	85	394	260	68.10	2,395,870	621,152	0	3,017,022	124.32	27	1631
		4	100	332	310	68.81	2,375,350	615,832	0	2,991,182	123.26	24	1628
		5	85	373	258	68.46	2,386,370	618,688	0	3,005,058	123.83	33	1623
		5	100	312	313	68.87	2,372,980	615,216	0	2,988,196	123.13	25	1636
	513	4	85	392	303	68.89	2,372,760	615,160	0	2,987,920	123.12	24	1636
		4	100	325	267	69.33	2,359,580	611,744	0	2,971,324	122.44	21	1639
		5	85	373	263	68.91	2,371,900	614,936	0	2,986,836	123.08	28	1636
		5	100	317	313	69.59	2,353,100	610,064	0	2,963,164	122.10	30	1635

Data Set	# Available Technicians	${\bar{n}}_{MAX}^{ENG}$	${\bar{n}}_{MAX}^{CIR}$	CPU Time (min)	# Selected Tech Shifts
DS I	35	2	30	3	50
		2	40	1	50
		3	30	2	49
		3	40	1	45
		4	30	2	43
		4	40	1	41
	46	2	30	2	50
		2	40	3	49
		3	30	1	46
		3	40	1	44
		4	30	1	41
		4	40	1	41
DS II	25	3	30	16	81
		3	40	5	77
		4	30	9	75
		4	40	6	73
	42	3	30	24	78
		3	40	6	76
		4	30	6	74
		4	40	2	68
DS III	28	4	40	58	527
		4	50	43	517
		5	40	63	527
		5	50	38	512
	63	4	40	61	527
		4	50	37	502
		5	40	59	527
		5	50	40	502
DS IV	344	4	85	160	4904
		4	100	144	4842
		5	85	148	4884
		5	100	108	4834
	513	4	85	204	4832
		4	100	224	4792
		5	85	216	4830
		5	100	146	4776

${\bar{n}}_{MAX}^{ENG}$	${\bar{n}}_{MAX}^{CIRC}$	# Available Technicians	Unit Circuit Cost ($)	# Available Technicians	Unit Circuit Cost ($)
DS-I
2	30	35	347.95	46	347.90
3	30		325.12		325.05
4	30		298.20		296.13
2	40		329.26		327.19
3	40		304.41		304.36
4	40		296.13		291.99
DS-II
3	30	25	284.72	42	275.87
4	30		252.60		251.50
3	40		264.78		239.30
4	40		258.14		232.66
DS-III
4	40	28	95.41	63	95.41
5	40		95.41		95.41
4	50		95.13		92.52
5	50		94.62		92.52
DS-IV
4	85	344	124.32	513	123.12
5	85		123.83		123.08
4	100		123.26		122.44
5	100		123.13		122.10

	# Total Circuits	# Circuits Migrated in
	# Total Circuits	STP	MTP
DS-I	133	48	85
DS-II	247	0	247
DS-III	5824	5544	280
DS-IV	24,268	16,176	8092

Abstract

Cited By

Figures (7)

Tables (6)

Equations (42)

Journal of Optical Communications and Networking