[go: up one dir, main page]

WO2022269707A1 - Dispositif de commande d'itinéraire, système de communication et procédé de commande d'itinéraire - Google Patents

Dispositif de commande d'itinéraire, système de communication et procédé de commande d'itinéraire Download PDF

Info

Publication number
WO2022269707A1
WO2022269707A1 PCT/JP2021/023454 JP2021023454W WO2022269707A1 WO 2022269707 A1 WO2022269707 A1 WO 2022269707A1 JP 2021023454 W JP2021023454 W JP 2021023454W WO 2022269707 A1 WO2022269707 A1 WO 2022269707A1
Authority
WO
WIPO (PCT)
Prior art keywords
time
prediction
switch
unit
traffic volume
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/JP2021/023454
Other languages
English (en)
Japanese (ja)
Inventor
優花 岡本
裕隆 氏川
慈仁 酒井
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NTT Inc
Original Assignee
Nippon Telegraph and Telephone Corp
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 Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP2023529233A priority Critical patent/JP7559947B2/ja
Priority to PCT/JP2021/023454 priority patent/WO2022269707A1/fr
Publication of WO2022269707A1 publication Critical patent/WO2022269707A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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
    • H04L45/121—Shortest path evaluation by minimising delays
    • 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/02—Topology update or discovery
    • H04L45/08—Learning-based routing, e.g. using neural networks or artificial intelligence
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/18—Communication route or path selection, e.g. power-based or shortest path routing based on predicted events
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices
    • H04W88/085—Access point devices with remote components

Definitions

  • the present invention relates to a routing control device, a communication system, and a routing control method.
  • MFH Mobile Front Haul
  • MMH Mobile Mid Haul
  • MBH Mobile Back Haul
  • DUs distributed units: remote stations
  • RUs Radio units: radio stations
  • CUs Central units: aggregation base stations
  • SW switch
  • the amount of traffic arriving at a certain CU is predicted (by machine learning), and when the arrival of traffic that cannot be processed by the CU is expected, the SW is set so that the traffic is sent to a different CU. switch (for example, see Non-Patent Document 1).
  • CU switching is realized by turning off the power of CUs that are not in use. It was difficult to switch only traffic to another CU.
  • the present invention has been made in view of the problems described above, and a routing control device, a communication system, and a routing control method that can determine and switch an efficient communication route even if traffic and propagation delays fluctuate. intended to provide
  • a route control device is a route control device that controls a switch that is provided between a plurality of aggregation base stations and a plurality of remote stations and switches communication paths, wherein the switch and the aggregation base station transmission time between and, transmission time between the switch and the remote station, control information including traffic volume and schedule information between the remote station and the aggregation base station, operation time of the switch, and previously a prediction time determination unit that determines a time available for predicting future traffic volume for a communication path based on the set maximum allowable delay time; and within the time available for prediction determined by the prediction time determination unit a selection unit that selects an algorithm capable of determining a communication path from among a plurality of algorithms according to a predetermined priority; an execution unit that determines a communication path between the remote stations, and a switching control unit that controls switching of the communication path by the switch so that the aggregation base station and the remote station communicate via the communication path determined by the execution unit. characterized by having
  • a communication system includes a switch that is provided between a plurality of centralized base stations and a plurality of remote stations to switch communication paths, and a path control device that controls the switches.
  • the path control device controls the transmission time between the switch and the aggregation base station, the transmission time between the switch and the remote station, and the traffic between the remote station and the aggregation base station.
  • a prediction time determination unit that determines the time available for predicting future traffic volume for a communication path based on control information including volume and schedule information, operation time of the switch, and a preset maximum allowable delay time; a selection unit for selecting an algorithm capable of determining a communication path within the time available for prediction determined by the prediction time determination unit from among a plurality of algorithms according to a predetermined priority; an execution unit that determines a communication path between the aggregation base station and the remote station by executing an algorithm; and the aggregation base station and the remote station communicate with each other through the communication path determined by the execution unit. and a switching control unit for controlling switching of the communication path by the switch.
  • a routing control method is a routing control method for controlling a switch provided between a plurality of aggregation base stations and a plurality of remote stations for switching communication paths, wherein the switches and the aggregation transmission time between the base station, transmission time between the switch and the remote station, control information including traffic volume and schedule information between the remote station and the aggregation base station, operation time of the switch, and a prediction time determination step of determining the time available for predicting the future traffic volume for the communication route based on a preset maximum allowable delay time, and determining the communication route within the time available for the determined prediction.
  • an efficient communication route can be determined and switched even if the traffic and propagation delay fluctuate.
  • FIG. 3 is a block diagram illustrating the functions and peripherals of a route control device according to one embodiment;
  • FIG. FIG. 5 is a diagram schematically showing an example of predicted time determined by a predicted time determination unit;
  • FIG. 10 is a diagram showing a specific example of a plurality of algorithms used by the selection unit for algorithm selection;
  • (a) is a diagram schematically showing an operation example of a route control device when traffic volume is used.
  • (b) is a diagram schematically showing an operation example of the route control device when control information is used.
  • (a) is a diagram schematically showing the relationship with traffic when prediction time is sufficient.
  • (b) is a diagram schematically showing the relationship with traffic when the prediction time is insufficient.
  • (a) is a diagram showing the traffic volume of each DU predicted by the routing device.
  • (b) is a diagram showing the traffic volume of each CU before and after the routing control device allocates the traffic volume.
  • (a) is a diagram showing the traffic volume of each DU predicted by the route control device and the actual traffic volume.
  • (b) is a diagram showing the traffic volume of each CU before and after the routing control device actually allocates the traffic volume.
  • (a) is a diagram showing the traffic volume of each DU predicted by the routing device according to the embodiment, the traffic volume of each DU predicted by the routing device of the comparative example, and the actual traffic volume.
  • (b) is a diagram showing a result of prediction and actual traffic volume allocation by the routing control device according to the embodiment and a result of prediction and actual traffic volume allocation by the routing control device of the comparative example; be.
  • FIG. 1 is a diagram showing a configuration example of a communication system 1 according to one embodiment.
  • a communication system 1 includes, for example, a core network 11 to which an end server 10 is connected, and a plurality of CUs (Central units: aggregation base stations) 12 are connected to configure a network as, for example, 5G (fifth generation mobile communication system). ing.
  • CUs Central units: aggregation base stations
  • the CU 12 is connected to a plurality of DUs (Distribution Units: remote stations) 13 and the routing control device 3 via SWs (switches) 2, respectively.
  • DUs Distribution Units: remote stations
  • SWs switching
  • Each DU 13 is connected to a plurality of RUs (Radio units) 14.
  • the RU 14 accommodates a UE (User equipment: wireless terminal) 15 and enables the UE 15 to access the end server 10 .
  • UE User equipment: wireless terminal
  • the SW2 is provided between the plurality of CU12 and the plurality of DU13, and constitutes an MMH (Mobile Mid Haul) that switches the communication path between the CU12 and the DU13 according to the control of the path control device 3, for example.
  • MMH Mobile Mid Haul
  • CU#1 and CU#2 when distinguishing between a plurality of CUs 12, they are distinguished by adding a number after #, such as CU#1 and CU#2.
  • a number after # such as DU#1 to DU#4.
  • FIG. 2 is a diagram showing a configuration example around SW2.
  • SW2 receives, for example, information indicating transmission time (t) and traffic volume (x) for communication from each of CU#1 and CU#2. Also, SW2 receives transmission time (t) and control information (c) for communication from each of DU#1 to DU#4. In the case of uplink communication, SW2 also receives information indicating the traffic volume (x) from each of DU#1 to DU#4.
  • control information is information that the UE 15 transmits to the DU 13 in order to access the end server 10, for example.
  • the control information transmitted from each of DU#1 to DU#4 to SW2 includes, for example, the traffic volume and schedule information between DU13 and CU12. Specifically, the control information describes the next actual traffic transmission time (t C ). Then, based on the control information, the allocated data will be sent in the next transmission.
  • FIG. 3 is a block diagram illustrating the functions and peripherals of the route control device 3 according to one embodiment.
  • the route control device 3 has a time analysis unit 30, a prediction time determination unit 31, a storage unit 32, a selection unit 33, an execution unit 34, and a switching control unit 35, and is connected to SW2.
  • the time analysis unit 30 analyzes the traffic transmission time from the control information (C DU ) received from the DU 13, and outputs the traffic transmission time (t C ) and the control information to the prediction time determination unit 31 and the execution unit 34. .
  • time analysis unit 30 may receive a time stamp together with the control information and analyze the time (t c ) at which the next traffic is actually transmitted based on the TTI (Transmission Time. Interval) cycle.
  • the prediction time determination unit 31 determines the transmission time ( tCU ) between SW2 and CU12, the transmission time ( tDU ) between SW2 and DU13, the traffic volume and schedule information (tC) between DU13 and CU12 . etc.), the operation time (t SW ) of SW2, and the preset maximum allowable delay time (for example, the required delay time of MMH: t MMH ), to predict the future traffic volume for the communication path
  • a usable time (predicted time: t f ) is determined and output to the selection unit 33 .
  • the prediction time determination unit 31 determines, for example, the maximum allowable delay time of MMH according to the priority of traffic as the maximum allowable delay time used for determining the time that can be used for prediction, or A maximum allowable delay time determination unit 310 may be provided that determines 0 as the maximum allowable delay time used for time determination. In this case, the prediction time determination unit 31 can use the total time of the time from the reception of the control information to the arrival of the main signal and the maximum allowable delay time determined by the maximum allowable delay time determination unit 310 for prediction. Decide as time.
  • the predicted time determining unit 31 obtains the current time (t now ) from the grandmaster clock or the original clock. Also, the predicted time determining unit 31 may store the time required to calculate the allocation to each CU 12 from the estimated traffic information as being constant. In addition, the predicted time determination unit 31 may store the time required for SW2 to switch from the instruction to the switching to be constant. Further, the predicted time determination unit 31 may store the MMH request delay time as being constant.
  • FIG. 4 is a diagram schematically showing an example of the prediction time determined by the prediction time determining section 31.
  • the transmission time (t DU ) between SW2 and DU13 could be as shown in equation (1) below.
  • the storage unit 32 stores the transmitted traffic volume and outputs it to the execution unit 34 as a continuous value together with the previously stored past traffic volume.
  • the selection unit 33 selects an algorithm capable of determining a communication route within the time (prediction time) that can be used for prediction determined by the prediction time determination unit 31 from among a plurality of algorithms according to a predetermined priority. A result is output to the execution unit 34 .
  • the selection unit 33 selects traffic estimation when the prediction time is sufficient, and when the prediction time is not sufficient, time series prediction or the like is selected. Choose an algorithm. Note that the selection unit 33 may be configured to select a plurality of algorithms.
  • FIG. 5 is a diagram showing specific examples of a plurality of algorithms used by the selection unit 33 for algorithm selection.
  • the selection unit 33 selects at least one of a plurality of algorithms numbered 1 to 3 according to priority as an algorithm capable of determining a communication route within the predicted time.
  • Algorithms with higher priority (1>2>3) have higher prediction accuracy, but take longer to calculate.
  • the selection unit 33 assigns a high priority RB (resource block) and estimates (calculates) traffic by multiplication using MCS (Modulation Coding Scheme) to select.
  • MCS Modulation Coding Scheme
  • the selection unit 33 acquires the resource allocation number (RIV: resource indication value) and MCS from the control information (DCI: Downlink Control Information). For example, the selection unit 33 estimates the line quality from the MCS, obtains the traffic volume of the RB, and multiplies it by the RIV to calculate the traffic volume of each DU 13 .
  • RIV resource indication value
  • DCI Downlink Control Information
  • the selection unit 33 selects linear prediction with the second highest priority because the algorithm with the highest priority is longer than the prediction time. In linear prediction, increasing the amount of traffic increases the accuracy, but the time required for prediction increases. Therefore, the selection unit 33 adjusts the traffic volume to be used according to the time required for prediction.
  • the selection unit 33 selects time-series prediction by machine learning with the third priority.
  • time-series prediction as with linear prediction, increasing the amount of traffic improves accuracy, but the time required for prediction increases. Therefore, the selection unit 33 adjusts the traffic volume to be used according to the time required for prediction.
  • the execution unit 34 determines the communication route between the CU 12 and the DU 13 by executing the algorithm selected by the selection unit 33 .
  • the execution unit 34 executes traffic estimation when the prediction time is sufficient, and executes time-series prediction when the prediction time is insufficient.
  • Traffic estimation is an algorithm that predicts each traffic volume from control information.
  • Time-series prediction is an algorithm that uses past traffic information to calculate the predicted traffic volume for the next time. In time-series prediction, the traffic information used may be changed according to the time available for prediction.
  • the execution unit 34 may be configured to execute a plurality of algorithms, merge a plurality of prediction results, and output one prediction result.
  • the execution unit 34 weights accuracy and time for multiple prediction results, and merges multiple prediction results by majority rule.
  • the executing unit 34 includes an aggregating unit 340 for aggregating a plurality of algorithms, and when the selecting unit 33 selects a plurality of algorithms, the aggregating unit 340 executes the multiple algorithms and merges the multiple prediction results. and output one prediction result. At this time, the aggregating unit 340 weights the accuracy and time of the plurality of prediction results, and merges the plurality of prediction results by majority rule.
  • the switching control unit 35 has a determination unit 350 and an allocation determination unit 352, and controls communication path switching by SW2 so that the CU 12 and DU 13 communicate via the communication path determined by the execution unit 34.
  • the determination unit 350 determines whether switching of SW2 is necessary based on the predicted traffic volume calculated by the execution unit 34, and if switching is not necessary, switches the communication path (path). However, when switching is necessary, the predicted traffic volume is output to the allocation determining unit 352 .
  • the determination unit 350 determines whether switching of SW2 is necessary by determining whether the predicted traffic volume exceeds a threshold value (bandwidth x 0.8, etc.).
  • the determination unit 350 determines that switching of SW2 is unnecessary when the traffic volume does not change in each communication path.
  • the determination unit 350 determines that communication path switching is necessary.
  • the allocation determination unit 352 determines the allocation of SW2 based on the predicted traffic volume input from the determination unit 350, and transmits an instruction to switch the communication path to SW2.
  • SW2 switches the communication path according to the instruction sent by the path control device 3.
  • FIG. 6 is a diagram schematically showing an operation example according to information used by the route control device 3.
  • FIG. 6(a) is a diagram schematically showing an operation example of the route control device 3 when the traffic volume (traffic information) is used.
  • FIG. 6B is a diagram schematically showing an operation example of the route control device 3 when using control information.
  • the route control device 3 when the route control device 3 tries to switch the communication route using the actual traffic information, the traffic is only for a short period of time between the time the data is received and the time the data is transmitted. Prediction is not available in time for actual traffic because it cannot be used for prediction.
  • the route control device 3 predicts the traffic using the previous data and switches the communication route. In this case, since the route control device 3 uses the previous data, the prediction accuracy of the traffic volume may be lowered.
  • the route control device 3 by using the received control information, the route control device 3, during the period from the time of receiving the control information to the time of data transmission, is used from prediction to communication route switching. You can secure the time you can.
  • the predicted time increases by the amount of time from when the control information is received until when the data is received. Moreover, by making predictions using the control information, the prediction accuracy is ensured more than using the previous data.
  • the route control device 3 analyzes the time required for prediction, and if the prediction time is sufficient, it can perform real-time path switching with high accuracy based on the control information.
  • FIG. 7 is a diagram schematically showing the relationship between the time available for prediction (prediction time) calculated by the route control device 3 and the traffic.
  • FIG. 7(a) is a diagram schematically showing the relationship with traffic when the prediction time is sufficient.
  • FIG. 7(b) is a diagram schematically showing the relationship with traffic when the prediction time is insufficient.
  • t C be the time until the data calculated by the time analysis unit 30 is transmitted.
  • the predicted time determination unit 31 determines the transmission time t CU between CU12 and SW2, the transmission time t DU between DU13 and SW2, the time t C until data transmission, and the operation time of SW2 (time until allocation/switching of communication paths).
  • the time (prediction time: t f ) that can be used for predicting traffic volume is calculated by the following equation (3).
  • the selection unit 33 selects an algorithm for calculating traffic volume for switching communication paths based on the predicted time tf .
  • the selection unit 33 uses the control information to estimate (calculate) the traffic Algorithm to select. Then, the execution unit 34 executes a traffic estimation algorithm to calculate traffic and outputs it to the switching control unit 35 .
  • the selection unit 33 uses past traffic data to predict the future traffic volume. Choose an algorithm to perform series prediction. At this time, the selection unit 33 may change parameters such as the number of traffic data to be used according to the time required for prediction.
  • the execution unit 34 predicts the next traffic volume using a time-series prediction algorithm and outputs it to the switching control unit 35 .
  • the route control device 3 controls the communication route in real time with high precision, and when the prediction time is not sufficient, the route control device 3 controls the communication route with an accuracy equivalent to switching the communication route using traffic information. to control the communication path.
  • the predicted time determination unit 31 may synchronize the time, or transmit the time stamp from the DU 13, and actually arrive at SW2 from t DU . A deviation from the time may be corrected.
  • the selection unit 33 selects an algorithm based on the predicted time (t f ).
  • the selection unit 33 selects the estimation (calculation, 1 ms) of the traffic transmitted by the control information.
  • the execution unit 34 transmits each traffic volume to the switching control unit 35 .
  • the execution unit 34 does not perform transmission if switching of the communication path by SW2 is unnecessary.
  • the allocation determining unit 352 changes the allocation of DU13 as communication path switching. That is, the allocation determination unit 352 transmits a communication path switching instruction to SW2 in order to change the CU 12 to which the DU 13 is connected.
  • the predicted time determination unit 31 may synchronize the time, or transmit the time stamp from the DU 13, and actually arrive at SW2 from t DU . A deviation from the time may be corrected.
  • the selection unit 33 selects an algorithm based on the predicted time (t f ).
  • the selection unit 33 selects the estimation (calculation, 0.7 ms) of the traffic transmitted by the control information.
  • the execution unit 34 transmits each traffic volume to the switching control unit 35 . The execution unit 34 does not perform transmission if switching of the communication path by SW2 is unnecessary.
  • the allocation determination unit 352 changes the allocation of DU13 as communication route switching. That is, the allocation determination unit 352 transmits a communication path switching instruction to SW2 in order to change the CU 12 to which the DU 13 is connected.
  • the predicted time determination unit 31 may synchronize the time, or transmit the time stamp from the DU 13, and actually arrive at SW2 from t DU . A deviation from the time may be corrected.
  • the route control device 3 is provided with a traffic prediction unit that predicts each traffic volume using the previous traffic volume. may be used to predict each traffic volume.
  • the selection unit 33 selects an algorithm based on the predicted time (t f ).
  • the selection unit 33 selects an algorithm for predicting future traffic information from past traffic information (determines the amount of data to be used in time for the prediction time).
  • the execution unit 34 transmits each traffic volume to the switching control unit 35 .
  • the execution unit 34 does not perform transmission if switching of the communication path by SW2 is unnecessary.
  • the allocation determining unit 352 changes the allocation of DU13 as communication path switching. That is, the allocation determination unit 352 transmits a communication path switching instruction to SW2 in order to change the CU 12 to which the DU 13 is connected.
  • the judgment time (t judgment) is a negative value. In other words, even if the communication path is switched according to the amount of traffic, it is too late.
  • the route control device 3 switches the communication route based on the prediction of the traffic volume in the next section.
  • the selection unit 33 selects an algorithm based on the predicted time (tf).
  • the execution unit 34 After executing the algorithm, the execution unit 34 transmits each traffic volume to the switching control unit 35 .
  • the execution unit 34 does not perform transmission if switching of the communication path by SW2 is unnecessary.
  • the allocation determining unit 352 does not allocate DU13 as communication path switching.
  • the route control device 3 controls switching of communication routes by changing the allocation of the traffic volume of each DU 13 to each CU 12 . As a result, the route control device 3 can distribute the load on the communication route for each CU 12 .
  • FIG. 8 is a diagram schematically showing the traffic volume of each DU 13 predicted by the routing device 3 and the result of allocating the traffic volume of each DU 13 to each CU 12 using the predicted traffic volume.
  • FIG. 8(a) is a diagram showing the traffic volume of each DU 13 predicted by the routing device 3.
  • FIG. 8(b) is a diagram showing the traffic volume of each CU 12 before and after allocation of traffic volume by the route control device 3 (before and after load distribution).
  • the traffic volume predicted by the route control device 3 and the actual traffic volume match.
  • CU#1 has a traffic volume of 8 Gbps
  • CU#2 has a traffic volume of 2 Gbps (before load balancing).
  • the route control device 3 switches the communication route by SW2.
  • the allocation determination unit 352 changes the allocation of the traffic volume of each DU 13 so as to distribute the traffic volume of each DU 13 to each CU 12, and transmits an instruction to that effect to SW2.
  • FIG. 9 is a diagram schematically showing the result of allocating the traffic volume of each DU 13 to each CU 12 using the traffic volume of each DU 13 predicted by the routing device 3 and the actual traffic volume.
  • FIG. 9(a) is a diagram showing the traffic volume of each DU 13 predicted by the routing device 3 and the actual traffic volume.
  • FIG. 9(b) is a diagram showing the traffic volume of each CU 12 before and after the route control device 3 actually allocates the traffic volume (before and after load distribution).
  • the traffic volume of each DU 13 after the routing control device 3 executes the algorithm described above is the traffic volume shown in the upper part of FIG.
  • CU#1 has a traffic volume of 8 Gbps
  • CU#2 has a traffic volume of 2 Gbps.
  • the route control device 3 switches the communication route using SW2.
  • the allocation determination unit 352 changes the allocation of the traffic volume of each DU 13 so as to distribute the traffic volume of each DU 13 to each CU 12, and transmits an instruction to that effect to SW2.
  • FIG. 10 shows the result of assigning the traffic volume of each DU 13 based on the traffic volume of each DU 13 predicted by the routing control device 3 according to one embodiment, and the traffic volume of each DU 13 predicted by the routing control device of the comparative example.
  • FIG. 10 is a diagram schematically showing the result of allocating the traffic volume of each DU 13 by means of
  • FIG. 10A is a diagram showing the traffic volume of each DU 13 predicted by the routing device 3 according to the embodiment, the traffic volume of each DU 13 predicted by the routing device of the comparative example, and the actual traffic volume.
  • FIG. 10(b) shows the result of prediction and actual traffic volume allocation by the routing control device 3 according to the embodiment and the result of prediction and actual traffic volume allocation by the routing control device of the comparative example.
  • FIG. 4 is a diagram showing;
  • the result of allocating the traffic volume of each DU 13 based on the traffic volume of each DU 13 predicted by the routing device 3 shows that the actual traffic volume is larger than the predicted traffic volume. It is shown that the communication path was suitably switched even if the
  • the routing control device 3 since the routing control device 3 has high traffic volume prediction accuracy, even if an error occurs in the traffic volume prediction, there is a margin so that the bandwidth of each CU 12 is not exceeded.
  • the communication system 1 selects an algorithm that can determine a communication route within a time that the route control device 3 can use for predicting traffic volume, among a plurality of algorithms according to a predetermined priority. , an efficient communication route can be determined and switched even if the traffic or propagation delay fluctuates.
  • each function of the path control device 3 described above may be configured partially or wholly by hardware such as a PLD (Programmable Logic Device) or FPGA (Field Programmable Gate Array), or a processor such as a CPU. may be configured as a program executed by a PLD (Programmable Logic Device) or FPGA (Field Programmable Gate Array), or a processor such as a CPU. may be configured as a program executed by a PLD (Programmable Logic Device) or FPGA (Field Programmable Gate Array), or a processor such as a CPU. may be configured as a program executed by
  • the route control device 3 can be implemented using a computer and a program, and the program can be recorded on a storage medium or provided through a network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Medical Informatics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Un dispositif de commande d'itinéraire selon un mode de réalisation de la présente invention comprend : une unité de détermination de temps de prédiction pour déterminer le temps disponible pour la prédiction d'un futur volume de trafic pour un itinéraire de communication, la détermination étant effectuée sur la base d 'un temps de transmission entre un commutateur et une station de base d'agrégation, d'un temps de transmission entre le commutateur et une station à distance, d'informations de commande qui comprennent des informations de planification et un volume de trafic entre la station à distance et la station de base d'agrégation, d'un temps de fonctionnement du commutateur, et d'un temps de retard maximal admissible prédéfini ; une unité de sélection pour sélectionner, parmi une pluralité d'algorithmes conformément à une priorité prescrite, un algorithme qui peut déterminer un itinéraire de communication dans le temps disponible pour une prédiction déterminé par l'unité de détermination de temps de prédiction ; une unité d'exécution pour déterminer un itinéraire de communication entre la station de base d'agrégation et la station à distance en exécutant l'algorithme sélectionné par l'unité de sélection ; et, une unité de commande de commutation pour commander la commutation des itinéraires de communication à l'aide du commutateur de telle sorte que la station de base d'agrégation et la station à distance communiquent par l'itinéraire de communication déterminé par l'unité d'exécution.
PCT/JP2021/023454 2021-06-21 2021-06-21 Dispositif de commande d'itinéraire, système de communication et procédé de commande d'itinéraire Ceased WO2022269707A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2023529233A JP7559947B2 (ja) 2021-06-21 2021-06-21 経路制御装置、通信システム、及び経路制御方法
PCT/JP2021/023454 WO2022269707A1 (fr) 2021-06-21 2021-06-21 Dispositif de commande d'itinéraire, système de communication et procédé de commande d'itinéraire

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2021/023454 WO2022269707A1 (fr) 2021-06-21 2021-06-21 Dispositif de commande d'itinéraire, système de communication et procédé de commande d'itinéraire

Publications (1)

Publication Number Publication Date
WO2022269707A1 true WO2022269707A1 (fr) 2022-12-29

Family

ID=84545286

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2021/023454 Ceased WO2022269707A1 (fr) 2021-06-21 2021-06-21 Dispositif de commande d'itinéraire, système de communication et procédé de commande d'itinéraire

Country Status (2)

Country Link
JP (1) JP7559947B2 (fr)
WO (1) WO2022269707A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170163342A1 (en) * 2014-07-11 2017-06-08 Telefonaktiebolaget Lm Ericsson (Publ) Optical Transport Network
JP2019009588A (ja) * 2017-06-23 2019-01-17 日本電信電話株式会社 通信システム
JP2019029842A (ja) * 2017-07-31 2019-02-21 株式会社Ｎｔｔドコモ フロントホールマルチプレクサおよび無線通信システム

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170163342A1 (en) * 2014-07-11 2017-06-08 Telefonaktiebolaget Lm Ericsson (Publ) Optical Transport Network
JP2019009588A (ja) * 2017-06-23 2019-01-17 日本電信電話株式会社 通信システム
JP2019029842A (ja) * 2017-07-31 2019-02-21 株式会社Ｎｔｔドコモ フロントホールマルチプレクサおよび無線通信システム

Also Published As

Publication number Publication date
JP7559947B2 (ja) 2024-10-02
JPWO2022269707A1 (fr) 2022-12-29

Similar Documents

Publication Publication Date Title
JP6278492B2 (ja) ソフトウェア定義ネットワーキングにおける、トラフィックエンジニアリングのためのフレームワーク
US11290375B2 (en) Dynamic deployment of network applications having performance and reliability guarantees in large computing networks
US9485689B2 (en) Adaptive traffic engineering configuration
US10129894B2 (en) Systems and methods for performing traffic engineering through network slices
US10904794B2 (en) Framework for traffic engineering in software defined networking
WO2015096761A1 (fr) Zonage dynamique entraîné par un comportement de circulation pour une ingénierie de circulation répartie dans un réseau sdn
Ibrahim et al. Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture
Farmanbar et al. Traffic engineering for software-defined radio access networks
US20250081270A1 (en) Transmission system, switching control apparatus, switching control method and program
Tiwana et al. Software-defined networking’s adaptive load optimisation technique for multimedia applications with multi-controller utilisation
CN106506275A (zh) 一种预测交换节点目的端口传输时延的方法及装置
EP3942756B1 (fr) Procédés, appareils et programmes informatiques pour la configuration d'un réseau de télécommunication
US20110206034A1 (en) Route allocation apparatus and method
JP7559947B2 (ja) 経路制御装置、通信システム、及び経路制御方法
CN118900253B (zh) 拥塞控制方法、系统、装置、计算机设备以及存储介质
Moeyersons et al. Enabling emergency flow prioritization in SDN networks
JP7330922B2 (ja) 通信管理方法、通信システム及びプログラム

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 2023529233

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

Country of ref document: EP

Kind code of ref document: A1