A path and algorithm scoring method for automatic planning and optimization of optical networks

Minye Ni; Hui Li; Manman Bu; Yuefeng Ji

doi:10.1117/12.2547824

18 December 2019 A path and algorithm scoring method for automatic planning and optimization of optical networks

Minye Ni, Hui Li, Manman Bu, Yuefeng Ji

Proceedings Volume 11340, AOPC 2019: Optical Fiber Sensors and Communication; 113401G (2019) https://doi.org/10.1117/12.2547824
Event: Applied Optics and Photonics China (AOPC2019), 2019, Beijing, China

Abstract

This paper presents a path and algorithm scoring method, which can quantitatively evaluate the degree of optimization and intelligently alert potential problems to realize automatic planning and maintenance of optical networks. Since the development of the networks, there is a growing demand for high speed, low latency, and low power consumption. Path selection has always been a problem that needs to be considered in detail in network communication. The combination of classical graph theory and continuously developed algorithms makes algorithms appear constantly. It is found that the increase in the number of services makes the high separation between the actual paths and optimal paths. Combining the scores, we can allocate routing and spectrum for different types of services, meanwhile the average running time of a single service performs lower using the path and algorithm scoring method, which will save a lot of processing time. The result of the simulation shows that as the number of services increases, the scoring method has a clear advantage in processing services. According to this method, a data foundation can be provided for automatic optimization threshold monitoring for operators to adjust the network in advance.

Citation Download Citation

Minye Ni, Hui Li, Manman Bu, and Yuefeng Ji "A path and algorithm scoring method for automatic planning and optimization of optical networks", Proc. SPIE 11340, AOPC 2019: Optical Fiber Sensors and Communication, 113401G (18 December 2019); https://doi.org/10.1117/12.2547824

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available