4.2 Article

Confidentiality meets protection in elastic optical networks

期刊

OPTICAL SWITCHING AND NETWORKING
卷 42, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.osn.2021.100620

关键词

Routing and spectrum allocation; Security; Protection; Network coding; ILP

资金

  1. European Union [739551]
  2. Government of the Republic of Cyprus
  3. Cyprus Research and Innovation Foundation [CULTURE/AWARD-YR/0418/0014]

向作者/读者索取更多资源

This work explores the use of network coding and backup path computation to secure confidential connections in elastic optical networks and maintain the security level in case of link failures.
This work considers the joint problem of securing confidential demands against eavesdropping attacks and protecting the network against link failures in elastic optical networks (EONs). Network coding is used to provide security for confidential connections by encrypting the data through XOR operations at the physical layer with other established connections in the network. Backup paths are also computed for protecting the primary path of the confidential connections, while ensuring that the level of security for the confidential demands is preserved in case of a link failure on the primary path or on any of the paths involved in the XOR process. A realistic network scenario is modeled, where four different classes of connections are considered with respect to their protection and security requirements, while a combination of novel integer linear programming (ILP) and heuristic algorithms are used to establish each class of demands in the network. The proposed algorithms are evaluated in terms of spectrum utilization, network blocking, and level of security provided. From the results obtained it is evident that confidential connections can be transmitted in a secure manner, while for the classes that require both security and protection, the connections retain their required level of security in the event of any single link failure in the network.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据