WO2023248316A1 - Dispositif de recherche d'itinéraire, procédé de recherche d'itinéraire et programme - Google Patents

Dispositif de recherche d'itinéraire, procédé de recherche d'itinéraire et programme Download PDF

Info

Publication number
WO2023248316A1
WO2023248316A1 PCT/JP2022/024614 JP2022024614W WO2023248316A1 WO 2023248316 A1 WO2023248316 A1 WO 2023248316A1 JP 2022024614 W JP2022024614 W JP 2022024614W WO 2023248316 A1 WO2023248316 A1 WO 2023248316A1
Authority
WO
WIPO (PCT)
Prior art keywords
route
candidate routes
candidate
links
optical path
Prior art date
Application number
PCT/JP2022/024614
Other languages
English (en)
Japanese (ja)
Inventor
花深 横井
弘順 越地
達哉 松川
崇 宮村
Original Assignee
日本電信電話株式会社
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 日本電信電話株式会社 filed Critical 日本電信電話株式会社
Priority to PCT/JP2022/024614 priority Critical patent/WO2023248316A1/fr
Publication of WO2023248316A1 publication Critical patent/WO2023248316A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation

Definitions

  • the present invention relates to a route searching device, a route searching method, and a program in an optical transmission network.
  • optical transmission network communication data is handled using light, and the communication demands that exist within the optical transmission network are called optical paths.
  • optical path wavelength allocation methods and route calculation methods are being studied.
  • Non-Patent Document 1 As a conventional technique of the route calculation method, there is a technique disclosed in Non-Patent Document 1.
  • Non-Patent Document 1 by selecting a path with a small maximum usage wavelength number when designing an optical path, the wavelength usage efficiency is improved by reducing the maximum usage wavelength number. Specifically, after finding a plurality of candidate routes and searching for wavelengths that can be used for each candidate route, the candidate route with the smallest maximum usage wavelength number is adopted as the usage route.
  • the largest wavelength number corresponding to the wavelength of the wavelength-multiplexed optical signal on the path is defined as the maximum wavelength number used.
  • Non-Patent Document 1 by dispersing the routes used by optical paths, it is possible to reduce the bias in the wavelength utilization rate of each link and improve the wavelength utilization rate of the entire optical transmission network.
  • the following problems may occur depending on the number of candidate routes.
  • Figure 1 shows the relationship between the number of candidate routes K and the maximum usage wavelength number selected by optical path design (solid line), and the relationship between the number of candidate routes K and the execution time per path of optical path design (dashed line) in an example of an optical transmission network.
  • FIG. 1 when the number K of candidate routes is 2, the effect of the optical path design is not fully demonstrated, and when the number K of candidate routes is 20, the effect of the optical path design is not fully demonstrated. A problem occurs where the execution time per pass becomes long.
  • An object of the present invention is to provide a route search device that can maximize the effect of light path design and shorten execution time when searching for a route using an optical path design method that uses a plurality of candidate routes. .
  • the optical path route search device for an optical transmission network of the present invention includes an optimal candidate route number derivation unit that derives the number of candidate routes for route searching based on information in a topology parameter DB of the optical transmission network. Then, candidate routes for the number of candidate routes derived by the optimal candidate route number derivation section are obtained, and among the candidate routes obtained, the route with the smallest maximum usage wavelength number in wavelength division multiplexing is set as the usage route, and the maximum usage wavelength is set as the usage route.
  • the optical path design unit assigns a number to an optical path to be set.
  • a route search device when a route search device performs a route search using an optical path design method using a plurality of candidate routes, it is possible to maximize the effect of optical path design and shorten the execution time.
  • FIG. 7 is a diagram showing the relationship between the number of candidate routes and the maximum usage wavelength number selected by optical path design, and the relationship between the number of candidate routes and the execution time of optical path design.
  • FIG. 1 is a diagram showing the configuration of a route search device according to an embodiment.
  • FIG. 2 is a hardware configuration diagram showing an example of a computer that implements the functions of the route search device according to the embodiment. It is a flow diagram explaining operation of a route search device of an embodiment.
  • 1 is a diagram illustrating an example of an optical transmission network that performs route search for optical paths;
  • FIG. It is a diagram showing an example of the configuration of a topology information DB.
  • FIG. 2 is a diagram illustrating the configuration of a topology parameter DB.
  • FIG. 2 is a diagram showing the state of an optical transmission network when setting up an optical path.
  • FIG. 3 is a diagram showing a first candidate route. It is a figure which shows the second candidate route. It is a figure which shows the third candidate route
  • FIG. 2 is a diagram showing the configuration of a route search device 1 according to an embodiment that determines optical path routes and wavelength assignments in the optical transmission network 7. As shown in FIG.
  • the optical transmission network 7 is a backbone network such as an IP communication network that realizes communication using optical signals, and connects nodes using optical fibers that transmit wavelength-multiplexed optical signals (hereinafter referred to as links).
  • an optical path network is configured by optical paths that are set up via one or more nodes.
  • the route search device 1 of the embodiment includes an optical path design unit 3 that determines the optimal optical path route and wavelength assignment using the technology described in Non-Patent Document 1, and an optical path design unit 3 that derives the number of candidate routes.
  • the optimum candidate route number deriving unit 2 controls the nodes by a node control device (not shown) to set optical paths of the optical transmission network 7.
  • the optimal candidate route number deriving unit 2 includes a topology parameter deriving unit 21, which will be described in detail later, and a candidate route number calculating unit 22.
  • the route search device 1 of the embodiment also includes a topology information DB 41 that stores topology information including information indicating connection relationships between nodes and links in an optical transmission network and distances between nodes, and
  • the storage unit 4 includes a topology parameter DB 42 that stores parameters used for deriving the number of optimal candidate routes.
  • the configurations of the topology information DB 41 and topology parameter DB 42 will be described later.
  • the route search device 1 of the embodiment includes an input unit 5 that inputs topology information used for optical path design, and an output unit 6 that outputs execution results of various functions.
  • the route search device 1 of the embodiment is realized by a computer 300 having a configuration as shown in FIG. 3, for example.
  • FIG. 3 is a hardware configuration diagram showing an example of a computer 300 that implements the functions of the route search device 1 of the embodiment.
  • the computer 300 includes a CPU (Central Processing Unit) 301, a ROM (Read Only Memory) 302, a RAM 303, an HDD (Hard Disk Drive) 304, an input/output I/F (Interface) 305, a communication I/F 306, and a media I/F 307. have a CPU (Central Processing Unit) 301, a ROM (Read Only Memory) 302, a RAM 303, an HDD (Hard Disk Drive) 304, an input/output I/F (Interface) 305, a communication I/F 306, and a media I/F 307.
  • a CPU Central Processing Unit
  • ROM Read Only Memory
  • RAM random access memory
  • HDD Hard Disk Drive
  • I/F Interface
  • the CPU 301 operates based on a program stored in the ROM 302 or HDD 304, and performs control by the control unit.
  • the ROM 302 stores a boot program executed by the CPU 301 when the computer 300 is started, programs related to the hardware of the computer 300, and the like.
  • the CPU 301 controls an input device 310 such as a mouse or a keyboard, and an output device 311 such as a display or printer via an input/output I/F 305.
  • the CPU 301 acquires data from the input device 310 via the input/output I/F 305 and outputs the generated data to the output device 311.
  • a GPU Graphics Processing Unit
  • a GPU Graphics Processing Unit or the like may be used in addition to the CPU 301 as the processor.
  • the HDD 304 stores programs executed by the CPU 301 and data used by the programs.
  • the communication I/F 306 receives data from other devices via a communication network (for example, NW (Network) 320) and outputs it to the CPU 301, and also sends data generated by the CPU 301 to other devices via the communication network. Send to device.
  • NW Network
  • the media I/F 307 reads the program or data stored in the recording medium 312 and outputs it to the CPU 301 via the RAM 303.
  • the CPU 301 loads a program related to target processing from the recording medium 312 onto the RAM 303 via the media I/F 307, and executes the loaded program.
  • the recording medium 312 is an optical recording medium such as a DVD (Digital Versatile Disc) or a PD (Phase change rewritable disk), a magneto-optical recording medium such as an MO (Magneto Optical disk), a magnetic recording medium, a semiconductor memory, or the like.
  • the CPU 301 of the computer 300 executes the program loaded on the RAM 303 to connect the optimal candidate route number deriving unit 2 of the route searching device 1.
  • the functions of the optical path design section 3 are realized.
  • the HDD 304 functions as a storage unit 4 that stores a topology information DB 41 and a topology parameter DB 42, and also stores data in the RAM 303.
  • the CPU 301 reads a program related to the target process from the recording medium 312 and executes it.
  • the CPU 301 may read a program related to target processing from another device via a communication network (NW 320).
  • step S41 the topology parameter derivation unit 21 (see FIG. 2) of the optimal candidate route number derivation unit 2 derives parameters necessary for determining the number of candidate routes based on the information stored in the topology information DB 41, It is stored in the topology parameter DB 42.
  • step S42 the candidate route number calculation unit 22 derives an optimal value for the number of candidate routes to be evaluated by the optical path design unit 3, based on the topology parameter DB 42, using a derivation method that will be described in detail later.
  • step S43 the optical path design unit 3 obtains candidate routes equal to the number of candidate routes calculated by the candidate route number calculation unit 22 in step S42, and as in the technique of Non-Patent Document 1, Optical path routes and wavelengths that improve the wavelength utilization of the entire optical transmission network are determined by considering the continuity of wavelengths across links. Details will be described later.
  • step S44 the route search device 1 controls a node control device (not shown) to create an optical path in the optical transmission network 7 based on the optical path route and wavelength assignment determined by the optical path design unit 3. Set.
  • the optimal candidate route number deriving unit 2 (candidate route number calculating unit 22) will be explained in more detail.
  • the configurations of the topology information DB 41 and topology parameter DB 42 referred to by the optimal candidate route number deriving unit 2 will be explained.
  • FIG. 5 is a diagram showing an example of an optical transmission network 7 in which the route search device 1 searches for an optical path.
  • the black circles in FIG. 5 indicate arranged stations (hereinafter sometimes referred to as nodes), and the numbers attached to the black circles indicate node numbers indicating the stations. Further, the solid line in FIG. 5 indicates a transmission path (hereinafter sometimes referred to as a link) using an optical fiber between stations.
  • the optical transmission network 7 is configured by connecting a plurality of nodes with links.
  • the route search device 1 (optical path design unit 3) determines the continuity of wavelengths across multiple links of the optical transmission network 7, constraints brought about by optical transmission deterioration factors, redundancy for high reliability of optical paths, etc. Considering this, we design optical paths according to the traffic demand between nodes and construct an optical path network.
  • FIG. 6 is a diagram showing an example of the configuration of the topology information DB 41 that holds information indicating connection relationships of nodes, links, etc. of the optical transmission network 7 shown in FIG. 5.
  • the topology information DB 41 includes a node A number 411 indicating the node number of the starting point node for each link of the optical transmission network 7, a node Z number 412 indicating the node number of the ending node, a link distance 413, and a link number 414 for identifying the link. Consists of.
  • FIG. 7 is a diagram illustrating the configuration of the topology parameter DB 42 derived by the topology parameter derivation unit 21 of the optimal candidate route number derivation unit 2 as parameters necessary for determining the number of candidate routes based on the information in the topology information DB 41. be.
  • the topology parameters define parameters for the optical transmission network 7 based on graph theory.
  • the number of nodes 421 indicates the number of nodes in the optical transmission network 7 shown in FIG.
  • nodes are points in graph theory.
  • the number of links 422 indicates the number of links in the optical transmission network 7 shown in FIG.
  • the average degree 423 indicates the average value of degrees (number of edges connected to vertices of the graph) corresponding to the number of links connected to a certain node of the optical transmission network 7.
  • the degree of connectivity 424 indicates the number of nodes that need to be removed in order to disconnect the optical transmission network 7, which is a connected graph.
  • the average connectivity degree 425 indicates the average value of the connectivity degrees 424.
  • the edge connectivity 426 indicates the number of links that need to be removed in order to disconnect the optical transmission network 7, which is a connected graph.
  • Betweenness centrality (average) 427 is the average value of betweenness centrality values, which is the ratio of the shortest paths connecting a certain node A and two other nodes that pass through a certain node A.
  • Betweenness centrality (maximum) 428 is the maximum value of betweenness centrality, which is the ratio of the shortest paths connecting a certain node A and two other nodes that pass through a certain node A.
  • the candidate route number calculation unit 22 refers to the topology parameter DB 42, and the optical path design unit 3 derives the number of candidate routes using one of the following calculation formulas.
  • Number of candidate routes number of links / average degree ... (1)
  • Number of candidate routes number of links ⁇ betweenness centrality (maximum) ...
  • Number of candidate routes number of links ⁇ average degree ⁇ betweenness centrality (average) ...
  • the candidate route number calculation unit 22 calculates the number of candidate routes using each of equations (1) to (3), and calculates the minimum value of the calculated number of candidate routes to the candidate route calculated by the number of candidate route calculation unit 22. It may be a number.
  • the candidate route number calculation unit 22 refers to the topology parameter DB 42 and calculates the number of candidate routes using equation (1).
  • the optical path design unit 3 calculates routes from the start node to the destination node for the number of candidate routes calculated as described above by the candidate route number calculation unit 22, and calculates the routes from the start node to the end node as many as the number of candidate routes calculated by the candidate route number calculation unit 22 as described above.
  • the optimal optical path is determined according to the traffic demand between nodes, taking into account factors such as performance, constraints brought about by optical transmission deterioration factors, and redundancy to increase the reliability of the optical path.
  • optical path determination method of the optical path design unit 3 will be explained with reference to FIGS. 8, 9A, 9B, and 9C.
  • FIG. 8 is a diagram showing the state of the optical transmission network when setting an optical path.
  • the node S is the starting point node of the optical path
  • the node D is the ending point node of the optical path.
  • each link is an optical fiber that transmits an optical signal that has been wavelength-multiplexed and divided into six wavelengths, and the used wavelength and unused wavelength of the wavelength number of each link are shown.
  • optical path design unit 3 adds an optical path from node S to node D. (set).
  • the optical path design unit 3 calculates the three candidates shown in FIGS. 9A, 9B, and 9C Find a route.
  • the optical path design unit 3 uses, for example, the K-Shortest Path algorithm to find three candidate paths in order of the shortest path.
  • the optical path design unit 3 selects the wavelength of wavelength number 6 as the wavelength to be used in the candidate route a of FIG. Find a.
  • optical path design unit 3 can select wavelengths with wavelength numbers 5 and 6 in candidate route b in FIG. 9B, and can select wavelengths with wavelength numbers 5 and 6 in candidate route b and Find the optical path b2 of No. 6.
  • the optical path design unit 3 can select wavelengths with wavelength numbers 3 and 4 in the candidate route c in FIG. 9C, and select the optical path c1 with the wavelength number 3 in the candidate route c, and Find the optical path c2 of 4.
  • wavelength numbers 5 and 6 can also be used, wavelength numbers 3 and 4 will be used here.
  • the optical path design unit 3 determines the maximum usage of the wavelength number corresponding to the wavelength of the wavelength-multiplexed optical signal in the three candidate routes a, b, and c in FIGS. 9A, 9B, and 9C.
  • the candidate route c in FIG. 9C with the smallest wavelength number is set as the route to be used, and the wavelength with wavelength number 3 is assigned to the optical path to be added.
  • the optical path design unit 3 determines candidate routes for the number of candidate routes derived by the optimal candidate route number derivation unit 2, and selects the route with the smallest maximum used wavelength number in wavelength division multiplexing among the determined candidate routes. is used as the route to be used, and its maximum used wavelength number is assigned to the optical path to be set. As a result, it is possible to reduce the bias in the wavelengths used and increase the number of optical paths that can be accommodated, so it is possible to improve the wavelength utilization rate of the entire optical transmission network.
  • the route search device 1 is a route search device 1 for optical paths in an optical transmission network, and is an optimal candidate route for deriving the number of candidate routes for route searching based on information in the topology parameter DB 42 of the optical transmission network.
  • the number deriving unit 2 and the optimal candidate route number deriving unit 2 calculate candidate routes for the number of candidate routes derived, and among the candidate routes found, the route with the smallest maximum used wavelength number in wavelength division multiplexing is set as the usage route, and
  • the present invention is characterized by comprising an optical path design unit 3 that assigns a maximum usage wavelength number to an optical path to be set.
  • the optimal number of candidate routes deriving unit 2 calculates the number of candidate routes by dividing the number of links 422 by the average degree 423 based on the number of links 422 and the average degree 423 of the topology parameter DB 42. Further, the optimum number of candidate routes deriving unit 2 calculates the number of candidate routes by multiplying the number of links 422 by the maximum value of betweenness centrality of 428, based on the number of links 422 of the topology parameter DB 42 and the maximum value of betweenness centrality of 428. Calculate.
  • the optimal candidate route number deriving unit 2 calculates the number of links 422, the average degree 423, and the average betweenness centrality 427 based on the values of the number of links 422, the average degree 423, and the average betweenness centrality 427 of the topology parameter DB 42.
  • the number of candidate routes is calculated by multiplying by the value of .
  • the optimum number of candidate routes deriving unit 2 can easily calculate the number of candidate routes, so it is possible to reduce the calculation resources used for deriving the number of candidate routes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Optical Communication System (AREA)

Abstract

La présente invention concerne un dispositif de recherche d'itinéraire (1) qui est destiné à un chemin optique d'un réseau de transmission optique et qui comprend : une unité de dérivation de nombre d'itinéraires candidats optimal (2) qui dérive le nombre d'itinéraires candidats pour lesquels une recherche d'itinéraire est effectuée, sur la base d'informations d'une base de données de paramètres de topologie (42) d'un réseau de transmission optique ; et une unité de conception de chemin optique (3) qui détermine des itinéraires candidats du nombre d'itinéraires candidats dérivé par l'unité de dérivation de nombre d'itinéraires candidats optimal, qui définit un itinéraire d'usage comme étant l'itinéraire parmi les itinéraires candidats déterminés qui a le plus petit nombre de longueurs d'onde utilisé maximal dans un multiplexage par répartition en longueur d'onde, et qui attribue le nombre de longueurs d'onde utilisé maximal de celui-ci à un chemin optique à définir. Plus particulièrement, sur la base d'un nombre (422) de liaisons, d'un degré moyen (423), de la valeur maximale (427) de centralité d'intermédiarité, et de la valeur moyenne (428) de centralité d'intermédiarité, qui sont les informations de la base de données de paramètres de topologie (42), le nombre d'itinéraires candidats est dérivé en divisant le nombre de liaisons par le degré moyen, en multipliant le nombre de liaisons par la valeur maximale de la centralité d'intermédiarité, ou en multipliant le nombre de liaisons par le degré moyen et la valeur moyenne de la centralité d'intermédiarité.
PCT/JP2022/024614 2022-06-20 2022-06-20 Dispositif de recherche d'itinéraire, procédé de recherche d'itinéraire et programme WO2023248316A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2022/024614 WO2023248316A1 (fr) 2022-06-20 2022-06-20 Dispositif de recherche d'itinéraire, procédé de recherche d'itinéraire et programme

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2022/024614 WO2023248316A1 (fr) 2022-06-20 2022-06-20 Dispositif de recherche d'itinéraire, procédé de recherche d'itinéraire et programme

Publications (1)

Publication Number Publication Date
WO2023248316A1 true WO2023248316A1 (fr) 2023-12-28

Family

ID=89379534

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2022/024614 WO2023248316A1 (fr) 2022-06-20 2022-06-20 Dispositif de recherche d'itinéraire, procédé de recherche d'itinéraire et programme

Country Status (1)

Country Link
WO (1) WO2023248316A1 (fr)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2018093335A (ja) * 2016-12-01 2018-06-14 日本電信電話株式会社 通信装置

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2018093335A (ja) * 2016-12-01 2018-06-14 日本電信電話株式会社 通信装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
HANAMI YOKOI, KOHJUN KOSHIJI, YASUHARU KANEKO, TATSUYA MATSUKAWA, TAKASHI MIYAMURA: "Routing and Wavelength Assignment based on Quality of Transmission and Modulation", IEICE TECHNICAL REPORT, NS, IEICE, JP, vol. 121, no. 262 (NS2021-87), 18 November 2021 (2021-11-18), JP, pages 18 - 23, XP009551658 *

Similar Documents

Publication Publication Date Title
Velasco et al. Designing, operating, and reoptimizing elastic optical networks
US20080181118A1 (en) Selecting service nodes for an end-to-end service path from a reduced search space
WO2012057095A1 (fr) Procédé et dispositif permettant une attribution des fréquences
JP5285083B2 (ja) 並行してトポロジを発見する方法および装置
US7218851B1 (en) Communication network design with wavelength converters
JP2014078943A (ja) ネットワーク仮想化のための経路制御および波長割り当てのシステムと方法
US10511517B2 (en) Path computation in multi-layer networks
Yuan et al. A RMSA algorithm for elastic optical network with a tradeoff between consumed resources and distance to boundary
US20180026716A1 (en) Device and method for designing optical network
JP6572789B2 (ja) 仮想光ネットワークのプロビジョニング
Bianco et al. Optimal resource allocation for disaster recovery
JP6604219B2 (ja) 仮想光ネットワークのプロビジョニング
WO2023065705A1 (fr) Procédé et système de groupage de trafic à équilibrage de charge basés sur un réseau ip sur quasi-cwdm
WO2023248316A1 (fr) Dispositif de recherche d'itinéraire, procédé de recherche d'itinéraire et programme
WO2018029913A1 (fr) Dispositif d'attribution de ressources et procédé d'attribution de ressources
US8774627B2 (en) Network restoration under link or node failure using preconfigured virtual cycles
JP5553312B2 (ja) 最適経路選択方法、最適経路選択プログラムおよび最適経路選択装置
JP6848688B2 (ja) ネットワークの中の制約を有する最短経路検索
JP6848691B2 (ja) ネットワークにおける最短最少再生経路検索
Amjad et al. Towards regeneration in flexible optical network planning
US10848262B2 (en) Optical path design apparatus and optical path design method
WO2023084786A1 (fr) Dispositif de conception de trajet optique, procédé de conception de trajet optique et programme
US11882390B2 (en) Method and system for allocating dedicated protected spectrum based on crosstalk awareness
CN111953522B (zh) 一种软件光网络控制器部署方法及存储介质
KR102033339B1 (ko) 다중자원 인프라구조 관리 방법 및 장치

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22947879

Country of ref document: EP

Kind code of ref document: A1