Communication management list generation device, communication management list generation method, and storage medium in which communication management list generation program is stored

Patent metadata

Field	Value
Publication number	US-10567306-B2
Application number	US-201615766883-A
Country	US
Kind code	B2
Filing date	Sep 20, 2016
Priority date	Oct 13, 2015
Publication date	Feb 18, 2020
Grant date	Feb 18, 2020

Abstract

A communication management list generation device 20 generates a communication management list composed of communication management information including time of day information corresponding to a prescribed time of day and communication information indicating a communication process started at a prescribed time of day and not using the same path at the same time. The communication management list generation device is provided with: a determination means 21 for determining, regarding whether information on the communication process can be added to the communication information, each communication management information in descending order of time (early time first) corresponding to the time of day information; and an addition means 22 for adding information on the communication process to the communication information of the communication management information determined at a stage at which it was determined by the determination means 21 that addition is possible.

First claim

What is claimed is:

1. A communication management list generation device comprising:
a generation unit for generating a communication management list constituted by communication management information including time information associated with a predetermined time, and communication information indicating communication processing which is started at the predetermined time and which does not use a same route simultaneously;
a determination unit for determining each piece of communication management information in an ascending order of time associated with the time information regarding whether or not communication processing information is addable to communication information; and
an addition unit for adding the communication processing information to communication information of communication management information which is determined to be addable at a time of determination by the determination unit,
wherein the communication processing information comprises shortest route information, and wherein data is transmitted over a shortest route selected based on the communication processing information.

2. The communication management list generation device according to claim 1 , wherein
the determination unit determines whether or not communication processing information is addable in a descending order of sum of distances between a shortest route to be used with respect to a plurality of communication processings, and a shortest route to be used by other communication processings.

3. The communication management list generation device according to claim 1 , further comprising
a measuring unit for measuring a time required for overall communication processing to be performed by using a communication management list generated by adding all pieces of communication processing information as an addition target, wherein
the measuring unit outputs a communication management list having the shortest required time among all patterns on a communication management list to be generated based on communication processing information as the addition target.

4. The communication management list generation device according to claim 1 , wherein
the communication processing information is shortest route information in which a sum of distances to a shortest route to be used by other communication processing is maximum among all patterns on a shortest route to be used by the communication processing.

5. A communication management list generation method comprising:
generating a communication management list constituted by communication management information including time information associated with a predetermined time, and communication information indicating communication processing which is started at the predetermined time and which does not use a same route simultaneously;
determining each piece of communication management information in an ascending order of time associated with the time information regarding whether or not communication processing information is addable to communication information; and
adding the communication processing information to communication information of communication management information which is determined to be addable at a time of determination,
wherein the communication processing information comprises shortest route information, and wherein data is transmitted over a shortest route selected based on the communication processing information.

6. The communication management list generation method according to claim 5 , further comprising
determining whether or not communication processing information is addable in a descending order of sum of distances between a shortest route to be used with respect to a plurality of communication processings, and a shortest route to be used by other communication processings.

7. The communication management list generation method according to claim 5 , further comprising:
measuring a time required for overall communication processing to be performed by using a communication management list generated by adding all pieces of communication processing information as an addition target; and
outputting a communication management list having the shortest required time among all patterns on a communication management list to be generated based on communication processing information as the addition target.

8. A non-transitory storage medium storing the communication management list generation program causing a computer to execute:
generation processing of generating a communication management list constituted by communication management information including time information associated with a predetermined time, and communication information indicating communication processing which is started at the predetermined time and which does not use a same route simultaneously;
determination processing of determining each piece of communication management information in an ascending order of time associated with the time information regarding whether or not communication processing information is addable to the communication information; and
addition processing of adding the communication processing information to communication information of communication management information which is determined to be addable at a time of determination in the determination processing,
wherein the communication processing information comprises shortest route information, and wherein data is transmitted over a shortest route selected based on the communication processing information.

9. The non-transitory storage medium storing the communication management list generation program according to claim 8 , the communication management list generation program causing the computer to further execute
determination processing of determining whether or not communication processing information is addable in a descending order of sum of distances between a shortest route to be used with respect to a plurality of communication processings, and a shortest route to be used by other communication processings.

10. The non-transitory storage medium storing the communication management list generation program according to claim 8 , the communication management list generation program causing the computer to further execute:
measuring processing of measuring a time required for overall communication processing to be performed by using a communication management list generated by adding all pieces of communication processing information as an addition target; and
output processing of outputting a communication management list having the shortest required time among all patterns on a communication management list to be generated based on communication processing information as the addition target.

Assignees

• Nec Corp

Inventors

• Tonouchi Toshio

Classifications

• H04L45/40

  Wormhole routing · CPC title

• H04L49/254

  Centralised controller, i.e. arbitration or scheduling · CPC title

• H04L47/28

  in relation to timing considerations · CPC title

• H04L49/103 Primary

  using a shared central buffer; using a shared memory · CPC title

• H04L45/121 Primary

  by minimising delays · CPC title