Topology Design and Identification for Dynamic Networks

2017 ◽  
pp. 209-235
Author(s):  
Chuangchuang Sun ◽  
Ran Dai
Keyword(s):  
Dynamic Networks ◽  
Topology Design

Performance Modeling and Analysis of WDM Optical Networks under Wavelength Continuity Constraint using MILP

2020 ◽  
Vol 13 (2) ◽  
pp. 203-211 ◽  
Author(s):  
Swati Bhalaik ◽  
Ashutosh Sharma ◽  
Rajiv Kumar ◽  
Neeru Sharma
Keyword(s):  
Network Design ◽  
Optical Networks ◽  
Wavelength Division Multiplexing ◽  
Optical Network ◽  
Optimal Path ◽  
Topology Design ◽  
Mixed Integer ◽  
Wdm Optical Networks ◽  
Virtual Topology ◽  
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.

Mathematics of networks

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Random Walks ◽  
Adjacency Matrix ◽  
Graph Partitioning ◽  
Dynamic Networks ◽  
Graph Laplacian ◽  
Network Visualization ◽  
Final Part ◽  
Bipartite Networks ◽  
Component Structure ◽  
Basic Properties

An introduction to the mathematical tools used in the study of networks. Topics discussed include: the adjacency matrix; weighted, directed, acyclic, and bipartite networks; multilayer and dynamic networks; trees; planar networks. Some basic properties of networks are then discussed, including degrees, density and sparsity, paths on networks, component structure, and connectivity and cut sets. The final part of the chapter focuses on the graph Laplacian and its applications to network visualization, graph partitioning, the theory of random walks, and other problems.

Routing in Large-scale Dynamic Networks

2020 ◽  
Vol 20 (4) ◽  
pp. 1-24
Author(s):  
Weichao Gao ◽  
James Nguyen ◽  
Yalong Wu ◽  
William G. Hatcher ◽  
Wei Yu
Keyword(s):  
Large Scale ◽  
Dynamic Networks

scholarly journals A Framework for Project Risk Assessment in Dynamic Networks: A Case Study of Oil and Gas Megaproject Construction

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Amir Farmahini Farahani ◽  
Kaveh Khalili-Damghani ◽  
Hosein Didehkhani ◽  
Amir Homayoun Sarfaraz ◽  
Mehdi Hajirezaie
Keyword(s):  
Risk Assessment ◽  
Oil And Gas ◽  
Dynamic Networks ◽  
Project Risk ◽  
Project Risk Assessment
Sign in / Sign up

Export Citation Format

Share Document