Eavesdropping-Aware Routing and Spectrum/Code Allocation in OFDM-Based EONs Using Spread Spectrum Techniques

Giannis Savva; Konstantinos Manousakis; Georgios Ellinas

doi:10.1364/JOCN.11.000409

Journal of Optical Communications and Networking
Vol. 11,
Issue 7,
pp. 409-421
(2019)
•https://doi.org/10.1364/JOCN.11.000409

Eavesdropping-Aware Routing and Spectrum/Code Allocation in OFDM-Based EONs Using Spread Spectrum Techniques

Giannis Savva, Konstantinos Manousakis, and Georgios Ellinas

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Giannis Savva, Konstantinos Manousakis, and Georgios Ellinas, "Eavesdropping-Aware Routing and Spectrum/Code Allocation in OFDM-Based EONs Using Spread Spectrum Techniques," J. Opt. Commun. Netw. 11, 409-421 (2019)

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

Abstract

In this work, eavesdropping-aware routing and spectrum/code allocation techniques are proposed for elastic optical networks (EONs) using orthogonal frequency division multiplexing (OFDM). To introduce physical (optical) layer security and protect these networks against eavesdropping attacks, spread spectrum (SS) with signal overlapping techniques are used to encode each requested confidential connection. In order to make sense of accessed information and compromise a confidential connection, an eavesdropper will now have to lock on the correct frequency, determine the correct code and symbol sequence among co-propagated overlapped signals, and decode the signal. Different novel policies are presented for the assignment of spectrum and the codes for each confidential demand along with different routing strategies, resulting in an extra layer of security for confidential demands. Depending on the spectrum/code allocation and routing policies utilized, different (extra) levels of security are added for confidential connections while also considering the spectrum utilization, the blocking rate, and the algorithmic time complexity required for connection provisioning.

Full Article | PDF Article

More Like This

Security enhanced routing and spectrum allocation against crosstalk attacks for confidential lightpath in elastic optical networks

Liyazhou Hu, Wei Wang, Yuanyuan Pan, Tianhe Liu, Yajie Li, Yongli Zhao, and Jianqing Li
Opt. Express 32(5) 7254-7275 (2024)

Fragmentation-Aware Routing and Spectrum Allocation Scheme Based on Distribution of Traffic Bandwidth in Elastic Optical Networks

Xin Chen, Juhao Li, Paikun Zhu, Ruizhi Tang, Zhangyuan Chen, and Yongqi He
J. Opt. Commun. Netw. 7(11) 1064-1074 (2015)

Holding-Time- and Impairment-Aware Shared Spectrum Allocation in Mixed-Line-Rate Elastic Optical Networks

Jijun Zhao, Bowen Bao, Hui Yang, Eiji Oki, and Bijoy Chand Chatterjee
J. Opt. Commun. Netw. 11(6) 322-332 (2019)

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

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

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

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

	Case 1	Case 2	Case 3
T	$\frac{M \cdot (M + 1)}{2}$	–	–
P1	$\frac{M \cdot (M + 1)}{2} \cdot \sum_{i = 1}^{n} 2^{2^{i}}$	$\sum_{i = 1}^{n} 2^{2^{i}}$	$\sum_{i = 1}^{n} 2^{i}$
P2	$\sum_{i = 1}^{M} (i \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{M - i + 1})$	${(\sum_{i = 1}^{n} 2^{2^{i}})}^{x}$	${(\sum_{i = 1}^{n} 2^{i})}^{x}$

Number of Frequency Slots	Combinations (Slot id)	Number of Code Choices	Overall Combinations
1	1	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{1}$	$3 \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{1}$
	2
	3
2	1–2	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$	$2 \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$
2	2–3	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$	$2 \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$
3	1–3	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{3}$	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{3}$

		Case 1	Case 2	Case 3
$M = 320$	Typical RSA	$10^{5}$	–	–
$n = 3$	RSA-CCP	$10^{8}$	$10^{3}$	$10^{1}$
$x = 5$	RSA-FCAP	inf	$10^{16}$	$10^{11}$
$M = 320$	Typical RSA	$10^{5}$	–	–
$n = 4$	RSA-CCP	$10^{10}$	$10^{5}$	$10^{1}$
$x = 10$	RSA-FCAP	inf	$10^{52}$	$10^{19}$
$M = 320$	Typical RSA	$10^{5}$	–	–
$n = 4$	RSA-CCP	$10^{10}$	$10^{5}$	$10^{1}$
$x = 20$	RSA-FCAP	inf	$10^{101}$	$10^{34}$

	Case 1	Case 2	Case 3
T	$\frac{M \cdot (M + 1)}{2}$	–	–
P1	$\frac{M \cdot (M + 1)}{2} \cdot \sum_{i = 1}^{n} 2^{2^{i}}$	$\sum_{i = 1}^{n} 2^{2^{i}}$	$\sum_{i = 1}^{n} 2^{i}$
P2	$\sum_{i = 1}^{M} (i \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{M - i + 1})$	${(\sum_{i = 1}^{n} 2^{2^{i}})}^{x}$	${(\sum_{i = 1}^{n} 2^{i})}^{x}$

Number of Frequency Slots	Combinations (Slot id)	Number of Code Choices	Overall Combinations
1	1	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{1}$	$3 \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{1}$
	2
	3
2	1–2	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$	$2 \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$
2	2–3	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$	$2 \cdot {(\sum_{j = 1}^{n} 2^{2^{j}})}^{2}$
3	1–3	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{3}$	${(\sum_{j = 1}^{n} 2^{2^{j}})}^{3}$

Abstract

Cited By

Figures (13)

Tables (5)

Equations (3)

Journal of Optical Communications and Networking