New Strategies for Connection Protection in Mixed-Line-Rate Optical WDM Networks

Menglin Liu; Massimo Tornatore; Biswanath Mukherjee

doi:10.1364/JOCN.3.000641

Journal of Optical Communications and Networking
Vol. 3,
Issue 9,
pp. 641-650
(2011)
•https://doi.org/10.1364/JOCN.3.000641

New Strategies for Connection Protection in Mixed-Line-Rate Optical WDM Networks

Menglin Liu, Massimo Tornatore, and Biswanath Mukherjee

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Menglin Liu, Massimo Tornatore, and Biswanath Mukherjee, "New Strategies for Connection Protection in Mixed-Line-Rate Optical WDM Networks," J. Opt. Commun. Netw. 3, 641-650 (2011)

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

Related Topics
Table of Contents Category
- Research Papers
Optics & Photonics Topics
?

The topics in this list come from the Optics and Photonics Topics applied to this article.

About this Article
History
- Original Manuscript: November 18, 2010
- Revised Manuscript: July 5, 2011
- Manuscript Accepted: July 10, 2011
- Published: August 9, 2011

Abstract

Today’s optical wavelength division multiplexing backbone networks need to support traffic demands with very diverse capacity requirements. Recent studies have shown how to design an optical transport network that supports mixed line rates (MLR), where the wavelength channels of the optical paths (i.e., lightpaths) can have a variety of capacities (10/40/100 Gbps). Some preliminary work on the design of MLR optical networks has already appeared, but survivability, which is a key concern in optical network design, is a nascent topic in MLR networks. This study investigates the problem of protection in MLR optical networks: in particular, we study how to design a cost-effective transparent MLR network that provides dedicated protection at the lightpath level. We propose three mechanisms: MLR-at-p-lightpath protection (MLR-p), MLR-at-lightpath protection (MLR-l), and MLR-with-backup-flow-grooming protection (MLR-g). The design problem is solved by two different approaches: (1) a two-step approach that formulates part of the problem as an integer linear program and (2) a heuristic approach. Our results show that, by appropriate assignment of rates to lightpaths, MLR networks can provide protection for diverse traffic demands with much lower transponder cost compared to single-line-rate networks.

Full Article | PDF Article

More Like This

Efficient Shared Subconnection Protection in Mixed-Line-Rate Optical WDM Networks

Menglin Liu, Massimo Tornatore, and Biswanath Mukherjee
J. Opt. Commun. Netw. 5(11) 1227-1235 (2013)

Survivable Impairment-Aware Traffic Grooming and Regenerator Placement With Connection-Level Protection

Chengyi Gao, Hakki C. Cankaya, Ankitkumar N. Patel, Jason P. Jue, Xi Wang, Qiong Zhang, Paparao Palacharla, and Motoyoshi Sekiya
J. Opt. Commun. Netw. 4(3) 259-270 (2012)

Regenerator Site Selection in Mixed Line Rate Waveband Optical Networks

Saket Varma and Jason P. Jue
J. Opt. Commun. Netw. 5(3) 198-209 (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 (12)

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

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

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

p-Lightpath	Working/feasible bit rates (Gbps)	Backup/feasible bit rates (Gbps)
No. 1	$1 \to 2$ /10, 40, 100	$1 \to 3 \to 4 \to 2$ /10, 40
No. 2	$1 \to 3 \to 4 \to 2$ /10, 40	$1 \to 2$ /10, 40, 100
No. 3	$1 \to 5 \to 4 \to 2$ /10, 40	$1 \to 2$ /10, 40, 100

Approach	# of variables	# of constraints
MLR-p	$η \cdot K \cdot R + η^{2} \cdot K$	$η \cdot K + L + N η$
MLR-l	$2 η \cdot K \cdot R + η^{2} \cdot K$	$2 η \cdot K + L + N η$
MLR-g	$2 η \cdot K \cdot R + η^{2} \cdot K$	$2 η \cdot K + L + N η$

p-Lightpath	Working/feasible bit rates (Gbps)	Backup/feasible bit rates (Gbps)
$1 \to 2$	$1 \to 2$ /10, 40, 100	$1 \to 3 \to 4 \to 2$ /10, 40
$1 \to 3$	$1 \to 3$ /10, 40, 100	$1 \to 2 \to 4 \to 3$ /10, 40
$1 \to 4$	$1 \to 3 \to 4$ /10, 40, 100	$1 \to 2 \to 4$ /10, 40, 100
$1 \to 5$	$1 \to 5$ /10, 40, 100	$1 \to 2 \to 4 \to 5$ /10, 40
$1 \to 6$	$1 \to 5 \to 6$ /10, 40	$1 \to 2 \to 4 \to 6$ /10, 40
$2 \to 3$	$2 \to 1 \to 3$ /10, 40, 100	$2 \to 4 \to 3$ /10, 40
$2 \to 4$	$2 \to 4$ /10, 40, 100	$2 \to 1 \to 3 \to 4$ /10, 40
$2 \to 5$	$2 \to 4 \to 5$ /10, 40, 100	$2 \to 1 \to 5$ /10, 40
$2 \to 6$	$2 \to 4 \to 6$ /10, 40, 100	$2 \to 1 \to 5 \to 6$ /10, 40
$3 \to 4$	$3 \to 4$ /10, 40, 100	$3 \to 1 \to 2 \to 4$ /10, 40
$3 \to 5$	$3 \to 1 \to 5$ /10, 40, 100	$3 \to 4 \to 5$ /10, 40
$3 \to 6$	$3 \to 4 \to 6$ /10, 40, 100	$3 \to 1 \to 5 \to 6$ /10, 40
$4 \to 5$	$4 \to 5$ /10, 40, 100	$4 \to 6 \to 5$ /10, 40, 100
$4 \to 6$	$4 \to 6$ /10, 40, 100	$4 \to 5 \to 6$ /10, 40, 100
$5 \to 6$	$5 \to 6$ /10, 40, 100	$5 \to 4 \to 6$ /10, 40, 100

$Λ_{1}$	$1 \to 4$	60 Gbps
$Λ_{2}$	$4 \to 6$	20 Gbps
$Λ_{3}$	$1 \to 6$	10 Gbps

Traffic	10G	40G	100G	MLR-p	MLR-l	MLR-g
1X	98	99	105	97.5	97.5	97.5
5X	376	285	240	240	240	240
10X	776	505	412.5	400	397.25	397.25
15X	–	725	585	572	545.25	545.25
20X	–	940	765	735	720	711.75
25X	–	1150	952.5	895	866.5	866.5
30X	–	1375	1132.5	1062.5	1024.5	1022.75
35X	–	1605	1320	1235	1182	1175.5
40X	–	–	1507.5	1390	1341.75	1324.75
45X	–	–	1687.5	1576.5	1503	1485.75
50X	–	–	1867.5	1767.5	1659.5	1644.5

Node	1	2	3	4	5	6	7	8	9	10	11
1	0	1	1	3	1	1	1	1	1	1	1
2	1	0	5	8	4	1	1	10	3	2	3
3	1	5	0	8	4	1	1	5	3	1	2
4	3	8	8	0	6	2	2	11	11	9	9
5	1	4	4	6	0	1	1	6	6	1	2
6	1	1	1	2	1	0	1	1	1	1	1
7	1	1	1	2	1	1	0	1	1	1	1
8	1	10	5	11	6	1	1	0	6	2	5
9	1	3	3	11	6	1	1	6	0	3	6
10	1	2	1	9	1	1	1	2	3	0	3
11	1	3	2	9	2	1	1	5	6	3	0

Traffic	Running time of the ILP (seconds)
10X	18,706.56
15X	15,000.98
20X	10,996.4
25X	11,036.29
30X	10,679.86
35X	8417.02
40X	7235.2
45X	10,726.94
50X	7307

Traffic	Two-step approach	Heuristic approach	Difference
1X	97.5	112.25	12.05%
5X	240	264.5	10.2%
10X	397.25	435	9.5%
15X	545.25	580.75	6.51%
20X	720	763	6.4%
25X	866.5	895.25	5.97%
30X	1024.5	1068.5	4.35%
35X	1182	1208.75	2.26%
40X	1341.75	1352.5	0.08%
45X	1503	1522.25	1.38%
50X	1659.5	1676.5	1.2%

Traffic	10G	MLR-p	MLR-l	MLR-g
0.2X	90	90	90	88
0.4X	164	150.5	150.5	150.5
0.6X	236	211	211	209.25
0.8X	314	273	269	267
1X	384	335.5	334.5	332
1.2X	488	403.5	400	395.25
1.3X	–	473	456.25	456.25

Node	1	2	3	4	5	6	7	8	9	10	11
1	0	1	1	3	1	1	1	1	1	1	1
2	1	0	5	8	4	1	1	10	3	2	3
3	1	5	0	8	4	1	1	5	3	1	2
4	3	8	8	0	6	2	2	11	11	9	9
5	1	4	4	6	0	1	1	6	6	1	2
6	1	1	1	2	1	0	1	1	1	1	1
7	1	1	1	2	1	1	0	1	1	1	1
8	1	10	5	11	6	1	1	0	6	2	5
9	1	3	3	11	6	1	1	6	0	3	6
10	1	2	1	9	1	1	1	2	3	0	3
11	1	3	2	9	2	1	1	5	6	3	0

Node	1	2	3	4	5	6	7	8	9	10	11
1	0	1	1	3	1	1	1	1	1	1	1
2	1	0	5	8	4	1	1	10	3	2	3
3	1	5	0	8	4	1	1	5	3	1	2
4	3	8	8	0	6	2	2	11	11	9	9
5	1	4	4	6	0	1	1	6	6	1	2
6	1	1	1	2	1	0	1	1	1	1	1
7	1	1	1	2	1	1	0	1	1	1	1
8	1	10	5	11	6	1	1	0	6	2	5
9	1	3	3	11	6	1	1	6	0	3	6
10	1	2	1	9	1	1	1	2	3	0	3
11	1	3	2	9	2	1	1	5	6	3	0

Node	1	2	3	4	5	6	7	8	9	10	11
1	0	1	1	3	1	1	1	1	1	1	1
2	1	0	5	8	4	1	1	10	3	2	3
3	1	5	0	8	4	1	1	5	3	1	2
4	3	8	8	0	6	2	2	11	11	9	9
5	1	4	4	6	0	1	1	6	6	1	2
6	1	1	1	2	1	0	1	1	1	1	1
7	1	1	1	2	1	1	0	1	1	1	1
8	1	10	5	11	6	1	1	0	6	2	5
9	1	3	3	11	6	1	1	6	0	3	6
10	1	2	1	9	1	1	1	2	3	0	3
11	1	3	2	9	2	1	1	5	6	3	0

Abstract

Cited By

Figures (12)

Tables (9)

Equations (14)

Journal of Optical Communications and Networking

Node	1	2	3	4	5	6	7	8	9	10	11
1	0	1	1	3	1	1	1	1	1	1	1
2	1	0	5	8	4	1	1	10	3	2	3
3	1	5	0	8	4	1	1	5	3	1	2
4	3	8	8	0	6	2	2	11	11	9	9
5	1	4	4	6	0	1	1	6	6	1	2
6	1	1	1	2	1	0	1	1	1	1	1
7	1	1	1	2	1	1	0	1	1	1	1
8	1	10	5	11	6	1	1	0	6	2	5
9	1	3	3	11	6	1	1	6	0	3	6
10	1	2	1	9	1	1	1	2	3	0	3
11	1	3	2	9	2	1	1	5	6	3	0

Node	1	2	3	4	5	6	7	8	9	10	11
1	0	1	1	3	1	1	1	1	1	1	1
2	1	0	5	8	4	1	1	10	3	2	3
3	1	5	0	8	4	1	1	5	3	1	2
4	3	8	8	0	6	2	2	11	11	9	9
5	1	4	4	6	0	1	1	6	6	1	2
6	1	1	1	2	1	0	1	1	1	1	1
7	1	1	1	2	1	1	0	1	1	1	1
8	1	10	5	11	6	1	1	0	6	2	5
9	1	3	3	11	6	1	1	6	0	3	6
10	1	2	1	9	1	1	1	2	3	0	3
11	1	3	2	9	2	1	1	5	6	3	0