Patents by Inventor Masayuki Tsujino
Masayuki Tsujino 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: 11870657Abstract: A network design apparatus for designing a network includes a processor; and a memory storing program instructions that cause the processor to receive input of a configuration condition for a network having a communication layer and at least one computing layer, a cost condition for the network, and a demand condition representing uncertain demand for the network, perform an operation for solving an adjustable robust optimization problem in which an objective function is to minimize a sum of a fixed cost and a variable cost for a resource placed at each base in the communication layer and the computing layer, and determine a configuration of the network based on placement and capacity of a resource obtained by the performing of the operation. The demand condition includes a set of one or more bases from which the resource is assignable in response to the demand.Type: GrantFiled: September 5, 2019Date of Patent: January 9, 2024Assignee: NIPPON TELEGRAPH AND TELEPHONE CORPORATIONInventor: Masayuki Tsujino
-
Patent number: 11818016Abstract: A network design device executes the following steps: inputting a configuration condition of a network, a cost condition of the network, and a demand condition of the network; computing to solve an optimization problem with, at each base in the communication layer and computing layer, an objective function for minimizing a sum of a fixed cost and a variable cost at a communication link to be placed and a computer to be placed, a demand satisfaction condition that a demand for each computer is satisfied, a flow conservation condition that a traffic flow rate for a demand for each computer is conserved, and a capacity constraint that is a constraint due to a capacity of the communication link and computer at each base; and outputting a placement and a capacity of each of the communication link and computer obtained by the computing.Type: GrantFiled: May 14, 2019Date of Patent: November 14, 2023Assignee: NIPPON TELEGRAPH AND TELEPHONE CORPORATIONInventor: Masayuki Tsujino
-
Publication number: 20220271998Abstract: A network design apparatus for designing a network, comprising: an input unit that receives input of a configuration condition for a network having a communication layer and at least one computing layer, a cost condition for the network, and a demand condition representing uncertain demand for the network; an operation unit that performs an operation for solving an adjustable robust optimization problem in which an objective function is to minimize a sum of a fixed cost and a variable cost for a resource placed at each base in the communication layer and the computing layer; and an output unit that outputs placement and capacity of a resource obtained by the operation unit, wherein the adjustable robust optimization problem has a constraint condition using a variable indicating a ratio of, in a case where demand is assigned to a resource, a portion assigned to the resource with respect to total volume of the demand, and the variable is a variable that depends on a set of generated demands.Type: ApplicationFiled: September 5, 2019Publication date: August 25, 2022Inventor: Masayuki TSUJINO
-
Publication number: 20220210025Abstract: A network design device for designing a network, including: an input unit that is input with a configuration condition of a network that includes a communication layer and at least one computing layer, a cost condition of the network, and a demand condition representing an uncertain demand of the network; a computing unit that performs computation to solve an optimization problem with, at each base in the communication layer and computing layer, an objective function for minimizing a sum of a fixed cost and a variable cost at a communication link to be placed and a computer to be placed, a demand satisfaction condition that a demand for each computer is satisfied, a flow conservation condition that a traffic flow rate for a demand for each computer is conserved, and a capacity constraint that is a constraint due to a capacity of the communication link and computer at each base; and an output unit that outputs a placement and a capacity of each of the communication link and computer obtained by the computing uType: ApplicationFiled: May 14, 2019Publication date: June 30, 2022Inventor: Masayuki TSUJINO
-
Patent number: 8121724Abstract: In response to a transfer request, for which a loading time at a transfer source and a loading time at a transfer target are designated by a production controller, there is created a transfer scenario, which contains a basic transfer (From) from the transfer source to a buffer near the transfer target, for example, and a basic transfer (To) from the buffer to the transfer target. In order that the basic transfers (From, To) may be able to be executed, the buffer is reserved, and a transfer vehicle is allocated. The time period for the transfer vehicle to run to the transfer source or the buffer and the time period for the transfer vehicle to run from the transfer source or the buffer are estimated to assign a transfer command to the transfer vehicle. The possibility that the loading and the loading time may deviate from a designated period is evaluated. In case this possibility is high, a production controller is informed that a just-in-time transfer is difficult.Type: GrantFiled: April 25, 2007Date of Patent: February 21, 2012Assignees: Murata Kikai Kabushiki Kaisha, Nippon Telegraph and Telephone West Corporation, Nippon Telegraph and Telephone CorporationInventors: Takao Hayashi, Hiroki Sone, Toyokazu Kobayashi, Yoshinori Yamada, Akiya Inoue, Masayuki Tsujino, Hiromichi Kawano
-
Patent number: 8019468Abstract: A transport scenario composed of a basic transport (From) from a transport starting point to, e.g., a buffer near the transport destination point and a basic transport (To) from the buffer to the transport destination point is created in response to a transport request of a production controller for transport whose loading times at the transport starting point and at the transport destination point are specified. The buffer is reserved so as to perform the basic transport (From) and the basic transport (To), transport vehicles are allocated, the travel time to the transport starting point or the buffer and the travel time from the transport starting point or the buffer are estimated, and transport instructions are given to the transport vehicles. The possibility that the loading times are out of the specified period is evaluated. If the possibility is larger, the impossibility of a just-in-time transport is notified to the production controller.Type: GrantFiled: April 25, 2007Date of Patent: September 13, 2011Assignees: Murata Kikai Kabushiki Kaisha, Nippon Telegraph and Telephone West Corporation, Nippon Telegraph and Telephone CorporationInventors: Takao Hayashi, Hiroki Sone, Toyokazu Kobayashi, Yoshinori Yamada, Akiya Inoue, Masayuki Tsujino, Hiromichi Kawano
-
Publication number: 20090208313Abstract: A transport scenario composed of a basic transport (From) from a transport starting point to, e.g., a buffer near the transport destination point and a basic transport (To) from the buffer to the transport destination point is created in response to a transport request of a production controller for transport whose loading times at the transport starting point and at the transport destination point are specified. The buffer is reserved so as to perform the basic transport (From) and the basic transport (To), transport vehicles are allocated, the travel time to the transport starting point or the buffer and the travel time from the transport starting point or the buffer are estimated, and transport instructions are given to the transport vehicles. The possibility that the loading times are out of the specified period is evaluated. If the possibility is larger, the impossibility of a just-in-time transport is notified to the production controller.Type: ApplicationFiled: April 25, 2007Publication date: August 20, 2009Applicants: MURATA KIKAI KABUSHIKI KAISHA, NIPPON TELEGRAPH AND TELEPHONE WEST CORPORATION, NIPPON TELEGRAPH AND TELEPHONE CORPORATIONInventors: Takao Hayashi, Hiroki Sone, Toyokazu Kobayashi, Yoshinori Yamada, Akiya Inoue, Masayuki Tsujino, Hiromichi Kawano
-
Publication number: 20090193235Abstract: In response to a transfer request, for which a loading time at a transfer source and a loading time at a transfer target are designated by a production controller, there is created a transfer scenario, which contains a basic transfer (From) from the transfer source to a buffer near the transfer target, for example, and a basic transfer (To) from the buffer to the transfer target. In order that the basic transfers (From, To) may be able to be executed, the buffer is reserved, and a transfer vehicle is allocated. The time period for the transfer vehicle to run to the transfer source or the buffer and the time period for the transfer vehicle to run from the transfer source or the buffer are estimated to assign a transfer command to the transfer vehicle. The possibility that the loading and the loading time may deviate from a designated period is evaluated. In case this possibility is high, a production controller is informed that a just-in-time transfer is difficult.Type: ApplicationFiled: April 25, 2007Publication date: July 30, 2009Applicants: MURATA KIKAI KABUSHIKI KAISHA, NIPPON TELEGRAPH AND TELEPHONE WEST CORPORATION, NIPPON TELEGRAPH AND TELEPHONE CORPORATIONInventors: Takao Hayashi, Hiroki Sone, Toyokazu Kobayashi, Yoshinori Yamada, Akiya Inoue, Masayuki Tsujino, Hiromichi Kawano