Patents by Inventor Koji Sugisono

Koji Sugisono has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11895037
    Abstract: A VNF operation apparatus is a processing apparatus that relocates data processing functions to another apparatus to continue data processing and includes: a storage unit configured to store information indicating a communication relationship between apparatuses; an estimation unit configured to calculate, based on the information indicating the communication relationship, an estimation value of a transfer delay of data generated during relocation for a plurality of schedulings having different orders of relocation of the data processing functions; a scheduling unit configured to select a scheduling for which the estimation value calculated by the estimation unit is minimized, and sets, based on the selected scheduling, an order of relocation of the data processing functions and a start timing of relocation of the data processing functions; and a relocation unit configured to relocate VNFs to the other apparatus in accordance with the order and the timing set by the scheduling unit.
    Type: Grant
    Filed: January 9, 2020
    Date of Patent: February 6, 2024
    Assignee: Nippon Telegraph and Telephone Corporation
    Inventors: Koji Sugisono, Shinya Kawano
  • Patent number: 11864097
    Abstract: In a communication system, an SLG includes a slice selection unit that selects, in receiving a network slice reservation request including a network condition from a vCPE, based on topology information, a latency state, and processing capability information regarding each of the other SLGs, a destination SLG of a network slice that satisfies the network condition to reserve the network slice, and if there is no destination SLG that satisfies the network condition, newly activates a destination SLG to establish a network slice that satisfies the network condition, and an allocation unit that allocates traffic transmitted from the vCPE to the network slice reserved or established by the selection unit.
    Type: Grant
    Filed: August 9, 2019
    Date of Patent: January 2, 2024
    Assignee: Nippon Telegraph and Telephone Corporation
    Inventors: Aki Fukuoka, Koji Sugisono
  • Publication number: 20230370361
    Abstract: In a transfer path change system for changing a transfer path of a flow in a network, a first packet processing device; a second packet processing device; and a supervision device for supervising migration processing of packet processing data used by the first packet processing device to the second packet processing device, are included. The second packet processing device receives the packet processing data; stores a packet arriving at the second packet processing device during transfer of the packet processing data; and processes the packet stored and transferring the processed packet to a destination. The supervision device instructs a third packet processing device, which performs transfer processing of the packet processing data next, to perform the transfer processing of the packet processing data with completion of the processing of a packet for a specific flow among packets of a plurality of flows stored as a trigger.
    Type: Application
    Filed: October 16, 2020
    Publication date: November 16, 2023
    Inventors: Koji SUGISONO, Shinya KAWANO
  • Publication number: 20230344761
    Abstract: A packet communication device connected to one or more paths includes a routing unit that distributes packets received from a terminal to any one of the one or more paths, and a control unit that acquires an IP address of the terminal and sets an application rule for packet processing in the routing unit on the basis of the IP address.
    Type: Application
    Filed: September 7, 2020
    Publication date: October 26, 2023
    Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Katsuma MIYAMOTO, Akihiro KIMURA, Shinya KAWANO, Koji SUGISONO, Hiroki KANO
  • Publication number: 20230305902
    Abstract: A resource amount estimation device includes: an acquisition unit configured to acquire, in response to a request for allocation of a resource, a measurement value of an amount of the resource, a measurement time of the measurement value, and statistical information relating to the resource; and a calculation unit configured to input a measurement value acquired by the acquisition unit and an elapsed time from the measurement time to a scheduled allocation time of the resource into a model that estimates the resource amount in the future on the basis of the statistical information and to calculate an estimation value of the resource amount at the scheduled allocation time, and thus increases the possibility of resource allocation appropriate to a point in time when the resource is allocated being performed.
    Type: Application
    Filed: August 25, 2020
    Publication date: September 28, 2023
    Inventors: Koji SUGISONO, Shinya KAWANO, Hiroki KANO, Akihiro KIMURA, Katsuma MIYAMOTO
  • Patent number: 11632319
    Abstract: A processing apparatus (10) processes received input data and outputs output data that is to be transferred to a synchronization target apparatus using a predetermined bandwidth. The processing apparatus (10) measures the generation rate of the output data that is to be output by the processing unit (122). Based on the measurement result, the processing apparatus (10) controls the input of input data such that a condition set in advance for the corresponding type of input data is satisfied and the generation rate of the output data rate is below the transmission rate of the band.
    Type: Grant
    Filed: January 17, 2020
    Date of Patent: April 18, 2023
    Assignee: Nippon Telegraph and Telephone Corporation
    Inventor: Koji Sugisono
  • Publication number: 20230051003
    Abstract: A control apparatus includes a setting unit configured to perform a setting for forwarding a packet destined for first software to a second computer on a switch on a communication path from a first computer to the second computer during a migration of the first software from the first computer to the second computer, the first computer being a computer in which the first software and second software configured to communicate with the first software run, and a deletion unit configured to delete the setting from the switch when the migration of the first software is completed. Thus, the control apparatus shortens the time during which the setting of data forwarding remains at the switch.
    Type: Application
    Filed: February 19, 2020
    Publication date: February 16, 2023
    Inventors: Koji SUGISONO, Shinya KAWANO
  • Publication number: 20230024732
    Abstract: A VNF operation apparatus (10) is a processing apparatus that relocates data processing functions to another apparatus to continue data processing and includes: a storage unit (12) configured to store information indicating a communication relationship between apparatuses; an estimation unit (132) configured to calculate, based on the information indicating the communication relationship, an estimation value of a transfer delay of data generated during relocation for a plurality of schedulings having different orders of relocation of the data processing functions; a scheduling unit (133) configured to select a scheduling for which the estimation value calculated by the estimation unit (132) is minimized, and sets, based on the selected scheduling, an order of relocation of the data processing functions and a start timing of relocation of the data processing functions; and a relocation unit (134) configured to relocate VNFs to the other apparatus in accordance with the order and the timing set by the schedulin
    Type: Application
    Filed: January 9, 2020
    Publication date: January 26, 2023
    Inventors: Koji SUGISONO, Shinya KAWANO
  • Publication number: 20220278931
    Abstract: A transfer device (10) includes: a storage unit (12) that stores a management table (121) having an entry including a transfer address, an output port, and a timer; a communication unit (11) that has a plurality of ports and transmits and receives a packet; an address retrieval unit (132) that refers to the management table (121) and retrieves an entry using a transmission source address of a packet as a key when receiving the packet, changes an output destination port of a packet in which the transmission source address is set as a transmission destination to a reception port of the packet and sets a timer of the entry with respect to the entry when the timer of the retrieved entry is not set, and does not change a content of the entry when the timer of the retrieved entry is set; and a transfer processing unit (131) that transfers the packet from an output port of an entry of the packet of the management table (121).
    Type: Application
    Filed: August 2, 2019
    Publication date: September 1, 2022
    Inventors: Koji SUGISONO, Shinya KAWANO
  • Publication number: 20220200918
    Abstract: A communication control apparatus configured to control bands for flows monitors the amount of communication of each of the flows input to the communication line in a predetermined monitoring period. When a sum of the amounts of communication of the flows acquired by the monitoring exceeds a predetermined threshold, the communication control apparatus restricts the communication bands for the top N flows in the descending order of the amount of communication input to the communication line, according to the amounts of communication of the flows. In contrast, the communication control apparatus does not restrict the communication bands for flows lower than the top N flows.
    Type: Application
    Filed: August 14, 2019
    Publication date: June 23, 2022
    Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Hiroki IWAHASHI, Kaori KURITA, Koji SUGISONO, Hidetaka NISHIHARA, Kazuhiro MATSUO
  • Publication number: 20220109619
    Abstract: A processing apparatus (10) processes received input data and outputs output data that is to be transferred to a synchronization target apparatus using a predetermined bandwidth. The processing apparatus (10) measures the generation rate of the output data that is to be output by the processing unit (122). Based on the measurement result, the processing apparatus (10) controls the input of input data such that a condition set in advance for the corresponding type of input data is satisfied and the generation rate of the output data rate is below the transmission rate of the band.
    Type: Application
    Filed: January 17, 2020
    Publication date: April 7, 2022
    Inventor: Koji Sugisono
  • Publication number: 20220030510
    Abstract: In a communication system. an SLG (6) includes a slice selection unit (614) that selects, in receiving a network slice reservation request including a network condition from a vCPE, based on topology information, a latency state, and processing capability information regarding each of the other SLGs (6), a destination SLG of a network slice that satisfies the network condition to reserve the network slice, and if there is no destination SLG that satisfies the network condition, newly activates a destination SLG to establish a network slice that satisfies the network condition, and an allocation unit (63) that allocates traffic transmitted from the vCPE to the network slice reserved or established by the selection unit.
    Type: Application
    Filed: August 9, 2019
    Publication date: January 27, 2022
    Inventors: Aki Fukuoka, Koji Sugisono
  • Publication number: 20210243278
    Abstract: An instance running device (10) determines, based on VNF instances through which a traffic flow passes and an order of software pieces through which the VNF instances pass, an order of the VNF instances to be migrated, and performs control so that the VNF instances are migrated to another instance running device (10) on the basis of the determined order of the software pieces migrated.
    Type: Application
    Filed: August 9, 2019
    Publication date: August 5, 2021
    Inventors: Koji Sugisono, Aki Fukuoka, Hirofumi Yamazaki
  • Publication number: 20210194790
    Abstract: A storage unit stores SLG information (12a) being information about a network slice to which an own device belongs, and an SLG table (12b) that aggregates SLG information (12a) about other SLGs (10). A table creation unit (11a) updates, when receiving SLG the information (12a) about the other SLGs (10) from an adjacent SLG (10), the SLG table (12b) by using the SLG information (12a). An SLG information transmission unit (11b) adds the SLG information (12a) about the own device to the received SLG information (12a), and transmits the SLG information (12a) to another adjacent SLG (10).
    Type: Application
    Filed: August 6, 2019
    Publication date: June 24, 2021
    Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Aki FUKUOKA, Koji SUGISONO
  • Publication number: 20210185147
    Abstract: An information processing device includes a control unit configured to control a transfer of software performing processing of a packet to or from another computer, and an attachment unit configured to attach, to a packet output from the software of a transfer source or a transfer destination, a transmission source address different from the transfer destination or the transfer source, thereby avoiding the occurrence of communication error when software relevant to packet processing is transferred to another computer.
    Type: Application
    Filed: May 13, 2019
    Publication date: June 17, 2021
    Inventors: Koji Sugisono, Hirofumi Yamazaki
  • Patent number: 9674083
    Abstract: A path calculation order determining method executed by a calculating apparatus for calculating a shortest path between a node pair in a network, using information on calculated shortest paths between other node pairs, the method including: a step storing calculated shortest path group information on shortest path groups each including calculated shortest paths from a starting node to one or more terminating nodes except the starting node, and topology information of the network, in a memory medium; and a calculation step of calculating shortest paths, starting from its starting node other than the starting node on the calculated shortest paths and having the most nodes that are located downstream therefrom, and terminating at nodes other than its starting node, using the calculated shortest path group information or the topology information for a path not included in the calculated shortest path group.
    Type: Grant
    Filed: November 18, 2009
    Date of Patent: June 6, 2017
    Assignee: Nippon Telegraph and Telephone Corporation
    Inventors: Koji Sugisono, Michihiro Aoki, Hideaki Iwata
  • Patent number: 9215163
    Abstract: A calculating apparatus calculates a shortest path connecting two nodes of a network. A shortest-path group, which is a set of shortest paths having node Y as their starting points, can be calculated at once by having calculated a shortest path having node Y as its starting point for each of other nodes. When the shortest-path group having node Y as the starting point is calculated and further if a group of shortest paths having node X as their starting points is stored beforehand in a storing unit, then path portions, which belong to the group of shortest paths having node X as the starting points and further which are paths extending from node Y to the nodes located downstream from node Y, are utilized as part of a result of calculation of the shortest path group having node Y as the starting point.
    Type: Grant
    Filed: November 18, 2009
    Date of Patent: December 15, 2015
    Assignee: Nippon Telegraph and Telephone Corporation
    Inventors: Koji Sugisono, Michihiro Aoki, Hideaki Iwata
  • Publication number: 20140098709
    Abstract: Calculation of a shortest path connecting two nodes of a network involves steps of: comparing a distance of a first communication path between, from among the plurality of nodes, a starting node as a starting point of a communication path and an adjacent node located adjacent to the starting node, to a distance of a second communication path which has already been calculated other than the first communication path and has already been stored; either taking the first communication path as a candidate of the shortest path if the distance of the first communication path is shorter than the second communication path, or taking the second communication path as a candidate of the shortest path if the distance of the first communication path is not shorter than the second communication path; and taking the adjacent node as a next starting node in the comparison step.
    Type: Application
    Filed: December 12, 2013
    Publication date: April 10, 2014
    Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Koji SUGISONO, Michihiro AOKI, Hideaki IWATA
  • Publication number: 20110222437
    Abstract: A calculating apparatus calculates a shortest path connecting two nodes of a network. A shortest-path group, which is a set of shortest paths having node Y as their starting points, can be calculated at once by having calculated a shortest path having node Y as its starting point for each of other nodes. When the shortest-path group having node Y as the starting point is calculated and further if a group of shortest paths having node X as their starting points is stored beforehand in a storing unit, then path portions, which belong to the group of shortest paths having node X as the starting points and further which are paths extending from node Y to the nodes located downstream from node Y, are utilized as part of a result of calculation of the shortest path group having node Y as the starting point.
    Type: Application
    Filed: November 18, 2009
    Publication date: September 15, 2011
    Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Koji Sugisono, Michihiro Aoki, Hideaki Iwata
  • Publication number: 20110219143
    Abstract: A path calculation order deciding method that is implemented by a calculating apparatus (1) which calculates, by use of calculated shortest path between a node pair about a network comprising a plurality of nodes, a shortest path between other node pair comprises: wherein the calculating apparatus comprises a memory medium storing shortest path group information which represents calculated shortest paths each of which is shortest path between the node pair, whose starting nodes are identical and terminating nodes are different from one another, by use of the plurality of nodes and paths between the node pairs and also storing topology information representing topology of the plurality of nodes, and a calculation unit, a calculation step that the calculation unit selects each particular nodes of the plurality of nodes, which is different from the starting node, in decreasing order of the numbers of the downstream nodes from the particular node in calculated shortest path between the node pair represented by th
    Type: Application
    Filed: November 18, 2009
    Publication date: September 8, 2011
    Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    Inventors: Koji Sugisono, Michihiro Aoki, Hideaki Iwata