Nippon Telegraph and Telephone Corporation

Koji Sugisono

Seisho Yasukawa

Masanori Uga

Shinya Kawano

Hideaki Iwata

Michihiro Aoki

Kazuhiro Matsuo

Hidetaka Nishihara

Hiroki Iwahashi

Kaori Kurita

Aki Fukuoka

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.

Communication control device and communication control method

A transfer device includes: a storage unit that stores a management table including a transfer address, an output port, and a timer; a communication unit that has ports and transmits and receives a packet; an address retrieval unit that refers to the management table and retrieves an entry using a transmission source address of a 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 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 that transfers the packet from an output port of an entry of the packet of the management table.

Transfer device, communication system, transfer method, and transfer program

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.

Processing device, relocation method, and relocation program

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.

Communication system and communication method

A processing apparatus () 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 () measures the generation rate of the output data that is to be output by the processing unit (). Based on the measurement result, the processing apparatus () 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.

Processing device and moving method

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.

Path calculation order deciding method, program and calculating apparatus

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.

Path calculating method, program and calculating apparatus

A method of establishing a multicast transfer route is disclosed that can reduce the cost of entire route under a constraint on delay incurred between starting point and ending points. The method includes the steps of: computing the shortest route with respect to delay connecting the starting point and the plural ending points based on measurement result; computing delay from a node on the shortest route to each ending point and the greatest delay; removing, if the greatest delay satisfies a delay condition, the greatest-cost route from the shortest route in accordance with selection criteria effective for cost reduction; dividing the multicast transfer route into two route trees; and establishing separately computed route as a complementary route that complement the removed route for connecting the two route trees. A method of multicast label switching for realizing the above method is also disclosed. A multicast label switching route is established using hierarchical labels by establishing a common multicast label switching route using a first layer label and establishing plural partial multicast label switching routes for subgroup destinations using lower layer labels. A relay node recognizes the hierarchical labels thereby to label-switch using all hierarchical labels.

Method of setting multicast transfer route and method of multicast label switching for realizing the same

A multicast communication path calculation method is disclosed which includes the steps of: obtaining minimum delay paths from a source node to each destination node; selecting, as candidate nodes of a rendezvous point node, nodes on one of the obtained minimum delay paths; for each candidate node, calculating minimum delay paths from the candidate node to each destination node, and obtaining a difference between the maximum value and the minimum value among delays of the calculated minimum delay paths; selecting, as the rendezvous point node, a candidate node by which the difference is smallest; and outputting a minimum delay path from the source node to the rendezvous point node and minimum delay paths from the rendezvous point node to each destination node.

Growing community of inventors

Tokyo, Japan

Koji Sugisono