WO2016132429A1 - Système de communication, procédé de commande de communication et serveur de commande - Google Patents

Système de communication, procédé de commande de communication et serveur de commande Download PDF

Info

Publication number
WO2016132429A1
WO2016132429A1 PCT/JP2015/054124 JP2015054124W WO2016132429A1 WO 2016132429 A1 WO2016132429 A1 WO 2016132429A1 JP 2015054124 W JP2015054124 W JP 2015054124W WO 2016132429 A1 WO2016132429 A1 WO 2016132429A1
Authority
WO
WIPO (PCT)
Prior art keywords
communication quality
route
function
base station
user terminal
Prior art date
Application number
PCT/JP2015/054124
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/JP2015/054124 priority Critical patent/WO2016132429A1/fr
Publication of WO2016132429A1 publication Critical patent/WO2016132429A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present invention relates to a communication network for providing a service that guarantees communication quality to a user, a communication network control method, and a communication control device, a communication device, and a user terminal capable of executing the control.
  • the fourth generation mobile communication service is provided all over the world, which is a best effort service intended to provide a fair communication service to more users.
  • wired dedicated line services capable of guaranteeing communication quality such as communication bandwidth guarantee and communication delay guarantee are provided for mission critical business applications such as financial services.
  • the mobile communication service has the advantage that it is not necessary to lay cables such as optical fibers for communication, so it can be expected to expand to mission-critical business applications in the future.
  • cables such as optical fibers for communication
  • it is difficult to use the mobile communication service for mission critical work from the viewpoint of communication quality.
  • the transmitted data packet may not reach the receiver, and packet discard may occur in the middle of the communication network.
  • the sender is forced to retransmit the communication packet, and a processing delay due to a communication delay occurs. Therefore, the transmitter is not suitable for an application that requires real-time performance. Or, the response packet to the request is discarded, so that the request is retransmitted, and the risk that double processing is performed on the receiving side increases.
  • the packet discard rate or the packet arrival rate obtained by subtracting the packet discard rate from 1 (hereinafter, unified in this specification as the packet arrival rate). is there. That is, it is necessary to be able to control the packet arrival rate so that the request is always satisfied according to the packet arrival rate of the user request.
  • Patent Document 1 in a wired (MPLS: Multi Protocol Protocol Switching) network, the packet arrival rate and communication delay are measured for each section on the route, and the packet arrival rate or communication delay of the current route is determined.
  • a technique is disclosed that resets a route that can protect the threshold when the threshold is deteriorated below a predetermined threshold.
  • Patent Document 2 discloses a technique for controlling m so as to achieve a target packet arrival rate by broadcasting to m devices instead of retransmission in a wireless ad hoc network.
  • Patent Document 1 applies to a wired network, the communication quality of a wireless network is likely to vary as compared to a wired network, and it is necessary to consider the correspondence with an emphasis on the packet arrival rate in the wireless section.
  • the packet arrival rate can be improved by performing multi-routing as in Patent Document 2 or performing retransmission control, but it is necessary to cope with an increase in resource consumption such as communication bandwidth. is there.
  • the present invention provides a packet arrival rate requested by each user in a communication section including a wireless section and a wired section while suppressing resource consumption such as a communication band even when the communication quality of the wireless section changes.
  • An object is to provide a communication path that satisfies the above.
  • a communication system includes a plurality of base stations, a plurality of relay nodes, and a control server, and communicates between a connection destination device and a user terminal via the plurality of base stations and the plurality of relay nodes.
  • the communication system communicates wirelessly between the user terminal and the base station.
  • the control server includes a first function for measuring the total communication quality of the existing route set between the connection destination device and the user terminal, and a request that the measured total communication quality is requested by the user terminal.
  • a second function for determining whether or not a predetermined condition based on communication quality is satisfied, a third function for listing additional path candidates that can be newly added to an existing path, and a connection destination device and a user terminal A fourth function for estimating the estimated total communication quality when an additional route candidate is added to an existing route set between the two, and the total communication quality of the existing route does not satisfy a predetermined condition based on the required communication quality
  • a relay node and a base station that are additional route candidates are set so that an additional route candidate whose estimated total communication quality satisfies a predetermined condition based on the required communication quality is added to the existing route.
  • the relay node and the base station have a function of measuring the communication quality of the previous link from the received packet, and the first function of the control server is measured from the relay node and the base station. It has a function of obtaining communication quality and a function of calculating and measuring the total communication quality of an existing route set between the connection destination device and the user terminal from the obtained communication quality.
  • the fourth function of the control server includes a function of setting a relay node and a base station that are candidates for an additional route in order to enable the operation of the candidate of an additional route with respect to an existing route, A function for instructing generation and transmission of a test packet to a relay node and a base station, which constitutes an additional path candidate that is made operable, and a test packet received from the relay node and base station that received the test packet.
  • a function for obtaining the communication quality of the previous link based on the communication quality of the previous link based on the test packet and the communication quality of the previous link obtained from the relay node and the base station configuring the existing route.
  • the third function of the control server is a function of listing a newly addable base station and a route from the addable base station to an existing route as additional route candidates.
  • the fourth function of the control server calculates the communication quality of the additional path candidate portion from the communication quality of the previous link based on the test packet, and acquires the previous link obtained from the relay node and the base station constituting the existing path.
  • the communication quality of the existing path portion is calculated from the communication quality of the current route, and the estimated total communication quality is calculated using these.
  • Another aspect of the present invention provides a communication system that includes a plurality of base stations, a plurality of relay nodes, and a control server, and communicates between a connection destination device and a user terminal via the plurality of base stations and the plurality of relay nodes. It is the communication control method to control.
  • the control server performs a first step of measuring the total communication quality of the existing route set between the connection destination device and the user terminal, and the requested communication that the measured total communication quality requires by the user terminal.
  • a relay node and a base station that are additional route candidates are set so that an additional route candidate whose estimated total communication quality satisfies a predetermined condition based on the required communication quality is added to the existing route.
  • the plurality of base stations and the plurality of relay nodes measure the communication quality of the previous link
  • the first step of the control server collects the measured communication quality of the previous link
  • a step of calculating the total communication quality using the collected communication quality
  • the first step of the control server includes a step of storing the collected communication quality of the link
  • the fourth step of the control server includes the base station and the relay that constitute the additional route candidate.
  • the step of instructing the node to set the route, the step of instructing the base station and the relay node for which the route has been set to transmit the test packet, and the base station and the relay node that have received the test packet are tested. Collecting the communication quality of the previous link measured using the packet, calculating the estimated total communication quality using the stored link communication quality and the link communication quality measured using the test packet Have
  • Another aspect of the present invention is a communication system that includes a plurality of base stations, a plurality of relay nodes, and a control server, and communicates between a connection destination device and a user terminal via the plurality of base stations and the plurality of relay nodes.
  • Control server This server has a first function for measuring the total communication quality of the existing route set between the connection destination apparatus and the user terminal, and the measured total communication quality determines the required communication quality required by the user terminal.
  • the third function for listing deletion path candidates that can be deleted from the existing path, and the existing path set between the connection destination device and the user terminal, the deletion path A fourth function for estimating the estimated total communication quality when the candidate is deleted; and a predetermined condition based on the required communication quality when the total communication quality of the existing route exceeds the required communication quality by a predetermined value or more. It has a fifth function of setting the relay node and the base station as additional route candidates so that additional route candidates satisfying the above condition are added to the existing route.
  • a communication network includes a user terminal, a plurality of radio base stations, a plurality of relay apparatuses, a mobility management apparatus, and a control server. Communication is performed between the connection destination device and the user terminal via the plurality of radio base stations and the plurality of relay devices.
  • User terminals, radio base stations, and relay devices have a function of transmitting and receiving test packets for measuring communication quality.
  • the user terminal, the radio base station, and the relay apparatus have a function of copying a plurality of data packets.
  • the user terminal, the radio base station, and the relay device have a function of assigning / deleting the current time and sequence number to the data packet.
  • the user terminal, the radio base station, and the relay device have a function of calculating a one-way communication delay and a packet arrival rate based on the time and sequence number extracted from the data packet.
  • the user terminal, the radio base station, and the relay apparatus have a function of requesting retransmission to the transmitting apparatus when a missing sequence number is detected, and a function of retransmitting the corresponding packet in response to the retransmission request of the receiving apparatus. To do.
  • control server has a function of holding inter-device connection information, a transfer destination device table for each IP address, a table for managing a communication path and communication quality, and a radio base station list. Is changed, the communication path is changed so as to satisfy the communication quality requested by the user, and the changed communication path is set in the radio base station and the relay device.
  • the present invention it is possible to maintain the packet arrival rate in the communication section including the wireless section and the wired section when the communication quality changes in the wireless section where the communication quality varies greatly.
  • Configuration block diagram of a communication network Configuration block diagram of communication network in embodiment Control flow chart of route addition according to the embodiment Configuration block diagram of control server of embodiment Table showing an example of the destination table of the embodiment Table showing an example of the base station list of the embodiment Table showing an example of the service class management database of the embodiment Table showing an example of the link database of the embodiment Table showing an example of the route database of the embodiment Configuration block diagram of user terminal of embodiment Configuration block diagram of the node of the embodiment Configuration block diagram of interface card of node of embodiment Control flow chart of additional route candidate list-up according to embodiment Table of route candidate list of embodiment Table of route candidate list of embodiment Control flowchart of route deletion according to the embodiment Control flowchart of deletion path candidate list-up according to embodiment Control flow chart of route addition and deletion according to the embodiment
  • notations such as “first”, “second”, and “third” are attached to identify the constituent elements, and do not necessarily limit the number or order.
  • a number for identifying a component is used for each context, and a number used in one context does not necessarily indicate the same configuration in another context. Further, it does not preclude that a component identified by a certain number also functions as a component identified by another number.
  • FIG. 1 is a configuration diagram of a communication network according to the present embodiment.
  • the communication network includes a user terminal (T) 101 with which a user communicates, a radio base station (Ax (x is a number)) 102 that communicates with the user terminal, a router connected to the radio base station, a communication device such as an L2 switch ( Bx, Cx, Dx, E) 103.
  • An application server (AP) 104 is a connection destination device of a user, and provides data and services to the user.
  • a mobile management device (MNG) 105 performs user location management, radio base station management, and the like.
  • the control server (CS) 106 is a device that performs communication quality control.
  • the radio base station (Ax) 102 and the communication devices (Bx, Cx, Dx, E) 103 are collectively referred to as nodes.
  • the communication device (E) 103e is called an end node.
  • a user terminal (T) 101 is configured to communicate with a plurality of radio base stations 102.
  • the communication device 103 is configured to be connectable between the user terminal (T) 101 and the end node (E) 103e through a plurality of routes.
  • a user (user terminal) is assigned to a physical communication network as shown in FIG. 1, for example, for each service.
  • a user network is a communication channel or a set of channels assigned to one or more users (terminals).
  • the user network may physically allocate specific resources to the user, or may virtually allocate specific resources to the user by, for example, an encapsulation technique.
  • the communication quality of the user network is required to satisfy the user requirements.
  • the communication quality between the user terminal (T) 101 and the application server (AP) 104 is guaranteed.
  • the application server (AP) 104 and the end node (E) 103e are directly connected, and the communication quality between them is guaranteed.
  • the communication quality between the user terminal (T) 101 and the end node (E) 103e is monitored and controlled.
  • an additional route candidate that can be additionally used by the user terminal is selected.
  • the communication quality when the additional route candidate is used is estimated, an additional route satisfying a predetermined threshold requested by the user terminal is selected, and a route with less resource consumption is added to the communication route. .
  • a solid line between nodes represents a connection relation for transferring a user data packet.
  • a dotted line represents a control signal path for a node or a signal path for acquiring information from the node.
  • FIG. 2 is a communication network configuration diagram in which a part of the configuration of FIG. 1 is taken out for explanation.
  • a numerical value written between the base station 102 and each node 103 (hereinafter referred to as a link) is a downlink (direction from the application server 104 toward the terminal 101) packet arrival rate in the link.
  • a downlink direction from the application server 104 toward the terminal 101
  • uplink direction from the terminal toward the application server
  • a path or route is formed by connecting a plurality of links.
  • the user request packet arrival rate was 0.94.
  • the user request packet arrival rate is defined as a packet arrival rate between the user terminal 101 and the end node 103e.
  • the user request packet arrival rate depends on how the range in which quality is to be guaranteed is determined, if the quality is guaranteed between the user terminal 101 and the nodes (D1, D2) 103, the user terminal 101 And the node (D1, D2) 103 may be the user request packet arrival rate.
  • the communication quality between the user terminal (T) 101 and the end node (E) 103e will be described.
  • the communication quality between the user terminal 101, the radio base station 102, and each node is measured.
  • the transmission side adds a sequence number to the transmission packet
  • the reception side monitors the sequence number
  • the packet loss may be measured based on the missing sequence number.
  • some commercial wireless standards such as TCP (Transmission Control Protocol) protocol
  • TCP Transmission Control Protocol
  • a compliant sequence number may be used.
  • the radio quality for example, packet arrival rate and error rate
  • the radio base station 102 is also monitored by current commercial radio base stations for transmission output control and the like. can do.
  • the packet arrival rate is shown next to the solid line representing the connection relationship for transferring the user's data packet.
  • the link shown with a thick continuous line in FIG. 2 is a link which comprises a user network now.
  • the packet arrival rate between the node (C1) and the node (D1) is 0.97
  • the packet arrival rate between the node (D2) and the end node (E) is 0.98.
  • the link between the node (B1) and the node (C1) indicated by a double line is a link for performing retransmission confirmation described later, and the arrival rate is 1.0 (100%).
  • packet arrival rates between the nodes are transmitted to the control server 106, where the packet arrival rate between the user terminal 101 and the end node 103e is calculated by a predetermined calculation.
  • the packet arrival rate between the start and end points of a path composed of a plurality of links connected in series is obtained by the product of the packet arrival rates of the links.
  • a multi-routed path (for example, between the terminal 101 and the node (B1) in FIG. 2) is obtained by subtracting the probability that a packet cannot reach even from multi-route from 1.
  • the route X and the route Y are The packet arrival rate R between the start end A and the end point B used (multi-routed) is as follows.
  • R 1- (1-RX) * (1-RY)
  • calculation of a path E-D1-C1-B1- (A2 or A3) -T in FIG. 2 is as follows.
  • the communication quality is monitored for each user network, and a route is added or changed as necessary. Therefore, routes that can be added structurally are extracted from the route configuration information.
  • a route from (A4) to (D2) surrounded by a dotted line is an additional route candidate.
  • the combination of various links can be considered as the additional route candidate, but it is desirable to secure the required quality of the user by selecting a candidate that consumes as little resources as possible.
  • FIG. 3 is an overall flowchart of processing for adding a communication path in order to ensure the required quality of the user in this embodiment.
  • step S100 for each user network, the measurement quality KPIm between the user terminal and the end node is compared with the user required quality KPIu in a predetermined order, for example, in descending order of priority, and control necessity is determined.
  • the method of determining the priority order of the user is arbitrary, but there are methods such as determining the order of the charge class paid by the user in descending order or determining the order in which the required quality of the user is strict.
  • the required quality is, for example, a packet arrival rate or a packet delay time.
  • there is a method of setting a priority order such as determining the arrival rate with priority over the delay time.
  • the measurement quality KPIm may be determined by comparison with a threshold value provided in consideration of the allowable range (margin) of the measurement quality KPIm. For example, the user request arrival rate is set to Ru, the user request delay is set to Du, the measured arrival rate is set to Rm, the measured delay is set to Dm, the arrival rate margin is set to Rs, and the delay margin Ds is set. At this time, if Rm ⁇ Ru + Rs or Dm> Du-Ds, it is determined that a communication path needs to be added. Such a determination can be made on a regular basis or discretely (once a day, once an hour, etc.).
  • route switching and multi-route copy setting change are performed while using the user network, so that appropriate margins Rs and Ds can be secured in consideration of packet loss and delay when switching or changing. desirable.
  • step S110 If the measurement quality KPIm does not satisfy the user required quality KPIu as a result of the determination, the communication quality needs to be improved and the process proceeds to step S110. If not, it is determined that the communication quality does not need to be improved, and the process returns to step S100 to process the next priority user network.
  • uplink and downlink in communication there are uplink and downlink in communication, and quality comparison may be performed on only one side and quality may be guaranteed on only one side, or both may be performed and quality on both sides may be guaranteed.
  • step S110 candidate routes that can be added are listed in order to improve communication quality.
  • This searches for a path that can be added to the path between the user terminal 101 and the end node 103e based on management information such as the control server 106 that manages the entire configuration of the communication network shown in FIG. Then, a test packet is sent to the additional route candidate portion, the communication quality is measured, and based on this, the communication quality of the route between the user terminal 101 and the end node 103e is estimated. Those whose estimated quality satisfies user requirements are listed as additional route candidates.
  • step S120 candidates that do not satisfy other specifications (specs) requested by the user are excluded from the listed routes.
  • the specifications required by the user include, for example, delay and bandwidth.
  • step S130 the additional route candidate is selected which has the smallest increase in consumption resources or is equal to or less than a predetermined value.
  • Various methods can be considered for evaluating the consumed resources. A simple method is to count the number of links. In the case of multi-route, this is the total number of links for each route. In addition, when the band varies depending on the link, the band may be weighted.
  • step S140 the communication path of the selected additional path candidate is set.
  • test packets are sent from the terminal to the end node, the communication quality KPIm is measured, and the effect of adding the communication path is grasped before the actual path switching.
  • an effect measurement method there is a method of checking whether the measured communication quality KPIm satisfies the user-required quality, as in step S110. If there is no effect, the process returns to step S130, and among the additional route candidates, for example, the one with the next smallest increase in the consumed resource is selected, and the process of step S140 is performed.
  • step S150 if the selected additional route candidate is effective, the set communication route is added to the current communication route. For this reason, the control server 106 transmits information specifying the nodes and the like on the additional route candidates before and after the base station 102 and the node 103 constituting the additional route candidate.
  • an instruction is transmitted to add the node or the like to the transfer path for the destination. That is, a relay device such as a node distributes and transmits packets according to the destination, but adds the transmission destination. Specifically, each node or base station switches the connection between input / output ports by a switch (for example, 1101 in FIG. 11) based on an instruction from the control server, or when a multi-route is added, the multi-route The copy setting (for example, 1208 in FIG. 12) is changed.
  • FIG. 4 is a functional configuration diagram of the control server (CS) 106.
  • the control server can be configured by a computer including a processing device 410, a magnetic disk storage device (HDD) 411, and a memory 412.
  • an interface 413 capable of communicating with an external terminal and the nodes 102 and 103 is provided.
  • other input / output devices such as a keyboard and a monitor may be provided.
  • FIG. 4 these are shown as the configuration of one information processing apparatus, but all or part of each element or function may be configured as another apparatus connected via a network.
  • the control function 401 is a function for controlling the entire processing shown in FIG. 3 in cooperation with other devices and databases. Also, if necessary, the terminal 101, the base station 102, and the node 103 are instructed to generate a test packet and set a route.
  • the consumption resource calculation function 402 is a function for calculating the consumption resource of each route candidate, and executes step S120 of FIG.
  • the control function 401 and the consumption resource calculation function 402 can be realized by operating the processing device 410 by software stored in the storage device 411 or the memory 412.
  • the memory 412 or the HDD 411 stores data described below.
  • the destination table 403 is referred to when route candidates are listed in step S110 of FIG.
  • the base station list 404 stores information related to the radio base station 102 of FIG.
  • the service class management database 405 stores information about users.
  • the link database 406 stores connection relations of links in the network.
  • the route database 407 stores the configuration of the user network assigned to the user and the latest communication quality.
  • FIG. 5 is a data table showing an example of the destination table 403.
  • the destination table is route search data provided in a normal relay device.
  • Reference numeral 501 denotes a destination IP address.
  • the relay device that has received the packet having the IP address transfers the packet to the next device determined by the IP address.
  • the device (B1) receiving the packet having the address abcd transmits the packet to the device (C1) or (C2).
  • the management server 106 can hold or access the destination table of each relay device.
  • Reference numeral 502 denotes a device ID
  • reference numeral 503 denotes a device ID to be transmitted next. If this destination table is used, the route through which the packet actually flows can be known, so that additional route candidates can be narrowed down.
  • FIG. 6 is a data table showing an example of the base station list 404.
  • Reference numeral 601 denotes a number assigned to each base station
  • 602 denotes a device ID for identifying each base station
  • 603 denotes a wireless arrival rate as a numerical value indicating communication quality between each base station and a terminal.
  • other data indicating other qualities such as an error rate and a delay time may be included.
  • FIG. 7 is a data table showing an example of the service class management database 405.
  • the service class management database 405 manages the required communication quality of the user, the measured communication quality, the user priority order, and the like for each user network.
  • 701 is the priority order of the user network described in step S100 of FIG. 3
  • 702 is a user network ID for identifying the user network
  • 703 is a user ID for identifying the user (terminal) using the user network.
  • 704 is a request arrival rate of the user network
  • 705 is a request delay (unit is, for example, msec)
  • 706 is a request band (unit is, for example, Mbps).
  • 707 is an uplink measurement arrival rate
  • 708 is a downlink measurement arrival rate
  • 709 is an uplink measurement delay
  • 710 is a downlink measurement delay
  • 711 is an uplink measurement band
  • 712 is a downlink measurement band.
  • FIG. 8 is a data table showing an example of the link database 406.
  • the link database 406 manages each link of the communication network shown in FIG. That is, it is a table showing the connection configuration of each device constituting the communication network. Such information is managed by the administrator of the communication network.
  • Reference numeral 801 denotes a link ID assigned to identify a link, and a unique ID is given throughout the network.
  • An end point 1 indicated by 802 and an end point 2 indicated by 803 represent both ends of the link, and are displayed, for example, as “device name-card number-port number”.
  • the link with the link ID “00000001” indicates that the port # 01 of the card # 01 of the device E and the port # 01 of the card # 03 of the device D1 are connected to form a link.
  • FIG. 9 is a data table showing an example of the route database 407.
  • the route database stores the configuration of a user network used by a certain user. For this reason, the table of FIG. 9 is provided for each user network.
  • Reference numeral 901 denotes a route ID for identifying a route constituting the user network, and is given a unique ID in one user network. However, the link ID 801 in FIG. 8 may be used as it is.
  • Reference numeral 902 denotes one end point 1 of the route, and 903 denotes the other end point 2 of the route.
  • Reference numeral 904 denotes the type of link.
  • Reference numeral 905 denotes a path band.
  • Reference numeral 906 indicates whether the link is a multi-route.
  • “Relay” indicates that it is connected to one of the multi-routes and relays it.
  • Reference numeral 907 denotes an uplink arrival rate, 908 a downlink arrival rate, 909 an uplink delay, and 910 a downlink delay.
  • FIG. 10 is a functional block diagram of the user terminal (T) 101.
  • the user terminal 101 includes a processing device 1011, a memory 1012, an HDD 1013, and the like.
  • the following functions can be executed by the processing apparatus 1011 by software recorded in the memory 1012 or the HDD 1013.
  • the user terminal (T) 101 communicates with the base station 102 through the interface 1014.
  • the functions of a normal user terminal are omitted, and only the parts related to this embodiment will be described.
  • the arrival confirmation unit 1001 detects reception of a packet to which a time or a sequence number is added received from the base station via the interface 1014.
  • the time and sequence number can be added to a test packet described later. Moreover, if it is added to all or a part of normal communication packets, it is possible to constantly monitor quality without using test packets.
  • the detected packet is sent to the time and sequence number detection / deletion unit 1003.
  • the time / sequence number detection / deletion unit 1003 detects packet loss from the sequence number of the received packet. When consecutive sequence numbers are assigned from the transmission source, it is possible to detect a missing packet from the missing sequence number. Further, the transmission time is detected from the time stamp added to the packet. If the packet to which the time or sequence number is added is a normal data packet, the time and sequence number are deleted and normal data reception / transmission (transfer) processing is performed.
  • the time information and sequence number missing information detected by the time / sequence number detection / deletion unit 1003 are sent to the arrival rate / delay time calculation unit 1004, where the downstream packet arrival rate and delay time are calculated. .
  • the delay time is obtained from the difference between the transmission time added to the packet and the current time.
  • the packet arrival rate is obtained by dividing the number of missing sequence numbers by the sequence number of the last packet.
  • the calculation result of the arrival rate / delay time calculation unit 1004 is transmitted to the control server 106. Further, the detection result and the calculation result are stored in the memory 1012 as necessary.
  • both the arrival rate and the delay time are calculated, but only one of them may be performed. Further, other communication quality may be detected and calculated.
  • the arrival rate and delay time are calculated by the user terminal (T) 101, but the time and the detection result of the sequence number detection / deletion unit 1003 are transmitted to the control server 106 as they are and are calculated by the control server. You may comprise as follows. The same applies to the configuration of nodes and the like described below.
  • the arrival response generation unit 1002 generates a packet that notifies the transmission source device of the arrival of the packet that has been confirmed by the arrival confirmation unit 1001. Further, for example, when arrival of a packet cannot be confirmed within a predetermined time, the arrival response generation unit may be configured to generate a packet instructing retransmission of the packet. This packet is sent to the transmission source via the transmission / retransmission processing unit 1009.
  • the sequence number assigning unit 1005 assigns an area storing the sequence number to the packet.
  • the time giving unit 1006 gives an area storing the current time to the packet.
  • the test packet generator 1007 generates a test packet.
  • the multi-route copy unit 1008 copies a packet by the number corresponding to a plurality of base stations.
  • the specific configuration may be the same as the multicast function of a commercialized switch device.
  • the transmission / retransmission processing unit 1009 transmits a packet with a sequence number and time to the base station 102. In some cases, a retransmission request is transmitted to the transmission source. Only one of the sequence number and time may be added. Further, information for detecting / calculating other communication quality may be added. Further, as described above, the sequence number and time may be added to all or part of a normal packet in addition to being added to the test packet. The same applies to the configuration of nodes and the like described later.
  • FIG. 11 is a functional block diagram of the node 102 or 103.
  • the node includes a device management unit 1101 that can communicate with the control server 106.
  • One or a plurality of interface cards 1100 and a switch 1102 for connecting the ports of the interface card 1100 are provided.
  • By setting the switch 102 it is possible to connect a predetermined input port and output port and send a packet to a desired next node.
  • the functions of a normal node are omitted, and only the parts related to this embodiment will be described.
  • FIG. 12 is a diagram showing the functional configuration of the interface card 1100 in FIG. 11 in detail. Parts having basically the same functions as those in the configuration of FIG. 10 are given the same names.
  • the arrival confirmation unit 1201 detects reception of a normal or test packet received via the interface 1214.
  • the interface 1214 includes a plurality of ports, and each port communicates with the relay node 103, the terminal 101, or the application server 104.
  • the multiplexer / demultiplexer 1290 communicates with the interface 1214, sorts the packets for each port at the time of reception, and collects the packets for each user at the time of transmission.
  • the arrival confirmation unit 1201 detects the arrival of the packet, and the detected packet is sent to the time and sequence number detection / deletion unit 1203.
  • the time / sequence number detection / deletion unit 1203 detects packet loss from the sequence number of the received packet. When consecutive sequence numbers are assigned from the transmission source, it is possible to detect a missing packet from the missing sequence number. Further, the transmission time is detected from the time stamp added to the packet. If the packet is a normal data packet, the time and sequence number are deleted and normal data reception processing is performed.
  • the destination / exit route search unit 1220 searches for the transfer destination from the address added to the packet by using the destination table held by each node.
  • the multi-route copy unit 1208 copies packets as necessary when the transfer destination is multi-routed.
  • the arrival rate / delay calculation unit 1204 calculates the packet arrival rate and delay based on the sequence number information and time information obtained from the time / sequence number detection / deletion unit 1203. The calculation result is transmitted to the device management unit 1101 and reported to the management server 106.
  • the arrival response generation unit 1202 generates a notification packet that notifies the transmission source device of the presence or absence of packet arrival.
  • the sequence number assigning unit 1205 assigns an area storing the sequence number to the packet.
  • the time assigning unit 1206 assigns an area storing the current time to the packet.
  • the test packet generator 1207 generates a test packet.
  • the transmission / retransmission processing unit 1209 transmits the packet to which the sequence number and time are assigned to the next device, and transmits the notification packet formed by the arrival response generation unit 1202.
  • the configuration of the base station 102 is basically the same as that shown in FIGS. However, since the base station 102 communicates with the terminal 101 wirelessly, the interface 1214 has a configuration capable of wireless communication.
  • the communication quality of each link calculated by the arrival rate and delay calculation unit 1004 or 1204 of the terminal 101 of FIG. 10 and the node 103 shown in FIGS. 11 and 12 is transmitted to the control server 106, and the route database shown in FIG. Managed as data.
  • link quality measurement data is transmitted to the control server 106 from the terminal 101 or the node 103 constantly or periodically.
  • the sequence number is assigned to the packet by the sequence number assigning unit 1005 of the terminal 101 or the sequence number assigning unit 1205 of the nodes 102 and 103, and the time and sequence number detection /
  • the deletion unit 1003 or the time of the nodes 102 and 103 and the sequence number detection / deletion unit 1203 confirm the lack of the sequence number of the packet, and measure the arrival rate of the packet.
  • the packet may be a normal data packet or a test packet generated by the test packet generator 1007 of the terminal 101 or the test packet generator 1207 of the nodes 102 and 103. A normal packet can be measured at any timing. If it is a test packet, it may be discarded without performing processing such as deletion of the sequence number.
  • the arrival rate measurement method may be configured to send a predetermined fixed number (for example, 100) of test packets without assigning a sequence number.
  • the arrival rate can be measured by counting the number of received packets on the receiving side.
  • the time giving unit 1006 of the terminal 101 or the time giving unit 1206 of the nodes 102 and 103 gives the transmission time to the packet, and the time of the terminal 101 and the sequence number detection / deletion unit 1003.
  • the time of the nodes 102 and 103 and the arrival time of the packet are confirmed by the sequence number detection / deletion unit 1203, and the packet delay time is measured.
  • the packet may be a normal data packet or a test packet generated by the test packet generator 1007 of the terminal 101 or the test packet generator 1207 of the nodes 102 and 103.
  • a normal packet can be measured at any timing. If it is a test packet, it may be discarded without performing processing such as deletion of the sequence number.
  • the arrival rate measurement method may be configured such that a test packet is sent at a predetermined fixed timing (every hour, for example, at 12 o'clock) without giving a transmission time. If the timing interval is set sufficiently longer than the delay time, the arrival rate can be measured by measuring the arrival time on the receiving side. With this method, it is not necessary to give a transmission time, but the degree of freedom of measurement timing is limited. Each node needs to have a common clock.
  • the management server 106 updates the quality data 907 to 910 shown in FIG. 9 with the link quality measurement data obtained from the terminal 101 and the node 103 at all times or regularly.
  • step S100 of FIG. 3 it is determined whether the measurement quality satisfies the required quality for each user network.
  • the communication quality between the user terminal (T) 101 and the end node (E) 103e of each user network is calculated based on the quality data 907 to 910 of the route database 407 shown in FIG.
  • the timing of calculation may be simultaneous with or different from the update of the quality data 907 to 910 described above.
  • the calculation method is the added value of the delay time of each link for the delay time.
  • the packet arrival rate there is a method described in ⁇ Overall system>.
  • the calculated communication quality of each user network is stored as measurement data 707 to 712 in the service class management database 405 shown in FIG.
  • the measurement data in the service class management database 405 is updated or monitored constantly or periodically, and when the measurement data 907 to 910 no longer satisfy the required quality 704 to 706, step S100 determines that communication quality needs to be improved.
  • the process after S110 is performed. Of course, the determination may be made using only a part of the required qualities 704 to 706. For example, when the communication quality is evaluated using the downlink packet arrival rate, if the measurement data falls below the required downlink packet arrival rate by a predetermined amount, the process proceeds to step S110. If a certain user network satisfies the required quality, the process returns to step S100, and the same processing is performed in the order of priority 701 in the service class management database 405 shown in FIG.
  • step S110 of FIG. 3 a list of routes that can be added is provided.
  • FIG. 13 is a flowchart showing details of the process of step S110 for listing additional route candidates in the process of FIG.
  • the route candidate list is created in the memory 412 or the like of the management server 106 by the processing of FIG. 3 and used for route selection processing.
  • the tables in FIGS. 14 to 15 are for explaining the concept of the invention, and may be different from the data stored in the memory in the actual system.
  • the management server 106 acquires information indicating the presence and destination of the base station from the mobile management device 105, and requests the radio quality information from each base station 102.
  • the management server 106 is connected to the mobile management apparatus 105 and each base station 102 via a network.
  • the mobile management apparatus 105 has basic information data of the user terminal 101 and the base station 102 in order to manage communication between the user terminal 101 and the base station 102.
  • the base station 102 has a function of evaluating communication quality with the terminal 101 in order to control communication with the user terminal 101. These are functions provided with the current mobile management apparatus 105 and the base station 102.
  • the management server 106 generates a base station list 404 shown in FIG. 6 from information obtained from the mobile management device 105 and the base station 102 and stores it in the storage device 411 or 412.
  • the base station shown in FIG. 6 is a base station capable of communicating with a terminal (link setting is possible) as a premise. Then, a base station having a communication quality of a certain level or more is selected using, for example, a threshold. For example, in the example of FIG. 6, if the threshold value is 0.9, the device with device ID A1 is excluded because the wireless arrival rate is low, and other base stations A2 to A4 are selected.
  • the wireless section has a larger change in communication quality than the wired section.
  • a base station may be selected using an index other than the radio arrival rate in addition to or instead of the radio arrival rate.
  • Other indicators include error rate and noise level.
  • the base stations extracted in this way are listed as base station data 1402 in FIG.
  • step S112 the host device of the selected base station is searched, a route that does not match the existing route is set as an additional candidate, and a branch point from the existing route is listed.
  • the host device selected in step S111 is searched for.
  • the link database 406 is data normally managed by a communication network manager (or management server) for setting the communication network. As shown in FIG. Connection configuration) is listed. Therefore, it is possible to acquire the host device (connection destination) using the base station selected in step S111 as a starting point. For example, according to FIG. 8, it can be seen from the data of the link ID “09999999” that the upper apparatus of the base station A1 is the node B1.
  • the host device searched in this way is stored as host device data 1403 in FIG.
  • the destination table shown in FIG. 5 lists transfer destinations of packets having a predetermined address. This information can be obtained by collecting information held by each node. Even if they are physically connected, those that are not set as transfer routes cannot be used as routes, so it is possible to confirm whether or not the route can be used according to the destination table.
  • the link that does not match the existing route is traced back to the existing route with reference to the link database 406. Then, a connection point with the existing route (a branch point from the existing route) is listed.
  • the route of the existing route can be known from the information in the route database 407 shown in FIG.
  • nodes C1, D1, and E are listed as branch points from the existing route.
  • the branch point searched in this way is stored as the branch point data 1404 in FIG.
  • step S113 for each route candidate, the communication quality R between the user terminal (T) 101 and the end node (E) 103e when the route is added is obtained.
  • R being the arrival rate of packets.
  • step S113 an additional route from the terminal 101 to the branch point is set for each additional candidate, and a communication quality R1 is calculated by flowing a test packet.
  • a communication quality R1 is calculated by flowing a test packet.
  • FIG. 2 there are three possible additional routes: A4-B2-C1, A4-B2-C2-D1, and A4-B2-C2-D2-E. Therefore, these routes are set, a test packet is generated by the test packet generator described with reference to FIGS. 10 and 12, the communication quality of each link is measured at the receiving node, and reported to the management server 106. In the management server, the communication quality from the terminal 101 to the branch point is calculated as described above. The determined communication quality is set as the communication quality R1 of the additional candidate portion.
  • a command is transmitted from the management server 106 to the target node or base station, and the switch 1102 and the multiplexer / demultiplexer 1290 may be set in the same way as the normal path switching. The same is true for the test packet generation instruction.
  • the communication quality obtained in this way is stored as communication quality data R1 1405 in FIG.
  • step S114 with reference to the route database 407 of FIG. 9, the communication quality R0 between the branch point and the end node (E) 103e is calculated using the quality data 907 to 910 of each link.
  • the link configuration from the branch point of the existing route to the end node is obtained by referring to the route database 407.
  • R f (R0, R1) between the terminal 101 and the end node (E) 103e.
  • the communication quality estimated in this way when an additional route candidate is added is stored as communication quality data R 1406 in FIG.
  • step S116 whether the estimated communication quality between the terminal 101 and the end node (E) 103e when this additional route candidate is added satisfies the required communication qualities 704 to 706 shown in the service class management database of FIG. Determine if. If the quality is an arrival rate, the communication quality data R1406 shown in FIG. 14 is compared with the user request arrival rate 704 shown in the service class management database 405 of FIG. 7, and what is satisfied is determined to be usable. Those that are not satisfied are judged as unusable. In the example of FIG. 14A, the determination result is shown in 1411, and it is determined that the packet arrival rate R is 0.85 or less is unacceptable and 0.95 or more is acceptable.
  • the result determined in this way is stored as the determination 1411 in FIG.
  • the retransmission function of the communication path is a function of confirming the arrival of a packet on the receiving side and sending a retransmission request to the transmitting side and retransmitting the packet when the packet cannot be received. If the retransmission function is enabled, the arrival rate is theoretically 100%, but the delay time is increased by the amount of retransmission time.
  • step S117 the retransmission function is turned on and the evaluation is performed again.
  • Candidate # 000002 is put on hold (blank), but for this candidate, the retransmission function is turned on and quality judgment is performed again with the test packet. That is, when a test packet is sent to an additional route candidate, the packet retransmission function is turned on and the same evaluation is performed.
  • the evaluated result when the retransmission function is ON is stored as data R ′ 1408 in FIG. Then, candidates that satisfy the request packet arrival rate are added to the route candidate list.
  • the additional route candidate # 000002 has the packet arrival rate R ′ after the retransmission function shown in the column 1408 to satisfy the request due to the retransmission function being ON, so the determination column 1411 can be determined. It became.
  • the communication quality is rarely deteriorated and the arrival rate is often improved by retransmission of the packet.
  • the packet arrival rate can be improved by making the route multi-routed.
  • step S118 the route database is referenced, and the link between the branch point and the end node is listed as data 1407 in the route candidate list in FIG. To do.
  • the delay time can be measured by the test packet. From the delay time of the additional route candidate and the delay time of the existing route, the delay time between the terminal and the end node can be calculated in the same manner as the arrival rate. Therefore, the calculated delay time data 1410 is stored. What is necessary is just to calculate the sum of the delay time of each link for delay time. When multi-routes are included, the longest delay time among the multi-routes may be taken or an average value may be taken.
  • the link number data 1409 is used when calculating the consumed resources of the additional route.
  • the communication quality is measured by sending a test packet only to the additional path candidate part, and the user terminal and the end node are used for the existing path part using the communication quality that is constantly observed. The quality between is estimated.
  • step S120 additional route candidates whose other qualities such as delay and bandwidth do not satisfy the user request are deleted. For example, it is assumed that the user request of the delay time is 15 or less as compared with the user request delay time 705 shown in the service class management database 405 of FIG.
  • FIG. 15C shows the above example.
  • Candidate # 000005 cannot be determined (or deleted from the list) because the delay time does not satisfy the request.
  • step S130 the additional route candidate that has the smallest increase in consumption resources is selected.
  • consumed resources There are various methods for evaluating consumed resources. For example, if the bandwidth is considered as a resource and the bandwidth of each link is assumed to be the same, the number of consumed links 1409 may be considered proportional to the consumed resource. In addition, when the bandwidth is different for each link, the link may be weighted with the bandwidth.
  • the bandwidth of each link is the same, and the links are sorted in ascending order of the number of links.
  • the number of links may or may not include the link of the wireless portion, and is arbitrary, but is included in the example of FIG.
  • Such calculation can be performed by the consumption resource calculation function 402 of the management server 106.
  • the rank may be determined based on other quality, for example, superiority or inferiority of the delay time. In the example shown in FIG. 15D, in the candidates # 00003 and # 00006 having the same number of links, # 00006 having a small delay is placed at the top.
  • step S140 the communication path of the selected additional path candidate is set, and after the setting, the test packet is sent to measure the communication quality and the effect of adding the communication path is measured. That is, the test packet is actually sent from the terminal to the end node, and the test for measuring the communication quality is performed.
  • candidate # 000002 satisfies the communication quality and consumes the least amount of resources. Therefore, a route between the branch point of candidate # 000002 and the end node is set to each node, and a test packet is sent.
  • the measurement / evaluation method is the same as the method already described.
  • the candidate route is added to the current communication route.
  • it may be determined whether or not the measurement quality satisfies the user required qualities 704 to 706 shown in the service class management database of FIG. If there is no effect, the process returns to step S130, and a test is performed in the same manner for the route candidate with the next lowest resource consumption. In the example of FIG. 15D, # 00006 is the next candidate.
  • step S150 the route candidate determined to be effective in step S140 is actually set in the user network.
  • the set route is added to the route database shown in FIG. 9, and is thereafter monitored for communication quality.
  • FIG. 16 is an overall flowchart of processing for deleting a route and reducing consumed resources.
  • step S1600 for each user network, the measurement quality KPIm is compared with the user required quality KPIu in a predetermined order to determine whether control is necessary. Regarding the determination, the measurement quality KPIm is compared with the user required quality KPIu, and when the measurement quality exceeds the required quality by a predetermined level or more, it is determined that the resource is consumed more than necessary.
  • step S1610 If it is determined that resources are consumed more than necessary, the consumption resources can be reduced and the process proceeds to step S1610. If not, it is determined that there is no need to reduce the consumption resource, and the process returns to step S1600 to perform the processing of the user network of the next priority.
  • the method of determining the priority order of the user is arbitrary, but there are methods such as determining in ascending order of charge class or in order of less demanding.
  • step S1610 route candidates that may be deleted are listed. Details will be described with reference to FIG.
  • step S1620 the deletion path candidate having the largest resource consumption or a predetermined one or more is selected.
  • Various methods can be considered for evaluating the consumed resources, but there are the number of routes and the like in the case of bandwidth and multi-route.
  • step S1630 assuming that the deletion route candidate is deleted in the route database 407 of FIG. 13, the communication quality between the terminal and the end node is calculated.
  • the packet arrival rate of the route may be calculated as zero.
  • the calculation result is determined based on whether or not the required quality of the service class management database 405 shown in FIG. 7 is satisfied. If the communication quality is not satisfied, the process returns to step S1620, and among the deletion path candidates, for example, the one with the next largest increase in consumption resource is selected, and the process of step S1630 is performed.
  • step S1640 if the communication quality can be maintained even if the selected deletion route candidate is deleted, the current communication route is switched to the set communication route.
  • the path switching method is the same as that described in the first embodiment.
  • a process for checking the quality by flowing a test packet may be added before actually switching the communication path and providing it to the user.
  • FIG. 17 is a detailed flowchart of step S1610 in FIG.
  • step S1611 the wireless base station in use is listed in the route database 407 of FIG.
  • step S1612 the route database 407 is referenced to search for higher-level devices of a plurality of selected base stations. At this time, assuming that the route added in the first embodiment becomes redundant due to the recovery of the communication state, if there is only one upper apparatus, the user network may be excluded from the processing target. Then, the route from the base station to the end node is specified.
  • step S1613 when there are a plurality of routes from a certain node to a certain node in the route from the base station to the end node, the route is listed as a deletion route candidate, and the process proceeds to step S1630.
  • the path between nodes can be specified by referring to the link database in FIG.
  • the addition history of the route added in the first embodiment is recorded, and only the added route is set as a deletion candidate.
  • the added route may be configured to be a deletion candidate with priority.
  • the addition of the route described in the first embodiment and the deletion of the route described in the second embodiment can be used in combination.
  • As a combination method there is a method of performing the route addition processing and the route deletion processing completely independently. Assuming that the resource addition is excessive due to the route addition process, there is a method of performing the route addition process and performing the route deletion process after completing this process.
  • FIG. 18 is an example in which route addition processing and route deletion processing are performed in parallel.
  • step S1800 the measurement quality KPIm is compared with the required quality KPIu for each user network in descending order of priority to determine whether control is necessary. As a result of the comparison, if the required quality is not satisfied, the process proceeds to step S110. If the required quality is higher than necessary as a result of the comparison, the process proceeds to step S1610. In branching based on the above conditions, the process proceeds to steps S110 and S1610 alternatively. The determination of branching is the same as in the first or second embodiment.
  • step S110 additional route candidates are listed.
  • the list-up method is the same as in the first embodiment.
  • step S1610 deletion route candidates are listed.
  • the list-up method is the same as in the second embodiment.
  • step S120 additional route candidates whose delay, bandwidth, etc. do not satisfy the user request are deleted.
  • the method is the same as in Example 1.
  • step S1830 among the additional route candidates, the one with the smallest increase in consumption resource or the deletion route candidate with the largest decrease in consumption resource is selected.
  • the method is the same as in Example 1 or Example 2.
  • step S1840 the selected additional candidate is actually routed, and the effect is measured by sending a packet or a test packet.
  • the method is the same as in Example 1 or Example 2.
  • step S1850 effective route candidates are actually set.
  • control server may be constituted by a single device, or any part of the input device, output device, processing device, and storage device may be constituted by another device connected by a network. .
  • the idea of the invention is equivalent and unchanged.
  • functions equivalent to those configured by software can also be realized by hardware such as FPGA (Field Programmable Gate Array) and ASIC (Application Specific Integrated Circuit). Such an embodiment is also included in the scope of the present invention.
  • the present invention is not limited to the above-described embodiment, and includes various modifications.
  • a part of the configuration of one embodiment can be replaced with the configuration of another embodiment, and the configuration of another embodiment can be added to the configuration of one embodiment.
  • This embodiment can be used for quality assurance of a network user network.
  • Control server 403 Destination table 404 Base station list 405 Service class management database 406 Link database 407 Route database 1400 Table of route candidate list

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Selon l'invention, une vitesse d'arrivée de paquet est garantie pour une section de communication comprenant une section sans fil et une section filaire lorsqu'un changement se produit au niveau de la qualité de communication de la session sans fil dans laquelle la qualité de communication change de manière significative. Un système de communication comporte une pluralité de stations de base, une pluralité de nœuds de relais, et un serveur de commande, réalise une communication entre un appareil connecté et un terminal utilisateur par l'intermédiaire de la pluralité de stations de base et la pluralité de nœuds de relais, et réalise une communication sans fil entre le terminal utilisateur et les stations de base. Dans le système de la présente invention, le serveur de commande comprend : une première fonction pour mesurer la qualité de communication totale d'un chemin existant établi entre l'appareil connecté et le terminal utilisateur ; une deuxième fonction pour déterminer si la qualité de communication totale mesurée satisfait ou non des conditions prédéfinies sur la base de la qualité de communication demandée, demandée par le terminal utilisateur ; une troisième fonction pour réaliser une liste de chemins candidats supplémentaires pouvant être nouvellement ajoutés pour le chemin existant ; une quatrième fonction pour estimer la qualité de communication totale estimée dans le cas dans lequel un chemin candidat supplémentaire est ajouté au chemin existant établi entre l'appareil connecté et le terminal utilisateur ; et une cinquième fonction qui, dans le cas dans lequel la qualité de communication totale du chemin existant ne satisfait pas les conditions prédéfinies sur la base de la qualité de communication demandée, définit les nœuds de relais et les stations de base servant de chemins candidats supplémentaires de telle sorte qu'un chemin candidat supplémentaire au moyen duquel la qualité de communication totale estimée satisfait les conditions prédéfinies sur la base de la qualité de communication demandée, est ajouté au chemin existant.
PCT/JP2015/054124 2015-02-16 2015-02-16 Système de communication, procédé de commande de communication et serveur de commande WO2016132429A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/054124 WO2016132429A1 (fr) 2015-02-16 2015-02-16 Système de communication, procédé de commande de communication et serveur de commande

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/JP2015/054124 WO2016132429A1 (fr) 2015-02-16 2015-02-16 Système de communication, procédé de commande de communication et serveur de commande

Publications (1)

Publication Number Publication Date
WO2016132429A1 true WO2016132429A1 (fr) 2016-08-25

Family

ID=56688795

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2015/054124 WO2016132429A1 (fr) 2015-02-16 2015-02-16 Système de communication, procédé de commande de communication et serveur de commande

Country Status (1)

Country Link
WO (1) WO2016132429A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017175421A1 (fr) * 2016-04-07 2017-10-12 住友電気工業株式会社 Dispositif de gestion et système de gestion
WO2018163557A1 (fr) * 2017-03-08 2018-09-13 日本電気株式会社 Dispositif et procédé pour réseau de communication
JP2019145880A (ja) * 2018-02-15 2019-08-29 日本電信電話株式会社 情報収集システム及び情報収集方法
WO2020008945A1 (fr) * 2018-07-06 2020-01-09 日本電信電話株式会社 Système de communication sans fil, procédé de commande, dispositif de commande, et programme de commande
WO2021215016A1 (fr) * 2020-04-24 2021-10-28 富士通株式会社 Dispositif de communication sans fil et système de communication sans fil
CN114760240A (zh) * 2022-06-14 2022-07-15 紫光恒越技术有限公司 数据传输的方法、装置、电子设备及计算机可读存储介质
WO2023188398A1 (fr) * 2022-03-31 2023-10-05 日本電信電話株式会社 Dispositif de commande, procédé de commande et programme de commande

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004093393A1 (fr) * 2003-04-11 2004-10-28 Fujitsu Limited Systeme de communication mobile et procede de distribution de donnees du systeme
WO2010057527A1 (fr) * 2008-11-19 2010-05-27 Nokia Siemens Networks Gmbh & Co. Kg Appareil, procédé et programme d'utilisation sélective d'interfaces selon le service
WO2011158431A1 (fr) * 2010-06-17 2011-12-22 日本電気株式会社 Dispositif et procédé de commande de chemin
WO2013010005A1 (fr) * 2011-07-12 2013-01-17 Interdigital Patent Holdings, Inc. Procédé et appareil pour un fonctionnement en mode de technologie d'accès radio multiple (multi-rat)

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004093393A1 (fr) * 2003-04-11 2004-10-28 Fujitsu Limited Systeme de communication mobile et procede de distribution de donnees du systeme
WO2010057527A1 (fr) * 2008-11-19 2010-05-27 Nokia Siemens Networks Gmbh & Co. Kg Appareil, procédé et programme d'utilisation sélective d'interfaces selon le service
WO2011158431A1 (fr) * 2010-06-17 2011-12-22 日本電気株式会社 Dispositif et procédé de commande de chemin
WO2013010005A1 (fr) * 2011-07-12 2013-01-17 Interdigital Patent Holdings, Inc. Procédé et appareil pour un fonctionnement en mode de technologie d'accès radio multiple (multi-rat)

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017175421A1 (fr) * 2016-04-07 2017-10-12 住友電気工業株式会社 Dispositif de gestion et système de gestion
US10631226B2 (en) 2016-04-07 2020-04-21 Sumitomo Electric Industries, Ltd. Management apparatus and management system for managing communication between communication devices
WO2018163557A1 (fr) * 2017-03-08 2018-09-13 日本電気株式会社 Dispositif et procédé pour réseau de communication
US11653255B2 (en) * 2017-03-08 2023-05-16 Nec Corporation Apparatus and method for communication network
JPWO2018163557A1 (ja) * 2017-03-08 2020-01-09 日本電気株式会社 通信ネットワークのための装置及び方法
JP7251604B2 (ja) 2017-03-08 2023-04-04 日本電気株式会社 制御装置及びその方法
US20220312259A1 (en) * 2017-03-08 2022-09-29 Nec Corporation Apparatus and method for communication network
US11388620B2 (en) 2017-03-08 2022-07-12 Nec Corporation Apparatus and method for communication network
JP6996549B2 (ja) 2017-03-08 2022-01-17 日本電気株式会社 通信ネットワークのための装置及び方法
JP2022028934A (ja) * 2017-03-08 2022-02-16 日本電気株式会社 制御装置及びその方法
JP7047441B2 (ja) 2018-02-15 2022-04-05 日本電信電話株式会社 情報収集方法
US11558283B2 (en) 2018-02-15 2023-01-17 Nippon Telegraph And Telephone Corporation Information collecting system and information collecting method
JP2019145880A (ja) * 2018-02-15 2019-08-29 日本電信電話株式会社 情報収集システム及び情報収集方法
JP7108180B2 (ja) 2018-07-06 2022-07-28 日本電信電話株式会社 無線通信システム、制御方法、制御装置及び制御プログラム
JP2020010162A (ja) * 2018-07-06 2020-01-16 日本電信電話株式会社 無線通信システム、制御方法、制御装置及び制御プログラム
WO2020008945A1 (fr) * 2018-07-06 2020-01-09 日本電信電話株式会社 Système de communication sans fil, procédé de commande, dispositif de commande, et programme de commande
WO2021215016A1 (fr) * 2020-04-24 2021-10-28 富士通株式会社 Dispositif de communication sans fil et système de communication sans fil
JP7476952B2 (ja) 2020-04-24 2024-05-01 富士通株式会社 無線通信装置及び無線通信システム
WO2023188398A1 (fr) * 2022-03-31 2023-10-05 日本電信電話株式会社 Dispositif de commande, procédé de commande et programme de commande
CN114760240A (zh) * 2022-06-14 2022-07-15 紫光恒越技术有限公司 数据传输的方法、装置、电子设备及计算机可读存储介质
CN114760240B (zh) * 2022-06-14 2022-09-02 紫光恒越技术有限公司 数据传输的方法、装置、电子设备及计算机可读存储介质

Similar Documents

Publication Publication Date Title
WO2016132429A1 (fr) Système de communication, procédé de commande de communication et serveur de commande
US20230171148A1 (en) Monitoring and detecting causes of failures of network paths
CN108400934B (zh) 软件定义网络控制器、服务功能链系统及路径追踪方法
US10819605B2 (en) Method, apparatus, and system for implementing delay measurement
US8661295B1 (en) Monitoring and detecting causes of failures of network paths
EP1705845B1 (fr) Procede de repartition de charge
KR100863539B1 (ko) 통신방법
US9104543B1 (en) Determining locations of network failures
WO2021036962A1 (fr) Procédé et dispositif de transmission de paquets de service
US10411972B2 (en) Determining impact of network failures
CN103155488B (zh) 延迟测量系统和延迟测量方法以及延迟测量设备和延迟测量程序
CN110798860B (zh) 数据处理方法、设备及系统
US9001667B1 (en) Monitoring and detecting causes of failures of network paths
JP2014168283A (ja) 通信システム、ネットワーク監視装置、及びネットワーク監視方法
CN112583636B (zh) 一种政务网络切片的构造方法、电子设备和存储介质
US9559932B2 (en) Route determination apparatus and transfer route determination method
US8139499B2 (en) Method and arrangement for determining transmission delay differences
US20180262569A1 (en) Selection device, device selection method, and program
US20230017561A1 (en) Network Device, System and Method For Cycle-Based Load Balancing
CN111740903A (zh) 一种数据传输方法及装置
JP5871322B2 (ja) サーバ、及び、ネットワーク管理方法
US20230120869A1 (en) Network management systems, edge devices, network management devices, and programs
KR101491698B1 (ko) 소프트웨어 정의 네트워크에서 제어 장치 및 그 동작 방법
JP6034263B2 (ja) 帯域制御装置
CN107592269B (zh) 传输路径的负载信息的方法和网络节点

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15882534

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: JP