Abstract:
A network device management apparatus which generates distribution routes for transmitting distribution information via communication devices, in order to distribute information to plural communication devices connected to a network, and makes the distribution information be transmitted in accordance with the generated distribution routes. The apparatus comprises: a hierarchy structure creation section that creates, based on units and the number of communication devices to which the distribution information is to be distributed, a hierarchy structure constituted by the units of communication devices as constitutional elements; and a distribution control section that controls distribution of the distribution information, by use of the hierarchy structure created by the hierarchy structure creation section. Therefore, the network device management apparatus can reduce the total distribution time and distribute information efficiently when the information is distributed to a huge number of communication devices.

Description:
BACKGROUND OF THE INVENTION  
       [0001]     1. Field of the Invention  
         [0002]     The present invention relates to a network device management apparatus, network device management program, and network device management method in which when information is distributed to a large number of communication devices, distribution routes thereof are created and then the information is distributed.  
         [0003]     2. Description of the Related Art  
         [0004]     When a management apparatus distributes, for example, control information to plural communication devices constituting a network, the control information is distributed to all the communication devices in sequential order, in an individual distribution method, as shown in  FIG. 15 . Alteratively, as shown in  FIG. 16 , in a relay device installation method, a relay device is provided and the control information is distributed via the relay device. These are known techniques.  
         [0005]     For example, in the Japanese Patent Application Laid-Open Publication No. 2002-14920, a calculator of an information distributor having requested information which is necessary for a calculator of an information distribution destination receives an information supply request from the calculator of the information distribution destination. The calculator of the information distributor constructs a network path, as a network path from the calculator of the information distributor to the calculator of the information distribution destination via an information relay calculator, for every attribute of the requested information, and distributes the requested information to the calculator of the information distribution destination.  
         [0006]     However, in case of adopting the individual distribution method as described above, information is distributed to all devices in sequential order. Therefore, the total distribution time increases, substantially in proportion to the number of devices. For example, where n is the number of communication devices to which information should be distributed, the total distribution time is n times longer the time required for distributing information to one device. If there are a huge number of communication devices, the total distribution time is too long to respond to.  
         [0007]     Alternatively, in case of adopting the relay device installation method, the relay device is fixed. Therefore, an advantage of reducing total transfer time cannot be expected, depending on the number of distribution destinations and the installation location. In addition, since the relay device has to be installed optionally, costs may be increased due to costs for the apparatus itself, installation space, and management of the apparatus.  
       SUMMARY OF THE INVENTION  
       [0008]     The present invention has been made in view of the problems described above, and has an object of providing a network device management apparatus, a network device management program, and a network device management method which are capable of reducing total distribution time and of efficiently distributing information, when information is distributed to a huge number of communication devices.  
         [0009]     To achieve the above object, according to an aspect of the present invention, there is provided a network device management apparatus which generates distribution routes for transmitting distribution information via communication devices, in order to distribute information to plural communication devices connected to a network, and makes the distribution information be transmitted in accordance with the generated distribution routes, the apparatus comprising: a hierarchy structure creation section that creates, based on units and the number of communication devices to which the distribution information is to be transmitted, a hierarchy structure constituted by the units of communication devices as constitutional elements; and a distribution control section that controls distribution of the distribution information, by use of the hierarchy structure created by the hierarchy structure creation section.  
         [0010]     In the network device management apparatus, if the hierarchy structure is constructed from an uppermost level where n is the number of the units of communication devices, x is the identical number of other units of communication devices than one of the units of communication devices through which the distribution information is to be distributed to the other units, and y is the number of layers constituting the hierarchy structure, the hierarchy structure creation section creates the hierarchy structure so as to minimize the value of x×y which satisfies: 
 
Σ x   i (where  i= 1 to  y− 1)≦ n&lt;Σx   i (where  i= 1 to  y ). 
 
         [0011]     Also, in the network device management apparatus, if there are plural combinations each of which minimizes the value of x×y, the hierarchy structure creation section creates the hierarchy structure by selecting one of the combinations which minimizes Σx i −n (where i=1 to y).  
         [0012]     Further, if there are plural combinations each of which minimizes Σx i −n (where i=1 to y), the hierarchy structure creation section creates the hierarchy structure by selecting a combination in which the value of x is greater.  
         [0013]     Also, in the network device management apparatus of the present invention, the hierarchy structure creation section creates the hierarchy structure so as to distribute the distribution information to the communication devices in order from a communication device having a shorter network distance between two of the units of communication devices.  
         [0014]     In the network device management apparatus, if a distribution order of communication devices is given, the hierarchy structure creation section may create the hierarchy structure by assigning the units of communication devices to the hierarchy structure, on the basis of the distribution order.  
         [0015]     Also, the hierarchy structure creation section may form the units of communication devices each as an independent distribution group including no overlapping part, by collecting together parts common to the distribution order.  
         [0016]     Further, the hierarchy structure creation section may form the units of communication devices each by assigning one or more communication devices, based on a network distance between the units each other in case where the units each are formed by one or more communication devices.  
         [0017]     Also, the hierarchy structure creation section may form the hierarchy structure by grouping, as each of the units of communication devices, nodes having an identical subnet.  
         [0018]     According to another aspect of the present invention, there is provided a medium that has recorded therein, readably by a computer, a network device management program which makes a computer generate distribution routes for transmitting distribution information via communication devices, in order to distribute information to plural communication devices connected to a network, and execute network device management of transmitting the distribution information in accordance with the generated distribution routes, the program comprising: a hierarchy structure creation step that creates, based on units and the number of communication devices to which the distribution information is to be transmitted, a hierarchy structure constituted by the units of communication devices as constitutional elements; and a distribution control step that controls distribution of the distribution information, by use of the hierarchy structure created in the hierarchy structure creation step.  
         [0019]     In the hierarchy structure creation step in the network device management program, if the hierarchy structure is constructed from an uppermost level where n is the number of the units of communication devices, x is the identical number of other units of communication devices than one of the units of communication devices through which the distribution information is to be distributed to the other units, and y is the number of layers constituting the hierarchy structure, the hierarchy structure is created so as to minimize the value of x×y which satisfies: 
 
Σ x   i (where  i= 1 to  y− 1)≦ n&lt;Σx   i (where  i= 1 to  y ). 
 
         [0020]     Also, in the hierarchy structure creation step, if there are plural combinations each of which minimizes the value of x×y, the hierarchy structure is created by selecting one of the combinations which minimizes Σx i −n (where i=1 to y).  
         [0021]     Also, in the hierarchy structure creation step, if there are plural combinations each of which minimizes Σx i −n (where i=1 to y), the hierarchy structure is created by selecting a combination in which the value of x is greater.  
         [0022]     In the hierarchy structure creation step, the hierarchy structure may be created so as to distribute the distribution information to the communication devices in order from a communication device having a shorter network distance between two of the units of communication devices.  
         [0023]     Also, in the hierarchy structure creation step, if a distribution order of communication devices is given, the hierarchy structure may be created by assigning the units of communication devices to the hierarchy structure, on the basis of the distribution order.  
         [0024]     Also, in the hierarchy structure creation step, the units of communication devices each may be formed as an independent distribution group including no overlapping part, by collecting together parts common to the distribution order.  
         [0025]     Also, in the hierarchy structure creation step, the units of communication devices each may be formed by assigning one or more communication devices, based on a network distance between the units each other in case where the units each are formed by one or more communication devices.  
         [0026]     Further, in the hierarchy structure creation step, the hierarchy structure may be formed by grouping, as each of the units of communication devices, nodes having an identical subnet.  
         [0027]     According to further another aspect of the present invention, there is provided a network device management method for generating distribution routes for transmitting distribution information via communication devices, in order to distribute information to plural communication devices connected to a network, and making the distribution information be transmitted in accordance with the generated distribution routes, the method comprising: a hierarchy structure creation step that creates, based on units and the number of communication devices to which the distribution information is to be transmitted, a hierarchy structure constituted by the units of communication devices as constitutional elements; and a distribution control step that controls distribution of the distribution information, by use of the hierarchy structure created in the hierarchy structure creation step.  
         [0028]     As has been described above, according to the present invention, total distribution time can be reduced and information can be efficiently distributed when the information is distributed to a huge number of communication devices forming a network. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0029]      FIG. 1  is a functional block diagram showing an embodiment of the present invention;  
         [0030]      FIG. 2  is a flowchart showing operation of an embodiment 1;  
         [0031]      FIG. 3  is a flowchart showing operation of an embodiment 2;  
         [0032]      FIG. 4  is a flowchart showing operation of an embodiment 3;  
         [0033]      FIG. 5  is a flowchart showing operation of an embodiment 4;  
         [0034]      FIGS. 6A and 6B  are tree views showing distribution routes of a complete type and a fractional type;  
         [0035]      FIG. 7  is a network structure view for explaining an example of the present invention;  
         [0036]      FIG. 8  is a table showing device characteristics;  
         [0037]      FIG. 9  is a table showing inter-device characteristics;  
         [0038]      FIG. 10  is a tree view showing distribution routes in an example 1 corresponding to the embodiment 1;  
         [0039]      FIG. 11  is a tree view showing distribution routes in an example 2 corresponding to the embodiment 2;  
         [0040]      FIG. 12  is a tree view showing distribution routes in an example 3 corresponding to the embodiment 3;  
         [0041]      FIG. 13  is a tree view showing distribution routes in an example 4 corresponding to the embodiment 4;  
         [0042]      FIGS. 14A and 14B  show order conditions;  
         [0043]      FIG. 15  is a view showing distribution routes according to a known individual-distribution method; and  
         [0044]      FIG. 16  is a view showing distribution routes according to a known relay-device installation method. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0045]     Embodiments of the present invention will now be described below with reference to the drawings.  
         [0046]      FIG. 1  is a block diagram showing a network device management apparatus in an embodiment of the present invention.  
         [0047]     The network management device  20  has: a distribution request receiving section  21 ; a distribution route determination section  22 ; a distribution control section  23 ; a distribution order condition database  24  which stores distribution order conditions; a network structure information database  25  which stores network structure information; and a distribution information database  26  which stores distribution information. The distribution route determination section  22  has a hierarchy structure creation section  22   a.    
         [0048]     The distribution request receiving section  21  receives a distribution request (e.g., a distribution destination list, a distribution information specification) from a user via a GUI (Graphical User Interface) or CLI (Command Line Interface). In accordance with the distribution request received, the distribution route determination section  22  creates and determines a distribution route through communication devices (or network devices)  1  to N. The hierarchy structure creation section  22   a  creates a hierarchy structure to construct a distribution route. The communication devices  1  to N mean communication devices dealt with as units. The following description will be made supposing that the communication devices  1  to N consist of one or plural units (each having one input and one output).  
         [0049]     The distribution control section  23  controls actual distribution of distribution information in accordance with distribution routes determined by the distribution route determination section  22 .  
         [0050]     The distribution order conditions stored in the distribution order condition database  24  include a constraint condition concerning the order of setting communication devices with respect to distribution information.  
         [0051]     Also, the network structure information stored in the network structure information database  25  includes device characteristics and inter-device characteristics (network characteristics) of communication devices as distribution destinations.  
         [0052]     The distribution information stored in the distribution information database  26  includes control information (e.g., a program, policy/Config information) to be distributed to communication devices.  
         [0053]     In the structure as described above, upon reception of a distribution request from a user, the distribution request receiving section  21  sends the distribution request to the distribution route determination section  22 . The distribution route determination section  22  refers to the databases  24  and  25 , respectively, for distribution order conditions and network structure information, and creates (or determines) distribution routes having a hierarchy structure. The distribution route determination section  22  sends the distribution routes to the distribution control section  23 . The distribution control section  23  sends a distribution frame including the distribution routes and distribution information to the nearest communication device specified by the distribution routes.  
       Embodiment 1  
       [0054]      FIG. 2  is a flowchart showing a method of determining routes (distribution structure creation) in the embodiment 1. In the embodiment 1, the distribution order is not particularly limited.  
         [0055]     Upon reception of a distribution request including a distribution destination list and a distribution information specification by the distribution request receiving section  21 , the hierarchy structure creation section  22   a  derives the total number (n) of distribution destinations from the distribution destination list, in the distribution route determination section  22  (S 1 ).  
         [0056]     After n is derived, such a combination of x and y that gives a minimum value of x×y is calculated among possible combinations of the number x of devices to which information should be distributed next from each communication device (hereinafter, simply referred to as a device) and the number y of hierarchy layers (S 2 ). This calculation is achieved by sequentially checking all combinations.  
         [0057]     If only one combination gives a minimum value (S 3 , N), only this one solution is selected (S 4 ). Otherwise, if there are plural combinations that give a minimum value (S 3 , Y), one of the combinations that has the smallest fraction with respect to a complete form is selected (S 5 ).  
         [0058]     The complete form mentioned above means a form in which x devices of the devices in the final hierarchy layer (the layer y or y-th layer) are connected to every one (without any fractional device) of the devices in the one-level higher layer (the layer (y−1) or (y−1)-th layer), as shown in  FIG. 6A .  
         [0059]     On the other side, a fractional form means a form in which x devices of the devices in the final layer are not connected (i.e., there is any fractional device) to every one of the devices in the one-level higher layer, as shown in  FIG. 6B . The devices in the final layer of the fractional form are arranged in order one after another below devices in the one-level higher layer.  
         [0060]     The fraction of the fractional form is expressed by the following expression: 
 
Σx i −n 
 
 where i is an integer of 1 to y. 
 
         [0061]     In this case, n satisfies the following condition: 
 
Σ x   i (where  i= 1 to  y− 1)≦ n&lt;Σx   i (where  i= 1 to  y ) 
 
         [0062]     In step S 5 , if there are such combinations that further have an equal fraction, one of the combinations that have a greater x is selected. This is to give priority to abilities of devices.  
         [0063]     After deriving x and y, devices are arranged as follows. In case of a complete form (S 6 , Y), x devices are arbitrarily selected and arranged below each of the devices in layers down to the layer y (S 7 ). Alteratively, in case of a fractional form (S 6 , N), x devices are arbitrarily selected and arranged below each of the devices in layers down to the layer (y−1) (S 8 ), and devices are arranged in order one after another below devices in the layer (y−1), in the layer y (S 9 ).  
       Embodiment 2  
       [0064]      FIG. 3  is a flowchart showing a method of determining routes (distribution structure creation) according to the embodiment 2. In the embodiment 2, the distribution order is not particularly limited either. The steps (S 1  to S 6 ) in  FIG. 3  up to derivation of x and y, as described with reference to  FIG. 2 , are the same as those in  FIG. 2 .  
         [0065]     The layout of devices after derivation of x and y will be as follows. That is, in case of a complete form (S 6 , Y), such x devices that have the shortest network distance are arranged below each of devices in layers down to the layer y (S 11 ). Alternatively, in case of a fractional form (S 6 , N), x devices that have the shortest network distance are arranged below each of devices in layers down to the layer (y−1) (S 12 ), and devices are arranged one after another in order below devices in the layer (y−1), in the layer y (S 13 ).  
       Embodiment 3  
       [0066]      FIG. 4  is a flowchart showing a method of determining routes (distribution structure creation) according to the embodiment 3. In the embodiment 3, the distribution order is not particularly limited either.  
         [0067]     Upon reception of a distribution request, devices as distribution destinations are firstly grouped into groups each consisting of those devices that have one identical subnet (S 21 ). In this case, whether or not a device should be included in a group is determined depending on the IP address and netmask of the device.  
         [0068]     After the grouping, one device to become Leader is determined in each of the groups (S 22 ). For example, a device having the smallest IP address may be determined as Leader. After determining Leaders, distribution routes from one Leader to other devices ( 1 :plural devices) are created in each of the groups (S 23 ).  
         [0069]     From the above, the total number n of created groups is derived (S 24 ).  
         [0070]     With respect to the derived n, such a combination of x and y that gives a minimum value of x×y is calculated among possible combinations of the number x of groups to which information should be distributed next from each group and the layer number y of hierarchy layers (S 25 ). This calculation is achieved by sequentially checking all combinations.  
         [0071]     If only one combination gives a minimum value (S 26 , N), only this one solution is selected (S 27 ). Otherwise, if there are plural combinations that give a minimum value (S 26 , Y), one of the combinations that has the smallest fraction with respect to a complete form is selected (S 28 ).  
         [0072]     In step S 28 , if there are such plural combinations that have an equal fraction, one of the combinations that has a greater x is selected.  
         [0073]     In the above, the procedure of deriving x and y is equivalent to the procedure of  FIG. 2 , in which the devices (each being a form of a unit of a communication device) as targets (each being another form of unit of communication device) to be arranged are substituted with groups.  
         [0074]     After deriving x and y, devices are arranged as follows. In case of a complete form (S 29 , Y), such x groups that have the shortest network distance are arranged below each of the groups in layers down to the layer y (S 30 ). At this time, those devices (selected orderly one after another) that are not Leaders are connected to Leaders in groups in the one-level lower layer groups. This processing procedure is common to steps S 31  and S 32  which will be described later.  
         [0075]     Alternatively, in case of a fractional type (S 29 , N), such x groups that have the shortest network distance are arranged below each of the groups in layers down to the layer (y−1) (S 31 ). In the layer y, groups that have the shortest network distance are arranged orderly one after another below groups in the layer (y−1) (S 32 ). Also, the arranging procedure in this step is equivalent to that in  FIG. 3 , in which the devices as targets to be arranged are substituted with groups.  
       Embodiment 4  
       [0076]      FIG. 5  is a flowchart showing a method of determining routes (distribution structure creation) according to the embodiment 4. In the embodiment 4, consideration is taken into the distribution order.  
         [0077]     Upon reception of a distribution request, order conditions concerning the order of distribution are checked (S 41 ).  
         [0078]     Next, with respect to the order conditions, those parts that overlap each other are merged to create one or more independent distribution groups (S 42 ). In each of the one or more groups, the order of devices which is derived from the order conditions is created as distribution routes (S 43 ). From the above, the total number of groups created is derived (S 44 ).  
         [0079]     Next, with respect to the derived n, such a combination of x and y that gives a minimum value of x×y is calculated, among possible combinations of the number x of groups to which each group should distribute information next, and the number y of hierarchy layers (S 45 ). This calculation is achieved by sequentially checking all combinations.  
         [0080]     If only one combination gives a minimum value (S 46 , N), only this one solution is selected (S 47 ).  
         [0081]     Otherwise, if there are plural combinations that give a minimum value (S 46 , Y), one of the combinations that has the smallest fraction with respect to a complete form is selected (S 48 ). The procedure of deriving x and y in this step is equivalent to that in  FIG. 2 , in which the devices as targets to be arranged are substituted with groups.  
         [0082]     After deriving x and y, devices are arranged as follows. In case of a complete form (S 49 , Y), x groups are arbitrarily selected and arranged below each of the groups in layers down to the layer y (S 50 ). At this time, the last devices respectively in the groups (selected one after another in an order) are connected to the first devices respectively in the groups in the next layer. This processing is common to the steps S 51  and S 52  which will be described later.  
         [0083]     Alternatively, in case of a fractional form (S 49 , N), x groups are arbitrarily selected and arranged below each of the groups in layers down to the layer (y−1) (S 51 ). In the layer y, groups are arranged one after another in an order below groups in the layer (y−1) (S 52 ). Also, the layout procedure in this step is equivalent to that in  FIG. 2 , in which the devices as targets to be arranged are substituted with groups.  
       EXAMPLES  
       [0084]     Examples of the embodiments described above will now be described.  
         [0085]      FIG. 7  is a diagram showing a network structure for explaining the examples.  FIGS. 8 and 9  are tables showing device characteristics of this network structure (IP addresses, netmasks, subnets) and inter-device characteristics (e.g., the number of hops between devices).  
       Example 1  
       [0086]     An example of the embodiment 1 will now be described.  
         [0087]     The total number n of distribution destinations is checked after a distribution request arrives. In this case, it is supposed that information is distributed to all communication devices ( 1  to  8 ) shown in  FIG. 7 . This supposition is common to examples 2 to 4 which will be described below.  
         [0088]     Since the number of devices as distribution targets is eight, possible combinations of (x, y) are (1, 8), (2, 3), (3, 2), (4, 2), (5, 2), (6, 2), (7, 1), and (8, 1).  
         [0089]     Of these combinations, two combinations (2, 3) and (3, 2) each minimize x×y. However, fractions which the two combinations have with respect to a complete form are 6 and 3, respectively. Hence, the combination (3, 2) which has the smaller fraction is selected.  
         [0090]     Accordingly, the devices are arranged in the order of device number. In the final layer where fractions appear, the devices are arranged one after another in order. Distribution routes obtained as a result of this are shown in  FIG. 10 .  
       Example 2  
       [0091]     An example of the embodiment 2 will now be described.  
         [0092]     In the example 2, the method of obtaining a combination of (x, y) described above is identical to that in the case of the example 1, and is determined to be (3, 2).  
         [0093]     To select devices, devices to which each device directly distributes information are selected among those devices that have the shortest network distance (which is the number of hops shown in  FIG. 9 ). Devices  1 ,  2 , and  3  are arranged below (or in the first layer) a network device management apparatus  20  as a parent. In the second layer as the final layer, devices are selected and arranged one after another from those devices that have the shortest network distance (e.g., the number of hops) among remaining devices, until all the devices are arranged. The structure of distribution routes obtained as a result is shown in  FIG. 11 .  
       Example 3  
       [0094]     An example of the embodiment 3 will be described below.  
         [0095]     In response to a distribution request, devices are firstly grouped into groups each consisting of those devices that have one identical subnet. According to the column of subnets of the device characteristics (which are maintained as a database in the network structure information in  FIG. 1 ) shown in  FIG. 8 , groups each consisting of devices that belong to one identical subnet are: devices  1  and  2 ; devices  3  and  4 ; devices  5  and  6 ; and devices  7  and  8 .  
         [0096]     One device that has the smallest IP address is selected as Leader, from each group. The selected devices are respectively the devices  1 ,  3 ,  5 , and  7 .  
         [0097]     In each group, distribution routes ( 1 :plural devices) from Leader to the other devices are created as follows.  
         [0098]     Routes from the device  1  to the device  2 , from the device  3  to the device  4 , from the device  5  to the device  6 , and from the device  7  to the device  8  are created.  
         [0099]     The total number of created groups are four. With respect to this, possible combinations of (x, y) are (1, 4), (2, 2), and (4, 1).  
         [0100]     In every one of these combinations, x×y gives four. However, fractions with respect to a complete form are respectively 0, 2, and 0, and therefore, (1, 4) or (4, 1) is possible. In this case, the structure of (4, 1) which has a greater number of distribution routes from the network device management apparatus is selected.  
         [0101]     According to this structure, groups are arranged. Those groups that have the shortest network distance (or the smallest hops between subnets shown in  FIG. 9 ) are arranged below each group. In the present case, the structure 1:4 is adopted, and therefore, it does not cause this situation. However, a structure of distribution routes obtained as a result is shown in  FIG. 12 .  
       Example 4  
       [0102]     An example of the embodiment 4 will now be described.  
         [0103]     In response to a distribution request, order conditions concerning the order of distribution are checked firstly. Suppose that the order conditions shown in  FIG. 14A  are defined as distribution order conditions (which are maintained as a database in the distribution order condition DB shown in  FIG. 1 ).  
         [0104]     Thus, overlapping parts are merged, and one or more independent distribution groups are created. Then, a structure shown in  FIG. 14B  is obtained (wherein the device  1  is common to the first and second order conditions, as well as the device  6  to the third and fourth order conditions).  
         [0105]     In each group, an order derived from the order conditions is created as distribution routes. Then, the same structure as shown in  FIG. 14B  is obtained. The total number of created groups is two. With respect to this, possible combinations of (x, y) are:  
         [0106]     (1, 2) and (2, 1)  
         [0107]     In every one of these combinations, x×y gives two. However, with respect to a complete form, both combinations have a fraction of 0. In this case, the structure of (2, 1) which has a greater number of distribution routes from the network device management apparatus is selected.  
         [0108]     According to this structure, groups are arranged. The groups are arbitrarily arranged below each group. However, in the present case, the structure 1:2 is adopted, and therefore, a structure of distribution routes obtained as a result is shown in  FIG. 13 .  
         [0109]     In the embodiments described above, a program which makes a computer execute each of the steps shown in FIGS.  2  to  5  is stored, as a network device management program, into a recording medium readable from the computer. In this way, a computer which constitutes a network device management apparatus can be made execute the program. The scope meant by a recording medium readable from a computer may include a portable storage medium such as a CD-ROM, flexible disk, DVD disk, magneto-optical disk, or IC card, a database which maintains the computer program, another computer and a database thereof, and further a transmission medium on lines.