Network control device, network control method, and network control program

Abstract

A network control device according to an embodiment comprises an acquisition unit, a first flag assignment unit, a second flag assignment unit, and a usage assignment unit. The acquisition unit acquires graphs indicating, as nodes, places where a network is allocated, and a schedule indicating time slots during which the places are to be used. The first flag assignment unit assigns, in graphs pertaining to the time slots and on the basis of the schedule, a use flag indicating use of the network to a first use node that is a node corresponding to a place to be used. The second flag assignment unit assigns, in a graph pertaining to a time slot, a use flag to a second use node that corresponds to a first use node in a graph pertaining to an adjacent time slot and that is different from the first use node in said graph pertaining to said time slot. The usage assignment unit assigns usages indicating the degrees of use of the network to the first use nodes and the second use nodes to which the use flags have been assigned.

Description

Network Control Device, Network Control Method, and Network Control Program

[0001] The present invention relates to a network control device, a network control method, and a network control program.

[0002] In next-generation information and communication technology, it is assumed that networks (or communication services) with appropriate quality are provided as needed in accordance with a user's requests (e.g., usage timing, usage environment). For this reason, it is necessary to correctly extract requirements related to communication quality that satisfy a wide variety of user requests, and control individual network devices in accordance with the extracted requirements.

[0003] In the prior art, networks are provided in accordance with user requests for each location for which a schedule (i.e., usage time) has been determined.

[0004] International Publication No. 2023 / 157304

[0005] Hiroaki Kikushima, Nobukazu Fukuda, Chao Wu, Shingo Horiuchi, Kenichi Tayama, "Quantitative Intent Derivation Method Based on User Service Usage Requirements", Proceedings of the 2022 National Convention of the Institute of Electronics, Information and Communication Engineers, B-14-8, Mar. 2022

[0006] However, the prior art does not assume a user moving between locations based on a schedule. For example, the user may remain at a previous location or may have already arrived at the next location. That is, with the prior art, networks cannot be provided to a user moving between locations before or after a schedule.

[0007] An object of the present invention is to provide a network for a user moving between locations before or after a schedule.

[0008] The network control device according to the embodiment comprises an acquisition unit, a first flag assignment unit, a second flag assignment unit, and a utilization level assignment unit. The acquisition unit acquires a graph showing each location where the network is located as a node, and a schedule showing each time period in which each location is used. Based on the schedule, the first flag assignment unit assigns a utilization flag to a first utilization node, which is the node corresponding to the location being used in the graph for each time period, indicating that the network is being used. The second flag assignment unit assigns the utilization flag to a second utilization node, which is the node corresponding to the first utilization node in the graph for an adjacent time period, and is different from the first utilization node in the graph for each time period. The utilization level assignment unit assigns a utilization level, indicating the degree of network usage, to the first utilization node and the second utilization node to which the utilization flag has been assigned.

[0009] According to the present invention, a network can be provided to users who move between locations before and after their scheduled time.

[0010] Figure 1 is a functional configuration diagram of the network control device of the first embodiment. Figure 2 is a flowchart of the network control method of the first embodiment. Figure 3 is a diagram showing an example of a graph. Figure 4 is a diagram showing an example of a schedule. Figure 5 is a diagram showing an example of a graph related to each time period. Figure 6 is a diagram showing an example of each graph flagged for the first user node. Figure 7 is a diagram showing a method for assigning usage flags to the second user node. Figure 8 is a diagram showing an example of each graph flagged for the second user node. Figure 9 is a diagram showing a first example of each graph to which a usage level has been assigned. Figure 10 is a functional configuration diagram of the network control device of the second embodiment. Figure 11 is a flowchart of the network control method of the second embodiment. Figure 12 is a diagram showing an example of capacity. Figure 13 is a diagram showing a second example of each graph to which a usage level has been assigned. Figure 14 is a functional configuration diagram of the network control device of the third embodiment. Figure 15 is a flowchart of the network control method of the third embodiment. Figure 16 is a diagram showing an example of participation status. Figure 17 is a diagram showing an example of participation rate. Figure 18 shows a third example of each graph with usage levels assigned to it. Figure 19 is a hardware configuration diagram of the network control device.

[0011] The embodiments will be described below with reference to the drawings. Multiple parts assigned the same reference numeral will be considered identical, and redundant explanations will be omitted as appropriate.

[0012] (First Embodiment) Figure 1 is a functional configuration diagram of the network control device 1 of the first embodiment. The network control device 1 is a device that controls a network (e.g., a wireless network). The network control device 1 includes an acquisition unit 11, a flag assignment unit 12, a usage level assignment unit 13, and a storage unit 14 as functional units.

[0013] The acquisition unit 11 is a means for acquiring various types of data. The acquisition unit 11 acquires graphs G and schedules S from the storage unit 14. Graphs G show each location P where the network is located as a node N (see Figure 3). Schedules S show each time period T in which each location P is used (see Figure 4). Based on schedules S, the acquisition unit 11 acquires (or generates) graphs G (also called "time-series graphs") related to each time period T. The acquisition unit 11 transmits the acquired graphs G and schedules S to the flagging unit 12.

[0014] The flag assignment unit 12 is a means for assigning various flags. The flag assignment unit 12 assigns a usage flag F to the graph G received from the acquisition unit 11 based on the schedule S received from the acquisition unit 11. The usage flag F indicates network usage. The flag assignment unit 12 comprises a first flag assignment unit 121 and a second flag assignment unit 122.

[0015] The first flag assignment unit 121 is a first means for assigning various flags. The first flag assignment unit 121 assigns a usage flag F to the node N (hereinafter referred to as "first usage node NA") corresponding to the location P used in the graph G. The first flag assignment unit 121 transmits the graph G (hereinafter referred to as "graph GF") with the usage flag F assigned to the first usage node NA to the second flag assignment unit 122.

[0016] The second flag assignment unit 122 is a second means for assigning various flags. The second flag assignment unit 122 assigns a usage flag F to a node N (hereinafter referred to as "second usage node NB") in the graph GF for each time period T that corresponds to the first usage node NA in the graph GF for the adjacent time period T, and is different from the first usage node NA in the graph GF for each time period T. The second flag assignment unit 122 transmits the graph GF (hereinafter referred to as "graph GFF") to the usage level assignment unit 13, with the usage flag F assigned to the second usage node NB.

[0017] The utilization level assignment unit 13 is a means for assigning utilization level D. The utilization level assignment unit 13 assigns utilization level D to the first utilization node NA and the second utilization node NB that have been assigned the utilization flag F in the graph GFF received from the flag assignment unit 12. Utilization level D indicates the degree of network utilization. For example, the utilization level assignment unit 13 assigns a predetermined value as utilization level D to the first utilization node NA and the second utilization node NB. The utilization level assignment unit 13 may assign a predetermined value as utilization level D to the first utilization node NA and a value smaller than the predetermined value (e.g., an intermediate value of the predetermined value) to the second utilization node NB. The utilization level assignment unit 13 may output the graph GFF with the assigned utilization level D to the network management system. The utilization level assignment unit 13 may output the utilization level D of each location P in each time period T to the network management system.

[0018] A network management system (e.g., a server) may control the network at each location P by controlling network devices (e.g., routers) located at each location P. For example, the network management system may set the network bandwidth in proportion to the utilization level D.

[0019] The storage unit 14 is a means for storing various types of data. The storage unit 14 stores the graph G and the schedule S. One storage unit 14 may store the graph G, and another storage unit 14 may store the schedule S. The storage unit 14 may also be a database. The storage unit 14 may be installed outside the network control device 1.

[0020] Figure 2 is a flowchart of the network control method according to the first embodiment. The network control device 1 executes the network control method related to steps SA1 to SA5 through each functional unit.

[0021] (Step SA1) First, the acquisition unit 11 acquires the graph G and the schedule S. Specifically, the acquisition unit 11 acquires the graph G and the schedule S from the storage unit 14 by accessing the storage unit 14 (see Figures 3 and 4).

[0022] (Step SA2) Next, the acquisition unit 11 acquires graphs G for each time period T based on the schedule S acquired in step SA1. Specifically, the acquisition unit 11 acquires graphs G for each time period T in the schedule S. The acquisition unit 11 acquires graphs G for each time period T by arranging the acquired graphs G in chronological order (see Figure 5).

[0023] (Step SA3) Next, the first flag assignment unit 121 assigns a usage flag F to the first usage node NA in the graph G for each time period T obtained in step SA2. Specifically, the first flag assignment unit 121 assigns a usage flag F to the first usage node NA corresponding to the location P used in the schedule S. This assignment results in the graph GF. The usage flag F may be represented as the numerical value "1" (see Figure 6).

[0024] The first flag assignment unit 121 may choose not to assign an utilization flag F to a node N corresponding to a location P that is not used in the schedule S, or it may assign an unused flag. The unused flag indicates that the network is not being used. The unused flag may be represented as the numerical value "0".

[0025] (Step SA4) Next, the second flag assignment unit 122 assigns the usage flag F to the second usage node NB in ​​the graph GF for each time period T to which the usage flag F was assigned in step SA3. Specifically, the second flag assignment unit 122 focuses on a plurality of nodes N in the graph GF for one time period T. The second flag assignment unit 122 identifies a node N from among the plurality of nodes N that corresponds to the first usage node NA in the graph GF for an adjacent time period T, and is different from the first usage node NA in the graph GF for that one time period T. The second flag assignment unit 122 assigns the usage flag F to the identified node N (i.e., the second usage node NB). This assignment gives rise to the graph GFF (see Figures 7 and 8).

[0026] (Step SA5) Finally, the utilization level assignment unit 13 assigns a utilization level D to the first utilization node NA and the second utilization node NB, which were assigned a utilization flag F in steps SA3 and SA4. Specifically, the utilization level assignment unit 13 assigns a utilization level D to the first utilization node NA and the second utilization node NB in ​​the graph GFF (see Figure 9).

[0027] Figure 3 shows an example of graph G. Graph G (also called the "venue graph") represents each location P in an event venue as a node N (perfect circle), and the paths that can be traveled between locations P are represented as edges (line segments). Each location P may also be a place where people can stay (e.g., a room, a corridor). Each location P includes the following nine locations: Conference Room 1, Conference Room 2, Conference Room 3, South Rest Area, North Rest Area, Presentation Hall, Reception, Product Exhibition Area, and Lunch Area.

[0028] If we express the correspondence between location P and node N as (location-node), we obtain the following correspondence: (meeting room 1-N1), (meeting room 2-N2), (meeting room 3-N3), (south break area-N4), (north break area-N5), (presentation hall-N6), (reception-N7), (product display area-N8), (lunch venue-N9).

[0029] If we express the connection relationships between each node N as (connecting node - connected node), we obtain the following connection relationships: (N1-N4, N5), (N2-N4, N5), (N3-N4, N5), (N4-N1-N3, N9), (N5-N1-N3, N6-N8), (N6-N5), (N7-N5), (N8-N5), (N9-N4).

[0030] Graph G may be mechanically generated from the floor plan of the event venue. The following reference information may be used as a method for generating Graph G: Mantaro Yamada et al., "Graphing of Real Estate Floor Plans Using Deep Learning and its Application to Property Search," The 33rd Annual Conference of the Japanese Society for Artificial Intelligence, 2019.

[0031] Figure 4 shows an example of Schedule S. Schedule S (also called "Event Schedule") records the combination of time and place for each event. Schedule S includes the following data: time zone T, start time, end time, place P, and content.

[0032] Time zone T indicates the time period during which the event is held (or used for the event). Time zone T is a time range from the start time to the end time. Time zone T includes the following six time zones: Q1 (9:00-10:00), Q2 (10:00-11:30), Q3 (11:30-13:00), Lunch (13:00-14:30), Q4 (14:30-16:00), and Reception (16:00-22:00).

[0033] Location P indicates the location where the event will be held (or used for the event). Various types of events (e.g., keynote speeches, workshops, panel discussions, lunch meetings, networking events) will be held at Location P.

[0034] If we express the correspondence between time zone T and location P as (time zone - location), we obtain the following correspondences: (Q1 - presentation hall), (Q2 - conference room 1, conference room 2, conference room 3), (Q3 - conference room 1, conference room 2), (lunch - lunch venue), (Q4 - conference room 2, conference room 3), (reception - presentation hall).

[0035] Figure 5 shows examples of graphs G corresponding to each time period T. Each graph G corresponds to each time period T. When the correspondence between time period T and graph G is expressed as (time period - graph), the following correspondences are obtained: (before opening - GP), (Q1 - G1), (Q2 - G2), (Q3 - G3), (lunch - GL), (Q4 - G4), (reception - GR).

[0036] Figure 6 shows examples of graphs GF with the first utilization node NA flagged. Each graph GF corresponds to each graph G. In each graph GF, the first utilization node NA that has been assigned the utilization flag F is colored (or shaded). When the correspondence between graphs GF and the first utilization node NA is expressed as (graph - first utilization node), the following correspondences are obtained: (GFP - N5, N7, N8), (GF1 - N5 to N8), (GF2 - N1 to N5, N7, N8), (GF3 - N1, N2, N4, N5, N7, N8), (GFL - N4, N5, N7 to N9), (GF4 - N2 to N9), (GFR - N5 to N8).

[0037] Figure 7 shows a method for assigning a usage flag F to the second usage node NB. For example, the second flag assignment unit 122 focuses on graph GF1 related to time period Q1. The second flag assignment unit 122 identifies two graphs (GFP, GF2) related to two time periods adjacent to time period Q1 (before opening, Q2).

[0038] First, the second flag assignment unit 122 compares graph GF1 with graph GFP. The second flag assignment unit 122 identifies three nodes (N5, N7, N8) from among the nine nodes (N1 to N9) in graph GF1 that correspond to the three first utilization nodes (N5, N7, N8) in graph GFP. The second flag assignment unit 122 determines that among the three identified nodes (N5, N7, N8), there is no node N (i.e., second utilization node NB) that is different from the four first utilization nodes (N5 to N8) in graph GF1.

[0039] Secondly, the second flag assignment unit 122 compares graph GF2 with graph GF1. The second flag assignment unit 122 identifies seven nodes (N1 to N5, N7, N8) from the nine nodes (N1 to N9) in graph GF1 that correspond to the seven first utilization nodes (N1 to N5, N7, N8) in graph GF2. Of the seven identified nodes (N1 to N5, N7, N8), the second flag assignment unit 122 identifies four nodes (N1 to N4) that are different from the four first utilization nodes (N5 to N8) in graph GF1. The second flag assignment unit 122 assigns a utilization flag F to the four identified second utilization nodes (N1 to N4).

[0040] In this way, the second flag assignment unit 122 assigns usage flags F to the four second usage nodes (N1 to N4) in graph GF1 related to time period Q1. This assignment results in graph GFF1. In graph GFF1, the second usage node NB to which the usage flag F has been assigned is colored (or shaded) in a different manner than the first usage node NA. The second flag assignment unit 122 repeats the same process for graph GF related to each time period T.

[0041] Figure 8 shows examples of graph GFFs flagged to the second user node NB. Each graph GFF corresponds to each graph GF. When the correspondence between graph GFFs and the second user node NB is expressed as (graph - second user node), the following correspondences are obtained: (GFFP - N6), (GFF1 - N1 to N4), (GFF2 - N6), (GFF3 - N3, N9), (GFFL - N1 to N3, N6), (GFF4 - none), (GFFR - N2 to N4, N9).

[0042] Figure 9 shows a first example of each graph GFF to which a utilization level D has been assigned. For example, the utilization level assignment unit 13 assigns the value "1.0" as a utilization level D to the first utilization node NA and the second utilization node NB in ​​each graph GFF. The utilization level assignment unit 13 may also assign the value "0.0" as a utilization level D to a node N that is different from the first utilization node NA and the second utilization node NB in ​​each graph GFF. The value "0.0" indicates that the network is not being used.

[0043] An event is held at the location P corresponding to the first usage node NA. No event is held at the location P corresponding to the second usage node NB. Therefore, it is assumed that fewer people stay at the location P corresponding to the second usage node NB than at the location P corresponding to the first usage node NA, and it is assumed that the degree of network usage is lower.

[0044] Based on this assumption, the usage degree assigning unit 13 may assign a smaller usage degree D to the second usage node NB than to the first usage node NA. For example, the usage degree assigning unit 13 may assign a numerical value "1.0" as the usage degree D to the first usage node NA, and assign a numerical value "0.5" as the usage degree D to the second usage node NB. As a result, the usage degree assigning unit 13 can reduce the power consumption by the network device that controls the network arranged at the location P corresponding to the second usage node NB.

[0045] According to the first embodiment described above, the network control device 1 assigns a usage degree D (in particular, greater than 0) to the second usage node NB. It is assumed that users who move between respective locations P around the schedule stay at the location P corresponding to the second usage node NB. Since the network control device 1 enables network usage at the location P corresponding to the second usage node NB, it can provide the network to said users.

[0046] Furthermore, the network control device 1 does not always enable network usage at each location P, but enables network usage at some locations P as needed. As a result, the network control device 1 can reduce the total power consumption by each network device respectively corresponding to each location P.

[0047] (Modification of First Embodiment) First, in the graph GF corresponding to each time slot T, the network control device 1 may assign a usage flag F to a node N that is adjacent to the first usage node NA and is different from the first usage node NA (hereinafter referred to as "adjacent node") (see FIG. 6).

[0048] For example, the flag assigning unit 12 identifies three adjacent nodes (N1, N2, N3) based on the connection relationship between each node N in the graph GF1 associated with the time slot Q1. The flag assigning unit 12 may assign a usage level D to the three identified adjacent nodes. The adjacent nodes may be handled in the same manner as the second usage node NB.

[0049] Secondly, in the graph GF associated with each time slot T, the network control device 1 may identify the node N corresponding to the first usage node NA in the graph GF associated with the time slot T two slots before (or two slots after). The network control device 1 may assign a usage flag F to a node N different from the first usage node NA in the graph GF associated with each time slot T among the one or more identified nodes N (hereinafter referred to as "third usage node") (see FIG. 6).

[0050] For example, in the graph GF1 associated with the time slot Q1, the flag assigning unit 12 identifies six nodes (N1, N2, N4, N5, N7, N8) corresponding to six first usage nodes NA in the time slot Q3 that is two slots after Q1. Among the six identified nodes, the flag assigning unit 12 may assign the usage level D to three third usage nodes (N1, N2, N4) different from the four first usage nodes (N5 to N8) in the graph GF1. The third usage node may overlap with the second usage node NB, or may be handled in the same manner as the second usage node NB.

[0051] (Second Embodiment) FIG. 10 is a functional configuration diagram of the network control device 1 according to the second embodiment. The network control device 1 according to the second embodiment has the same configuration as that of the first embodiment. In the second embodiment, in addition to the graph G and the schedule S, the storage unit 14 stores a capacity C.

[0052] The acquisition unit 11 acquires the graph G, the schedule S and the capacity C from the storage unit 14. The capacity C indicates the number of people that can be accommodated in each location P (see FIG. 12). The acquisition unit 11 transmits the acquired graph G, schedule S and capacity C to the flag assigning unit 12. The flag assigning unit 12 transmits the capacity C received from the acquisition unit 11 to the usage level assigning unit 13.

[0053] Figure 11 is a flowchart of the network control method according to the second embodiment. The network control device 1 executes the network control method related to steps SB1 to SB5 through each functional unit.

[0054] (Step SB1) First, the acquisition unit 11 acquires the graph G, schedule S, and capacity C. Specifically, the acquisition unit 11 acquires the graph G, schedule S, and capacity C from the storage unit 14 by accessing the storage unit 14 (see Figure 12).

[0055] (Steps SB2 to SB4) Steps SB2 to SB4 are the same as steps SA2 to SA4, respectively (see Figure 2).

[0056] (Step SB5) Finally, the utilization assignment unit 13 assigns a utilization level D proportional to the capacity C to the first utilization node NA and the second utilization node NB, which were assigned the utilization flag F in steps SB3 and SB4. Specifically, the utilization assignment unit 13 assigns a value proportional to the capacity C to the first utilization node NA and the second utilization node NB in ​​graph GFF (see Figure 13).

[0057] Figure 12 shows an example of Capacity C. Capacity C represents the number of people that can be accommodated at each location P. When the correspondence between location P and the number of people that can be accommodated is expressed as (location - number of people that can be accommodated), the following correspondence is obtained: (presentation hall - 300), (conference room 1 - 70), (conference room 2 - 50), (conference room 3 - 50), (product exhibition - 100), (lunch venue - 200), (reception - 40), (rest area north - 70), (rest area south - 50).

[0058] Figure 13 shows a second example of each graph GFF to which a utilization level D has been assigned. For example, the utilization level assignment unit 13 calculates a utilization level D for each location P in proportion to its capacity C. The utilization level assignment unit 13 defines the utilization level D for a location P that can accommodate 300 people (e.g., presentation hall) as "3.0". Based on this definition, the utilization level assignment unit 13 relatively calculates the utilization level D for the remaining locations P. For example, the utilization level assignment unit 13 calculates the utilization level D for a location P that can accommodate 70 people (e.g., conference room 1, rest area north) as "0.7".

[0059] The utilization assignment unit 13 assigns a relative utilization level D to the first utilization node NA and the second utilization node NB in ​​each graph GFF. If the correspondence between node N and utilization level D is denoted as (node, utilization level), the following correspondence is obtained: (N1 - 0.7), (N2 - 0.5), (N3 - 0.5), (N4 - 0.5), (N5 - 0.7), (N6 - 3.0), (N7 - 0.4), (N8 - 1.0), (N9 - 2.0).

[0060] According to the second embodiment described above, the network control device 1 assigns a utilization level D to the second user node NB that is proportional to the capacity C. It is assumed that a number of users proportional to the capacity C are present at the location P corresponding to the second user node NB. Since the network control device 1 assigns an appropriate utilization level D to that number of users, it can provide a network of appropriate quality to that number of users.

[0061] (Third Embodiment) Figure 14 is a functional configuration diagram of the network control device 1 of the third embodiment. The network control device 1 of the third embodiment has the same configuration as the first embodiment. In the third embodiment, the storage unit 14 stores the graph G and the schedule S, as well as the participation status PS.

[0062] The acquisition unit 11 acquires the graph G, schedule S, and participation status PS from the storage unit 14. The participation status PS indicates whether multiple people are participating in each location P (see Figure 16). The acquisition unit 11 transmits the acquired graph G, schedule S, and participation status PS to the flag assignment unit 12. The flag assignment unit 12 transmits the participation status PS received from the acquisition unit 11 to the usage status assignment unit 13.

[0063] Figure 15 is a flowchart of the network control method according to the third embodiment. The network control device 1 executes the network control method related to steps SC1 to SC6 through each functional unit.

[0064] (Step SC1) First, the acquisition unit 11 acquires the graph G, schedule S, and participation status PS. Specifically, the acquisition unit 11 accesses the storage unit 14 and acquires the graph G, schedule S, and participation status PS from the storage unit 14 (see Figure 16).

[0065] (Steps SC2 to SC4) Steps SC2 to SC4 are the same as steps SA2 to SA4, respectively (see Figure 2).

[0066] (Step SC5) Next, the usage assignment unit 13 calculates the participation rate PP based on the participation status PS obtained in step SC1. The participation rate PP indicates the number of people participating out of a total number of people for each location P (i.e., the percentage). Instead of the participation rate PP, the number of people participating for each location P may be used (see Figure 17).

[0067] (Step SC6) Finally, the utilization assignment unit 13 assigns a utilization level D, weighted by the participation ratio PP, to the first utilization node NA and the second utilization node NB, which were assigned the utilization flag F in steps SC3 and SC4. Specifically, the utilization assignment unit 13 assigns a value weighted by the participation ratio PP to the first utilization node NA and the second utilization node NB in ​​the graph GFF (see Figure 18).

[0068] Figure 16 shows an example of participation status PS. Participation status PS is associated with schedule S. Participation status PS indicates whether three participants (A, B, C) are participating in each location P during each time period T. For example, three participants (A, B, C) are participating in the presentation hall during time period Q1. One participant (A) is participating in conference room 1 during time period Q2. None of the participants are participating in conference room 2 during time period Q2. Two participants (B, C) are participating in conference room 3 during time period Q2.

[0069] Figure 17 shows an example of participation ratio PP. Participation ratio PP corresponds to participation status PS. Participation ratio PP indicates the number of participants (A, B, C) who attend each location P in each time period T. For example, the participation ratio PP for the presentation hall in time period Q1 is "1.00" (= 3 / 3). The participation ratio PP for conference room 1 in time period Q2 is "0.33" (= 1 / 3). The participation ratio PP for conference room 2 in time period Q2 is "0.00" (= 0 / 3). The participation ratio PP for conference room 3 in time period Q2 is "0.66" (= 2 / 3).

[0070] Figure 18 shows a third example of each graph GFF to which a utilization level D has been assigned. For example, the utilization level assignment unit 13 assigns a utilization level D, weighted by the participation ratio PP, to the first utilization node NA and the second utilization node NB in ​​each graph GFF. The utilization level D may also be a value obtained by multiplying a predetermined value (e.g., 1.0) by the participation ratio PP.

[0071] For example, the usage level assignment unit 13 assigns a numerical value of "1.00" as the usage level D to the first usage node N6 corresponding to the presentation hall in time period Q1. The usage level assignment unit 13 assigns three numerical values ​​(0.33, 0.00, 0.66) as the usage level D to the three first usage nodes (N1, N2, N3) corresponding to the three locations (meeting room 1, meeting room 2, meeting room 3) in time period Q2, respectively.

[0072] The utilization level assignment unit 13 assigns the utilization level "1.00" assigned to the first utilization node N6 in time period Q1 to the second utilization node N6 in time period Q2. The utilization level assignment unit 13 assigns the three utilization levels (0.33, 0.00, 0.66) assigned to the three first utilization nodes (N1, N2, N3) in time period Q2 to the three second utilization nodes (N1, N2, N3) in time period Q1, respectively. In this way, the utilization level assignment unit 13 assigns the utilization level D assigned to the corresponding first utilization node NA in the graph GFF related to an adjacent time period T to the second utilization node NB in ​​the graph GFF related to one time period T. The utilization level assignment unit 13 repeats the same process for the graph GFF related to each time period T.

[0073] In particular, the utilization level assignment unit 13 focuses on the second utilization node N2 corresponding to conference room 2 during the time period (lunch). The first utilization node N2 during time period Q3 is assigned a utilization level of "0.00", and the first utilization node N2 during time period Q4 is assigned a utilization level of "0.33" (see Figure 17). In this case, the utilization level assignment unit 13 assigns the higher utilization level of "0.33" to the second utilization node N2 during the time period (lunch) from the two different utilization levels (0.00, 0.33). The utilization level assignment unit 13 may also assign the intermediate value of the two different utilization levels, "0.17", to this second utilization node N2.

[0074] According to the third embodiment described above, the network control device 1 assigns a utilization level D to the second user node NB that is weighted by the participation ratio PP. At location P corresponding to the second user node NB, network usage is expected to occur at a frequency proportional to the participation ratio PP. Since the network control device 1 assigns an appropriate utilization level D for that frequency, it can provide a network of appropriate quality for that frequency.

[0075] Figure 19 shows the hardware configuration of the network control device 1. The network control device 1 comprises a CPU 101, RAM 102, ROM 103, storage 104, display device 105, input device 106, and communication device 107 as its components. Each component is connected to the others via an internal bus so as to be able to communicate with each other. The network control device 1 may include at least one of each component.

[0076] The CPU 101 is a processor that executes various processes according to a program. The CPU 101 uses a predetermined area of ​​the RAM 102 as a working area. The CPU 101 realizes each processing unit (e.g., acquisition unit 11, flag assignment unit 12, first flag assignment unit 121, second flag assignment unit 122, utilization level assignment unit 13) by reading and executing each program stored in the ROM 103 or storage 104. Each processing unit may be realized by a dedicated hardware circuit (e.g., ASIC). The CPU 101 is an example of a processing unit.

[0077] RAM 102 is a memory that stores various types of data in a rewritable format. RAM 102 is an SDRAM (Synchronous Dynamic Random Access Memory), etc. ROM 103 is a memory that stores various types of data in a non-rewritable format. Storage 104 is various types of storage media. Storage 104 may also be a drive device that writes or reads various types of data to or from the storage media. Storage 104 may write or read various types of data to or from the storage media in accordance with the control of the CPU 101. RAM 102, ROM 103, or storage 104 are examples of storage units (e.g., storage unit 14).

[0078] The display device 105 is a device that displays various images. The display device 105 is an LCD (Liquid Crystal Display), etc. The display device 105 displays various images based on display signals from the CPU 101. The display device 105 is an example of a display unit.

[0079] The input device 106 is a device that receives various input operations from the user. The input device 106 is a mouse, keyboard, etc. The input device 106 receives the operations entered by the user as instruction signals and transmits the received instruction signals to the CPU 101. The input device 106 is an example of an input unit.

[0080] The communication device 107 is a device that communicates with external devices via a network in accordance with the control of the CPU 101. The communication device 107 is an example of a communication unit.

[0081] Each embodiment of the present invention is presented as an example and does not limit the scope of the invention. Each embodiment can be carried out in various forms without departing from the spirit of the invention. Each embodiment may be combined with one another, in which case the combined effects can be obtained. Each embodiment includes a plurality of components, and various inventions can be obtained by various combinations of these components. Each embodiment or each combination of components is included within the scope of the invention.

[0082] 1...Network control device, 11...Acquisition unit, 12...Flag assignment unit, 13...Usage level assignment unit, 14...Storage unit, 101...CPU, 102...RAM, 103...ROM, 104...Storage, 105...Display device, 106...Input device, 107...Communication device, 121...First flag assignment unit, 122...Second flag assignment unit, C...Capacity, D...Usage level, F...Usage flag, G...Graph, GF...Graph, GFF...Graph, N...Node, NA...First usage node, NB...Second usage node, P...Location, PP...Participation rate, PS...Participation status, S...Schedule, T...Time zone

Claims

1. A network control device comprising: an acquisition unit that acquires a graph showing each location where the network is located as a node, and a schedule showing each time period in which each location is used; a first flag assignment unit that assigns a usage flag to a first usage node, which is the node corresponding to the location being used in the graph for each time period, based on the schedule; a second flag assignment unit that assigns the usage flag to a second usage node, which is the node corresponding to the first usage node in the graph for an adjacent time period, and is different from the first usage node in the graph for each time period; and a usage degree assignment unit that assigns a usage degree indicating the degree of network usage to the first and second usage nodes to which the usage flag has been assigned.

2. The network control device according to claim 1, wherein the utilization level assigning unit assigns predetermined values ​​as the utilization level to the first utilization node and the second utilization node.

3. The network control device according to claim 1, wherein the utilization level assignment unit assigns a predetermined value as the utilization level to the first utilization node and a value smaller than the predetermined value to the second utilization node.

4. The network control device according to claim 1, wherein the acquisition unit acquires a capacity indicating the number of people that each location can accommodate, and the utilization level assignment unit assigns a value proportional to the capacity as the utilization level to the first utilization node and the second utilization node.

5. The network control device according to claim 1, wherein the acquisition unit acquires a participation status indicating whether or not multiple persons are participating in each of the locations, the utilization level assignment unit calculates a participation ratio for each of the locations indicating the number of participating persons out of the total number of persons based on the participation status, and assigns a value weighted by the participation ratio to the first and second utilization nodes as the utilization level.

6. A network control method comprising: a computer obtaining a graph showing each location where the network is located as a node, and a schedule showing each time period in which each location is used; assigning a usage flag indicating network usage to a first usage node, which is the node corresponding to the location being used in the graph for each time period, based on the schedule; assigning the usage flag to a second usage node, which is the node corresponding to the first usage node in the graph for an adjacent time period and is different from the first usage node in the graph for each time period; and assigning a usage level indicating the degree of network usage to the first and second usage nodes to which the usage flag has been assigned.

7. A network control program that causes a computer to function as a component of the network control device described in claim 1.

Images