JP6586864B2 - Node connection configuration method - Google Patents

Description

  The present invention relates to a node connection configuration method, and more particularly to a node connection configuration method for creating a network configuration diagram using a spanning tree algorithm in a ring topology.

  In a multi-path network, a spanning tree protocol is executed on each bridge in order to avoid adverse effects caused by overlapping interconnections. The spanning tree algorithm used for this route control has a mechanism that prevents the occurrence of a loop by extracting the shortest path to the root bridge using a distance vector algorithm and blocking other paths.

  In the distance vector algorithm, the amount of path information held by each node is constant regardless of the number of nodes. In other words, one node holds only the distance vector to the root bridge (destination = root bridge, distance, representative bridge), and advertises this to neighbors, so that the entire network can be controlled as a result. It is a mechanism.

The route control mechanism is advantageous in that the size of the route information is constant regardless of the configuration and scale of the network. However, when a node connection configuration diagram is created, information is insufficient. If all nodes broadcast their distance vectors and each node collects them all, it is possible to create an active path configuration diagram, but this method cannot detect the existence of an alternative path.
Note that Patent Document 1 is known as a technique for causing a network to execute a spanning tree protocol.

JP 2006-109188 A

FIG. 6 shows a conceptual diagram of the network configuration. Hereinafter, a node connection configuration diagram in a ring topology is referred to as a “ring map”. FIG. 6 shows a ring topology composed of N nodes by B _{1 to} B _N. The ring topology on a result of executing the spanning tree algorithm, indicating that in which a left port is blocked bridge B _X. The link of bridge B _X -B _{X + 1} is an alternative path.

Bridge running spanning tree algorithm has the distance vector to the root bridge B _1. This is called a representative distance vector. If a certain bridge is Bi, the representative distance vector is (B ₁ , Di, Bi). Here, Di is the distance from Bi to B _1. As described later, in the present invention, the representative distance vector of each bridge itself is broadcast on the ring. Hereinafter, this message is referred to as a ring map advertisement.

Ring map advertisements broadcast by each bridge are collected by other bridges and cached in a ring map database RingMapDB (hereinafter referred to as RMDB). In FIG. 6, the RMDB is described only in the bridge Bi, but this RMDB is possessed by all the bridges B _{1 to} B _N. Each bridge replays the inter-node connection in the node connection diagram generation unit RMGen from the ring map advertisement cached in the RMDB, composes the ring map, and displays it on the console or the information management base MIB to the user provide. Thereby, the user can acquire a ring map from an arbitrary bridge.

Here, there is one obstacle to creating a ring map from RMDB. that is,
Distance value included in the representative distance vector is to a large value as the distance from the root bridge B _1. Therefore, in order to construct a ring map from the RMDB, the connection relationship becomes unclear simply by sorting the collected representative distance vectors in order of distance. In other words, in the ring topology, two paths extend from the root bridge B _1, and therefore, simply sorting them makes it difficult to understand the connection relationship because the nodes of each path are mixed.

For example, in FIG. 6, simple sorting results in the following. However, the number in [] shows the distance value.
B ₁ [0], B ₂ [1], B _N [1], B ₃ [2], B _N-1 [2]...
This is clearly not in line with the actual connection order. The present invention solves this problem.

The following two approaches can be considered to solve the problem.
(1) The designated bridge ID is included in the ring map advertisement. (Or DesignatedRootPathVector)
(2) Devise so that it can be sorted for each ring path.
Although the methods (1) and (2) can solve the problem, the method (1) has the following problems.
a. The process for creating the ring map configuration diagram is complicated.
b. If there is a node that does not support ring map advertisements, all connection diagrams after that node cannot be constructed.
On the other hand, in the method (2), even if there is a node that does not support the ring map advertisement, a connection diagram can be configured except for the node.
c. The amount of data that must be included in a ring map ad increases.

  Therefore, in the present invention, by adopting the method (2) and limiting the applicable topology to the ring, it is possible to select which one when the transmission line is disconnected due to the occurrence of an accident on the network only by collecting representative distance vectors of each node. It is an object of the present invention to provide a node connection configuration method capable of creating a node connection configuration diagram that is disconnected at a position.

The present invention is a network that performs routing control using a spanning tree algorithm in a ring topology in which a plurality of bridges including a root bridge are connected in a ring shape, and each bridge includes a ring map database and a node connection diagram generation unit. In the method of exchanging signals,
When the network is shut down, the root bridge adds a flag divided into 1 system / 2 systems up to the shut-off point to the representative distance vector of the ring map advertisement and transmits it to each bridge by system,
Each bridge is triggered by receiving a ring map advertisement from the root bridge.
Attach a system-specific flag from the root bridge to your ring map advertisement and send it to all other bridges,
In the ring map database, representative distance vectors advertised by ring map advertisements from each bridge are accommodated in 1 system / 2 systems,
The node connection diagram generating unit sorts representative distance vectors classified into 1 system / 2 systems in order of distance.

  The root bridge of the present invention is characterized in that ring map advertisement transmission to each bridge is transmitted at a timing shifted to the first system and the second system.

  Each bridge of the present invention is characterized in that a ring map advertisement to be transmitted to all other bridges is transmitted at random timing from the reception of the ring map advertisement from the root bridge.

  As described above, according to the present invention, it is possible to create a node connection configuration diagram on a network that performs routing control using a spanning tree algorithm in a ring topology. As a result, when the transmission path is disconnected due to the occurrence of an accident on the network, it is possible to easily find out where the transmission path was disconnected.

The system classification | category figure which shows embodiment of this invention. Root bridge ring map advertisement transmission state diagram. Ring map advertisement transmission state diagram of the bridge. Storage state diagram in the ring map database. The figure of the example of a display of a ring map. The conceptual diagram of a ring-shaped network structure.

As shown in the system classification diagram shown in FIG. 1, the present invention blocks the root bridges B ₁ to B _x when, for example, the port on the left side of the bridge B _x is blocked by the execution result of the spanning tree algorithm on the ring topology. The section up to the port is handled by classifying into 1 system and 2 system. The procedure will be specifically described below.

Step 1
As shown in FIG. 2, the root bridge B ₁ uses a ring map advertisement in which the 1-system and 2-system flags 1F and 2F are set separately for the representative distance vector (B ₁ , 0, B ₁ ). Send to the system. Since the ring map advertisement is broadcast or multicast that all bridges can receive, it is propagated to each system in an instant. However, since the blocking port cannot be exceeded, infinite transfer is never performed. In transmission, it is desirable to shift the transmission timings of the 1st system and the 2nd system in order to avoid the rush of the ring map advertisement.

Step 2
Other bridges that have received the ring map advertisement from the root bridge B ₁ store the advertisement in their RMDB. Whether or not the received ring map advertisement is from the root bridge B ₁ can be determined from the distance value = 0. Alternatively, it is possible to determine from the root bridge ID included in its representative distance vector.

Next, each bridge transmits its ring map advertisement to all other bridges triggered by receiving an advertisement from the root bridge B ₁ . At this time, the 1-system / 2 system flags contained in the ring map ad is the same as the advertisement received from the root bridge B _1. That is, the 1st-system bridge transmits a ring map advertisement with the 1st-system F flag set to all other bridges, and the 2nd-system bridge transmits the 2nd-system F flagged ring map advertisement to all the other bridges. Send to.

In order to avoid the rush of the ring map advertisement, it is desirable that each bridge provides a random waiting time from the reception of the ring map advertisement from the root bridge B ₁ and transmits its own ring map advertisement to all other bridges. .
FIG. 3 shows a state where the bridges B _i and B _N are sending ring map advertisements to all other bridges. Of course, other bridges also transmit the ring map advertisement to all other bridges at different timings.

Step 3
Each bridge receives the ring map advertisement received by each bridge in its own RMDB. When cached in the RMDB, as shown in FIG. In that case, it sorts in order of distance value.

Step 4
When the user requests to acquire a ring map in an arbitrary bridge, the bridge configures a ring map from the entry cached in the RMDB via the node connection diagram generation unit RMGen and provides the ring map to the user. If the console display is performed, a ring map display is obtained by displaying the entries of the 1 system / 2 system side by side. FIG. 5 shows an example of the display.

  As described above, according to the present invention, it is possible to create a node connection configuration diagram on a network that is route-controlled using a spanning tree algorithm in a ring topology. As a result, when the transmission path is disconnected due to the occurrence of an accident on the network, it is possible to easily find out where the transmission path was disconnected.

B _{1 to} B _N ... Bridge
RMGen… Node connection diagram generator
RMDB ... Ring map database

Claims (3)

A network that uses a spanning tree algorithm to control routing in a ring topology in which multiple bridges, including the root bridge, are connected in a ring shape. Each bridge is equipped with a ring map database and a node connection diagram generator to send and receive signals. In the way to do
When the network is shut down, the root bridge adds a flag divided into 1 system / 2 systems up to the shut-off point to the representative distance vector of the ring map advertisement, and transmits it to each bridge for each system,
Each bridge uses a ring map advertisement reception from the root bridge as a trigger, adds a system-specific flag from the root bridge to its ring map advertisement, and sends it to all other bridges.
In the ring map database, representative distance vectors advertised by ring map advertisements from each bridge are accommodated in 1 system / 2 systems,
The node connection diagram generating unit sorts the representative distance vectors classified into 1 system / 2 systems in order of distance. 2. The node connection configuration method according to claim 1, wherein the root bridge transmits ring map advertisement transmission to each bridge at a timing shifted to a first system and a second system. 3. The node connection configuration method according to claim 1, wherein each bridge transmits a ring map advertisement to be transmitted to all other bridges at a random timing from reception of the ring map advertisement from the root bridge.

Images