JPH01190044A - Data processing system - Google Patents

Abstract

PURPOSE:To obtain a management center point in nearly the center of structure of the network without giving much change to an information path by constituting the system by a network constitution change storage section giving a change in network constitution to a basic operation control section and a path revision storage section receiving a change in the information path from the basic operation control section. CONSTITUTION:The content of the network constitution storage section 2 is corrected according to the inputted constitution change. Then the shortest path to other points from a subscribing point is obtained, whether or not the subscribing point is remoter than the path constituting a diameter is discriminated, and in the case of the remote point, the shortest path from (x) to other point is obtained, the remotest point in the paths is selected as (y), an intermediate point of path y-x- subscribing point is obtained to attain a new management center. When there is a change in the relation of constitution of the components in the state of the network information path decided and it is required to change the information path and the management center point, the revised path is obtained.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to technology for controlling communication networks configured by various data communication means, that is, management of physical communication network configuration devices and control of data communication networks. Regarding the logical component management method used.

(Prior Art) The ↑+'fIII path within a communication network is, in principle, fixedly defined, and the information path can be changed by manually changing it as necessary.

(Problems to be Solved by the Invention) When managing network information in a communication network, one management device is usually defined, and a management method within the device collects information from each device in the network.Each device Using the route setting method of
An example of determining the information transfer route is shown in Figure 5 (A>). In the figure, the information collection point (management center point) is the "
It is set at the center, that is, at a point that is not extremely far from a certain device. For example, in FIG. Figure 5 (B) shows an example where the point is set away from the "center". In Figure 5 (B), device 3 is the central management point. In Figure 5 (A>), from which point is not far away, so there is little communication delay.In this way, the central point of management is
It is desirable to be near the “center” of the network.

This method works in a situation where the sub-information route has already been determined.
The purpose of this method is to find a changed route when a change occurs in the connection relationship between components and it becomes necessary to change the information route and management center point.

(Means for Solving the Problem) As shown in FIG. 1, the present invention comprises a basic calculation control section 1, a network configuration storage section 2 connected thereto, an information route storage section 3, a shortest path calculation section 4, and an intermediate point calculation section. unit 5, a network configuration change storage unit 6 that inputs changes in network configuration to the basic calculation control unit 1, and a route change storage unit 7 that outputs changes in the information route from the basic calculation control unit 1. .

(Operation) The wJ configuration storage unit 2 stores connection relationships of communication devices in a communication network. FIG. 4(A) shows an example of the connection relationship (network) of communication devices, and FIGS. 4(B) and 4(C) show an outline of the contents stored in the network configuration storage unit 2. Each communication device is a point, and the communication line connecting each communication device is a branch. It is assumed that the length of the branch corresponding to the delay time and cost of the communication line is defined between points 1 to 5 as shown in FIG. 4(A). When the information route is set as shown in FIG. 5(A) on this network, an outline of the storage contents of the information route storage unit 3 is shown in FIG. 5(C). Here, the distance of each point from the management center point represents the sum of the lengths of techniques passing along a determined information path. Further, the diameter is the longest path connecting the end points of the information path, and the radius is the path connecting the management center and the farthest end point. In Figure 5 (A>, the diameter is path 1
-2-3, and the radius is path 1-2. When a change occurs in the connection relationship of the communication network, calculations are performed using this method to find a change in the information path. An information summary of the network configuration change storage unit 6 that describes this configuration change is shown in FIG. 6 (A), and an example thereof is shown in FIG. 6 (B). This shows the case where point 6 joins point 5 and length l.By receiving the contents of network configuration change storage section 6 as input, calculation of basic calculation control section 1 is started.Basic calculation control The calculation procedure of part l is shown in FIG.

First, in step 11, the contents of the network configuration storage section 2 are modified in accordance with the input configuration change.

In step 12, it is determined whether the configuration change is joining or leaving. In the case of joining, steps 13 to 18 are executed. 19-24 in case of 1lli prolapse
Execute.

13, find the shortest path from the addition point to all other points. This is executed by starting the shortest path calculation method 4.

The contents are (A, V, Eiho, J.

, E., Hopcroft, J., D., Urmanni “Design and Analysis of Algorithms” 180 pages Science Publishing 1
Dijks Lra's shortest algorithm (1977) is used.

At step 14, it is determined whether the addition point is further away than the path that makes up the diameter. If it is close, there is no need to change the management center, so execute step 15. Conversely, if it is far away, the management center will be changed, so execute steps 16 to 18.

In step 15, route information for a portion where a new information route is added by joining is generated. The situation in this case is shown in FIG. 7 (A>).

In step 13 above, the point closest to the joining point among the points that have already been routed is determined. Let this be X. 1
In step 6, find the shortest path from X to another point, and set the farthest point as y. In step 17, the intermediate point of the path y-x-join point is found and set as a new management center. In step 18, the changed portion of the information route is determined by adding the route and moving the management center.

The situation in this case is shown in FIG. 7(B).

In step 19, it is determined whether the departure point is a point forming a diameter.

If the diameter does not form, there is no need to change the management center, so execute step 20. Conversely, if the diameter is the same, the center of control will be changed, so execute steps 21 to 23.

In step 20, route information for the portion of the information route to be deleted due to departure is generated. The situation in this case is shown in FIG. 7(C).

In step 21, first find a point X that affects the path of the pond point from the departure point toward the management center.

At this time, the route between the departure point and X is deleted. In step 22, find the shortest route on the information setting route from X to the point in the pond, and set the farthest point among them as y. In step 23, the midpoint of the route y-x is found and set as a new management center.

In step 24, the changed portion of the information route is determined by adding the route and moving the management center. The situation in this case is shown in Figure 7 (D
> Shown below.

(Example) FIG. 3 shows an example of a conference system to which this method is applied.

It is assumed that one communication device 32 that incorporates this method 31 and other communication devices 33 (plurality) that do not incorporate this method 31 are connected via a communication method 35. The communication devices 32 and 33 have a built-in data route setting method 34, and set the data route according to the instructions of this method 31. This system uses this method to sequentially modify the management center (in this case, the chairperson) when a member joins or leaves during a meeting, such as in a meeting, so that the chairperson becomes the center of the meeting members in the communication path. It is something.

(Effects of the Invention) According to this method, the management center point can be found approximately at the structural center of the workpieces without significantly changing the information path. Here, the central management point is not necessarily the center of the network. However, when the second evaluation criterion is to reduce the number of route changes, the points closest to the center are obtained.

[Brief explanation of the drawing]

Figure 1 is a block diagram of this data processing method, Figure 21, d
is a calculation flow diagram of the basic calculation control unit 1, FIG. 3 is a block diagram of an embodiment of the conference system of the present invention, and FIG. 4 (A
＞ is an example of the network, FIG. 11(B) is a data summary diagram of the network configuration storage unit 2, FIG. 4(C) is the data opening of the network configuration storage unit 2, and FIG. , FIG. 5(B) is an example diagram of a network information transfer route, FIG. 5(C) is an information overview diagram showing the transfer route,
Figure 5<D) shows the data opening and Figure 6 (D) shows the transfer route.
A> is a data summary diagram of the network configuration change storage unit 6, FIG.
B) shows the data opening of the network configuration change storage unit 6, FIG.
) to (D> are the changes in the network when joining/withdrawing occurs.

Claims (1)

[Claims] A basic calculation control unit, a network configuration storage unit connected to it, an information route storage unit, a shortest route calculation unit, an intermediate point calculation unit, a network configuration change storage unit that inputs changes in network configuration to the basic calculation control unit, and a basic calculation control unit. It consists of a route change storage unit to which the change in the information route is output from the arithmetic and control unit, and is characterized in that when the configuration of the communication network is changed for some reason, the change in the information route is determined accordingly. data processing method.