WO2022249225A1 - Dispositif de conception de chemin optique, procédé de conception de chemin optique et programme - Google Patents

Dispositif de conception de chemin optique, procédé de conception de chemin optique et programme Download PDF

Info

Publication number
WO2022249225A1
WO2022249225A1 PCT/JP2021/019527 JP2021019527W WO2022249225A1 WO 2022249225 A1 WO2022249225 A1 WO 2022249225A1 JP 2021019527 W JP2021019527 W JP 2021019527W WO 2022249225 A1 WO2022249225 A1 WO 2022249225A1
Authority
WO
WIPO (PCT)
Prior art keywords
slots
frequency
communication demand
mask
network
Prior art date
Application number
PCT/JP2021/019527
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/JP2021/019527 priority Critical patent/WO2022249225A1/fr
Priority to JP2023523710A priority patent/JPWO2022249225A1/ja
Publication of WO2022249225A1 publication Critical patent/WO2022249225A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]

Definitions

  • the present invention relates to an optical path design device, an optical path design method, and a program.
  • the frequency band of the grid network is divided more finely than in the fixed grid network. ). At this time, it is required to efficiently allocate communication demand slots to frequency slots, and the problem of how to efficiently allocate communication demand slots to frequency slots is called a frequency allocation problem.
  • FIG. 9 shows an example of candidates for allocating communication demand slots to frequency slots.
  • FIG. 9 shows candidates when there are 8 frequency slots and 2 communication demand slots. Each frequency slot is numbered from 1 to 8, and frequency slots 6 and 7 are occupied slots to which other communication demand slots have already been assigned. Frequency slots 1-5 and 8 are available slots to which communication demand slots can be assigned.
  • frequency slots 1 and 2 are assigned communication demand slots.
  • frequency slots 2 and 3 are assigned communication demand slots.
  • the above has explained the case where there are eight frequency slots.
  • the number of candidates may become enormous.
  • the number of candidates is 370 in the flexible grid network.
  • Non-Patent Document 1 a frequency selection method using reinforcement learning has been proposed (for example, Non-Patent Document 1).
  • Non-Patent Document 1 has the following problems. One is that it is necessary to determine candidate frequency slots in advance. In addition, one is to examine communication demand slots in ascending order of frequency slot numbers, and to allocate a communication demand slot to the frequency slot if it can be allocated, so that other frequencies to which communication demand slots can be allocated. The point is that slots cannot be considered.
  • An object of the present invention is to provide an optical path designing device, an optical path designing method, and a program capable of allocating communication demand slots to frequency slots with high accuracy.
  • information on a network is input to an estimation model that outputs a behavioral distribution indicating the probability of frequency slots to which communication demand slots are assigned.
  • a behavior distribution estimating unit for outputting a behavior distribution indicating the probability of
  • a mask generating unit for generating a mask, which is data indicating whether or not the communication demand slot is allocated to the frequency slot, based on the information about the network, and the behavior
  • a candidate value calculation unit for calculating candidate values for allocatable frequency slots based on the distribution and the mask; and determining frequency slots to which the communication demand slots are assigned based on the candidate values calculated by the candidate value calculation unit.
  • a frequency allocation unit that performs optical path design.
  • information about a network is input to an estimation model that outputs a behavioral distribution indicating the probability of frequency slots to which communication demand slots are assigned.
  • a behavior distribution estimation step of outputting a behavior distribution indicating slot probabilities;
  • a mask generation step of generating a mask, which is data indicating whether or not the communication demand slots are allocated to frequency slots, based on the information about the network;
  • a candidate value calculating step of calculating candidate values of allocatable frequency slots based on the behavior distribution and the mask; and frequency slots to which the communication demand slots are assigned based on the candidate values calculated by the candidate value calculating step.
  • a frequency allocation step of determining.
  • One aspect of the present invention is a program for causing a computer to function as the above optical path design device.
  • communication demand slots can be assigned to frequency slots with high accuracy.
  • FIG. 1 is a diagram showing the configuration of an optical path design device 1 according to a first embodiment
  • FIG. 4 is a flow chart showing a method for generating a mask by a mask generator 16 according to the first embodiment
  • 4 is a flow chart showing the operation of the optical path design device 1 when generating an estimated model according to the first embodiment
  • 4 is a flow chart showing the operation of the optical path designing device 1 when allocating communication demand slots to frequency slots according to the first embodiment.
  • FIG. 2 is a diagram showing an environment in an experiment according to the first embodiment
  • FIG. FIG. 4 is a diagram showing a convolutional neural network used in experiments according to the first embodiment
  • FIG. 4 is a diagram showing PPO and Adam's parameters in experiments according to the first embodiment
  • FIG. 4 is a diagram showing blocking probabilities in experiments according to the first embodiment; This is an example of candidates for allocating communication demand slots to frequency slots.
  • FIG. 1 is a diagram showing the configuration of an optical path designing device 1 according to the first embodiment.
  • the optical path design device 1 determines frequency slots to which communication demand slots are assigned by observing the state of the network.
  • the optical path design device 1 includes a network information acquisition unit 10, a route determination unit 12, a behavior distribution estimation unit 14, an estimation model storage unit 15, a mask generation unit 16, a candidate value calculation unit 18, a frequency allocation unit 20, and a reward calculation unit 22. , and an estimation model updating unit 24 .
  • the network information acquisition unit 10 acquires information about networks.
  • Information about the network includes information about the configuration of the network such as, for example, the network topology, the number of fibers connecting each node of the network, or the number of frequency slots for each link of the network.
  • the multiple number of fibers connecting each node can affect the route that is determined when the route through each node is determined. For example, if there are three fibers connecting node A and node B (fiber a, fiber b, and fiber c), the path from node A to node B includes fiber a, fiber b, or fiber c. includes any. Therefore, route information also includes information about fibers.
  • Information about the fiber may also be considered when the route is determined. For example, the number of used frequency slots in each fiber is considered and the path through the fiber with the highest number of used frequency slots is determined.
  • Information about the network includes information about the frequency allocation of the network, such as the usage status of frequency slots for each link or the duration of the allocation.
  • Information about the network includes information about the required lightpaths.
  • the information about the requested lightpath includes, for example, the information of the nodes that are the start and end points of the lightpath, the number of communication demand slots or the duration of the allocation.
  • the network information acquisition unit 10 acquires information about the network, for example, by observing the network.
  • the frequency slot usage status determination unit 11 determines the frequency slot usage status s t in the network based on the number of frequency slots of each link in the network and the frequency slot usage status of each link acquired by the network information acquisition unit 10. to decide.
  • the usage status of frequency slots of each link in the network is, for example, information as to whether each frequency slot is a usable slot or an occupied slot.
  • a network has two links, and the link usage status, which is the usage status of eight frequency slots for each link, is represented by one-dimensional vectors l 1 and l 2 .
  • l 1 and l 2 are represented by formulas (1) and (2), for example.
  • each element takes a value of 0 or 1.
  • 0 in the nth element means that the nth frequency slot is an occupied slot.
  • a 1 in the nth element means that the nth frequency slot is a usable slot. That is, l1 means that the 3rd, 4th, 5th and 6th frequency slots are usable slots, and l2 means that the 1st to 4th frequency slots are usable slots.
  • the usage status s t of the frequency slots in the network is defined, for example, as shown in Equation (3).
  • s t is a matrix containing all the usage states of each link in the network.
  • the s t may contain information about the network's frequency allocation, such as the duration of the allocation to the frequency slot.
  • the route determination unit 12 determines a route connecting the start point and the end point of the optical path in the network based on the network information acquired by the network information acquisition unit 10 .
  • the route determination unit 12 determines a route by evaluating fragmentation of used slots by entropy, for example.
  • a method for determining a route by evaluating the fragmentation of used slots by entropy is described in Non-Patent Document 2, for example.
  • the route determination unit 12 may determine the route by, for example, a method of selecting the shortest route that can be assigned from among the k-th shortest paths (K-shortest path algorithm).
  • K-shortest path algorithm The route determined by the route determination unit 12 can also be included in the information about the network.
  • the behavior distribution estimating unit 14 inputs the frequency slot usage status st and the route determined by the route determining unit 12 to the estimation model stored in the estimation model storage unit 15, thereby calculating the probability distribution of the behavior at .
  • Estimate the behavioral distribution that is The distribution of actions at is called a "policy”, and is a probability indicating to which frequency slot a communication demand slot is assigned in st .
  • the estimation model is created using, for example, a polynomial function and a neural network, and outputs a behavioral distribution by inputting usage conditions st and routes.
  • a method of generating the estimation model stored in the estimation model storage unit 15 will be described later.
  • the behavioral distribution estimated by the behavioral distribution estimating unit 14 is, for example, a one-dimensional vector A act having the same number of elements as the number of frequency slots, and each element indicates the probability that each frequency slot is the leading slot. That is, for example, when communication demand slots are two and frequency slots are eight, the elements of A act are eight, and the third element of A act is the third frequency slot. Indicates probability.
  • the mask generation unit 16 generates data (hereinafter referred to as a mask) indicating whether communication demand slots can be allocated to frequency slots based on the usage status st of the frequency slots and the route determined by the route determination unit 12. .
  • FIG. 2 is a flow chart showing how the mask generator 16 generates a mask.
  • the mask generation unit 16 detects availability of frequency slots on the route determined by the route determination unit 12 (step S100). For example, the mask generator 16 detects frequency slots that can be used on all links through which the determined route passes. For example, when the route determined by the route determination unit 12 passes through two links, and the usage status of the frequency slots of the links is represented by equations (1) and (2), the availability status A available is It is represented by Formula (4).
  • AND means applying the logical operator AND to each element. That is, when the n-th elements of l 1 and l 2 are both 1, the n-th element of A available becomes 1; otherwise, the n-th element of A available becomes 0. In other words, availability status A available indicates frequency slots that are available on all links along a given path.
  • the mask generation unit 16 generates a mask A mask indicating consecutive available slots to which communication demand slots can be assigned, based on the availability status A available (step S102).
  • the mask generation unit 16 generates, for example, a mask indicating all candidates for consecutive available slots to which communication demand slots can be assigned. More specifically, the mask is a one-dimensional vector A mask having the same number of elements as the frequency slots. It indicates that the slot cannot be assigned, and the fact that the n-th element is 1 indicates that the communication demand slot can be assigned when the n-th frequency slot is set as the leading slot.
  • the mask generator 16 calculates the elements of A mask by the following calculation.
  • the mask generation unit 16 When the number of communication demand slots is m, the mask generation unit 16 generates n 1 is calculated for the th element, and 0 is calculated for the nth element of A mask otherwise.
  • the n-th element of A mask is calculated as 0 even when the (n+m ⁇ 1)-th element of the availability status A available does not exist.
  • the fourth element of the availability status A available to 5 Since the values up to the 4th element are all 1, the 4th element of A mask is 1. In addition, since the second element of the values from the first element to the second element of the availability status A available is 0, the first element of A mask is 0. Also, since the ninth element of the availability status A available does not exist, the eighth element of A mask is 0. By performing the above calculations for all the elements, the mask A mask becomes [0,0,0,1,1,1,0].
  • the mask generation unit 16 may generate, for example, a mask indicating a part of candidates for consecutive available slots to which communication demand slots can be assigned. For example, after generating the mask A mask indicating all the consecutive available slot candidates described above, the mask generation unit 16 changes some of the elements of the mask A mask from 1 to 0. FIG. More specifically, when assigning communication demand slots to frequency slots, if the number of groups of consecutive available slots (hereinafter referred to as blocks) increases, some of the elements of the corresponding mask A mask from 1 to 0.
  • the number of blocks is and two blocks consisting of the 4th through 8th available slots.
  • the availability status A available changes to [1, 0, 0, 1, 0, 0, 1, 1]
  • the number of blocks is It increases to three blocks: the first available slot, the fourth available slot, and the seventh to eighth available slots. Therefore, the mask generator 16 sets the fifth element of the mask A mask to 0. Similarly, the mask generator 16 sets the sixth element of the mask A mask to 0, and finally the mask A mask becomes [0, 0, 0, 1, 0, 0, 1, 0].
  • the mask generation unit 16 generates a mask indicating a part of candidates for consecutive available slots to which communication demand slots can be assigned, thereby preventing fragmentation of available slots. can.
  • the candidate value calculator 18 calculates candidate values of allocatable slots based on the estimation result A act from the behavior distribution estimator 14 and the mask A mask generated by the mask generator 16 .
  • the candidate value calculation unit 18 calculates the allocatable candidate value A out by Equation (5).
  • Equation (5) means the Hadamard product of A act and A mask . That is, each element of A out is the product of the corresponding elements of A act and A mask . Therefore, the allocatable candidate value A out is obtained by masking non-allocatable slots indicated by A mask among the elements of A act .
  • the frequency allocation unit 20 determines frequency slots to which communication demand slots are allocated. For example, the frequency allocation unit 20 sets the frequency slot corresponding to the element having the largest value in A out as the leading slot. For example, the frequency allocation unit 20 converts the values of the elements of A out into probability values, and sets the frequency slot corresponding to the elements determined stochastically based on the converted probability values as the top slot.
  • a method for converting the values of the elements of A out into probability values is, for example, a method of converting the values of the elements using a softmax function, but is not limited to this.
  • the reward calculation unit 22 calculates a reward r t+1 based on the information on the network acquired by the network information acquisition unit 10 and the action at acquired from the frequency allocation unit 20 .
  • the information about the network may be the usage status s t of the frequency slots determined by the frequency slot usage status determining section 11 .
  • the action at obtained from the frequency allocating unit 20 is the action at time t by the frequency allocating unit 20, which is the action of allocating the communication demand slot to the frequency slot.
  • the reward calculation unit 22 calculates the reward r t+1 as 1 when the communication demand slot can be assigned to the frequency slot when the action a t is performed in the usage status st , and the reward r t+1 when it is not possible. Calculate t+1 as -1.
  • the reward calculator 22 may calculate the reward r t +1 based on the usage status s t and the usage status s t +1 . At this time, the remuneration calculation unit 22 calculates the remuneration r t+1 after the network information acquisition unit 10 observes the usage status s t+1 . The reward calculator 22 may calculate the reward r t+ 1 based on the usage status s t , the usage status s t+1 and the behavior at .
  • the estimation model updating unit 24 updates the estimation model stored in the estimation model storage unit 15 based on the reward r t+1 calculated by the reward calculation unit 22 .
  • the estimation model updating unit 24 updates the estimation model so that the reward that can be obtained in the future is maximized.
  • the estimation model update method is performed using, for example, DQN (deep Q-network) described in Non-Patent Document 3 or A3C (asynchronous advantage actor-critic) described in Non-Patent Document 4, but is not limited thereto.
  • FIG. 3 is a flow chart showing the operation of the optical path design device 1 when generating an estimated model.
  • the network information acquisition unit 10 acquires information about the network (step S200).
  • the frequency slot usage status determining unit 11 determines the frequency slot usage status s t based on the information on the network (step S201).
  • the route determination unit 12 determines a route based on information about the network (step S202).
  • the behavior distribution estimation unit 14 estimates the behavior distribution based on the usage status st and the route (step S204).
  • the mask generation unit 16 generates a mask based on the usage status st and the route (step S206).
  • the candidate value calculation unit 18 calculates allocatable candidate values based on the behavior distribution and the mask (step S208).
  • the frequency allocation unit 20 allocates communication demand slots to frequency slots based on the allocatable candidate values (step S210).
  • the reward calculation unit 22 calculates a reward based on the network-related information acquired by the network information acquisition unit 10 and the behavior of the frequency allocation unit 20 (step S212).
  • the estimation model update unit 24 updates the estimation model based on the reward (step S214).
  • the optical path design device 1 repeats the operations from step S200 to step S214 to update the estimated model, thereby generating the estimated model.
  • FIG. 4 is a flowchart showing the operation of the optical path designing device 1 when allocating communication demand slots to frequency slots.
  • the flowchart shown in FIG. 4 corresponds to the operations from step S200 to step S210 in the flowchart shown in FIG.
  • communication demand slots can be allocated without determining candidate frequency slots in advance. Also, by calculating A out indicating all assignable frequency slots, all assignable frequency slots can be considered.
  • FIG. 5 is a diagram showing the environment in this experiment.
  • the information about the requested lightpath that is, the information of the nodes that are the start and end points of the lightpath, the number of communication demand slots, and the duration of allocation, were randomly generated according to a uniform distribution.
  • the average arrival rate of lightpath requests was 10, and the average service time of allocation processing by the lightpath design device 1 was 12.
  • the usage status s t is represented by a two-dimensional vector.
  • a value of 1 in the lth row and mth column element of the usage status st indicates that the mth frequency slot of the lth link is a usable slot, and a value of 0 indicates that the slot is an occupied slot. indicates that
  • the reward calculation unit 22 calculates the reward r t+1 as 1 when the frequency assignment by the frequency assignment unit 20 succeeds and -1 when the assignment fails.
  • the estimation model updating unit 24 used a convolutional neural network as the estimation model.
  • FIG. 6 is a diagram showing the convolutional neural network used in this experiment.
  • a convolutional neural network consists of a convolutional layer 200 and a fully connected layer 210 .
  • the convolution layer 200-1 receives the frequency slot usage state s t , it performs convolution and outputs a two-dimensional vector of 32 ⁇ S (S is the number of frequency slots).
  • S is the number of frequency slots and takes a value of 80.
  • convolution is performed by inputting the two-dimensional vectors output from the convolution layers 200-1 and 200-2 to the convolution layers 200-2 and 200-3, respectively.
  • the action distribution A act is output.
  • the value of the usage state s t is output.
  • the estimation model is updated based on the value of the usage status s t output from the fully connected layer 210-2.
  • PPO Proximal Policy Optimization
  • Adam was used as an optimization algorithm.
  • FIG. 7 shows the PPO and Adam parameters in this experiment.
  • FIG. 8 is a diagram showing the blocking probability in this experiment. Without the mask, the blocking probability is approximately 80%, while with the mask, the blocking probability is approximately 2.2%. Also, when there is a mask, the blocking probability can be close to 2.2% from the stage where the evaluation step is 1, so the learning time can be greatly shortened.
  • the optical path design device 1 does not have to generate an estimated model.
  • the optical path designing device 1 includes a network information acquisition unit 10, a route determination unit 12, a behavior distribution estimation unit 14, an estimation model storage unit 15, a mask generation unit 16, a candidate value calculation unit 18, and a frequency allocation unit 20. , the reward calculator 22 and the estimation model updater 24 may not be provided.
  • the estimated model storage unit 15 stores the generated estimated model.
  • the behavior distribution estimator 14 estimates the behavior distribution, which is the probability distribution of the behavior at , based on the usage status st and the route, but is not limited to this.
  • the action distribution estimator 14 may estimate the action distribution, which is the probability distribution of the action at , based on the information about the network acquired by the network information acquisition unit 10, for example.
  • 1 optical path design device 10 network information acquisition unit, 11 frequency slot usage determination unit, 12 route determination unit, 14 behavior distribution estimation unit, 15 estimation model storage unit, 16 mask generation unit, 18 candidate value calculation unit, 20 frequency Allocation unit, 22 reward calculation unit, 24 estimation model update unit

Landscapes

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

Abstract

Selon l'invention, un dispositif de conception de chemin optique comprend : une unité d'estimation de distribution de comportement qui produit une distribution de comportement indiquant la probabilité de créneaux de fréquence auxquels sont attribués des créneaux de demande de communication, grâce à la fourniture d'informations concernant un réseau en entrée d'un modèle d'estimation qui reçoit des informations concernant le réseau en entrée et produit une distribution de comportement qui indique la probabilité de créneaux de fréquence auxquels sont attribués des créneaux de demande de communication ; une unité de production de masque qui produit un masque, qui est constitué de données indiquant si les créneaux de demande de communication peuvent être attribués ou non à des créneaux de fréquence, en fonction des informations concernant le réseau ; une unité de calcul de valeurs candidates qui calcule des valeurs candidates pour des créneaux de fréquence pouvant être attribués en fonction de la distribution de comportement et du masque ; et une unité d'attribution de fréquence qui détermine des créneaux de fréquence auxquels sont attribués les créneaux de demande de communication en fonction des valeurs candidates calculées par l'unité de calcul de valeurs candidates.
PCT/JP2021/019527 2021-05-24 2021-05-24 Dispositif de conception de chemin optique, procédé de conception de chemin optique et programme WO2022249225A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/JP2021/019527 WO2022249225A1 (fr) 2021-05-24 2021-05-24 Dispositif de conception de chemin optique, procédé de conception de chemin optique et programme
JP2023523710A JPWO2022249225A1 (fr) 2021-05-24 2021-05-24

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2021/019527 WO2022249225A1 (fr) 2021-05-24 2021-05-24 Dispositif de conception de chemin optique, procédé de conception de chemin optique et programme

Publications (1)

Publication Number Publication Date
WO2022249225A1 true WO2022249225A1 (fr) 2022-12-01

Family

ID=84229684

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2021/019527 WO2022249225A1 (fr) 2021-05-24 2021-05-24 Dispositif de conception de chemin optique, procédé de conception de chemin optique et programme

Country Status (2)

Country Link
JP (1) JPWO2022249225A1 (fr)
WO (1) WO2022249225A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011176518A (ja) * 2010-02-24 2011-09-08 Fujitsu Ltd 経路割当装置および経路割当方法
JP2017220870A (ja) * 2016-06-09 2017-12-14 富士通株式会社 波長再割当てを支援する装置、方法、およびプログラム

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011176518A (ja) * 2010-02-24 2011-09-08 Fujitsu Ltd 経路割当装置および経路割当方法
JP2017220870A (ja) * 2016-06-09 2017-12-14 富士通株式会社 波長再割当てを支援する装置、方法、およびプログラム

Also Published As

Publication number Publication date
JPWO2022249225A1 (fr) 2022-12-01

Similar Documents

Publication Publication Date Title
US8737836B2 (en) Apparatus and method for setting an optical path in an optical network
CN109905784B (zh) 一种光网络波长分配的业务重构方法及设备
Couckuyt et al. Automatic surrogate model type selection during the optimization of expensive black-box problems
WO2022249225A1 (fr) Dispositif de conception de chemin optique, procédé de conception de chemin optique et programme
Chaves et al. A methodology to design the link cost functions for impairment aware routing algorithms in optical networks
JP7436747B2 (ja) Ｏｔｎネットワークリソース最適化方法および装置、コンピュータデバイスと記憶媒体
Zhang et al. Routing and spectrum assignment algorithm with traffic prediction and periodic rerouting in elastic optical networks
Jiao et al. Reliability-Oriented RSA Combined with Reinforcement Learning in Elastic Optical Networks
Lezama et al. Routing and spectrum allocation in flexgrid optical networks using differential evolution optimization
WO2016107757A1 (fr) Procédé et système pour attribuer des indicateurs de performance à des objets d'un réseau
CN113438173B (zh) 路由和频谱分配方法、装置、存储介质以及电子设备
Rolland et al. Queueing delay guarantees in bandwidth packing
JP6264747B2 (ja) ネットワーク設計装置、及びネットワーク設計方法
Ruiz et al. A column generation approach for large-scale RSA-based network planning
JP2017028548A (ja) 物理リソース割当装置、物理リソース割当方法、及びプログラム
US10341041B2 (en) Method and device for assisting wavelength reallocation in wavelength division multiplexing optical network
Todd et al. Fast efficient design of shared backup path protected networks using a multi-flow optimization model
JP4607903B2 (ja) 通信ネットワーク内の回線を再経路指定するための方策を選択する方法と、この方法を用いるネットワーク
JP5952755B2 (ja) ネットワーク設計装置およびネットワーク設計プログラム
Yamazaki et al. Virtualized-elastic-regenerator placement by firefly algorithm for translucent elastic optical networks
Kennington et al. Wavelength translation in WDM networks: Optimization models and solution procedures
Hu et al. Dynamic network simulation using DeepRMSA in Elastic Optical Networks
WO2018181031A1 (fr) Dispositif de conception de chemin optique et procédé de conception de chemin optique
Din Delay-Variation Constrained Spectrum Extraction and Contraction Problem for Multipath Routing on Elastic Optical Networks.
JP3895700B2 (ja) 通信網故障頻度計算方法、通信網故障頻度計算装置、通信網故障頻度計算プログラム及びそのプログラムを記録した記録媒体

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: 21942883

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2023523710

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21942883

Country of ref document: EP

Kind code of ref document: A1