Survivable virtual topology mapping for single-node failure in IP over WDM network

Objective: Optical networks exploit the Wavelength Division Multiplexing (WDM) to meet the ever-growing bandwidth demands of upcoming communication applications. This is achieved by dividing the enormous transmission bandwidth of fiber into smaller communication channels. The major problem with WDM network design is to find an optimal path between two end users and allocate an available wavelength to the chosen path for the successful data transmission. Methods: This communication over a WDM network is carried out through lightpaths. The merging of all these lightpaths in an optical network generates a virtual topology which is suitable for the optimal network design to meet the increasing traffic demands. But, this virtual topology design is an NP-hard problem. This paper aims to explore Mixed Integer Linear Programming (MILP) framework to solve this design issue. Results: The comparative results of the proposed and existing mathematical models show that the proposed algorithm outperforms with the various performance parameters. Conclusion: Finally, it is concluded that network congestion is reduced marginally in the overall performance of the network.

Download Full-text

Analysis of the End-to-End Protection and Restoration Algorithm in the IP over WDM Network

Information Networking: Wired Communications and Management - Lecture Notes in Computer Science ◽

10.1007/3-540-45803-4_62 ◽

2002 ◽

pp. 687-698

Author(s):

Young Ae Kim ◽

Jun Kyun Choi

Keyword(s):

Ip Over Wdm ◽

Wdm Network ◽

Restoration Algorithm ◽

End To End

Download Full-text

A Blockchain-Based Authentication and Dynamic Group Key Agreement Protocol

Sensors ◽

10.3390/s20174835 ◽

2020 ◽

Vol 20 (17) ◽

pp. 4835

Author(s):

Zisang Xu ◽

Feng Li ◽

Han Deng ◽

Minfu Tan ◽

Jixin Zhang ◽

...

Keyword(s):

Key Agreement ◽

Group Communication ◽

Single Node ◽

Node Failure ◽

Group Key ◽

Group Key Agreement ◽

Key Agreement Protocol ◽

Dynamic Group ◽

Group Members ◽

Group Key Agreement Protocol

With the rapid development of mobile networks, there are more and more application scenarios that require group communication. For example, in mobile edge computing, group communication can be used to transmit messages to all group members with minimal resources. The group key directly affects the security of the group communication. Most existing group key agreement protocols are often flawed in performance, scalability, forward or backward secrecy, or single node failure. Therefore, this paper proposes a blockchain-based authentication and dynamic group key agreement protocol. With our protocol, each group member only needs to authenticate its left neighbor once to complete the authentication, which improved authentication efficiency. In addition, our protocol guarantees the forward secrecy of group members after joining the group and the backward secrecy of group members after leaving the group. Based on blockchain technology, we solve the problem of single node failure. Furthermore, we use mathematics to prove the correctness and security of our protocol, and the comparison to related protocols shows that our protocol reduces computation and communication costs.

Download Full-text