Network system, spanning tree configuration method, spanning tree configuration node, and spanning tree configuration program

Network system, expanded tree planning method, expanded tree planning node, and expanded tree planning program

The present invention relates to an expanded tree system, in particular to an expanded tree system, an expanded tree planning method, and an expanded planning node, which are used to prevent the network from stopping during the reconfiguration of the expanded tree. In addition, it has load distribution ( load distribution) function.

Traditionally, this type of expansion tree is deployed in a loop (loop) network to prevent data from being continuously cyclically transmitted.

For example, in a standard document published by IEEE with the title "1998 IEEE Std 802.1D", it points out the control technology related to the expansion tree, in which, in order to prevent the data from being continuously configured in the loop (loop) form of the network Cyclic transmission, by exchanging control information related to bridge protocol data unit (BPDU, Bridge Protocol Data Units, hereinafter referred to as BPDU) between nodes, and by making a part of the actual loop-like network logically invalid , To form a logically tree-like network topology. This is a traditional technique 1.

In addition, in the standard document published by IEEE, titled "2001 IEEE Std 802.1W", it points out a control technology related to high-speed expansion trees, which can use traditional technology 1 to speed up by providing a method for exchanging control information. Tree-like establishment, furthermore, by pre-setting a detour path, the detour path can be set immediately in case of error. This is a traditional technique 2.

The above-mentioned conventional technology has the following problems.

First, the problems caused by congestion, delayed arrival and loss of frames.

In traditional technology 1, since the time of adding or removing connections and nodes belonging to the expansion tree starts, the expansion tree is stopped and rebuilt. During reconfiguration and congestion, the entire network stops for the purpose of extending time. The arrival of the frame will be delayed or the frame will be lost.

In traditional technology 2, since the expansion tree is gradually rebuilt, and the transmission of data frames is partially stopped at the time when the connections belonging to the expansion tree and the nodes are added or removed. Therefore, during the reconstruction period, a part of the network Stop and congestion means that sometimes the arrival of the frame will be delayed or the frame will be lost.

Second, the problem that the network stops when the expansion tree is reconfigured is the addition or removal of nodes in the expansion tree.

In the conventional technique 1, since the time of adding or removing the connections and nodes belonging to the expansion tree starts, the expansion tree is stopped and rebuilt. During the rebuilding, the entire network sometimes stops for a long time.

In traditional technology 2, since the expansion tree is gradually rebuilt, and the transmission of data frames is partially stopped at the time when the connections belonging to the expansion tree and the nodes are added or removed. Therefore, during the reconstruction period, the entire network sometimes stops. .

Third, the problem that traffic load will not be distributed.

In traditional technologies 1 and 2, because the cost is calculated using link capacity, and the cost can be used to select the path when the expansion tree is constructed, it is impossible to change the path of dynamic load distribution according to the traffic.

Fourth, the problem caused by the reconfiguration of the expansion tree. When trying to do load distribution, the network stops.

In the conventional technique 1, when trying to continuously change the cost according to the traffic conditions, the expansion tree is temporarily stopped and rebuilt to change the path. That is, during the rebuilding period, the entire network sometimes stops for an extended period of time.

In traditional technology 2, when trying to continuously change the cost according to the traffic conditions, a part of the expansion tree is gradually rebuilt to change the path, and the transmission of the data frame is partially stopped, that is, during the reconstruction, a part of the network sometimes stops.

Fifth, the problem that has the lowest cost and the path to the goal is not often selected.

In traditional technologies 1 and 2, because by pre-setting a priority value and a target adapter address (MAC address, hereinafter referred to as MAC address) in each node, only one system with an expansion tree is set in the network , And only one root node is defined in the network to create a single tree. When the nodes are located at the end of the tree that connects with each other, sometimes even if there are different restrictions and the shortest path, the long path will still be obtained.

Sixth, the load is concentrated near the root node, and the connection speed is low.

In traditional technologies 1 and 2, because by pre-setting a priority value and a MAC address in each node, only one extended tree system is set in the network, and only one root node is defined in the network. Create a single tree, although it is not located at the end of the tree presented, the connection is not used, and the connection utilization speed is reduced. Conversely, sometimes transactions are concentrated near the root node, increasing the possibility of congestion.

Seventh, when the root node is wrong, the tree-like construction takes time, and the problem caused by the network stop at this time.

In traditional technology 1, since there is an expansion tree system set in the network, and there is only one root node, if an error occurs at the root node, the expansion tree stops and rebuilds at the beginning, that is, during the rebuilding period, sometimes the entire network Will stop for an extended period of time.

In traditional technology 2, if an error occurs at the root node, the expansion tree will be gradually rebuilt, and the sending of the data frame will be partially stopped, that is, during the reconstruction, sometimes a part of the network will stop.

Eighth, in the area using IEEE 802.1D, in the case of an error, the routing conversion is slow, and it takes a long time to reconfigure the extended tree.

This is because, in the conventional technique 1, it takes several tens of seconds until the data is exchanged during the tree-like construction.

In addition, ninth, in traditional technologies 1 and 2, because there is only a single tree, traffic is concentrated and congested near the root node, and sometimes the arrival of the frame is delayed or the frame is lost.

The first object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program. It has the following capabilities to reduce the probability of occurrence of congestion, as well as reduce the frequency of delayed arrival and frame loss due to congestion.

The second object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program. It has the following capabilities to re-plan the expansion tree, for example, perform addition/removal of nodes belonging to the expansion tree without stopping the network.

The third object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program. It has the following capabilities to distribute the load of the carrying capacity.

The fourth object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program. It has the following ability to distribute the load without stopping the network for re-planning the expansion tree accompanying the path change.

The fifth object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program, in which the path with the goal and the least cost is selected.

The sixth object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program. It has the following capabilities to increase the utilization rate of the connection and distribute the load without the need to concentrate the load on the adjacent root node.

The seventh object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program. It has the following capabilities to prevent the network from stopping due to root node errors.

The eighth object of the present invention is to provide a network system, an expanded tree planning method, an expanded tree planning node, and an expanded tree planning program. It has the following capabilities to prevent the expansion tree from being set through the IEEE 802.1D area; to speed up the conversion and path changes when errors occur; and to reduce the possibility of congestion and the loss of frames.

According to one aspect of the present invention, a node is used to plan an expansion tree in a network, wherein a plurality of nodes are connected to the network, including: after a network plan is changed, a new expansion tree is generated, and when the plan is changed Before performing operations on the expansion tree, and in order to transfer the expansion tree to the new expansion tree after the new expansion tree is stable, the expansion tree to be used is converted.

According to another aspect of the present invention, a node is used to plan an expansion tree in a network, wherein a plurality of nodes are connected to the network, including: at the time when the connection cost of one of the networks changes, after the cost changes, A new expansion tree is generated, and an existing expansion tree is continuously operated, and in order to transfer the new expansion tree to the new expansion tree after the new expansion tree is stable, the used expansion tree is converted.

According to another aspect of the present invention, a node is used to plan an expansion tree in a network, wherein a plurality of nodes are connected to the network, including: a plurality of tree managers for generating a plurality of independent operations of the expansion tree; a label Form, used to return a label corresponding to the extended tree used to send; a label insertion unit, used to insert the label returned from the label form into a frame; a tree-shaped selector used to determine the sending The expansion tree; a transmission form, in the transmission form, a transmission output destination of the frame is recorded by the target; a frame transmission unit used to transmit the frame to the transmission output destination specified by the transmission form; And a distinguisher, which is used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, a node is used to plan an expansion tree in a network, wherein a plurality of nodes are connected to the network, including: generating an expansion tree, and each node of the network in the expansion tree serves as A node, and use its target as one of the root nodes to expand the tree to transmit a frame.

According to another aspect of the present invention, a node is used to plan an expansion tree in a network, wherein a plurality of nodes are connected to the network, including: a plurality of tree managers for generating a plurality of independent operations of the expansion tree; a label Form, used to return a label corresponding to the extended tree used to send; a label insertion unit, used to insert the label returned from the label form into a frame; a tree-shaped selector used to generate and exist in An expansion tree with the same number of root nodes in the network; a transmission form in which one of the frame's transmission output destinations is recorded by the target; a frame transmission unit for transmitting the frame to the transmission form The designated transmission output destination; and a distinguisher used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, a node is used to plan an expansion tree in a network connected by a plurality of nodes, wherein a tree manager is used to generate the expansion tree, and includes: a cost operator for generating the expansion tree according to a Expand the version and type of the tree protocol to adjust a cost value. According to another aspect of the present invention, a node for planning an expansion tree in a network connected by a plurality of nodes includes: generating an expansion tree, wherein it is a communication protocol that is slow to exist in the network and use its operation For each connection, and when an error occurs in each connection, the cost of each connection is the largest; and a tree structure whose connection cost is the largest is used to send a frame.

According to another aspect of the present invention, a node is used to plan an expansion tree in a network to which a plurality of nodes are connected, including: a plurality of tree managers, used to generate a plurality of independent operations of the expansion tree; a label list for Returns a label corresponding to the extended tree used to transmit; a label insertion unit for inserting the label returned from the label form into a frame; a tree-like selector used to generate and exist in the network And use the expansion tree whose operation is the same as the number of connections of one of the slower communication protocols; a transmission form in which one of the transmission output destinations of the frame is recorded by the target; a frame transmission unit for The frame is transmitted to the transmission output destination specified in the transmission form; and a distinguisher is used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, an extended tree planning program operates on each node, wherein each node plans an extended tree in a network connected to a plurality of nodes, including: generating an extended tree after a network plan is changed New expansion tree, and continue to operate the function of the expansion tree before the plan is changed; and in order to transfer the new expansion tree to the new expansion tree after the new expansion tree is stable, the function of the used expansion tree is converted.

According to another aspect of the present invention, an extended tree planning program operates on each node, wherein each node plans an extended tree in a network connected to a plurality of nodes, including: changing the connection cost in one of the networks In terms of time, after the cost is changed, a new expansion tree is generated, and the function of an existing expansion tree is continuously operated; and in order to transfer the new expansion tree to the new expansion tree after the new expansion tree is stable, the function of the expansion tree used is converted.

According to another aspect of the present invention, an expansion tree planning program operates on each node, where each node plans the expansion tree in the network connected to the plural nodes, including: generating plural independent numbers through plural tree managers The function of the extended tree of operations; the function of returning a label corresponding to the extended tree used for transmission; a label inserting function for inserting the returned label into a frame in the future; a tree-like selector function for determining the use The expansion tree of transmission; a transmission form function, in which one of the transmission output destinations of the frame is recorded by the target; a frame transmission function used to transmit the frame to the transmission output destination specified by the transmission form; and The distinguisher function is used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, an extended tree planning program operates on each node, wherein each node plans an extended tree in a network connected to a plurality of nodes, including the function of generating an extended tree, and in the Each node of the network in the extended tree is used as a node; and the function of using the target as one of the root nodes to extend the tree to transmit a frame. According to another aspect of the present invention, an expansion tree planning program operates on each node, where each node plans an expansion tree in the network connected to a plurality of nodes, including: a plurality of tree manager functions for generating Multiple independent operation expansion trees; a label form function to return a label corresponding to the expanded tree used to send; a label insertion function to insert the label returned from the label form into a frame; a tree The state selector function is used to generate an expansion tree with the same number of root nodes existing in the network; a form transmission function, in which one of the frame transmission output targets is recorded by the target; a frame transmission function is used to The frame is sent to the transmission output destination specified in the transmission form; and a distinguisher function is used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, an expansion tree planning program operates on each node, where each node plans an expansion tree in the network connected to a plurality of nodes to generate an expansion tree, where the And for each connection whose operation is the slowest communication protocol, and when an error occurs in each connection, the cost of each connection is the largest; and the cost of using the connection is the largest The tree structure, sending a frame.

According to another aspect of the present invention, an extended tree planning program operates on each node, wherein each node plans an extended tree in the network connected to a plurality of nodes, including: a plurality of tree manager functions for generating Multiple independently operated expansion trees; a label form function to return a label corresponding to the expanded tree used to send; a label insertion function to insert the label returned from the label form into a frame; a tree The state selector function is used to generate an expansion tree with the same number as the number of connections that exist in the network and use one of the slower communication protocols; a transmission form function, in which one of the frames transmits the output destination by The destination is recorded; a frame transmission function is used to send the frame to the transmission output destination specified in the transmission form; and a distinguisher function is used to determine the tree of the transmission destination of the frame according to the label Manager.

According to another aspect of the present invention, a network system in which a transmission path is set is by an expansion tree in a network connected by a plurality of nodes, wherein each node

After a network plan is changed, a new expansion tree is generated, and before the plan is changed, the expansion tree is executed, and in order to transfer the new expansion tree to the new expansion tree after the new expansion tree is stable, the expansion tree to be used is converted.

According to another aspect of the present invention, a network system in which a transmission path is set is by an expansion tree in a network connected by a plurality of nodes, wherein each node

Planning an expansion tree in the network, where a plurality of nodes are connected to the network, includes: generating a new expansion tree after the cost changes at the time when the connection cost of one of the networks changes, and continuing to operate an existing expansion tree, And in order to transfer the new expansion tree to the new expansion tree after the new expansion tree is stable, the expansion tree to be used is converted.

According to another aspect of the present invention, in a network system, one of the transmission paths is set by an expansion tree in the network to which a plurality of nodes are connected, wherein each node includes: a plurality of tree managers for Generate a plurality of expansion trees for independent operations; a label form to return a label corresponding to the expanded tree used to transmit; a label insertion unit to insert the label returned from the label form into a frame; a tree The state selector is used to determine the expansion tree used for transmission; a transmission form in which one of the transmission output destinations of the frame is recorded by the target; a frame transmission unit is used to transmit the frame to The transmission output destination specified in the transmission form; and a classifier used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, a network system in which a transmission path is set by an expansion tree in a network connected by a plurality of nodes includes: generating an expansion tree, wherein each of the network A node is used as a node; and the expansion tree using its target as a node, transmits a frame.

According to another aspect of the present invention, a network system in which a transmission path is set by an expansion tree in a network connected to a plurality of nodes includes: a plurality of tree managers to generate a plurality of independent operations The expansion tree; a label form to return a label corresponding to the expanded tree used to transmit; a label insertion unit to insert the label returned from the label form into a frame; a tree-like selector, It is used to generate an expansion tree with the same number of root nodes existing in the network; a transmission form in which one of the frame transmission output targets is recorded by the target; a frame transmission unit is used to transmit the signal The frame is transmitted to the transmission output destination specified in the transmission form; and a distinguisher is used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, a network system in which a transmission path is set by an expansion tree in a network connected to a plurality of nodes, wherein a tree manager is used to generate the expansion tree and execute A cost operation process is to adjust a cost value according to the version and type of an extended tree protocol.

According to another aspect of the present invention, a network system in which a transmission path is set by an expansion tree in a network connected to a plurality of nodes, wherein a tree manager for generating the expansion tree includes: A cost operator is used to adjust a cost value according to the version and type of an extended tree protocol.

According to another aspect of the present invention, a network system in which a transmission path is set by an expansion tree in a network connected by a plurality of nodes includes: generating an expansion tree, wherein And for each connection whose operation is the slowest communication protocol, and when an error occurs in each connection, the cost of each connection is the largest; and the cost of using the connection is the largest The tree structure, sending a frame.

According to another aspect of the present invention, a network system in which a transmission path is set by an expansion tree in a network connected to a plurality of nodes includes: a plurality of tree managers to generate a plurality of independent operations The expansion tree; a label form to return a label corresponding to the expansion tree used to transmit; a label insertion unit to insert the label returned from the label form into a frame; a tree-like selector, Used to generate an expansion tree with the same number of connections that exist in the network and use a protocol whose operation is slow; a transmission form in which one of the frame's transmission output targets is determined by the target Record; a frame transmission unit used to transmit the frame to the transmission output destination specified in the transmission form; and a distinguisher used to determine the tree manager of the transmission destination of the frame according to the label.

According to another aspect of the present invention, an expansion tree planning method is applicable to a network connected to a plurality of nodes, including: generating a new expansion tree after a network plan is changed, and performing operations before the plan is changed The expansion tree is transferred to the new expansion tree after the new expansion tree is stable, and the expansion tree to be used is converted.

According to another aspect of the present invention, an expansion tree planning method is applicable to a network connected to a plurality of nodes, including: generating a new expansion tree after the cost changes when the connection cost of one of the networks changes , And continue to operate an existing expansion tree, and in order to transfer the new expansion tree to the new expansion tree after the new expansion tree is stable, the expansion tree to be used is converted.

According to another aspect of the present invention, an expansion tree planning method is applicable to a network connected to a plurality of nodes, including: when a new node is added, the new node only participates in a spare expansion tree, and does not participate in a current Expand the tree. According to another aspect of the present invention, an expansion tree planning method is applicable to a network connected to a plurality of nodes, including: when a node is removed, the node only participates in a current expansion tree and a standby expansion tree, and does not participate A spare expansion tree.

According to another aspect of the present invention, an expanded tree planning method is applicable to a network connected to a plurality of nodes, including: when a network plan is changed, a tree structure is established after the change using a backup system.

According to another aspect of the present invention, an extended tree planning method applicable to a network connected to a plurality of nodes includes: using an idle bandwidth of a connection to calculate the cost.

According to another aspect of the present invention, an expansion tree planning method is suitable for a network connected to a plurality of nodes, including: building a plurality of expansion trees so that all nodes in the network can act as the expansion trees with all nodes The root node of any expansion tree.

According to another aspect of the present invention, an expansion tree planning method is suitable for a network connected to a plurality of nodes, including: establishing an expansion tree with all existing networks, and in order to use its error recovery to be slow For each node of the communication protocol, a complex expansion tree is established.

According to another aspect of the present invention, a method for forming a logical topological structure is suitable for frame transmission in a network connected to a plurality of nodes, including: the logical topological structure existing before the network plan is changed with use The signal transmission to be executed produces a logical topology structure after a network plan is changed; and after the logical topology structure after the change of the plan is stabilized, the logical topology structure used for signal transmission is transformed into the plan The logical topological structure after the change.

According to another aspect of the present invention, a node includes: when the plan of a network is changed to itself, a network plan change is generated along with signal transmission performed using the logic topology in the network The latter is a component of the logical topology structure; and after the network plan is changed, the logical topology structure used for signal transmission is transformed into the logical topology structure after the change of the plan.

According to another aspect of the present invention, a program includes when changing the plan of a network to itself, the signal transmission that is performed with the use of the logic topology in the network is generated after the network plan is changed One of the functions of the logical topology structure; and after the change of the network plan, the logical topology structure used for signal transmission is transformed into the function of the logical topology structure after the change of the plan .

According to another aspect of the present invention, a network system that is connected by a plurality of nodes includes: following the signal transmission performed by the logical topology structure existing before the network plan is changed, a network plan is generated after the change One is the logical topological structure; and after the logical topological structure is stabilized after the plan is changed, the logical topological structure that will be used for signal transmission is transformed into the logical topological structure after the plan is changed.

According to another aspect of the present invention, a node includes: generating a communication between the information of a target reserved by the added frame, and using an extended tree communication protocol to generate a component of a transmission target of the frame ; And refer to the communication to determine the components of the transmission destination of the added frame.

The best embodiment of the present invention will be described in detail below along with the drawings. In the following description, in order to provide a comprehensive understanding of the present invention, many special details will be set later. This will enable those skilled in the art to implement the present invention without special instructions. In this case, in order not to obscure the present invention, the well-known structure is not described.

In the following description, although a tag is used as an identifier for identifying plural extended trees and plural node groups, this tag means a single one or any one or more of the extended tags disclosed in Japanese Patent No. 2002-204673 Combinations, and other tags or identification tools other than Virtual Local Area Network (VLAN) tags.

Here, in the label used in the present invention, the format of the extended mark frame disclosed in Japanese Patent No. 2002-204673 is explained.

Figure 1 shows the Ethernet frame tagged with VLAN specified by IEEE 802.1Q. This VLAN tagged Ethernet frame includes the target adapter address (MAC address, hereinafter referred to as MAC address) 3201, source MAC address 3202, VLAN tag 3203, Ethernet attribute information 3204, and payload ( payload) 3205 and Frame Check Sequence (FCS, hereinafter referred to as FCS) 3206.

On the other hand, Figure 2 shows the format of the extended mark Ethernet frame of the present invention. The extended tagged Ethernet frame 3300 includes the MAC address 3201, the source MAC address 3202, the extended tag storage area 3301, the Ethernet attribute information 3204, the payload 3205, and the FCS 3206. The existing VLAN tag Ethernet network The VLAN tag 3203 of the frame 3200 is replaced by the extended tag storage area 3301.

In addition, as shown in Figure 3, the extended tag Ethernet frame 3400 also exists in another structure, and includes the MAC address 3201, the source MAC address 3202, the extended tag storage area 3301, the VLAN tag 3203, and the Ethernet attribute information 3204, payload 3205, FCS 3206, in which the extended tag storage area 3301 is placed after the source MAC address 3202.

One or more extended tags can be stored in the extended tag storage area 3301. The size of the extension tag is 4 bits, which is the same as the size of the VLAN tag 2303. The uppermost extension tag of the extended tag Ethernet frame 3300 and 3400 and the VLAN tag of the VLAN tag Ethernet frame 3200 are stored in the same location with the same size, and they are stored in the first two of each tag by changing The value of the bit is different (details will be described later).

The extended tagged Ethernet frames 3300 and 3400 are therefore compatible with VLAN tagged Ethernet frames, and can be processed in existing nodes and local extended tag nodes.

Figure 4 shows the extended label storage area 3301. In the extended label storage area 3301 in Figure 4, eight extended labels 3500 to 3507 are stored.

The identifier of the target node or tag of the target (for example, a multi-protocol label switching tag) is stored in the transmission tag 3500. The identifier of the source node can also be stored in the transfer tag 3500 stored in the target node of the target. Each node determines the transmission destination of the frame according to the transmission label. The transmission tag 3500 is stored in the extended mark Ethernet frames 3300 and 3400.

Regarding the extension tags, store user distinguish tags 3501, protection tags 3502, OAM&P tags 3503 (Operations, administration, maintenance, and provisioning, hereinafter referred to as OAM&P), feature information tags 3504, frame control tags 3505, safety tags 3506, and usage Extend the label 3507.

Provided at each node, the identifier of the distinguishing information of each user is stored in the user distinguishing tag 3501. Regarding users, users belonging to the same VLAN are regarded as the same users; users provided by designated ports in two or more nodes are regarded as the same users; and two or more hosts in the network are regarded as new same users. The distinguishing identifier is used to designate these users, and the distinguishing identifier is stored in the user distinguishing tag 3501 from the frame of each user. By identifying the user with the user distinguishing tag 3501, additional services (for example, previous control regarding the designated user) can be provided for each user. Furthermore, a plurality of user distinguishing labels 3501 can be stacked for use. In this case, the number of distinguishable users can be greatly increased. In addition, when stacking the user distinguishing label 3501, the user distinguishing label 3501 stacked at the next level uses the special user distinguishing label, which indicates that it is the last level.

In the case of detour path information for recovery from failure and failure, the error information is stored in the protection tag 3502. The operation/management information is stored in the OAM&P tag 3503.

Characteristic information such as delay, jitter, packet loss rate, time stamp indicating when the frame flows into the network, and frequency band control information are stored in the characteristic information tag 3504. If the time mark value is stored in the characteristic information label 3504, the node receiving the frame can calculate the delay of the frame from the current time in the network (the time of staying in the network), and the time mark value. If the guaranteed value of the delay in the network is specified, the previous processing can be executed to achieve the guaranteed value. In addition, if the frequency band information, such as the requested frequency band, cumulative data volume, or traffic class (traffic class) is stored in the characteristic information tag 3504, by considering the cumulative data volume, the traffic level of the data stream, and the real-time status of other data streams (traffic staus), bandwidth control can be performed to ensure that the requested frequency band is obtained.

For example, the hop counter used to limit the survival time of the frame in the network (Time To Live, hereinafter referred to as TTL), or the periodic backup check (hereinafter referred to as CRC) used to detect errors is stored in the frame Control label 3505. If the TTL is stored, the TTL value of each node is reduced by the frame passing, and when TTL=0, the frame is discarded. This prevents the frame from being continuously calculated if the path is a loop. If the CRC is stored, the CRC calculation result in the extended tag storage area 3301 of the ingress node is stored, so by performing the CRC calculation at the egress node again, and by comparing it with the stored value, it can be found in the extended tag area Error of 3301.

Information to ensure the credibility of the frame, as well as confidentiality at the time of network configuration and at the time of network configuration changes are stored in the security tag 3506. An example of the use of the security label 3506 will be described below. The security identifier of each user communicating in the network can be preset, and this identifier is reserved in the node to which the user is connected. By storing this group of security identifiers in the security tag 3506 at any time when each user sends a frame, it can prevent sending/receiving frames from malicious users that reconcile the user identification tag 3501 information. At the time of network structure and at the time of network configuration change, the flow between two nodes is executed to set the security identifier. By storing a set of security identifiers in the security tag 3506 at any time when the frame is transmitted between nodes, malicious nodes can be prevented from connecting to the network.

Any information in the personal settings made by the user is stored in the user extension tag 3507. The label and its processing storage information, as well as the personal settings of the format, are satisfied by allowing the user to extend the functions of the user himself and to improve the adaptability of the network.

If necessary, in addition to the transfer label 3500, the extension labels 3501 to 3507 are stored. The transfer label 3500 is stored in the header of the extension label storage area 3301, and the other extension labels 3501 to 3507 are stored thereafter. If after sending the tag 3500, they may be placed in a preset, fixed address or any address.

After that, in the two systems of the presented expansion tree, the expansion tree used to transmit the latest data frame inserted into the network refers to the existing tree structure or the current system tree structure, and is not the expansion tree of the existing tree structure Refer to the auxiliary tree structure or auxiliary system tree structure.

However, the tree manager that generates a tree structure of the current system refers to the tree manager of the current system, and the tree manager that generates the tree structure of the house number system refers to the tree manager of the auxiliary system.

A label group means a group of nodes that are identified using labels or other identifiers, that is, a collection of plural nodes. If the tag group is formed using a VLAN tag as an identifier, this tag group refers to the VLAN.

Bridge Protocol Data Unit (Bridge Protocal Data Unit, hereinafter referred to as BPDU) refers to the control of data described in IEEE 802.1D (Traditional Technology 1) and IEEE 802.1W, which are exchanged to generate an expansion tree; and the control is included in the current The identification information of the system, the auxiliary system or the similar in the present invention is the control frame.

Figure 5 is a schematic diagram showing the structure format of the configuration BPDU frame 2205 described in IEEE802.1D and IEEE802.1w.

The MAC target address 2201 is the area where the target MAC address is stored.

The MAC target address 2202 is the area where the source MAC address is stored.

The label area 2203 is the position where the label is inserted. The label is used as an identifier to identify the complex expansion tree. In addition, although it is not described in the prior art, in addition to being a VLAN tag, this tag can be a combination of one or more extended tags disclosed in Japanese Patent No. 2002-204673, as well as other tags or identification means.

The category 2204 is the area where the category identifier of the frame is stored.

The BPDU area 2205 is an area where information about configuring BPDU parameters described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

FCS 2206 is the area where a frame inspection sequence is stored.

The protocol identifier 22051 is an area where information is stored. This information is equivalent to the protocol identifier described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2).

The protocol version identifier 22052 is equivalent to the area stored with the protocol version identifier information described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2).

The BPDU type 22053 is equivalent to the area where the information of the BPDU type described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

The flag 22054 is equivalent to the area where the information of the flag described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

The root identifier 22055 is equivalent to the area where the information of the root identifier described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

The root path cost 22056 is equivalent to the area stored with the information of the root path cost described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2).

The bridge identifier 22057 is equivalent to the area stored in the bridge identifier information described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2).

The port identifier 22058 is equivalent to the area stored with the port identifier information described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2).

The message age (Message Age) 22059 is equivalent to the area where the information about the message age described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

Maximum age (MAX Age) 2205A system is equivalent to the area where the maximum age information described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

The hello time (HELLO Time) 2205B is equivalent to the storage area of the hello time information described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2).

Forward Delay (Forward Delay) 2205C is equivalent to the area where the forward delay information described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

Figure 6 is a schematic diagram showing the topology change notification bridge protocol data unit (Topology Change Notification BPDU) frame structure described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2).

The MAC target address 2201 is the area where the target MAC location is stored.

The MAC target address 2202 is the area where the source MAC location is stored.

Although not described previously, the tag area 2213 is an area and is inserted as an identifier for identifying a complex extended tree. In addition to the VLAN tag, the tag can be one or more combinations of the extension tag disclosed in Japanese Patent No. 2002-204673, and other tags or identification means.

The category 2204 is the area where the category identifier of the frame is stored.

The BPDU area 2205 is equivalent to the area where the information of the topology change notification bridge protocol data unit parameter information described in IEEE802.1D (traditional technology 1) and IEEE802.1w (traditional technology 2) is stored.

FCS 2206 is the area where a frame inspection sequence is stored.

Generic Attributes Registration Protocol (GARP (Generic Attributes Registration Protocol) VALN Registration Protocol, hereafter referred to as GVRP) is meant to manage label groups, distinguish between the current system and the backup system, and exchange different settings between nodes Information, and one of the control frames being sent/received.

The format of the extended label frames 3300 and 3400, and other frames is illustrated in Figure 53. In addition, the frame format of the extended label frame 3500 to 3508 illustrated in Figure 4 is regarded as the extended label frame format (1), and the frame format illustrated in Figure 53 is regarded as the extended label frame format (2 ).

The upper part of Figure 53 shows the detailed frame format of the VLAN tag 3203. The value of "0x8100" is set to the protocol identifier (The Ptotocol Indentifer, hereinafter referred to as TPID) 2800. In addition, the value of "0x9100" can be used, although it does not fit the standard. Tag control information (TCI, hereinafter referred to as TCI) 2801 includes priority area 2802, standard format indicator (Canonical Format Indicator, CFI, hereinafter referred to as CFI) 2803, and virtual local area network identification code (hereinafter referred to as VLAN-ID) Area 2804.

The priority of the frame is stored in the priority area 2802, and the priority value is specified by IEEE 802.1p. In addition, the value indicating the presence/absence of special routing information or the MAC address format type is stored in CFI 2803, and the VLAN-ID is stored in VLAN-ID area 2804.

On the other hand, the extended tag frame format (2) shown in the upper part of Figure 53, TPID 2800 and CFI 2803 in TCI 2801 are the same as VLAN tag 3203; priority area 2802 is changed to priority/tag category area 5003 ; And the VLAN-ID area 2804 becomes the extended tag information area 5004. In addition, the size of the corresponding area is the same.

In the extended tag frame format (2), the categories of the extended tags 3500 to 3508 are stored in the priority/tag category area 5003. When the extended tags 3500 to 3508 are used, part of the priority value in the priority area 2802 (IEEE 802.1p) of the existing VLAN tag 3203 is used as the category of the extended tags 3500 to 3508 to support IEEE 802.1p.

In particular, 110, 100, 001 and 000 are used as extension tags 3500 to 3508, 111 (reserved), 101 (interactive communication media), 011 (necessary application) and 010 (standard flow) are compatible with IEEE 802.1p .

Therefore, the use of extended tags 3500 to 3508 is limited to four, such as the use of transmission label 3500, broadcast transmission label 3508, user distinction label 3501, and OMA & P label 3503, and the corresponding priority value is 001=transmission label 3500, 000=Broadcast transmission label 3508, 110=User distinguish label 3501 and 110=OMA & P label 3503. This allows four defined extension tags and the four priorities supported in IEEE 802.1p. In addition, the selection of the extended label to be used and the setting of the corresponding priority value are not limited by this example.

Furthermore, in the extended tag frame format (2), information like the location information of the tag categories that match the extended tags 3500 to 3508 is stored in the extended tag information area 5004. For example, the address information of the target node is stored in the transmission tag 3500, the address information of the source node is stored in the broadcast transmission tag 3508, and the user identification information is stored in the user distinguishing tag 350.

The first embodiment

The first embodiment of the present invention will be explained based on the drawings. Referring to Figure 7, the first embodiment of the present invention includes nodes 11-16, users 91-96, connections 81-86, and connections 21-28.

The node 11 is achieved through a programmatically controlled central processing unit (CPU), etc., and the node 11 handles the following functions: 1) Send a frame that has reached the connection 24 or 21 from the connection 21 or 24.

2) After adding the tags required for transmission, the transmission has reached the frame of connection 21 or 24 from connection 81.

3) After removing the tags needed for transmission, the transmission has reached the frame of connection 81 from connection 21 or 24.

4) Send/receive control frames between other nodes and itself to configure the expansion tree, and if necessary, close the connection port.

5) Monitor the flow rate of the frame through the connection.

Nodes 12 to 16 are the same as node 11. Although node 11 will be used instead of nodes 12 to 16 in the description hereinafter, the description of node 11 can be achieved in the same way for nodes 12 to 16.

The user 91 is a collection of one or more users, and handles the function of transmitting/receiving a frame between the node 11 and itself through the connection 81.

The users 92 to 96 are the same as the user 91. Although the user 91 will be used to replace the users 92 to 96 in the description hereinafter, the description of the user 91 can be achieved in the same way for the users 92 to 96.

The connection 81 is a two-way connection, which is connected from the user 91 to the node 11 and from the node 11 to the user 91.

Connections 82 to 86 are the same as connection 81. Although the connection 81 will be used to replace the connections 82 to 86 in the description hereinafter, the description of the connection 81 can be achieved in the same way for the connections 82 to 86.

The connection 21 is a two-way connection, which is connected from the node 11 to the node 12 and from the node 12 to the node 11.

Connections 22 to 26 are the same as connection 21. Although the connection 21 will be used to replace the connections 22 to 26 in the description hereinafter, the description of the connection 21 can be achieved in the same way for the connections 22 to 26.

FIG. 8 shows a schematic diagram illustrating the structure of the node 11 in detail. The node 11 includes a frame transmission unit 111, a label insertion unit 112, a label removal unit 113, a transmission form 114, a distinguisher 1150, tree managers 1151 and 1152, a tree selector 116, a label form 117, and a configuration interface 118.

The frame transmission unit 111 transmits the frames received from the connection 21 or 24 and the label insertion unit 112 to the connection 21 or 24, the label removal unit 113 or the tree selector 116 according to the transmission form 114. According to the description in the tag sheet 117, the tag insertion unit 112 inserts a tag into the frame to be received from the connection 81, and transmits it to the frame transmission unit 111. In addition, according to one of the descriptions in the tag sheet 117, the tag insertion unit 112 not only transmits the received frame to the frame transmission unit 111 when no tags are added, but also adds a plurality of zero or more tags to the same frame. , Or a plurality of frames that have arrived, and add a plurality of zero or more identical or different labels to each copied frame.

The label removal unit 113 removes the label added to the frame received from the frame transmission unit 111 and transmits it to the connection 81. In addition, according to the setting, it can send the received frame to the connection 81 without removing the tag.

According to the survey from the frame transmission unit 111, in addition to the MAC location, label, or input port, one or more combinations such as key and key, the transmission form 114 returns one or more frames transmitted to the target port. The key and the destination port are set by the tree manager 1151 or 1152.

The distinguisher 1150 determines the output destination port according to the label of the received frame, and sends the frame to the tree manager 1151 or 1152. The situation that the tagged frame is sent to the tree manager 1151 or 1152 can be set by the tree selector 116.

The tree manager 1151 follows the instruction of the tree selector 116, uses the extended tree rule system to receive the BPDU from the discriminator 1150, and transmits the BPSU to the frame transmission unit 111 to set the transmission form 114. Furthermore, the tree manager receives the setting information from the tree selector 116 and uses the setting information as the parameters of the BPDU. The tree manager also selects the control information contained in the BPDU, and informs the tree selector 116 of it.

The tree manager 1152 is the same as the tree manager 1151. Hereinafter, although the tree manager 1151 will be described in place of the tree manager 1152, the description of the tree manager 1151 can be achieved in the same way for the tree manager 1152.

The tree selector 116 receives a setting frame like the GVRP from the transmission unit 111; receives the control information contained in the BPDU from the tree manager 1151 or 1152; and receives the connection information notification from the resource monitor 119 or from Configure the notification of interface 118 settings. The tree selector 116 also sets the tree managers 1151 and 1152 and the tag form 114 according to the setting frame or the information included in the notification. It also transmits this setting frame to the frame transmission unit 111.

According to the survey from the label insertion unit 112, the label form 117 returns the information on the inserted label or the command sent without adding a label to the label insertion unit 112. The instruction to be inserted into the tag or to be sent without adding a tag is set by the tree selector 116. Plural zero or most tags are inserted into the settings of the same frame, or the settings of the frame that has been copied, and plural zero or most identical or different tags are inserted into the settings of each copied frame, the above settings Is possible.

The configuration interface 118 transmits the tree selection command from the user, node removal request, connection cost, expansion tree parameter value, etc., to the tree selector 106 through the command connection interface. This command connection interface is like a serial connection Wire or TELNET, or network server.

The resource monitor 119 monitors the status of each connection port of the node, and when it detects the connection of the connection, it sends a connection notification to the tree selector 116. The resource monitor 119 also calculates and reserves, accumulates the value of one or more bytes, the past TCP agenda, and the amount of HTTP requests through the frame of the connection; and in addition to the request from the tree selector 116, the notification is In addition to the tree selector 116 of the reserved value, the resource monitor 119 also resets the reserved value to zero according to the instruction from the tree selector 116. In addition, the resource monitor 119 monitors the passage of frames of a pre-designated category by the tree selector 116, and notifies the tree selector 116 when the monitored frame passes.

Fig. 9 shows an example of the structure of the transmission form 114 in this embodiment. The output port is determined by the label as a key.

The label field 1141 is regarded as a search index field, used to confirm whether the information in this field matches the label content written in the received frame.

The output port 1142 is a field used to describe that the frame should be sent to the port when the tag content written in the received frame that matches the content of the field 1141.

In addition, the application of this embodiment is not only to perform label transmission to determine the transmission destination port based on the label content shown in the operation example; it is also equivalent to the general transmission destination, which determines the transmission destination based on the MAC address. In this example, multiple ports are written to the output port field 1142.

Fig. 10 is a detailed structure diagram of the tree manager 1151 in Fig. 8 of the first embodiment of the present invention. The tree manager 1151 includes a label removal unit 11511, a BPDU transmitter/receiver 11512, a label insertion unit 11513, a tree controller 11514, and a tree form 11515.

The label removing unit 11511 removes the label inserted into the frame entered by the distinguisher 1150, and transmits it to the BPDU sender/receiver 11512. If no tag is attached to the received frame from the distinguisher 1150, the tag removing unit 11511 transmits the received frame to the BPDU sender/receiver 11512.

The BPDU sender/receiver 11512 receives the BPDU from the label removal unit 11511, and informs the tree controller 11514 of the information contained in the frame through the BPDU reception notification. It also receives the BPDU transmission notification from the tree controller 11514, generates and transmits a frame to the label insertion unit 11513.

The label inserting unit 11513 receives the frame from the BPDU sender/receiver 1151, inserts a preset label, and sends the frame to the frame sending unit 111. In addition, it is possible that the transmitted frame is not inserted into the label setting.

The tree controller 11514 has the following functions: 1) Stop operation (initial state): According to the stop command from the tree selector 116, stop the BPDU transmission notification to the BPDU sender/receiver 1151; also use the tree form 11515 The status of the port is registered as down.

2) Start operation: according to the start command from the tree selector 116, start the BPDU transmission notification to the BPDU sender/receiver 1151; also according to the information contained in the start command, register the port status as up in the tree form 11515 state.

3) BPDU reception operation: receive the BPDU reception notification from the BPDU sender/receiver 1151, and update the tree form 11515; also obtain the identification information of the current system tree structure and the backup system tree structure contained in the BPDU reception notification , And notify the main controller 1164 of the tree selector 116.

4) Topological structure update operation: After stopping operation, starting operation and BPDU receiving operation, refer to the tree form 11515 according to the extended tree agreement in the traditional technology 1 or 2, if you have already read, set the tree form 11515 and send the form 114, and transmit the BPDU. The transmitted BPDU contains the identification information of the current system tree structure and the backup system tree structure; the tree selector 116 is also notified whether the topology structure is changed to the tree structure recalculation result.

In the tree form 11515, the reference about the status of ports and nodes is explained. This parameter is required for the extended tree protocol represented by the traditional technique 1 or 2. The priority and connection cost of each node or each connection are also described in this form. In the first embodiment, it is assumed that the width of the connection frequency band is used as the connection cost.

Fig. 11 shows the detailed structure of the tree selector 116 in Fig. 8 in the first embodiment of the present invention. The tree selector 116 includes a tag removal unit 1161, a GVRP sender/receiver 1162, a tag insertion unit 1163, a main controller 1164, a stability timer 1165, and an arrival interval timer 1166.

The label removal unit 1161 removes the label inserted into the frame input by the frame transmission unit 111, and transmits it to the GVRP sender/receiver 1162. If no tag is attached to the received frame from the frame transmitting unit 111, the tag removing unit 1161 transmits the received frame to the GVRP transmitter/receiver 1162.

The GVRP sender/receiver 1162 receives the control frame from the tag removal unit 1161, and informs the main controller 1164 of the information contained in the frame through the GVRP frame receiving notification. It also receives the GVRP transmission notification from the main controller 1164, generates and transmits a frame to the tag insertion unit 1163.

The label insertion unit 1163 receives the frame from the GVRP sender/receiver 1162, inserts a preset label, and transmits the frame to the frame transmission unit 111. In addition, you can set the frame to be sent without being inserted into the label.

The main controller 1164 has the following functions: 1) Connection detection: Receive connection notifications from the resource monitor 119, and notify the tree manager of the connection (start command), which at this time is Backup system. The upward connection information is stored in the start command. In addition, after the start command is transmitted, the stabilization timer 1165 is set. According to the reception of the end notification of the stability timer 1165, the label form 117 is notified of the instruction to change the inserted label, and the GVRP sender/receiver 1162 is instructed to send a tree-shaped change request frame to the root node of the new tree structure to convert the standby Registration of the system and the current system; also set the stability timer 1165, and after the timer expires, add its own nodes to the tree structure.

2) Reception of the node removal request: According to the reception of the node removal request notification from the configuration interface 118, a stop command is sent to the tree manager, which is the standby system at this time. In addition, after the transmission of the stop command, the main controller notifies the label form 117 of an instruction to change the insertion label and instructs the GVRP sender/receiver according to the reception of the set stability timer 1165 and the end notification of the stability timer 1165 1162 sends a change in the GYRP frame of the use tag group to the root node of the new tree structure to transform the registration of the backup system and the current system; also sets the stability timer 1165, and after the timer expires, indicates that it is allowed to own The node must be connected to the configuration interface 118.

3) Change of using tag group GYRP frame: when its own node is the root node of the new tree structure, according to the received change of using tag group GYRP frame, after adding the current system flag, command the tree manager 1151 Or 1152, to send the BPDU sent from the own node; also instruct the GVRP sender/receiver 1162 to cancel the attachment of the current system flag attached to the root node of the old tree structure.

4) Receipt of the bit notification change of the current system: The tree manager 1151 or 1152 confirms that the current system flag of the BPDU is added to the BPDU at the time the BPDU is received, and that its own group is the current system or the standby system, and Notify its main controller. After receiving this notification, if there is a change in the current system and the standby system, the main controller transmits the change of the label notification to the label form 117. In order to convert the registration of the current system and the backup system.

5) Receipt of designated frame passing notification: According to the notification received from the resource monitor 119 used to instruct the monitored preset target frame to pass, the set notification is sent to the arrival interval timer 1166. If the timer termination notification from the arrival interval timer 1166 arrives, it can understand that the arrival interval of the monitored target frame is greater than the time set by the setting notification. This allows detection of the fact that the arrival interval of BPDUs has become longer, or the fact that the arrival interval of frames flowing through the backup system has become longer.

Due to the reception of the setting notification sent by the main controller 1164, after the preset time has elapsed, the stabilization timer 1165 sends the timer termination to the main controller 1164.

According to the reception of the setting command from the main controller 1164, the arrival interval timer 1166 resets the time that is now kept at zero, and the driver is enabled, and after the time specified by the setting command has elapsed, the timer end notification is sent to the main Controller 1164.

Figure 12 is a schematic diagram showing the detailed status transmission of the main controller 1164 in Figure 11 in the first embodiment of the present invention.

After that, in the two systems of the expansion tree presented, the expansion tree used to transmit the latest data frame inserted into the network is referred to as the current tree structure or the current system tree structure, and is not the current tree structure The expansion tree is referred to as a backup tree structure or a backup system tree structure.

In addition, the tree manager that generates the tree structure of the current system is referred to as the tree manager of the current system, and the tree manager that generates the tree structure of the backup system is referred to as the tree manager of the backup system. .

In state 11641, it is impossible to determine whether the current system tree manager is the tree manager 1151 or 1152; and the BPDU sender/receiver 11512 in the tree manager 1151 and the BPDU sender in the tree manager 1152 /Receiver 11522's receiving function is disabled, and only the BPDU receiving function is enabled.

In state 11642, the tree manager of the current system is the tree manager 1151, and the tree manager of the backup system is the tree manager 1152; and in the state 11642, the BPDU sender of the tree manager 1151 The BPDU transmission function of the receiver/receiver 11512 is not effective, and the BPDU transmission function of the BPDU transmitter/receiver 11522 of the tree manager 1152 also fails. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled.

In state 11643, the tree manager of the current system is the tree manager 1151, and the tree manager of the backup system is the tree manager 1152; and in the state 11643, the BPDU sender of the tree manager 1151 The BPDU transmission function of the receiver/recipient 11512 is disabled, and the BPDU transmission function of the BPDU transmitter/receiver 11522 of the tree manager 1152 is enabled. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled.

In state 11644, the tree manager of the current system is the tree manager 1152, and the tree manager of the backup system is the tree manager 1151; and in the state 11644, the BPDU sender of the tree manager 1152 The BPDU transmission function of the receiver/recipient 11522 is enabled, and the BPDU transmission function of the BPDU transmitter/receiver 11512 of the tree manager 1151 is disabled. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled.

In state 11645, the tree manager of the current system is the tree manager 1152, and the tree manager of the backup system is the tree manager 1151; and in the state 11645, the BPDU sender of the tree manager 1152 The BPDU transmission function of the receiver/receiver 11522 is enabled, and the BPDU transmission function of the BPDU transmitter/receiver 11512 of the tree manager 1151 is also enabled. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled.

In state 11646, the tree manager of the current system is the tree manager 1151, and the tree manager of the backup system is the tree manager 1152; and in the state 11646, the BPDU transmitter of the tree manager 1151 The BPDU transmission function of the receiver/receiver 11512 is enabled, and the BPDU transmission function of the BPDU transmitter/receiver 11522 of the tree manager 1152 is also enabled. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled. In state 11647, the tree manager of the current system is the tree manager 1151, and the tree manager of the backup system is the tree manager 1152; and in the state 11647, the BPDU transmitter of the tree manager 1151 The BPDU transmission function of the receiver/recipient 11512 is enabled, and the BPDU transmission function of the BPDU transmitter/receiver 11522 of the tree manager 1152 is disabled. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled.

In state 11648, the tree manager of the current system is the tree manager 1152, and the tree manager of the backup system is the tree manager 1151; and in the state 11648, the BPDU sender of the tree manager 1152 The BPDU transmission function of the receiver/recipient 11522 is disabled, and the BPDU transmission function of the BPDU transmitter/receiver 11512 of the tree manager 1151 is enabled. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled.

In state 11649, the tree manager of the current system is the tree manager 1152, and the tree manager of the backup system is the tree manager 1151; and in the state 11649, the BPDU sender of the tree manager 1152 The BPDU transmission function of the receiver/recipient 11522 is invalid, and the BPDU transmission function of the BPDU sender/recipient 11512 of the tree manager 1151 is invalid. In addition, the BPDU receiving function of the BPDU sender/receiver 11512 and 11522 is continuously enabled, regardless of whether the transmission function is disabled or enabled.

Next, refer to Figure 12 to explain the operation of the main controller 1164.

According to the reception of the latest notification from the resource monitor 119 to the network, the main controller waits for the arrival of an existing system notification from the tree manager 1151 or 1152. According to the reception of the current system notification contained in the BPDU from the tree manager 1151 or 1152, the main controller 1164 sets the tree manager 1151 or 1152 specified in the notification as current and will be used for backup purposes. The designated tree manager 1151 or 1152 is set as standby; the main controller 1164 transmits to the state 11642 or 11649. Here, although the case of the transmission system to the state 11642 is described as an example, the following description is the same as the case of the transmission system to the state 11649. (Status 11641)

The main controller 1164 sets the tree manager 1151 as current and the tree manager 1152 as standby. In addition, it transmits a command to stop the BPDU transmission to the tree managers 1151 and 1152. (Status 11642)

In the state 1642, when the main controller 1164 receives a node joining request from the configuration interface 118, it transitions to the state 11643. When it receives the current system notification from the tree manager 1151 or 1152, and when the relationship between the current system and the backup system changes, it transitions to the state 11649. (Status 11642)

The main controller 1164 transmits a connection notification to the tree manager 1152, and at the same time, allows the tree manager 1152 to transmit BPDUs. In addition, it enables the stability timer 1165 to function. (Status 11643)

According to the reception of the timer termination notification from the stable timer 1165, the five-key controller 1164 replaces the current tree manager 1151 as the backup tree manager 1152, which is the latest tree manager 1152 to become the current one. , And the tree manager 1151 has recently become standby. In addition, it sends the label group change notification to the root node of the new tree structure through the GVRP sender/receiver 1162. The content of this label group change notification is reflected in the BPDU and is transmitted to all nodes. After that, it activates the stability timer 1165. (Status 11644)

According to the reception of the timer end notification from the stability timer 165, the main controller 1164 transmits a connection notification to the tree manager 1151, and at this time allows the tree manager 1152 to transmit BPDUs. It is generally stable in this state. (Status 11645)

In the state 11645, when the primary controller 1164 receives the current system notification including the BPDU from the tree manager 1151 or 1152, and receives the change in the relationship between the current system and the backup system, the change To state 11646. The main controller then replaces the current tree manager 1152 with the backup tree manager 1151, that is, the tree manager 1151 has recently become the current one, and the tree manager 1152 has become the backup. (Status 11645)

In the state 11645, when the primary controller 1164 receives a node removal request from the configuration interface 118, it transitions to the state 11644. (Status 11645)

The main controller 1164 notifies the tree manager 1151 of the downward links of all connected connections, and sends an instruction to stop the BPDU transmission to the tree manager 1151. In addition, it enables the stability timer 1165 to work. (Status 11644)

According to the reception of the timer termination notification from the stability timer 1165, the main controller 1164 takes the tree manager 1151 as the backup, and then takes the tree manager 1152 as the current tree manager 1152. That is, the tree manager 1151 has recently become the current one, and the tree manager 1152 has become the backup. In addition, it notifies the tag group change through the GVRP sender/receiver 1162 to send it to the root node of the new tree structure. The content of the label group change notification is reflected in the BPDU and transmitted to all nodes, after which it makes the stable timer function. (Status 11643)

According to the reception of the timer termination notification from the stable timer 1165, the main controller 1164 notifies the tree manager 1151 of the downward connection, and at the same time transmits the command to the tree manager 1151 to stop BPDU reception. In addition, it unconditionally transitions to state 11641 and waits until the nodes are different. (Status 11642)

Figure 13 shows an example of the label sheet structure in Figure 8 of this embodiment, which determines the label inserted into the target MAC address as a key.

The target MAC address 1171 is a field used as a search index to confirm whether the information in this field matches the content written in the target MAC address field, that is, if it matches, the MAC target address field of the received frame Bit, insert the label described in the insert label field 1172 into the received frame.

In the insertion label field 1172, the inserted label is written in the target MAC location field 1171. In this embodiment, the tags are inserted for the tag group of the current current system. The insertion label field 1172 is rewritten by the tree selector 116 to the label of the current system at this time.

Referring to Figures 8, 14, 15, and 16, the operation of adding a node in this embodiment will be described in detail with a specific example.

In the initial state (the state before the node is connected to the connections 29 and 30), the two systems of the expansion tree are in the same connection relationship. This same connection relationship is due to the fact that the protocol set in the expansion tree is based on information such as plural nodes and connections, and the fact that the expansion tree is set, and is due to the fact that the two expansion trees are set on the same network. In this initial state, one of the expansion trees is set as the current one, and the other is set as the backup (specifically, the tree managers 1151 and 1152 rewrite the tree form 11515, and the tree selector 116 rewrites the label Form 117 to complete each setting), and the network is operated using the current expansion tree.

The two expansion trees 51 are set in the initial state, as shown in the bold lines in the network in Figure 10.

Referring to Figure 14, the operation example governs nodes 11 to 17, connections 21 to 30, and tree structure 51. However, the node 17 and the connections 39 and 30 are not connected in the initial state.

In addition, FIG. 15 shows the state of the expanded tree 52 after the node 17 has been added in the operation example. The expansion tree 52 is represented by the bold line in Fig. 11.

All nodes 11 to 16 and two label groups attached to all ports can be set; the first label group is label group 41, and the second label group is label group 42.

In addition, although there are basically nodes and all ports participating in two label groups, a label group including only some connections or ports can be created. Hereafter, it is assumed that all nodes and all ports participate in the two-label group organization.

The nodes 11 to 16 have two independently operated extended tree circuits, the extended tree operating in the tag group 41 is a tree structure 51, and the extended tree operating in the tag group 42 is a tree structure 52.

The two systems must be established due to the expansion tree, regardless of whether the establishment of two label groups is not necessary. It is possible to set the tag group 41 without using the tag group 42, and to mention the tree structure 51 as an extended tree operating on the tag group 41, and to mention the tree structure 52 as an operation that does not belong to Expansion tree of tag groups. Conversely, it is possible to set only the tag group 42 without using the tag group 41, and refer to the tree structure 51 as an expansion tree that does not belong to the tag group, and mention the tree structure 52 as Operate on the extended tree of tag group 42.

Although the case of using the tag groups 41 and 42 will be partially explained, the operation in the case of using the tag groups 41 and 424 is equivalent to the operation in the case of using only the tag group 41 or 42.

In this network, according to the initial settings from the configuration interface 118, the tree structure 51 becomes the current system expansion tree, and the tree structure 52 becomes the backup system expansion tree, and the BPDU of the tree structure 51 is marked and labeled by the current system The label of the group 41 is marked, and the BPDU of the tree structure 52 is marked by the backup system flag and the label of the label group 42.

All nodes transmit the BPDU frame of the current system or the standby system that is marked as a fixed period specified by IEEE Std.1D or IEEE Std.1w to build the current system expansion tree of the tree structure 51, and establish The backup system expansion tree of the tree structure 52.

The current system flag or the backup system flag can be represented by the label area 2203, the category area 2204, and the BPDU category area 22053 in the BPDU frame field in Figure 5.

Assume that at this time, enough time has elapsed since the start of the network, and the change of the BPDU frame to which the tags of the tag group 41 and the tags of the tag group 42 are added has been performed. Therefore, each of the tree structures 51 and 52 has the node 11 as the root node and is stable.

The BPDUs of the tree structure 51 are marked by the tags of the tag group 41, and the BPDUs of the tree structure 52 are marked by the tags of the tag group 42. Specifically, the value indicating that the BPDU belongs to the tag group 41 is written, and the tag area 2203 of the BPDU that is transmitted using the tree structure 51, and the value indicating that the BPDU belongs to the tag group 42 is written, and the value is written using the tree structure 52. The label area 2203 of the transmitted BPDU.

In addition, since the tree structure 51 is set to the current system at the current point in time, the tags of the tag group 41 are added by the tag insertion unit 112, and the data has been sent to the nodes 11 to 16 by the user. Specifically, the value indicating that the data belongs to the tag group 41 is written into the tag area of the data signal. The data that this tag has been added to is transmitted by the frame transmission unit 11 along the tree structure 51, which is set as the current system at this time.

When connected to connections 29 and 30, the node starts to receive BPDUs without participating in any tag group. (At this time, the main controller 1164 of node 17 is in the state 11641 in Figure 12.)

According to the reception of the BPDU of each tag group, the node 17 confirms that the current system at this point in time is the tag group 41 and the current system is the tag group 42. (At this time, the state of the main controller 1164 of the node 17 is the state 11642 in Figure 12) The node 17 then sets its own node so that it only participates in the tag group 42 to transmit/receive BPDUs, and the added tag Group 41 only receives BPDUs and does not transmit BPDUs. (At this time, the state of the main controller 1164 of node 17 is the state 11643 in Figure 12)

Since a part of the tag group changes when the node 17 is added, the operation of updating the tree structure 52 starts by extending the tree protocol. In other words, when the node 17 transmits the BPDU and the neighbor node receives the BPDU, the status of the neighbor node authentication topology has changed, and the neighbor node starts the operation of updating the tree structure 52. Since there is no invention change in the part of the tag group 41, the tree structure 51 is not updated.

The tags of the tag group 41 are added to the frame transmitted by the user by each of the nodes 11 to 16 and added to the frame that is continuously transmitted along the tree structure 51.

Here, it is assumed that through the operation of updating the tree structure 52, the tree structure 52 is stabilized with the node 11 whose work is the follow node. At this time, the structure of the tree structure 52 is as shown in FIG. 15.

After the given length of time ends when node 17 is connected to the network, node 17 detects that tree structure 52 is stable, and sends a label group change notification to node 11, which is the root node of tree structure 52, to order It transforms the tree structure 52 from the standby system to the current system. For this command, for example, a control frame (GVRP) is used. (At this time, the state of the main controller 1164 of node 17 is the state 11644 in Figure 12)

In addition, in addition to detecting the fact that the node 17 is connected to the network by the given length of time, the detection of the fact that the tree structure 52 has been stabilized can also be detected by the tree structure 52 of the node 17 The BPDU arrival interval has become longer than the given length of time and measured.

The node 11 that has received the label group change notification transmits the label group change notification to the node 11 that is the root node of the tree structure 51 to instruct the tree structure 51 to be transferred to the backup system. For this tag group change notification, for example, use a control frame (GVRP). The node 11 then adds the tag of the tag group 42 and sets the current system flag in the BPDU to be transmitted for the tree structure 52. When this BPDU is transmitted by each node, it is propagated to all nodes.

The node 11 of the tree structure 51 receives the tag group change notification, transforms the tree structure 51 into a backup system, joins the tag group flag, and sets the backup system flag in the BPDU to be transmitted for the tree structure 51 . The backup system flag is set in the preset field of the BPDU in Figure 1. This setting is performed by the fact that the tree managers 1151 and 1152 rewrite the tree form 11515, and by the fact that the tree selector 116 rewrites the label form 117. When this BPDU is transmitted by each node, it is propagated to all nodes.

Nodes 11 to 17 confirm that the current system flag has been added to the BPDU frame marked with the tag of tag group 42, and will be added to the tag of the frame sent by the user, from tag group 41 to tag group Group 42. At this time, rewrite in the insert label field 1172 of the label form 117. The frame to which the tag is added is transmitted along the tree structure 52. After the above conversion is completed, the frame passing through the tree structure 51 disappears.

After the label group change notification is sent and the time given has expired, node 17 decides that there are no more nodes added by the label of the label group, and node 17 makes it own node to participate in label group 41 in preparation for the next A topology change. In order for its own node to participate in the label group 41, the node 17 permits the tree controller of the tree manager 1151 to transmit BPDUs to allow the BPDUs to be transmitted from the BPDU transmitter/receiver 11512. (At this time, the state of the main controller 1164 of node 17 is the state 11645 in Figure 12)

At this time, due to the reconfiguration performed in the expansion tree 51, the network stops. However, since the expansion tree 52 is used to perform communication with the network during this time, the problems related to the joining of the node 17 will not occur, that is, the blockage and delay of the frame.

In addition, the operation of making the node 17 participate in the label group 41 can be performed by the node 11 which is the root node of the tree structure 52 or by the node 11 which is the root node of the tree structure 51.

In the case where node 11, which is the root node of tree structure 52, makes node 17 participate in label group 41, the given length of time is determined by node 11 after receiving the label group change notification from node 17 There are no more nodes added by the label of the group 41, and the node 11 sends the GVRP frame to the node 17 to order it to refer to the label group 41.

In the case where node 11, which is the root node of tree structure 51, makes node 17 participate in label group 41, the given length of time is determined by node 11 after node 11 has received the label group change notification from node 17 There are no more nodes added by the label of the group 41, and the node 11 sends the GVRP frame to the node 17 to order it to refer to the label group 41. In this case, the node 11 of the tree structure 51 directly transmits the GVRP frame to the node 17 (not through the node 11 of the tree structure). This is because the fact that the node 17 participates in the operation of the label group 41 is not changed when inserted into the BPDU flag, that is, there is no need to pass through the root node.

As mentioned above, the node 17 can be added without stopping the network. In order to join the node next, repeat the same operation. However, the exchange of the above-mentioned tag groups 41 and 42 is necessary.

Figure 6 is a continuous diagram showing the operation of adding the above-mentioned node 17.

The arrow 31 represents the flow of BPDUs marked with the current system flag, and the label indicating the tag group 41 has been inserted into the current system flag.

The arrow 32 indicates the flow of BPDUs marked with the backup system flag, in which the tag indicating the tag group 42 has been inserted into the backup system flag.

The arrow 33 indicates the flow of BPDUs marked with the current system flag, in which the label indicating the tag group 42 has been inserted into the current system flag.

The arrow 34 indicates the flow of BPDUs marked with the backup system flag, where the tag indicating the tag group 41 has been inserted into the backup system flag.

The arrow 35 indicates the flow of the label group change notification through the GVRP frame, etc., in which the label indicating the label group is not inserted into the GVRP frame.

Next, referring to Figs. 15 and 14, the operation of removing the node 17 in this embodiment will be described with specific operations.

Referring to Figures 15 and 14, the operation example has nodes 11 to 17 and connections 21 to 30. The two label groups to which all ports 11 to 17 belong have been set; the first label group is used as the label group 41, and the second label group is used as the label group 42.

The nodes 11 to 17 have two independently operated expansion tree paths; the expanded tree operated in the tag group 41 is used as the tree structure 51, and the expanded tree operated in the tag group 42 is used as the tree structure 52.

The tree structure is represented by the bold line in Figure 15, and it is in a stable coexistence state with the node 11 as the follow node.

The BPDU of the tree structure 51 is marked with the label of the label group 41, and the BPDU of the tree structure 52 is marked with the label of the label group 42.

At the preset time, since the tree structure 52 is the current system, the tags of the tag group are added to the data that has been sent to the nodes 11-17 by the user. The information that the tag has been added is transmitted along the tree structure 52.

Assume that the node 17 receives the BPDU of each tag group and confirms that the current system at the current time point is the tag group 42 and the standby system at the current time point is the tag group 41.

According to the configuration interface or other methods for receiving the removal request, the node 17 sets itself to participate in the tag group 42 of the current system, and not to participate in the tag group 41. At this time, the node 17 stops transmitting the BPDU of the label group 41.

Due to this setting, since the BPDU has not been received by the node adjacent to the node 17, the fact that the node 17 has been removed is confirmed, and a part of the tag group 41 has changed, and the operation of updating the tree structure 51 is started. Since there is no change in a part of the tag group 41, the tree structure 52 is not updated.

The tags of the tag group 42 are added to the frame transmitted by the user by each node of the nodes 11 to 17, and are added to the frame continuously transmitted by the tree structure 52.

Here, the tree structure 51 and the node 11 as a follower node present a stable coexistence state, without the participation of the node 17. The configuration of the node 51 is shown in Figure 14.

In addition, stabilization here means that the tree configuration of the expansion tree is in a state where there is no change within a sufficient extension time.

After the expiration of the given length of time, because node 17 is set to not participate in label group 41, node 17 determines that tree structure 51 is stable, and sends a label group change notification to node 11, which is the root node of tree structure 51. In order to order it to convert the tree structure 51 from the standby system to the current system. (At this time, the state of the main controller 1164 of node 17 is the state 11644 in Figure 12)

The node 11 that has received the label group change notification transmits the label group change notification to the node 11 as the follower node of the tree structure 52 to instruct it to convert the tree structure 52 into a backup system. The node 11 then adds the label of the label group 41 and sets the current system label on the BPDU to be transmitted for the tree structure 51. When this BPDU is transmitted by each node, it is propagated to all nodes.

The node 11 of the tree structure 51 receives the label group change notification; converts the tree structure 52 to a backup system; joins the label of the label group 42; and sets the backup system label on the BPDU transmitted for the tree structure 52. When this BPDU is transmitted by each node, it is propagated to all nodes.

Nodes 11 to 17 confirm that the current system flag has been added to the BPDU marked with the label group 41; and the label added to the frame sent by the user will be converted from the label group 42 to the label group 41. The frame added by the tag is transmitted along the tree structure 51.

After the above conversion is completed, the frame of the tree structure 52 is eliminated.

Since the label group change notification has been set, and after the given length of time expires, the node 17 determines that there are no more nodes to which the label of the label group 42 has been added, and outputs the permission notification to the configuration interface 118 to remove its permission Is a node removed from the network. (At this time, the state of the main controller 1164 of node 17 is the state 11643 in Figure 12)

To remove the node next, repeat the same operation. However, the aforementioned exchange of tag groups 41 and 42 is necessary.

Referring to Figures 14 and 15, in this embodiment, the label is only added to the BPDU but not to the data, the operation of adding the node 17 will be illustrated by a specific example.

The tree structure 51 is represented by the bold line in Figure 14, and it and the node 11 as the root node are in a stable coexistence state. This stability means that the configuration state of the expansion tree remains unchanged for a sufficient period of time.

The BPDU of the tree structure 51 is marked with the label of the label group 41, and the BPDU of the tree structure 52 is marked with the label of the label group 42.

At this time, the tags of the tag group 42 are added to the data that has been sent to the nodes 11-16 by the user. The data added by the tag is transmitted along the tree structure 51.

When connections 29 and 30 are connected, node 17 starts to receive BPDUs without participating in any label group.

According to the reception of the BPDU of each label group, the node 17 confirms that the current system at this time is the label group 41, and confirms that the standby system at this time is the label group 42. Then the node 17 sets itself so that it only participates in the tag group 42 to transmit/receive BPDUs, and the tag group 41 only receives BPDUs and does not transmit. The frame notifying the fact that the node 17 has been added is sent to the node 11 which is the root node of the label group 42 and to the node 11 which is the root node of the label group 41.

Since some tags in the tag group 42 change when the node 17 is added, the operation of updating the tree structure 52 starts by extending the tree protocol. Since some tags in the tag group 41 have not changed, the tree structure 51 does not need to be updated.

The tags of the tag group 41 are added to the frame previously transmitted by the user, and the frame is continuously transmitted along the tree structure 51.

Here, it is assumed that the tree structure 52 and the node 11 as the root node are in a stable coexistence state. The arrangement of the tree structure 52 is shown in FIG. 15.

According to the detection fact that the arrival time interval of the BPDU of the tree structure 52 is longer than the given length of time, the node 11, which is the root node of the tree structure 52, determines that the tree structure 52 is stable, and sends a label group change notification to The node 11, which is the root node of the tree structure 51, is instructed to convert the tree structure 51 into a backup system. The node 11 then adds the tag of the tag group 42 and sets the current system flag on the BPDU to be transmitted by the tree structure 52. When this BPDU is transmitted by each node, it is propagated to all nodes.

In addition, the stability of the tree structure 52 can be detected by the node 11 which is the root node of the tree structure 51. In this example, based on the fact that the length of the BPDU arrival time interval of the tree structure 52 is greater than the given length of time, node 11, which is the root node of the tree structure 51, detects that the tree structure 52 is in a stable state and transmits The label group change is notified to the node 11 which is the root node of the tree structure 52, and the tree structure 52 is converted into a backup system with a command. The node 11 as the root node of the tree structure 51 joins the label of the label group 42 and sets the current system flag on the BPDU to be transmitted by the tree structure 52. When this BPDU is transmitted by each node, it is propagated to all nodes.

The node 11 receives the tag group change notification; converts the tree structure 51 to a backup system; adds the flag of the tag group 41; and sets the flag of the backup system on the BPDU to be transmitted for the tree structure 51. When this BPDU is transmitted by each node, it is propagated to all nodes.

The nodes 11 to 17 confirm that the current system flag has been added to the BPDU marked by the tag of the tag group 52; and the tag that has been added to the tag transmitted by the user is converted from the tag group 41 to the tag group 42. The frame added by the tag is transmitted along the tree structure 52.

After the above changes are completed, the frame passing through the tree structure 51 disappears.

When the arrival time interval of the frame marked by the tags of the tag group 41 passing through the tree structure 51 becomes longer than the time given length, the node 11, which is the root node of the tag group 41, decides that there is no tag group 41 The label has been added to more nodes, and the node 11 sends the GVRP frame to the node 17 to order it to participate in the label group 41 so as to prepare for the next topology change.

In addition, making the node 17 participate in the operation of the label group 41 will be performed by the node 11 as the root node of the tree structure 52.

When the arrival time interval of the frame marked by the tags of the tag group 41 passing through the tree structure 51 becomes longer than the time given length, the node 11, which is the root node of the tree structure 52, determines that there is no tag group 41 The label has been added to more nodes, and the node 11 sends the GVRP frame to the node 17 to order it to participate in the label group 41 so as to prepare for the next topology change.

As mentioned above, the node 17 can be added without stopping the network. In order to join the node next, repeat the same operation. However, it is necessary to exchange the above-mentioned label groups 41 and 42.

Referring to FIGS. 14 and 15, in the embodiment where the conversion to the backup system is detected by receiving the notification of completion of the conversion, the operation of adding the node 17 to the backup system will be explained in detail by a specific example.

The tree structure 51 is represented by the bold line in Fig. 14 as M and is in a stable coexistence state with the node 11 as the root node.

The BPDU of the tree structure 51 is marked with the label of the label group 41, and the BPDU of the tree structure 52 is marked with the label of the label group 42.

At this time, the tags of the tag group 42 are added to the data that has been sent to the nodes 11-16 by the user. The data added by the tag is transmitted along the tree structure 51.

When connections 29 and 30 are connected, node 17 starts to receive BPDUs without participating in any label group.

According to the reception of the BPDU of each label group, the node 17 confirms that the current system at this time is the label group 41, and confirms that the standby system at this time is the label group 42. The node 17 sets itself so that it only participates in the tag group 42 to transmit/receive BPDUs, and the tag group 41 only receives BPDUs and does not transmit. The frame notifying the fact that the node 17 has been added is sent to the node 11 which is the root node of the label group 42 and to the node 11 which is the root node of the label group 41.

Since some tags in the tag group 42 change when the node 17 is added, the operation of updating the tree structure 52 starts by extending the tree protocol. Since some tags in the tag group 41 have not changed, the tree structure 51 does not need to be updated.

The tags of the tag group 41 are added to the frame previously transmitted by the user, and the frame is continuously transmitted along the tree structure 51.

Here, it is assumed that the tree structure 52 and the node 11 as the root node are in a stable coexistence state. The arrangement of the tree structure 52 is shown in FIG. 15.

Since node 17 has been connected to the network, and after the given length of time expires, node 17 determines that tree structure 52 is stable, and sends a label group change notification to node 11, which is the root node of tree structure 52, to order It converts the tree structure 52 from the backup system to the current system.

The node 11 that has received the label group change notification sends the label group change notification to the node 11 of the root node to instruct it to convert the tree structure 51 into a backup system. The node 11 then adds the tag of the tag group 42 and sets the current system flag on the BPDU to be transmitted by the tree structure 52. When this BPDU is transmitted by each node, it is propagated to all nodes.

The node 11 receives the tag group change notification; converts the tree structure 51 to a backup system; adds the flag of the tag group 41; and sets the flag of the backup system on the BPDU to be transmitted for the tree structure 51. When this BPDU is transmitted by each node, it is propagated to all nodes.

Nodes 11 to 17 confirm that the current system flag has been added to the BPDU marked by the tag of the tag group 42; the tag added to the frame transmitted by the user is converted from the tag group 41 to the tag group 42; And a notification of the completion of the conversion is sent to the node 11 which is the root node of the tree structure 52.

According to the reception of the conversion completion notification from the nodes 11 to 17, the node 11 determines that there are no more nodes to which the tags of the tag group 41 have been added, and sends a GVRP frame to the node 17 to order it to participate in the tag group 41.

In addition, the operation of making the node 17 refer to the label group 41 can be performed by the newly added node 17 or by the node 11 which is the root node of the tree structure 51.

When the newly added node 17 makes the node 17 participate in the label group 41, the nodes 11 to 16 confirm that the current system flag has been added to the BPDU marked by the label of the label group 42; When the label of the transmitted frame is converted from the label group 41 to the label group 42, the conversion completion notification is sent to the newly added node 17; when the node 17 receives the conversion completion notification from all nodes 11 to 16, the node 17 decides There are no more nodes to which the tags of the tag group 41 have been added, and the node 17 itself is allowed to participate in the tag group 41.

When node 11, which is the root node of tree structure 51, makes node 17 participate in label group 41, nodes 11 to 17 confirm that the current system flag has been added to the BPDU marked by the label of label group 42; and when When the label added to the frame transmitted by the user is converted from the label group 41 to the label group 42, the notification of completion of the conversion is sent to the node 11 which is the root node of the tree structure 51; when the node 11 receives from all nodes Upon notification of completion of the conversion from 11 to 17, the node 11 determines that there are no more nodes to which the tags of the tag group 41 have been added, and sends a GVRP frame to the node 17 to order it to participate in the tag group 41.

As mentioned above, the node 17 can be added without stopping the network. In order to join the node next, repeat the same operation. In addition, the above-mentioned exchange of tag groups 41 and 42 is necessary.

Next, the effect of this embodiment will be explained.

In the past, at the time of adding/removing nodes belonging to the expansion tree, the transmission of the data frame was completely or partially stopped to rebuild the expansion tree. Sometimes the network would stop during the rebuild.

In this embodiment, by generating an expansion tree, the expansion tree includes the newly added node when the expansion tree that existed before the continuous operation reconfiguration changes, and by converting the used expansion tree after the new expansion tree is stabilized , Reconfiguration of the expansion tree, such as adding/removing nodes belonging to the expansion tree, you do not need to stop the network.

It also reduces the possibility of congestion.

Second Embodiment 5823

After that, the second embodiment of the present invention will be described based on the drawings.

The second embodiment of the present invention will be described in detail based on the drawings. The second embodiment of the present invention is different from the first embodiment. When calculating the cost, available bandwidth, or past TCP traffic, the HTTP request volume may be used to replace the connection bandwidth. Moreover, when the cost changes, Perform the transformation of the current and auxiliary systems, such as adding/removing nodes. In addition, although the explanation is given considering the use of available bandwidth as a cost, in addition to other specified aspects, the explanation of the use of past TCP traffic and HTTP request volume can also be achieved in the same way.

In IEEE 802 1D and IEEE 802.1W, the cost of the connection is determined by a method that is inversely proportional to the connection bandwidth. In other words, the cost does not change continuously according to the load.

In this embodiment, the connection cost is determined by a method that is inversely proportional to the available bandwidth of the connection, and the dynamic cost change is performed according to the load.

Figure 17 shows the configuration of the tree selector 116 of the second embodiment. By referring to Fig. 17, the second embodiment of the present invention is partially different from the first embodiment because the cost reference timer 1167, the function calculator 1168, and the smoothing unit ) 1169 is added to the tree selector in Figure 11 of the first embodiment.

In addition to the operation of the first embodiment, the main controller 1164 α also executes the operation of obtaining the flow rate information from the resource monitor, the TCP flow or the HTTP request amount of the frame according to the receipt of the end warning from the cost reference timer 1167 , Where this frame has flowed through the connection since the previous cost reference timer expired; the cost is calculated based on the flow rate, flow or request volume; the tree manager is also registered as an auxiliary system (referred to as the auxiliary system tree manager) . In the case of flow rate, the available bandwidth of the connection is obtained from the flow rate and the connection bandwidth, and the inverse ratio of the available bandwidth of the connection is used as the cost. In the case of TCP traffic or HTTP request volume of the frame, obtain the difference between the preset maximum allowable traffic or the preset maximum allowable demand, and the TCP traffic or the actual request volume through the connection, and the inverse ratio of this difference is used as the cost .

After calculating the cost by the above method, the main controller 1164 α transmits the cost to the function calculator 1168 for estimation; transmits the estimation result of the function calculator 1168 to the smoothing unit 1169; and transmits the value of the smoothing result to the tree of the auxiliary system State manager.

The function calculator 1168 uses the cost value method to determine the output cost value by the operation of the function calculator 1168 to prevent state transition shocks. The cost value is added by the main controller 1164 α as a parameter, using any advance Specify functions, such as a proportional function, a hysteresis function, and a step function; and the function calculator 1168 returns a value to the main controller 1164 α. This is because rapid changes in cost values are prohibited and costs change smoothly.

The smoothing unit 1169 smoothes the previously stored input parameters and the new input parameters newly input by the main controller 1164α, using a low-pass filter, etc.; the main controller 1164α of the result is notified. The operation of the smoothing unit 1169 can prevent rapid changes in costs and shocks in state transitions.

After a preset time has ended after the setting notification sent by the main controller 1164α is received, the cost reference timer 1167 transmits a timing extension notification to the main controller 1164α.

Figure 18 illustrates the detailed status transition of the main controller 1164A in Figure 17 in the second embodiment of the present invention. Referring to Fig. 18, the second embodiment of the present invention is different from the first embodiment, and states 1164A and 1164B are added to Fig. 12 of the first embodiment.

The state 1164A is that the current system tree manager is the tree manager 1152, and the backup system tree manager is the tree manager 1151, and the BPDU transfer function of the BPDU sender/receiver 11522 of the tree manager 1152 is Enable, the BPDU transfer function of the BPDU sender/receiver 11512 of the tree manager 1151 is also enabled. In addition, the receiving functions of the BPDU sender/receiver 11512 and the BPDU sender/receiver 11522 are continuously enabled, regardless of whether the transmission function is enabled or canceled.

State 1164B is that the current system tree manager is the tree manager 1151, and the backup system tree manager is the tree manager 1152. The BPDU transfer function of the BPDU sender/receiver 11512 of the tree manager 1151 is caused Yes, and the BPDU transfer function of the BPDU sender/receiver 11522 of the tree manager 1152 is also enabled. In addition, the receiving functions of the BPDU sender/receiver 11512 and the BPDU sender/receiver 11522 are continuously enabled, regardless of whether the transmission function is enabled or canceled.

After that, although the process of cost calculation is described with reference to Figure 18 with the state 11645 as the starting point, this description can also be applied to the case where the state 11646 is the starting point.

Suppose it transitions to the state 11645, when the command uses the configuration interface 118 or the GVRP sender/receiver 1162 to use dynamic cost calculation, the main controller 1164α sets the cost reference timer 1167. (Status 11645)

According to the reception of the timer extension notification from the reference timer 1167, the main controller 1164 α receives the information on the cumulative number of passed bytes from the resource monitor 119, or issues a reset notification at the same time to notify The cumulative number of bytes passed by the resource monitor 119 is reset to zero. In addition, it calculates the cost from the accumulated number of bytes or the number of HTTP requests, and passes the result to the arithmetic calculator 1168.

The arithmetic calculator 116 estimates the value input by the main controller 1164α through a preset signal, and returns this value to the main controller 1164α. Here, an example is used for explanation. In this example, a proportional operation is set, and the output value is equal to the input value.

According to the receipt of the cost estimation result from the arithmetic calculator 1168, the main controller 1164α informs the smoothing unit 1169 of this value.

The smoothing unit 1169 smoothes the input value according to the setting of a device such as a low-pass filter, and returns the result to the main controller 1164α.

According to the receipt of the cost value after the smoothing by the smoothing unit 1169 is completed, the main controller 1164α informs the tree manager 1151 of the backup system of the cost value. The tree manager 1151 of the backup system calculates the expansion tree again based on the cost information, and informs the main controller 1164 α whether the topology structure is changed to the result of this calculation. (State 1164A in Fig. 18)

In state 1164A, when the tree shape after recalculation is the same as the tree shape before calculation, or when the degree of change is lower than a preset change, the main controller 1164 α transitions to state 11645 to reset The cost refers to the timer. The state transition diagram in Figure 18 illustrates that if there is a slight change, the transition to state 11645 will not occur. (State 1164A)

In state 1164A, when the tree shape after recalculation is different from the tree shape before calculation, or when the degree of change is higher than the preset change, the main controller 1164 α sets the stability timer 1165, and After the timer expires, it transitions to state 1164B. In Fig. 18, the state transition diagram is explained. If there is a slight change, the transition is to the setting where the state 11645 occurs. (State 1164A)

According to the timer termination notification from the stable timer 1165, the main controller 1164 α replaces the current tree manager 1152 with the backup tree manager 1151, which means that the tree manager 1151 has recently become active and the tree manager The manager 1152 becomes standby. In addition, it uses the GCRP sender/receiver 1162 to send a label group change notification to the root node of the new tree structure. The content of the label group notification is reflected in the BPDU and transmitted to all nodes. After that, it enables the stable timer 1165 and transitions to the state 11646. (State 1164B)

According to the receipt of the end notification from the stability timer 1165, the main controller 1164α informs the tree manager 1152 of the new cost to recalculate the expansion tree based on the new calculation cost information. It also arranges the cost reference timer 1167. (Status 11646)

Next, by using FIG. 7, in the case where the transmission path is changed from node 15 to 13 in this embodiment, the extended tree transition operation will be explained with an example of operation.

Referring to Figure 7, operation examples include nodes 11 to 16, users 91 to 96, two-way connections 81 to 86, and two-way connections 21 to 28.

User 91 is connected to node 11 through line 81, user 92 is connected to node 12 through line 82, user 93 is connected to node 13 through line 83, user 94 is connected to node 14 through line 84, and user 95 is connected through line 85 Connected to node 15, and the user

96 is connected to node 16 by line 86.

Nodes 11 and 12 are connected by connection 21, nodes 12 and 13 are connected by connection 22, nodes 13 and 14 are connected by connection 23, nodes 14 and 15 are connected by connection 24, and nodes 15 and 16 are connected by connection 25, Nodes 16 and 14 are connected by connection 26, nodes 12 and 15 are connected by connection 27, and nodes 13 and 16 are connected by connection 28.

The two label groups to which all ports 11 to 16 belong have been set; the first label group is label group 41, and the second label group is label group 42.

The nodes 11 to 16 have two expansion tree circuits that operate independently; the expansion tree operating in the tag group 41 is a tree structure 51, and the expansion tree operating in the tag group 42 is a tree structure 52.

In Figure 7, assuming that the initial cost equal to 10 is set for all connections, the tree structure 41 and the node 13 as the root node are already in a stable coexistence state. The BPDUs of the tree structure 51 are marked by the tags of the tag group 41, and the BPDUs of the tree structure 52 are marked by the tags of the tag group 42.

At this time, the tags of the tag group 41 of the current system are added to the data that has been sent to the nodes 11-16 by the user. The data added to the tag is transmitted along the tree structure 51.

In the initial state, among the users 91 to 96, no user performs data transfer.

By transmitting/receiving BPDUs during the period specified by the hello time, each node confirms the status of the BPDU of the given length at each time. This frame has the identification tags of the current system and the backup system. The tags of the current system belong only to the BPDU marked with the tag group 41 of the current system at this time, and the flag of the current system does not belong to it, so it is considered the backup system The BPDU marked by the label of the label group 42.

Since each node has been instructed to use dynamic cost calculation through configuration interface 118 or GVRP sender/receiver 1162, the cost refers to each time the timer expires, and the flow of connections since the previous timer expired The flow rate of the frame is related, and the recalculation of the cost level uses the expansion tree of the alternate system tree structure.

Here, it is assumed that the start of the data transfer is from the user 95 to the user 93, and from the user 96 to the user 93.

At the beginning of the transfer, the data from the user 95 to the user 93 is sent through the connections 85, 25, 28, and 83 using the tree structure 51. Data from user 96 to user 93 is transmitted through connections 86, 28, and 83 using tree structure 51.

Given the length of time since the data transmission is terminated (when the cost of each node refers to the timer 1167), the cost of the connection 21 to 28 in the tree structure 52 is recalculated based on the idle space of the connection 21 to 28, and Use function calculator and smoothing unit to process cost. Suppose that due to the reduction of the idle bandwidth of the connection 28, the cost of the connection 28 on the tree structure 52 is changed by the node 16 to 15, and the idle bandwidth of the connection 25 is reduced, although it is not as low as the connection 28, the tree structure The cost of link 25 on 52 is changed from node 15 to 12. At this time, the cost of the tree structure 51 used will not change.

The node 16 detects the cost change, and after the change (the root path cost 22056 in Figure 5 is changed) to the neighboring nodes 13, 14 and 15, it transmits the BPDU created by using the cost. The label of the label group 42 is added to the BPDU.

The node 15 also detects the cost change, and after changing to the neighboring nodes 11, 12, and 16, transmits the BPDU created using the cost.

According to the receipt of the BPDU from the node 16 where the cost 15 is added, after adding the cost of the connection 25, the node 15 re-identifies that it will cost the cost 27 to reach the node 13 through the connections 25 and 28.

After that, according to the receipt of the BPDU from node 12 that cost 10 has been added (node 12 periodically transmits the cost of the root node (node 13) to neighboring nodes (points 11 and 15)), add it at the cost of connection 27 Afterwards, node 15 re-identifies it will cost 20 to reach node 13 through connections 27 and 22. Since this cost is lower than the cost through the connection 25, the node 15 switches the stop port from the connection 27 side to the connection 25 side, and forms a tree structure that uses the connections 27 and 22 to reach the connection 13. The node 15 then drives the stability timer 1165M and waits for the tree structure to stabilize.

Here, it is assumed that the tree structure 52 has reached a stable state with the root node 13.

After the stabilization timer 1165 in Figure 13 expires, the root node 13 of the tree structure 51 detects that the tree structure is stable, and transmits the change of the tag group message to node 13, which is the root node of the tree structure 52, the tree The tree-like structure 52 is a new tree-like structure, and its command is used to transfer the current system tree-like structure from the tree-like structure 51 to the tree-like structure 52. After that, it drives the stability timer 1165.

According to the reception of the tree structure change message, the node 13 as the root node of the tree structure 52 sends the change of the tag group message to the node 13 which is the root node of the tree structure 41. The tree structure 41 is the previous tree structure , The current system tree structure of the command used to transmit is changed from the tree structure 51 to the tree structure 52. The content of the label group change notification is reflected in each BPDU transmitted by the node 13 in the tree structures 51 and 52, and is transmitted to all nodes.

After finishing sending the tag group message change to the root node of the previous current system, node 13 transforms into a tree structure. The tree structure itself is used by the node to send it to the frame received from user 93 and sent to the network. The tree structure 51 used so far is transmitted to the tree structure 52. After the conversion is completed, the frame that has been sent from user 93 to 95 is sent to user 95 through connections 83, 22, 27, and 85.

In this method, the frame transmission path from the user 92 to the user 95 and from the user 93 to the user 96 is allocated to resolve the congestion of the connection 28.

After that, each time the cost reference timer expires, the expansion tree uses the cost calculation according to the limited bandwidth of the connection and the dynamic path change to show that the idle bandwidth in the cost is executed periodically. Therefore, the carrying capacity of each connection is dispersed, and it is possible to distribute the load of the connection and prevent congestion.

Next, explain the effectiveness of this embodiment.

In the past, because the cost was calculated by using the connection capacity and used to select the path in the time of expanding the tree structure, it was impossible to change the path for dynamic load distribution based on the load.

In this embodiment, by calculating the connection cost based on dynamic information such as idle bandwidth and server load, it is possible to distribute the load.

In addition, in the past, when trying to dynamically change the cost according to the load status, the expansion tree was rebuilt to change the path, and the transmission of the data frame was partially stopped or the entire network, so that the network sometimes stopped during the reconstruction. .

In this embodiment, after the cost is changed, the expansion tree is generated, and before the change, by the continuous operation tree structure, and after the new expansion tree is stabilized, by converting the expansion tree to be used, the additional As far as the reconfiguration of the expansion tree belongs to the path change, it is possible to disperse the load without stopping the network. This also allows the chance of congestion to occur to be reduced.

The third embodiment

Hereinafter, the third embodiment of the present invention will be explained with the aid of figures.

The third embodiment of the present invention is different from the second embodiment in that it is the execution of the transmission between the current system and the backup system, regardless of whether the cost has changed. In addition, although the description is about the use of idle bandwidth capacity as a cost, the description about the elapsed TCP traffic and HTTP request volume can also be achieved in the same way.

Referring to Figure 19, the third embodiment of the present invention is different from the second embodiment in that the transmission between the states 1164A and 1164B does not occur, and the transmission set between the states 11643 and 11644 is serial transmission between the states 11647 and 11648. It exists by the transition detection of the current system flag in the BPDU, not by the end of the stabilization timer 1165 in Figure 18 of the second embodiment.

When receiving the notification that the resource monitor 119 is connected to the network recently, the main controller 1164β of the third embodiment waits for the notification from the current system to arrive from the tree manager 1151 or 1152. According to the reception of the current system notification contained in the BPDU from the tree manager 1151 or 1152, the main controller 1164 β sets the tree manager 1151 or 1152 designated by the notification as the current and designated as the backup tree manager 1151 or 1152 is used for standby, and transitions to state 11642 or 11649. Here, although the transition to the state 11642 is described as an example, the following description is the same as the transition to the state 11649. (State 11641 in Figure 19)

The main controller 1164 β sets the tree manager 1151 as current and the tree manager 1152 as standby. In addition, it transmits a command to stop the BPDU transmission to the tree managers 1151 and 1152. (State 11642 in Figure 19)

In state 11642, when the main controller 1164β receives a node addition request from the configuration interface 118, it transitions to state 11643. When it receives notifications from the current system from the tree managers 1151 and 1152, and when the relationship between the current system and the backup system changes, it transitions to the state 11649. (Picture 19 of 11642)

The main controller 1164β sends an upward connection notification to the tree manager 1152, and at the same time authorizes the tree manager 1152 to transmit BPDUs. In addition, it drives a stabilization timer 1165. (State 11643 in Figure 19)

In state 11643, when the main controller 1164β receives the current system notification contained in the BPDU from the tree manager 1151 or 1152, and when the relationship between the current system and the backup system changes, it uses it as a backup The tree manager 1152 replaces the current tree manager 1151, that is, the tree manager 1152 is the latest to become the current one, and the tree manager 1151 becomes the backup. After that, it drives the stability timer 1165. (11644 in Picture 19)

According to the reception of the timer termination notification from the stable timer 1165, the main controller 1164β transmits an uplink notification to the tree structure 1151, and at the same time allows the tree manager 1152 to transmit BPDUs. In this state, it is generally stable. (State 11645 in Figure 19)

In state 11645, when the tree manager 1152 of the current system is regarded as the root node, the main controller 1164 β of this node drives the stability timer 1165, and is notified by the timer installation from the stability timer 1165 Receiving, it replaces the current tree manager 1152 with the backup tree manager 1151, that is, the tree manager 1151 is the latest to become the current, and the tree manager 1152 becomes the backup. In addition, it will send the label group change notification through the GVRP sender/receiver 1162 to the root node of the new tree structure. The content of the label group change notification is reflected in the BPDU and transmitted to all nodes. (State 11645 in Figure 19)

The replacement exchange of the tree manager can be implemented by the tree manager 1151 as a backup system. In state 11645, when the tree manager of the backup system is regarded as the root node, the primary controller 1164 of the node drives the stability timer 1165, and according to the reception of the timer termination notification from the stability timer 1165, The current tree manager 1152 is replaced by the backup tree manager 1151, that is, the tree manager 1151 is the latest to become the current, and the tree manager 1152 becomes the backup. In addition, it will send the label group change notification through the GVRP sender/receiver 1162 to the root node of the previous current tree structure. The content of the label group change notification is reflected in the BPDU and transmitted to all nodes. (State 11645 in Figure 19)

In the state 11645, when the primary controller 1164β receives the notification of the current system from the tree manager 1151 or 1152, and when the relationship between the current system and the backup system changes, it transitions to the state 11646. The main controller then replaces the current tree manager 1152 with the backup tree manager 1151, that is, the tree manager 1151 is the latest to become the current one, and the tree manager 1152 becomes the backup. (State 11645 in Figure 19)

In the state 11645, when the main controller 1164β receives the node removal request from the configuration interface 118, it transitions to the state 11644. (State 11645 in Figure 19)

The main controller 1164 β notifies the tree manager 1151 that is connected downward in all connected connections, and sends a command at the same time to stop the BPDU transmission to the tree manager 1151 (status 11644 in Figure 19)

State 11644, the main controller 1164 β receiver, included in the tree from the manager 1151 or the current BPDU 1152 of the row-system notifications, and in that in the case where the relationship between the change of the current system and the standby system changes The status is 11643, and the current tree manager 1152 is replaced with the backup tree manager 1151, that is, the tree manager 1151 is the latest to become the current, and the tree manager 1152 becomes the standby. After that, it drives the stabilization timer 1165. (State 11643 in Figure 19)

According to the reception of the timer termination notification from the stable timer 1165, the main controller 1164β informs the tree structure 1151 of the downward connection, and at the same time sends a command to the tree manager 1151 to stop the BPDU transmission. In addition, it unconditionally transitions to state 11641 and waits until the nodes are separated. (State 11645 in Figure 19)

When the main controller 1164 β is configured with the interface 118, or the GVRP sender/receiver 1162 is instructed to use dynamic cost calculation, it sets the cost reference timer 1167 so that the predetermined length of time elapses since receiving the tag group change notification After that, the cost reference timer 1167 ends.

According to the receipt of the timer end notification from the cost reference timer 1167, the main controller 1164β receives the information on the cumulative number of passed bytes from the resource monitor 119. , And at the same time send out the calculation reset notification to reset the cumulative number of bytes passed by the resource monitor 119 to zero. In addition, the calculation comes from the cost of accumulating bytes, TCP traffic, or HTTP request volume, and notifies the tree manager 1151 of the backup system. The tree manager 1151 recalculates the expanded tree according to the latest calculation cost information, and notifies the main controller 1164 β regardless of whether the topology is changed as the calculation result.

Referring to Figures 14 and 15, the operation of adding node 17 in this embodiment will be explained through specific examples.

Referring to Figure 14, the operation example has nodes 11 to 17 and connections 21 to 30. In addition, the node 17 and the connections 29 and 30 are not connected in the initial state.

In the initial state, all the nodes 11 to 16 and the two label groups to which all ports belong have been set. The first label group is the label group 41, and the second label group is the label group 42.

In addition, although basically all nodes and all ports participate in two label groups, one label group may be created to include only some ports or nodes. After that, the following description assumes that all nodes and all ports participate in two label groups.

The nodes 11 to 16 have two independently operated expansion tree circuits; the expansion tree operating in the tag group 41 has a tree structure 51; and the expansion tree operating in the tag group 42 has a tree structure 52.

The two systems must be gradually expanded in order to expand the tree, but the establishment of two label groups is not necessary. By setting only the tag group 41 without setting the tag group 42, it is possible to make the tree structure 51 as an extended tree operating in the tag group 41, and the operation of the tree structure 52 does not belong to any tag group . On the contrary, by only setting the tag group 42 without using the tag group 41, the tree structure 52 is regarded as an extended tree operating in the tag group 42, and the operation of the tree structure 51 does not belong to any tag group It is possible.

Although part of the description refers to the case where both label groups 41 and 42 are used, when label groups 41 and 42 are used, and when only label group 41 or only label group 42 is used, The operation system is equal.

The tree structure 51 is represented by a bold line in Fig. 14, and it coexists stably with the node 11 as the root node.

The BPDUs of the tree structure 51 are marked with the tags of the tag group 41, and the BPDUs of the tree structure 52 are marked with the tags of the tag group 42.

At this time, the tags of the tag group 41 are added to the data that has been sent to the nodes 11-16 by the user. The data added by the tag is transmitted along the tree structure 51.

When connected to connections 29 and 30, node 17 starts to receive BPDUs without participating in any tag group.

According to the reception of the BPDU of each tag group, the node 17 confirms that the current system at this point in time is the tag group 41 and the current system is the tag group 42. The node 17 then sets its own node so that it only participates in the tag group 42 to transmit/receive BPDUs, and the tag group 41 only receives BPDUs and does not transmit BPDUs.

Since a part of the tag group 42 changes when the node 17 is added, the operation of updating the tree structure 52 is started by the extended tree protocol. Since there is no invention change in the part of the tag group 41, the tree structure 51 is not updated.

The tags of the tag group 41 are added to the frame that is transmitted by the user, and are added to the frame that is continuously transmitted along the tree structure 51.

After the stabilization timer 1165 expires, node 11, which is the root node of the current system tree structure 51, sends a label group change notification to node 11, which is the root node of the tree structure 51, to instruct it to switch the tree structure 51 as Backup system. The node 11 then joins the node of the label group 42 and sets the current system flag on the BPDU transmitted for the tree structure 52. The BPDU is propagated to all nodes and is transmitted by each node.

The node 11 detects the change in the joining state of the current system flag; converts the tree structure 51 to the standby system; adds the flag of the tag group 41; and sets the BPDU to be transmitted for the tree structure 51 The flag of the backup system. BPDUs are propagated to all nodes and are transmitted by each node.

Nodes 11 to 17 confirm that the current system flag has been added to the BPDU marked with the tag of tag group 41, and will add the tag of the frame transmitted by the user, from tag group 41 to tag group 42 . The frame added by the tag is transmitted along the tree structure 52.

After the above conversion is completed, the frame flowing through the tree structure 51 disappears.

After the label change notification has been sent, and the predetermined length of time expires, the node 17 decides that there is no node to which the label of the label group 41 is added, and makes its own node participate in the label group 41 for the next topology change Prepare.

As mentioned above, the node 17 can be added without stopping the network. To join the node later, repeat the same operation. In addition, the aforementioned tag groups 41 and 42 are exchanged.

Next, by using FIG. 7, in the case where the transmission path is changed from node 5 to node 13 in this embodiment, the extended tree conversion operation will be described in detail using a specific example.

Referring to Figure 7, operation examples include nodes 11-16, users 91-96, connections 81-86, and bidirectional connections 21-28.

User 91 is connected to node 11 through connection 81, user 92 is connected to node 12 through connection 82, user 93 is connected to node 13 through connection 83, user 94 is connected to node 14 through connection 84, user 95 The user 96 is connected to the node 15 through the connection 85 and the user 96 is connected to the node 16 through the connection 86.

Nodes 11 and 12 are connected by training line 21, nodes 12 and 13 are connected by training line 22, nodes 13 and 14 are connected by training line 23, nodes 11 and 15 are connected by training line 24, node 15 And 16 are connected by training line 25, nodes 16 and 14 are connected by training line 26, nodes 12 and 15 are connected by training line 27, and nodes 13 and 16 are connected by training line 28.

The two label groups to which all ports of nodes 11-16 belong have been set; the first label group is label group 41, and the second label group is label group 42.

The nodes 11 to 16 have two independently operated extended tree circuits, the extended tree operating in the tag group 41 is a tree structure 51, and the extended tree operating in the tag group 42 is a tree structure 52.

The tree structure 41 is represented by a bold line, and assuming that an initial cost equal to 10 is used for all connections, the tree structure 41 is in a stable state with the node 13 as the root node. The BPDUs of the tree structure 51 are marked by the tags of the tag group 41, and the BPDUs of the tree structure 52 are marked by the tags of the tag group 42.

At this time, the tags of the tag group 41 of the current system are added to the data sent by the user to the nodes 11-16. The data added by the tag is transmitted along the tree structure 51.

In the initial state, data transmission has been performed among users 91 to 96.

By sending the greeting frame, each node confirms the status of the BPDU at a predetermined length of time. This frame has the identification flags of the current system and the backup system. The flag of the current system belongs only to the BPDU marked by the label of the current system label group 41 at this time; and the flag of the current system does not belong to , The BPDU marked with the label of the label group 42 of the standby system label.

Since each node has been ordered to use, it is calculated by the dynamic cost of the configuration interface 118 or GVRP sender/receiver 1162, so each cost refers to the end time of the timer, which is related to the connection through the connection since the end of the previous timer. The flow rate of the frame passing through; and it uses the backup system tree structure to recalculate the cost and expand the tree.

Here, it is assumed that the data transmission starts from the user 95 to the user 93, and from the user 96 to the user 93.

At the beginning of the transmission, the data from user 95 to user 93 is transmitted through the connections 85, 25, 28, and 83 by using the tree structure 51. The data from the user 96 to the user 93 is transmitted through the connections 86, 28, and 83 by using the tree structure 51.

After the predetermined length of time has expired since the data transmission, the cost of the connections 21 to 28 of the tree structure 52 is recalculated at a time based on the idle space of the connections 21 to 28. Here, suppose that because the idle bandwidth of the connection 28 is reduced, the cost of the connection 28 of the tree structure 52 is changed to 15 by the node 16; and the idle bandwidth of the connection 25 is reduced, although unlike the connection 28, The cost of the link 25 of the tree structure 52 is changed to 12 by the node 15. At this time, the cost of the tree structure 51 in use has not changed.

The node 16 detects the cost change, and after the change, transmits the BPDU created using the cost to the neighboring nodes 13, 14, 15.

The node 15 detects the cost change, and after the change, transmits the BPDU created using the cost to the neighboring nodes 11, 12, and 16.

Afterwards, based on the reception of the BPDU from the node 12 with the cost 10 added, the node 15 recognizes that it will spend the cost 20 to increase the cost of the connection 17 and reach the node 13 through the connections 27 and 22. Since this cost is lower than the cost through the connection 25, the node 15 switches the stop port from the connection 27 side to the connection 25 side, and uses the connections 27 and 22 to form a tree structure reaching the connection 13.

After the topological stabilization timer used to drive the node 13 as the root node of the tree structure 51 expires, the node 15 sends a label group change message to it as the root node of the tree structure 41 of the previous current system tree structure The node 13 of the tree structure 41 command is used to transfer the current system tree structure, which is converted from the tree structure 51 to the tree structure 52. The content of the label group change notification is reflected in each BPDU of the tree structure 51 and 52, and the BPDU is transmitted from the node 13 and transmitted to all nodes.

After completing the change of the tag group message and sending it to the root node of the previous current system, the node 13 uses its own node to send the tree structure of the frame received from the user 93 and sent to the network by the tree structure used The structure 51 is transformed into a tree structure 52. After the above transition is completed, the frame sent from the user 93 to the user 95 is sent to the user 95 through the connections 83, 22, 27, and 85.

In this method, the transmission paths of the frames transmitted from the user 93 to the user 95 and from the user 93 to the user 96 are dispersed to solve the congestion problem of the connection 28.

At the end of each time of the cost reference timer, according to the idle bandwidth of the connection, cost calculation and dynamic path changes are used to recalculate the expansion tree to reflect that the idle bandwidth of the cost is executed periodically. Therefore, the carrying capacity of each connection is dispersed, so that it is possible to distribute the load of the connection and prevent congestion.

Next, the effect of this embodiment will be explained.

In the past, because the cost was calculated using the connection capacity and the time used to expand the tree structure to select the path, it was impossible to change the path for dynamic load distribution based on this load.

In this embodiment, by calculating the connection cost based on dynamic information such as idle bandwidth and server load, it is possible to distribute the load.

In addition, in the past, the cost dynamically changed every time according to the status of the load, the expansion tree was rebuilt to change the path, and the transmission of the data frame was partially stopped or the entire network stopped, so that the network sometimes stopped during the reconstruction.

In this embodiment, after the cost is changed, the expansion tree is generated, and before the change, by the continuous operation tree structure, and after the new expansion tree is stabilized, by converting the expansion tree to be used, the additional As far as the reconfiguration of the expansion tree belongs to the path change, it is possible to disperse the load without stopping the network. This also allows the chance of congestion to occur to be reduced.

Fourth embodiment

The fourth embodiment of the present invention will be described with reference to the drawings.

The fourth embodiment of the present invention is applicable to the first embodiment, the label and expansion tree used are transformed into the function of the target node, and the target node is set as the root node.

If the frame is transmitted in the network operated by IEEE 802.1D and IEEE802.1W, it will be difficult to always choose the least cost path to the destination. There is also the display of unused connections, the load is concentrated on the root node, and When the root node fails, the network stops for extended time.

In this embodiment, by using the tree structure of the target as the follower node to send the frame, the frame is sent to the target at the least cost, which improves the ratio of connection usage and increases the resistance to root node failure.

Referring to Fig. 20, the fourth embodiment of the present invention is different from the first embodiment in that there are tree managers with the same number of nodes in the network, which is established in Fig. 8 of the first embodiment.

The tree manager 1151 has the function of the tree manager 1151 in Figure 8 of the first embodiment.

The tree structure 1152 and the tree manager 1153 are the same tree managers as the tree manager 1151. Although the following description will replace the tree managers 1151 to 1153 with the tree manager 1151, the description of the tree manager 1151 can also be used for the tree managers 1152 and 1153 unless otherwise specified.

If there are tree managers with the same number of nodes in the network, or the network (subnet) or connection is divided to establish a hierarchy, the number of nodes existing in the same hierarchy is established by the tree selector 116. Therefore, although the number of tree managers has increased from one to an infinite number, the entire tree managers are represented by tree managers 1151 to 1153 in Figure 20.

In addition to the function of the tree selector 116 in Figure 8 in the first embodiment, the tree selector 116 generates a new tree manager when it detects a new node in the network or hierarchy, which also has the ability to notify the new node The function of other nodes of the target, and the function of receiving new node detection notifications from other nodes to generate a tree manager. In addition, it has the function of detecting node removal to remove the tree manager; it has the function of notifying the target node of other removed nodes; and it has the function of receiving node removal notifications from other nodes to move Except for tree managers.

Figure 21 is an example of the configuration of the transmission sheet 114 in Figure 20 of this embodiment, in which the output port is determined by the label such as a key.

The label field 1141 is used as a field of the search index, which confirms whether the information in this field matches and writes the content in the label of the transmitted frame.

The field of the output port 1142 indicates the port to which the frame is transmitted when the content written in the label of the transmitted frame matches the content of the field 1141.

In addition, this embodiment is not only used in the case of performing tag transmission to determine the transmission destination port based on the tag content shown in the operation example, but also in the traditional implementation of general MAC location transmission in which the transmission destination is determined based on the MAC address. . In this case, multiple ports corresponding to the appropriate MAC address can be written into the output port field 1142.

Figure 22 shows an example of the structural force of the label sheet in the 20th embodiment of the present embodiment, in which the label to which the location of the target MAC is determined, like a key, is added.

As the target MAC address 1171 of the search index field, confirm whether the information in this field matches the content written in the target MAC address field, that is, if it matches, the MAC target bit of the received frame In the address field, add the label specified in the inserted label field 1172 to the received frame.

In the inserted label field 1172, the inserted label is written in a manner related to the target MAC address 1171. In this embodiment, the target node identification code is written, and this identification code is inserted into a frame such as a label.

FIG. 23 is a layout diagram of the tree structure 61, which is the structure of the expanded tree whose root node is node 11. The tree structure 61 is established so that the priority value of the node 11 is set lower than the value of the nodes 12-16. The tree structure 61 is used to transmit the frame indicating the node 11 and to transmit the scattered frame from the node 11 to the nodes 11-16.

FIG. 24 is a layout diagram of the tree structure 62, which is a layout diagram of an expanded tree whose root node is node 12. The tree structure 62 is established so that the priority value of the node 12 is set lower than the values of the nodes 11 and 13-16. The tree structure 62 is used to transmit the frame indicating the node 12 and to transmit the scattered frame from the node 12 to the nodes 11 and 13-16.

FIG. 25 is a layout diagram of a tree structure 63, which is a layout diagram of an expanded tree whose root node is node 13. The tree structure 63 is established so that the priority value of the node 13 is set lower than the values of the nodes 11, 12, and 14-16. The tree structure 63 is used to transmit the frame indicating the node 13 and to transmit the scattered frame from the node 13 to the nodes 11, 12, and 134-16.

FIG. 26 is a layout diagram of the tree structure 64, which is a layout diagram of an expanded tree whose root node is node 14. The tree structure 64 is established so that the priority value of the node 14 is set lower than the value of the nodes 11 to 13, 15, and 16. The tree structure 64 is used to transmit the frame indicating the node 14 and to transmit the scattered frame from the node 14 to the nodes 11 to 13, 15, and 16.

FIG. 27 is a layout diagram of a tree structure 65, which is a layout diagram of an expanded tree whose root node is node 15. The tree structure 65 is established so that the priority value of the node 15 is set lower than the values of the nodes 11 to 14, 16. The tree structure 65 is used to transmit the frame indicating the node 15 and to transmit the scattered frame from the node 15 to the nodes 11 to 14 and 16.

FIG. 28 is the layout diagram of the tree structure 66, which is the layout diagram of the expanded tree whose root node is node 16. The tree structure 66 is established so that the priority value of the node 16 is set lower than the value of the nodes 11-15. The tree structure 66 is used to transmit the frame indicating the node 16 and to transmit the scattered frame from the node 16 to the nodes 11-15.

Next, with reference to Figures 23 to 28, the operation of establishing the tree structure 63 when the node 13 is newly added to the network formed by the nodes 11 and 12 and the nodes 14 to 16.

When the node 13 joins the network, the node 13 receives the BPDU frame transmitted from the neighboring node, and generates a tree manager for each identification tag of the latest detection. In this example, five tree managers are created , Where each of nodes 11, 12, and 14 to 16 is the root node.

Next, the node 13 generates a label identification code from the node identification code; generates a tree manager, and the priority value of its own node is set to a smaller value; adds the label identification code to the BPDU output by the tree manager and transmits it This BPDU. Here, it is assumed that the tag identification code is 43.

The nodes 12 and 16 newly receive the BPDU whose label identification code is 43; generate a tree manager, and transmit the added BPDU with the label identification code 43 to neighboring nodes.

By repeating the above-mentioned BPDU transmission operation, the tree structure 63 is completed.

Next, referring to Figures 23 to 28, a step will be described. In the figure, each of nodes 11 to 16 sends a frame to each of nodes 11 to 16, to represent the frame that has been sent, with minimal cost The path is passed to the target; and it means that the load distribution is used for connection resources. In addition, assuming that the cost of each connection is equal, the configuration of each of the tree structures 61 to 66 in each figure is completed, and the topology is stable.

The tree structure 61 is used to transmit the frame from each of the nodes 12 to 16 to the node 11. For example, when a frame is sent from node 15 to node 11, node 15 will add the signature identification code 41, which is the identification label of the tree structure 61, to the data frame. Please send this frame.

The tree structure 62 is used to transmit the frame from each of the nodes 11, 13 to 16 to the node 12. For example, when a frame is sent from node 14 to node 12, node 14 adds the signature identification code 42 as the identification tag of the tree structure 62 to the data frame. Please send this frame.

The tree structure 63 is used to transmit the frame from each of the nodes 11, 12, 14 to 16 to the node 13. For example, when a frame is sent from node 11 to 13, node 11 adds the signature identification code 43, which is the identification tag of the tree structure 63, to the data frame. Please send this frame.

The tree structure 64 is used to transmit the frame from each of the nodes 11 to 13, and 15 to 16 to the node 14. For example, when a frame is sent from node 12 to 14, node 12 adds the signature identification code 44, which is the identification tag of the tree structure 64, to the data frame, please send this frame.

The tree structure 65 is used to transmit the frame from each of the nodes 11 to 14, 16 to the node 15. For example, when a frame is sent from node 16 to node 15, node 16 adds the signature identification code 45, which is the identification label of the tree structure 65, to the data frame, please send this frame.

The tree structure 66 is used to transmit the frame from each of the nodes 11 to 15 to the node 16. For example, when a frame is sent from node 14 to 16, node 14 adds the signature identification code 46, which is the identification tag of the tree structure 66, to the data frame. Please send this frame.

The tree structure 61 is used to spread the frame from the node 11 to all nodes in the network. For example, the node 11 adds the identification code 41 which is the identification tag of the tree structure 61 to it, and its target is to be a scattered frame, and the frame is transmitted.

The tree structure 62 is used to spread the frame from the node 12 to all nodes in the network. For example, the node 12 adds the identification code 42 as the identification tag of the tree structure 62, and its target is to be a scattered frame, and the frame is transmitted.

The tree structure 63 is used to spread the frame from the node 13 to all nodes in the network. For example, the node 13 adds the identification code 43 as the identification tag of the tree structure 63, and its target is to be a scattered frame, and the frame is transmitted.

The tree structure 64 is used to spread the frame from the node 14 to all nodes in the network. For example, the node 14 adds the identification code 44 as the identification tag of the tree structure 64 to it, and its target is to be a scattered frame, and the frame is transmitted.

The tree structure 65 is used to spread the frame from the node 15 to all nodes in the network. For example, the node 15 adds the identification code 45 which is the identification tag of the tree structure 65 to it, and its target is to be a scattered frame, and the frame is transmitted.

The tree structure 66 is used to spread the frame from the node 16 to all nodes in the network. For example, the node 16 adds the identification code 46 which is the identification tag of the tree structure 65 to it, and its target is to be a scattered frame, and the frame is transmitted.

By adding a label to the transmission of the above method and then transmitting the data frame, the data frame can be transmitted through the path with the least cost. In addition, due to the use of multiple tree structures with different root nodes to transmit the frame, it is known that the load can be allocated without the phenomenon that the load is concentrated in the neighboring root nodes, and it is known that the root node is less connected. The speed becomes like the expansion tree of traditional technology 1 and 2.

Next, in Figures 23 to 28, by giving an example of an error in the node 12, the operation in the case of an error in the node is explained. In addition, it is assumed that in the initial state, the tree structures 61 to 66 have been constructed and stabilized.

For the tree structure 61, if the node 12 stops due to an error, by using the rapid expansion tree structure method specified by IEEE802.1W, the route through the connections 25, 27, 26, and 23 is selected from the nodes 13 to 11 The route to continue to transmit the frame to the node 11, and to transmit the frame distributed from the node 11 to each node.

For the tree structure 62, if the node 12 stops due to an error, since the node 12 is the root node, the tree structure must be reconfigured. A node different from the node 12 becomes the root node to reconfigure the tree structure 62 before the node 12 is restored. Although it takes several ten seconds in IEEE 802.1D and several seconds in IEEE 802.1w, the tree structure 62 was originally about the frame transmitted from each node to node 12, and about the distribution from node 12 to each node. Therefore, except for node 12, the reconfiguration will not affect the connection between nodes, even if it takes a long time to reconfigure.

For the tree structure 63, if the node 12 stops due to an error, by using the rapid expansion tree structure method specified by IEEE802.1W, the route through the connections 23, 26, 27, and 25 is selected from the nodes 13 to 11 The route to continue to send the frame to the node 13, and to send the frame spread from the node 13 to each node.

For the tree structure 64, if the node 12 stops due to an error, the tree structure is reconfigured by the rapid expansion tree structure method specified by IEEE802.1W to continue to transmit the frame from each node to the node 14, and The frame distributed from the node 14 is sent to each node.

For the tree structure 65, if the node 12 stops due to an error, the tree structure is reconfigured by the rapid expansion tree structure method specified by IEEE802.1W to continue to transmit the frame from each node to the node 15, and The frame distributed from node 15 is sent to each node.

For the tree structure 66, if the node 12 stops due to an error, the route through the connections 23, 26, and 27 is selected as the route from the nodes 11 to 16 by using the rapid expansion tree structure method specified by IEEE802.1W , To continue to send the frame to the node 16, and to send the frame spread from the node 16 to each node.

Next, referring to Figs. 29 and 30, the method of configuring an extended tree in the case where some users in Fig. 7 in the first embodiment are connected to a plurality of nodes by dual homing will be described.

In Figure 29, the user 97 is a collection of one or more, and has the function of sending/receiving frames between nodes 15 and 16 and itself through connections 87 and 88.

The connection 87 is a two-way connection, which is connected from the user 97 to the node 15 and from the node 15 to the user 97.

The connection 88 is a two-way connection, which is connected from the user 97 to the node 16 and from the node 16 to the user 97.

As in the case of the user 97 in Figure 29, if a user group connected to a plurality of nodes exists, the expansion tree is set by considering the user as a virtual node.

FIG. 30 is a network configuration diagram in the case where the user 97 is assumed to be the virtual node 18 in FIG. 29.

The expansion tree 74 is an expansion tree that coexists stably with the node 18. Let the extended tree 74, the frame that has been transmitted from each of the nodes 11 to 16 to the node 18 arrive at the node 18, which is the user 97. In addition, the distribution frame that has been transmitted by the user 97 who is the node 18 is also distributed to each of the nodes 11-16 along the expansion tree 74.

In addition, since the node 18 is a virtual node, the node 15 or 16 performs the actual operation of the node 18. The node 15 or 16 performs the operation of the node 18, which is determined by the method of manually setting through the configuration interface 118 and automatically setting it as a node with a lower or higher node ID.

Next, referring to Fig. 29, a method of performing transmission without establishing a virtual node when the user 97 is connected to the nodes 15 and 16 through the connections 87 and 88 through dual-homing will be explained.

In Figure 29, nodes 15 and 16 detect that the user 97 is connected to multiple nodes through settings in the configuration interface or through learning. The node 15 detects that the user 97 is connected to the node 16. The node 16 detects that the user 97 is connected to the node 15.

The nodes 15 and 16 exchange control messages with each other to determine whether the node 15 or 16 sends a frame to the user 97. The transmitting node is determined to be a node with a lower node identification code or a higher identification code, or is determined to be a preset node.

According to the decision of the transmitting node, the user 97 assumes that it is only connected to the node 16 and the frame transmission starts. Nodes 11 to 16 recognize that user 97 is connected to node 16 through learning, etc.; add the tree-like identification tag whose root node is node 16 to the frame addressed to user 97, and send this frame.

Nodes 15 and 16 use methods such as Keep Alive to constantly monitor each other state. If the node 15 cannot confirm the operation of the node 16, the node 15 transmits the frame from the user 97 to the nodes 11-16. The nodes 11 to 16 then remember that the 15 as the node identification code is added to the frame sent by the user 97; and the addressed frame is sent from the user 97 to the node 15.

The above operations allow the user 97 to transmit/receive frames. The above operation can also be applied to the case where node 16 is substituted for node 15.

Next, referring to Figure 19, it will be explained that when user 97 is connected to nodes 15 and 16 through connections 87 and 88 through dual-homing, a way to quickly notify user 97 that the connection destination can be changed by performing transmission without creating a virtual Node method and method of error detection node with sending transition notification to all nodes in the network.

In Figure 29, the nodes 15 and 16 detect that the user 97 is connected to multiple nodes through the settings in the configuration interface 118 or through learning. The node 15 detects that the user 97 is connected to the node 16. The node 16 detects that the user 97 is connected to the node 15.

The nodes 15 and 16 exchange control messages with each other to determine whether the node 15 or 16 sends a frame to the user 97. The transmitting node is determined to be a node with a lower node identification code or a higher identification code, or is determined to be a preset node.

According to the decision of the transmitting node, the user 97 assumes that it is only connected to the node 16 and the frame transmission starts. Nodes 11 to 16 recognize that user 97 is connected to node 16 through learning, etc.; add the tree-like identification tag whose root node is node 16 to the frame addressed to user 97, and send this frame.

Nodes 15 and 16 use methods such as Keep Alive to constantly monitor each other state. If the node 15 cannot confirm the operation of the node 16, the node 15 transmits the frame from the user 97 to the nodes 11-16. In addition, under the change of the frame that the node 15 sends the address to the user 97, the node 15 has been changed to replace the message of the node 16 and sent to all nodes of the network.

Nodes 11 to 16 then receive this notification, add the label addressed to node 15 to the frame addressed to user 97, and send the frame addressed to user 97 under the guidance of node 15.

The above operations allow the user 97 to transmit/receive frames. The above operation can also be applied to the case where node 16 is substituted for node 15.

Next, the effect of this embodiment will be explained.

In the past, the path of least cost to the goal was not always chosen.

In this embodiment, it is possible to select the least cost path to the target by using a tree structure whose target is the follower node to transmit the frame.

In addition, in the past, the load was concentrated on the neighboring root node, and the connection utilization rate was low.

In this embodiment, by setting a plurality of extended tree systems with different root nodes, it is possible to increase the connection utilization rate and distribute the load without concentrating the load on the adjacent root nodes.

In addition, in the past, when the root node was wrong, the tree structure would take a lot of time, and during this period, the network would stop.

In this embodiment, since the transmission frame is excluded by using the tree structure with its target system as the root node, and its target system is used as a frame other than the frame of the follow node, it cannot be extended under the influence of the root node error. The fact that time is transmitted, it is possible to prevent the network from stopping due to root node errors.

It also allows to minimize the occurrence of congestion.

Fifth embodiment

The fifth embodiment of the present invention will be described in detail with reference to the drawings.

The fifth embodiment of the present invention is suitable for generating an extended tree by identifying BPDU changes in the first embodiment, where the cost is set to be higher in the area using low-speed IEEE 802.1D (traditional technology 1), and In areas where high-speed IEEE 802.1w is used (traditional technology 2), the cost is set to be lower.

There is a problem. In the area using IEEE 802.1D, the path changes slowly under the error condition, and the reconfiguration of the extended tree also takes a long time. If the tree structure through this area is set, under the error condition , Transition and path changes take a long time, and cause congestion, resulting in frame loss.

In this embodiment, by setting a higher cost in the area using IEEE 802.1D, and by preventing the expansion tree setting in the area using IEEE 802.1D, the conversion and path conversion under error conditions are accelerated to prevent congestion. Occurrence and loss of frame.

Referring to Fig. 31, the fifth embodiment of the present invention is different from the first embodiment in that the cost operator 11516 is added to Fig. 10 of the first embodiment.

The tree controller 11514, in addition to performing the operations of the tree controller 11514 in the first embodiment of the present invention, also determines the version of the received BPDU. In addition, if it receives a BPDU whose version is less than the preset version, The tree controller 11514 sets the cost of the connection. This connection is the connection between the node that has transmitted the BPDU and the cost operator 11516, and the tree controller 11514 writes it into the tree form 11515. In addition, this operation is performed once, and each time the cost change notification is received by the tree selector 116.

The cost operator 11516 adds a preset value to the value that has been added through the tree controller 11514, and returns it to the tree controller 11514.

According to the reception of the BPDU reception notification from the BPDU sender/receiver 11512, the tree controller 11514 sets the value in the tree table 11515 according to the content of the notification. The BPDU reception notification includes information about the version of the BPDU that has been transmitted and the receiving port. This information is also kept in the tree form 11515.

When the cost information is notified by the tree selector 116, the tree controller 11514 sets values in the form according to the notified information. At this time, in order to receive a BPDU whose version is older than the default version, in the case of setting the cost, the tree controller 11514 notifies the cost operator 11516 of the cost notified by the tree selector 116.

The cost operator 11516 adds a preset value to the value added by the tree controller 11514, and returns it to the tree controller 11514.

The tree controller 11514 notifies the cost tree list 11515, which is returned by the cost operator 11516 as the cost of the port.

According to the completion of the cost update of all nodes, the tree controller 11514 reconfigures according to the expanded tree rules.

Next, referring to FIGS. 32 to 34, the operation of establishing an extended tree in this embodiment will be described.

In Figures 32 to 34, it is assumed that node 12 only supports IEEE 802.1D instead of IEEE 802.1W. It is assumed that nodes other than node 12, that is, nodes 11, 13, 14, 15, and 16 support IEEE 802.1W.

Each of the nodes 11, 15 and 13 recognizes that the node 12 only supports IEEE 802.1D based on the version information and the protocol identification code in the BPDU frame that has been transmitted by the node 12.

Each of the nodes 11, 15, and 13 sets the cost of each of the connections 21, 22, and 24 to be sufficiently higher than the cost of the other connections. Here, the cost of connections 21, 22, and 24 is set to 10, and the cost of other connections, such as connections 23, 26, 27, and 25, is set to 1.

Figure 32 shows the layout of the expanded tree when node 11 or 14 is the root node in the cost setting state.

Figure 33 shows the layout of the expanded tree when node 15, 16 or 14 is the root node in the cost setting state.

Figure 34 shows the layout of the expanded tree when node 13 or 16 is the root node in the cost setting state.

As shown in Figures 32 to 34, this embodiment allows a tree structure to be configured to bypass the area where IEEE 802.1D is used and error recovery takes a long time, so as to reduce the impact of the overall network in the event of an error, and quickly recover errors.

Next, the effect of this embodiment will be explained.

In the past, in areas where IEEE 802.1D was used, path switching was slower in the case of errors, and the reconfiguration of the extended tree also took a long time.

In this embodiment, by setting the cost in the area using IEEE 802.1D to be higher, it is possible to prevent the expansion tree from being set by using the area using IEEE 802.1D. In addition, in case of error, speed up It is also possible to change and change the path, reduce the possibility of congestion and reduce frame loss.

Sixth embodiment

The sixth embodiment is described with reference to the drawings.

The sixth embodiment of the present invention is applicable to, in the first embodiment, the discriminator recognizes the BPDU version to be established by the tree selector, and the tree manager has the same number of low-speed areas as the IEEE 802.1D, that is, , In the case of errors in the area using IEEE 802.1D, a path that bypasses this area is quickly provided.

This has a problem. In the area using IEEE 802.1D, the path transition is slow in the case of errors, and the reconfiguration of the extended tree also takes a long time. In the case of errors in this area, the transition and The path change takes time, and congestion occurs, so frame loss occurs.

In this embodiment, by creating a tree manager with the same number of low-speed areas as those using IEEE 802.1D; by creating a different tree structure for each area using IEEE 802.1D, where IEEE 802.1D is used The cost of the area is set to be higher; and, by using a tree structure in the case where the path must be bypassed due to errors, etc., and in this tree structure, the higher cost is allocated to this area; making a quick detour, And it is possible to prevent congestion and frame loss.

Referring to Fig. 35, the sixth embodiment of the present invention is different from the first embodiment in that the tree manager 1151 with the same number of low-speed areas using IEEE 802.1D exists in Fig. 8 of the first embodiment.

The tree manager 115 has the functions of the tree manager 1151 in Figure 8 of the first embodiment. When the tree manager 115 confirms the received BPDU frame, it is compliant with the version field or It is the 802.1D of other methods, and the tree manager 115 also sends the IEEE 802.1D frame reception notification about the BPDU frame to the tree selector 116. The node that transmits the BPDU frame conforming to IEEE 802.1D writes its identification code into the 802.1D frame to receive notification.

The tree manager 1152 and 1153 are the same, such as the tree manager 1151. Hereinafter, although the tree manager 1151 is used to represent the tree managers 1152 and 1153, the description of the tree manager 1151 can also be applied to the tree managers 1152 and 1153 in addition to other notations.

Tree managers with the same number of areas as those using IEEE 802.1D are established by tree selector 116. Therefore, although the number of tree managers has increased from one to an infinite number, the total number of tree managers is represented by tree managers 1151 to 1153 in Figure 35.

The tree selector 116, in addition to the function of the tree selector 116 on the 8th path of the first embodiment, the tree selector 116 receives an 802.1D frame from any one of the tree managers 1151 to 1153 In the case of receiving notifications, it has the function of generating a new tree manager; it can notify nodes using 802.1D to other nodes in the network; it also has the ability to notify nodes using 802.1D that have been sent by other nodes. The function of generating a tree-like manager.

Tree selector 116, in addition to the above-mentioned functions, also has the ability to detect the fact that for any reason, such as version upgrades, nodes using 802.1D can use 802.1W to remove the tree manager; it will be removed The function of sending the information on the network to other nodes in the network; it also has the function of removing the tree manager based on the information on the removal notified by other nodes.

FIG. 36 shows the configuration diagram of the tree structure 67, in which node 11 is the root node, and the tree structure 61 is established through the general cost of IEEE 802.1W.

FIG. 37 shows a layout diagram of the tree structure 68, in which the node 11 is the root node, and the tree structure 68 is established by setting the cost of the tree structure 21 to be higher. This tree structure is also used when the error occurs in connection 21.

FIG. 38 shows a layout diagram of the tree structure 69, in which the node 11 is the root node, and the tree structure 69 is established by setting the cost of the tree structure 22 to be higher. This tree structure is also used when the error occurs in connection 22.

FIG. 39 shows a layout diagram of the tree structure 70, in which the node 11 is the root node, and the tree structure 70 is established by setting the cost of the tree structure 24 to be higher. This tree structure is also used when the error occurs in connection 24.

Next, referring to Figs. 36 to 39, it will be explained that the node 12 in Figs. 36 to 39 does not support IEEE 802.1w, and IEEE 802.1D is used in the case of connections 21, 22, and 24. In addition, the root node is node 11.

First, the expansion tree 67 in Fig. 36 is formed according to IEEE 802.1w through general procedures. At this time, since the node 12 does not support IEEE 802.1w, the BPDU frame added by the IEEE 802.1D protocol identification code is transmitted by the node 12.

According to the reception of BPDUs from node 12 added by the IEEE 802.1D protocol identification code, node 11 generates a new tree manager; the specific tag identification code calculated from the connection identification code, and the node identification code, etc. And so on, distributed to the tree manager; and through the GVRP frame or other frames, the new group organization is established and distributed to all nodes. Here, it is assumed that the tag identification code 48 is assigned as the new tag identification code. At this time, the cost of connection 21 is set to be higher.

The nodes 12 to 16 receive and transmit the new group establishment notification transmitted by the node 11, and generate a tree manager to start exchanging BPDUs. The label with the label identification code 48 is added to the BPDU exchanged between the newly created tree managers. Assume that the expanded tree established at this time is a tree structure 68.

According to the reception of the BPDUs from node 12 added by the IEEE 802.1D protocol ID, node 13 generates a new tree manager; assigns specific tag IDs, etc. to the tree manager; and through GVRP frames or other information Frame, the new group organization is established and distributed to all nodes. Here, it is assumed that the tag identification code 49 is assigned to the new tag identification code. At this time, the cost of the connection 22 is set to be higher.

The nodes 11, 12, 14 to 16 receive and transmit the new group establishment notification transmitted by the node 13, and generate a tree manager to start the exchange of BPDUs. The tag with tag identification code 49 is added to the BPDU exchanged between the newly created tree managers. Assume that the expanded tree established at this time is a tree structure 69.

According to the reception of BPDUs from node 12 added by the IEEE 802.1D protocol ID, node 15 generates a new tree manager; assigns specific tag IDs and so on to the tree manager; and through GVRP frames or other information Frame, the new group organization is established and distributed to all nodes. Here, it is assumed that the tag identification code 50 is assigned to the new tag identification code. At this time, the cost of the connection 24 is set to be higher.

The nodes 11 to 14 and 16 receive and transmit the new group establishment notification transmitted by the node 15, and generate a tree manager to start exchanging BPDUs. The tag with tag identification code 50 is added to the BPDU exchanged between the newly created tree managers. Assume that the expanded tree established at this time is a tree structure 70.

In normal times, the tree structure 67 is used to connect each node, and the tree structures 68 to 70 are not used.

In the case where the error occurs on the connection 21, the node 11 detects the error on the connection 21 and changes the tree structure used for immediate transmission from the tree structure 67 to the tree structure 68. In addition, it distributes a label group change notification to all nodes to convert the label used for transmission to the label identification code 48.

Each of the nodes 12 to 16 receives the label group change notification sent by the node 11, and adds the label with the label identification code 48 to the frame sent from its own node, so as to use the tree for transmission The structure is changed from a tree structure 67 to a tree structure 68.

In addition, in the case of an error in the connection 21, the transformation to the tree structure 68 can be performed by replacing the node 12 of the node 11. If the node 12 detects an error in the connection 21, it immediately changes the tree structure used for transmission from the tree structure 67 to the tree structure 68. In addition, it distributes a label group change notification to all nodes to convert the label used for transmission to the label identification code 48. The subsequent operations are the same as when the node 11 detects an error.

Although the tree structure 67 is reconfigured due to an error on the connection 21, because the reconfiguration on the connection 21 is performed according to 802.1D, it takes time until the reconfiguration is completed.

In this embodiment, the error is in the case of connection 21. By immediately changing the tree structure used for transmission from the tree structure 67 to the tree structure 68, the frame can be transmitted without waiting for the tree structure 67 to be reconfigured. It is possible.

Although the operation of the error in the connection 21 is described, this operation is also applicable to the error in the connection 22 or 24.

Next, the effect of this embodiment will be explained.

In this embodiment, by creating a tree manager with the same number of areas as using IEEE 802.1D; a different tree structure is established for using IEEE 802.1D areas. Among them, the cost setting of the area using IEEE 802.1D is relatively low. High; and in the case that the area must be bypassed due to errors, etc., the conversion is performed to use the tree structure that is allocated to this area at a higher cost; therefore, it is possible to speed up the detour, and reduce the possibility of congestion and the loss of frame of.

Seventh embodiment

The seventh embodiment will be described in detail using diagrams.

The seventh embodiment is different from the first embodiment in that for the error detection frame, the error detector is used for transmission within a fixed short period of time, and the error detection is because the error detection frame is no longer received It is delivered, and the error information is executed by notifying the reason of the tree manager through the resource monitor and the tree selector.

In IEEE 802.1D and IEEE802.1w, errors are detected because the HELLO frame sent within a fixed period of time does not arrive. However, due to the long transmission period of the greeting frame, the extended time will elapse before the error is detected.

In this embodiment, the frame about error detection is sent by the error detector in a fixed short period of time, and the fast error detection is performed because there is no predetermined number, or predetermined length, or more information about error detection. The box did not arrive.

Referring to FIG. 40, the seventh embodiment is different from the first embodiment in that the error detector 120 that transmits/receives a frame about error detection to detect errors is added to FIG. 4 of the first embodiment.

The error detector 120 transmits the frame about error detection to the neighboring node through the frame transmission unit 111 during a fixed period; receives the error detection frame that has been transmitted by the neighboring node through the frame transmission unit 111 Frame; and, in the case that the error detection frame transmitted by the neighboring node cannot be received for a predetermined length of time or longer, and more about error detection when detected In the case that the frame or the predetermined number has not arrived, the error detector 120 sends an error detection notification to the resource monitor.

In addition to the function of the resource monitor 119 of the first embodiment, the resource monitor 119 also has the function of receiving error notifications from the error detector 120, and also has the function of transmitting the error notifications to the tree selector 116.

In addition to the function of the tree selector 116 of the first embodiment, the tree selector 116 also has the function of receiving error notifications from the resource monitor 119, and also has the function of sending error notifications to the tree managers 1151 and 1152. .

In addition to performing the functions of the tree managers 1151 and 1152 of the first embodiment, the tree managers 1151 and 1152 can receive error notifications from the tree selector 116, and also reconfigure and expand according to IEEE 802.1D and IEEE802.1w. Tree.

Next, referring to FIG. 40, an operation example in the case where the node 11 detects an error in the connection 21 in this embodiment will be described.

The error detector 120 transmits the error detection frame to nodes 12 and 15 which are adjacent nodes through the frame transmission unit 111 and the connections 21 and 24 during the predetermined period.

The error detector 120 also receives, through the frame transmission unit 111, the connections 21 and 24, the error detection frame sent from the nodes 12 and 15 of the neighboring nodes. At this time, the error detector 120 also recognizes the identification code of the port where the frame about the error detection arrives.

When the frame about the error detection arrives, the error detector 120 activates the timer of the port where the frame about the error detection arrives, so as to set it to post a notification after a predetermined length of time has passed.

According to the reception of the frame about error detection, the error detector 120 resets the timer established for each port. For example, when the error detector 120 receives a frame about error detection from the connection 21, the timer of the port to which the connection 21 is connected is reset. When the error detector 120 receives a frame about error detection from the connection 24, the timer of the port to which the connection 24 is connected is reset.

If due to a connection error, etc., no frame about the error detection reaches the error detector 120 after a predetermined length of time or more disappears, the time is suspended because the timer is not reset. When the occurrence time is suspended, the error detector 120 recognizes that some errors have occurred, and informs the tree managers 1151 and 1152 of the error occurrence through the resource monitor 119 and the tree selector 116.

The tree managers 1151 and 1152 who received the notification thought that the port where the error occurred was unavailable, and immediately reconfigured the expansion tree to avoid the error.

Next, the effect of this embodiment will be explained.

In the past, due to the long transmission period of the greeting frame used by the extended tree protocol, errors could not be detected quickly.

In this embodiment, by adding the error detector who sends/receives the frame about the error detection in a short period of time, the error detection can be faster than the greeting frame.

This also reduces the possibility of errors and the loss of frames.

Eighth embodiment

The eighth embodiment will be illustrated through diagrams.

The eighth embodiment has a configuration, that is, in the first embodiment, the label and the extended tree used are converted into the function of the target node, and the target node is set as the root node.

If the frame is sent to a network operated by IEEE 802.1D and IEEE 802.1w, there are some problems that have the least cost and the path to the target is always selected, unused connections appear, and the load is concentrated on the root node. In the case of an error in the root node, the network stops in order to extend the time.

In this embodiment, by using a tree structure based on the target as the root node to transmit the frame, it can be understood that the frame is transmitted to the target at the minimum cost, the utilization rate of the connection is improved, and the error on the root node is improved. resist.

Referring to Figure 41, the eighth embodiment is different from the first embodiment in that the frame transmission unit 111 is replaced by a frame transmission unit 111 γ, and the transmission form 114 is replaced by a transmission form 114 γ. After the operation is changed, the tree manager 115 with the same number of nodes existing in the network is replaced by the tree manager 1151 γ to 1153 γ.

Fig. 41 shows the case where this embodiment is applied to the node 11 in Fig. 23.

The frame transmission unit 111 γ, according to the description of the output port 1142 in the transmission form 114 γ, transmits the frame received from the connection frame 21 or 23 and the label insertion unit 112 to the connection 21 or 23 and the label movement Elimination unit 113 or tree selector 116. Under this approach, if the description of the output port 1142 is the initial value, the received frame is discarded.

The transfer form 114 γ is the same as the transfer form 114.

Although the tree manager 1151 γ has the same structure as the tree manager, its functions and operations are different. After that, although the tree manager 1151 γ is used instead of the tree manager 1151 γ to 1153 γ, the explanation about the tree manager 1151 γ applies to the tree manager 1152 γ and 1153 γ, except for other notes. .

FIG. 42 shows an example of the configuration of the transmission sheet 114 γ, in which the output port is determined by using a transmission label such as a key.

The label field 1141 is the same as the label field in the transmission form 114.

The output port 1142 is the same as the output port in the transmission list 114, and when a single transmission frame is transmitted, the output port 1142 is referred to as the frame transmission unit 111 γ.

In Figure 42, the "end" in the output port 1142 is the identifier, which is used to indicate that the output port entry of the target node identification code at the edge node is its own node, and it is written to the related and own node The output port field of the node identifier entry with the same identification code.

Figure 43 is a block diagram illustrating the configuration of the tree manager 1151 γ.

In the case of the expansion tree configuration as shown in Figure 23, according to the expansion tree configuration, the port of each node is determined to be Root Port, Designated Port, or Alternate Port, such as Shown in Figure 54. The root port is represented by R, the selected port is represented by D, and the alternate port is represented by ALT. The type of port is based on the configuration of the expansion tree (the position of the root node).

The tags in the tag group have been added to the BPDU frame transmitted/received by the tree 1151 γ, and the tree controller 11514 γ determines the root port according to the IEEE802.1D or IEEE602.1w communication protocol. In this embodiment, the set root port is determined as the output port 1142 of the entry of the tag group 41 in the transmission form 114 γ. In this case, at least six BPDU frames are transmitted/received.

If the root port exists (node 11 in Figure 54), the column for the output port 1142 (a column for the output port) is set to point to the port of its own node, and is set as the label group 41 added by the frame transmission unit The label, and the marked frame is sent to the label removal unit 113.

Next, by using FIGS. 23 and 44, the operation of transmitting a single transmission frame is described, taking the transmission of a single transmission frame from node 13 to node 11 as an example.

Figure 44 shows the form, which illustrates the port settings of each node in the expansion tree 61 and the status of the settings of the transmission form.

In addition, Figure 44 completely shows the setting status without the content of the actual form.

Assume that the state in Figure 23 is that the tree structure 61 of the label group 41 has been constructed and stabilized; and that the root port of each node of nodes 11 to 16 has been determined to be the root port 6102 of Figure 44. Therefore, The output port in the transmission list 114 of each node has been determined to be the output port 1142 in FIG. 44.

Here, the tree structure 61 represents a tree structure with node 11 as the root node. The label 41 represents the identification code (value) of the label indicating the tree structure 61. In other words, adding the tag 41 to the frame means using the tree structure 61 to transmit the frame. Therefore, it represents the number at the unit position of each tree structure number, and the tag numbers correspond to each other. For example, the tree structure 62 represents a tree structure with the root node being the node 12, and the label 42 represents the identification code (value) of the label indicating the tree structure 62. This aspect is consistent in the delivery instructions.

As mentioned in the above example, it is explained that different numbers are assigned to each tree structure, node and label. In addition, for management purposes, the same number is assigned to the tree structure, node and label corresponding to each other to simplify the connection between each other. possible.

First, the node 13 adds the label of the label group 41 to the single transmission frame addressed to the node 11, and transmits the single transmission frame. In this operation, the port on the connection 22 side that is the root port of the tree structure 62 is designated as the output destination port of the frame of the tag group 41 in the node 13. Therefore, the frame is output to the connection 22 side.

According to the reception of the frame from the connection 22, the node 12 searches the transmission list by using the tag group 41 as the key to obtain the port on the connection 21 side as the output port. Then output the received frame to the connection 21 side.

According to the reception of the frame from the connection 21, the node 11 confirms that it is addressed as its own node, and sends the frame to the label removal unit 113.

The above operation allows a single transmission frame, using the tags of the tag group 41 and the expansion tree 61, to transmit from the node 13 to the node 11 through the path with the least cost.

Next, the effect of this embodiment will be explained.

In the past, although the path to the target with the least cost could not be selected all the time, in this embodiment, by using the tree structure with the target as the root node to transmit the frame, the path to the target with the least cost is selected possible.

In addition, in the past, although the load was concentrated on adjacent nodes and the connection utilization rate was low, in this embodiment, by setting a plurality of extended tree systems with different root nodes, the connection utilization rate was increased, and It is possible to distribute the load without concentrating the load on neighboring nodes.

In addition, in the past, even if the root node has an error, there is a problem that the tree structure construction takes time and the network is stopped during the period. In this embodiment, because the tree with its target as the root node is used State structure, the transmission frame excludes the fact that frames other than the frame whose target is the root node cannot be transmitted within the extended time under the influence of the root node error, thus preventing the network termination caused by the root node error It is possible. It also reduces the possibility of congestion and frame loss.

Ninth embodiment

The ninth embodiment will be described with reference to the drawings.

The ninth embodiment has a configuration in which, in addition to the conventional output port for a single output as shown in Fig. 8, a plurality of output ports for dispersion are written in the transmission form to transmit the dispersion frame.

In this embodiment, by using the tree structure of the source node in the scatter frame as the root node to transmit the scatter frame, the scatter frame can be transmitted to each node through the most point path to achieve fast Transmit.

Referring to Fig. 45, the ninth embodiment is different from the eighth embodiment in that the transmission unit 111 in the eighth embodiment is replaced by a transmission unit 111 β, the transmission form 114 is replaced by a transmission form 114 β, and tree management Persons 1151 to 1153 are replaced with tree managers 1151 β to 1153 β.

Fig. 45 shows the case where this embodiment is applied to the node 11 in Fig. 23.

The frame transmission unit 111 β transmits the frame received from the connection 21 or 24 and the label insertion unit 112 to the connection 21 or 24, and the label removal unit 113 or tree selection according to the description of the transmission form 111 βBy116.

Under this method, assuming that the added frame is a single transmission frame, the received frame is transmitted to the port of the output port 1142 written in the transmission form 114 β.

If the added frame is a distribution frame, the received frame is copied and sent to the multiple ports of the distribution output port 1144 written in the sending form 114 β, and sent to the label removal unit. In addition, if the initial value has been set in the distribution output port, the received frame is only sent to the label removal unit.

The execution of the distinction between the spread frame and the single transmission frame is based on the target MAC address 3201, or the extended tag information field 5002 or the extended tag priority 5003.

The sending form 114 β includes the sending form 114 added in the column of the distributing output port 1144. The column 1144 of the scatter output port indicates that when the scatter signal transmitted from the node corresponding to the tag identification code is received, it becomes the port of the transmission destination. For example, the transmission form in Figure 46 of this embodiment. In Figure 46, the connection name is used to indicate the transfer destination port. Figure 46 shows the transmission form 114 β of the node 11 in the network formed by the topology shown in Figures 23 to 28. As mentioned above, the tree structure used for frame transmission is different for each target node in the present invention. For example, frame transmission is performed by using the tree structure in Fig. 23 for the frame addressed at node 11; and the use of the tree structure in Fig. 24 is regarding the frame addressed at node 12.

Here, the method of interpreting No. 46 will be explained by taking the spread of the frame added by the tag 42 as an example. The fact that the tag 42 is added indicates that the dissemination frame has been transmitted by the node 12. The scatter frame that has been transmitted by the node 12 is transmitted using the tree structure in Fig. 24. Therefore, according to the reception of the scattered frame, the node 11 must transmit it to the connection 23 side. Figure 46 was prepared based on this result.

Although the tree manager 1151 β has the same structure as the tree manager 1151, its functions and operations are different. Hereafter, although the tree manager 1151 β is used instead of the tree manager 1151 β to 1153 β, the explanation about the tree manager 1151 β can also be applied to the tree manager 1152 β and 1153 in addition to other notes. β.

Figure 46 shows an example of the configuration of the transmission sheet 114β, in which the output port is determined by the label such as the key.

The label field 1141 is the same as the label field of the transmission form 114.

The output port 1142 is the same as the output port of the transmission form 114, and is mentioned by the transmission unit 111 β when a single transmission frame is transmitted.

When a single transmission frame is transmitted, the scattered output port 1144 is the output port mentioned by the transmission unit 111 β. Multiple ports are written in this column, and if two or more ports are written, the frame with the same number of ports will also be copied and sent. If the value set in the column when mentioned by the transmission unit 111 β is still the initial value, the frame transmission unit 111 β only transmits the frame to the label removal unit.

In addition, the "end" in Figure 46 means that if the node is an edge node, the recognizer "end" is written.

Figure 47 shows a block diagram illustrating the β structure of the tree manager 1151.

When the tags of the tag group 42 are added to the BPDU frame sent/received by the tree manager 1151 β, the tree controller 11514 β determines the root port and assigns it according to the communication protocol of IEEE 802.1D and IEEE802.1w port. In this embodiment, the root ports are respectively set to be determined as the output port 1142 of the tag group entry in the transmission form 114β, and one or more designated ports are designated as the scatter output port 1144.

If the root port exists, the field about the output port 1142 is set to indicate the port of the own node, and the frame marked by the label of the label group 41 input by the frame transmission unit is sent to the label removal unit 113.

If the port is not specified, the column of the scattered output port 1144 is set to the initial value of the form.

Next, by using Figures 23 and 48, the operation of transmitting the scattered frame will be explained.

Figure 48 shows the settings of each port in the tree structure 62 and the settings of the transmission form.

Assume that in the initial state, the tree structure 61, which is the tree structure of the tag group 41, has been established and stabilized, and it is assumed that each node has 11 to 16 root ports and designated ports to determine the 48th root port 6102 and designated Port 6104. Therefore, the output port and virtual port of the transmission sheet 114 β at each node are determined as the output port 1142 and the scattered output port 1144 in FIG. 48.

First, the node 11 adds the label of the label group 41 to the dissemination frame, and transmits the dissemination frame. In this operation, the designated ports of the tree structure 61 on the connection 21 side and the connection 23 side are designated as the output destination port of the distribution frame of the tag group 41 in the node 11. Therefore, the frame is copied and output to the connection 22 side and the connection 23 side, and is sent to the label removal unit.

According to the reception of the distribution frame from the connection 21, the node 12 searches the transmission list by using the tag group 41 as a key to obtain the port on the connection 22 side as the distribution output port. Then output the received scatter frame to the connection 22 side and to the label removal unit.

According to the reception of the distribution frame from the connection 22, the node 13 obtains the initial value by using the tag group 41 as the key to search for the transmission form, which is used as the distribution output port. Then output the received scatter frame to the label removal unit.

According to the reception of the distribution frame from the connection 23, the node 14 searches the transmission list by using the tag group 41 as the key to obtain the port on the connection 26 side as the distribution output port. Then output the received scatter frame to the connection 26 side and the label removal unit.

According to the reception of the distribution frame from the connection 26, the node 15 searches the transmission list by using the tag group 41 as a key to obtain the port on the connection 27 side as the distribution output port. Then output the received scatter frame to the connection 27 side and the label removal unit.

According to the reception of the distribution frame from the connection 27, the node 16 obtains the initial value by using the tag group 41 as the key to search for the transmission form, which is used as the distribution output port. Then output the received scatter frame to the label removal unit.

The above operation allows the scattered frame output by the node 11 to be transmitted to each node in the network through the path with the least cost.

Next, the effect of this embodiment will be explained.

In the past, although the path to the target with the smallest cost could not always be selected when spreading, in this embodiment, by using a tree structure whose source node is the root node to transmit the frame, the choice has the smallest cost and It is possible to transmit scattered frames along the path to all nodes.

In addition, in the past, although the load was concentrated on adjacent nodes and the connection utilization rate was low, in this embodiment, by setting a plurality of extended tree systems with different root nodes, the connection utilization rate was increased, and It is possible to distribute the load without concentrating the load on neighboring nodes.

In addition, in the past, even if the root node has an error, there is a problem that the tree structure construction takes time and the network is stopped during the period. In this embodiment, because the tree with its target as the root node is used The shape structure uses the transmission of the scattered frame to eliminate the fact that the scattered frame other than the frame whose target is the root node cannot be transmitted within the extended time under the influence of the root node error, so as to prevent the root node error from being caused Network termination is possible. It also reduces the possibility of congestion and frame loss.

Tenth embodiment

The tenth embodiment will be illustrated by diagrams.

In the structure of the tenth embodiment, two output ports are written into the transmission form, so that if other output ports cannot be used due to the error in the eighth embodiment, one output port can be used, and the error detection of the seventh embodiment It is used by the tester to quickly send error detection.

In this embodiment, by using a tree structure with a target as a root node to transmit a single transmission frame, and using a transmission form to indicate in advance alternate output ports determined by the expansion tree, rapid recovery from errors can be achieved.

Referring to Figure 49, the tenth embodiment is different from the fourth embodiment in that the frame transfer unit 111 is replaced by a frame transfer unit 111α, and the transfer form 114 is replaced by a transfer form 114α, and the tree structure 1151 to 1153 The tree structures 1151 α to 1153 α are replaced, and the error detector 120 of the seventh embodiment is added to FIG. 41 of the fourth embodiment.

Figure 49 shows the application of this embodiment to node 11 in Figure 23.

The frame transmission unit 111 α transmits the frame received from the connection 21 or 23 and the label insertion unit 112 to the connection 21 or 23, and the label removal unit or 113 or tree according to the description of the transmission form 114 α Choose Master 116.

In this way, if the resource monitor 119 detects that there is an error in the port written to the output port 1142 of the transmission form 114α, the received frame is transmitted to the port displayed to the spare output port 1143. If an error in the port of the output port 1142 is detected, but the description of the alternate output port is the initial value (not set), the received frame is discarded.

The transmission form 114 α includes the spare output port 1143 column added to the transmission form 114.

Although the tree manager 1151α has the same structure as the tree manager 1151, its functions and operations are different. Hereafter, although the tree manager 1151 α is used instead of the tree manager 1151 α to 1153 α, the explanation about the tree manager 1151 α can also be applied to the tree manager 1152 α and 1153 in addition to other notes. α.

Fig. 50 shows a configuration example of the transmission sheet 114α of the node 12 in Fig. 23, in which the output port is determined by the label such as the key.

The label field 1141 is the same as the label field of the transmission form 114.

The output port 1142 is the same as the output port of the transmission form 114.

In the spare output port 1143 column, write the output destination port, which is used when the port of the write output port 1142 becomes unstable. When the frame transmission unit 111α detects that the port written in the output port 1145 is unavailable, it transmits the frame to the port of the backup output port 1143 entrance.

Figure 51 shows the block diagram of the tree manager 1151α structure.

When the tags of tag group 41 are added to the BPDU frame sent/received by the tree manager 1151α, the tree controller 11514α determines the root port and assigns it according to the communication protocol of IEEE 802.1D and IEEE802.1w port. In this embodiment, the root port is set to be determined as the output port 1142 of the tag group entry in the transmission list 114α, and the designated port is designated as the spare output port 1143.

If the root port exists, the field about the output port 1142 is set to indicate the port of the own node, and the frame marked by the label of the label group 41 input by the frame transmission unit is sent to the label removal unit 113.

If there is no designated port, the column of alternate output port 1143 is set to the initial value of the form.

Next, by using Figures 23 and 52, taking the error occurred on the connection 21 as an example, the operation of sending a single transmission frame when the error occurs on the connection is explained.

Figure 52 shows the settings of each port in the tree structure 61 and the settings of the transmission form.

Assuming that in the initial state, the tree structure 61, which is the tree structure of the tag group 41, has been established and stabilized, and it is assumed that each node has 11 to 16 root ports and designated ports to determine the root port 6102 and designation in Figure 52 Port 6104. Therefore, the output port and virtual port of the transmission list 114α at each node are determined as the output port 1142 and the scattered output port 1144 in FIG. 52.

First, the node 13 adds the tags of the tag group 41 to the single transmission frame, and transmits the single transmission frame. In this operation, the port on the side of the connection 22 that is the root port of the tree structure 61 is designated as the output destination port of the frame of the tag group 41 in the node 13. Therefore, the frame is output to the connection 22 side.

Assume that in this case, the error occurred on the line 21 side.

According to the reception of the frame from the connection 22, the node 12 searches the transmission list by using the tag group 41 as the key to obtain the port on the connection 21 side as the output port, and the port on the connection 24 side Port as a spare output port. Then try to send the received frame to the connection 21 side. However, because the error detection information of the connection 21 is received from the resource monitor, the received frame is output to the connection 24 side that requires your output port.

According to the reception of the frame from the connection 24, the node 15 searches the transmission list by using the tag group 41 as the key to obtain the port on the connection 26 side as the output port and the port on the connection 24 side As a virtual output port. It was proved that no error occurred on the connection 26 side, and no received frame was output to the connection 26 side.

According to the reception of the frame from the connection 26, the node 14 searches for the transmission list by using the tag group 41 as the key to obtain the port on the connection 23 side as the output port and as a spare output port. Initial value. It was proved that no error occurred on the connection 23 side, and no received frame was output to the connection 23 side.

According to the reception of the frame from the connection 23, the node 11 confirms that it is addressed as its own node, and sends it to the label removal unit 113.

Through the above operation, if the error occurs on connection 21, refer to the default alternate output port, and quickly select the path through connections 22, 23, 24, 26 and 23, and send a single frame from node 13 to node 11. , And continuously transmit frames to node 11. Therefore, when an error occurs, a quick detour can be achieved, and network congestion can be avoided.

According to the reception of the distribution frame from the connection 26, the node 15 searches the transmission list by using the tag group 41 as a key to obtain the port on the connection 27 side as the distribution output port. Then output the received scatter frame to the connection 27 side and the label removal unit.

According to the reception of the distribution frame from the connection 27, the node 16 obtains the initial value by using the tag group 41 as the key to search for the transmission form, which is used as the distribution output port. Then output the received scatter frame to the label removal unit.

The above operation allows the scattered frame output by the node 11 to be transmitted to each node in the network through the path with the least cost.

Next, the effect of this embodiment will be explained.

In the past, although the path to the target with the smallest cost cannot always be selected when spreading, in this embodiment, by using a tree structure with the target as the root node to send a single transmission frame, the selection has the smallest cost And the path to the goal is possible.

In addition, in the past, although the load was concentrated on adjacent nodes and the connection utilization rate was low, in this embodiment, by setting a plurality of extended tree systems with different root nodes, the connection utilization rate was increased, and It is possible to distribute the load without concentrating the load on neighboring nodes.

In addition, in the past, even if the root node has an error, there is a problem that the tree structure construction takes time and the network is stopped during the period. In this embodiment, because the tree with its target as the root node is used The shape structure uses the transmission of the scattered frame to eliminate the fact that the scattered frame other than the frame whose target is the root node cannot be transmitted within the extended time under the influence of the root node error, so as to prevent the root node error from being caused Network termination is possible. It also reduces the possibility of congestion and frame loss.

In addition, in the past, although the conversion of the output destination port took a long time when the connection error occurred on the root port side, and the designation was sent during the period; in this embodiment, the output connection The alternate output connection in the case of a line error, in the case that the error occurs in the root port side connection, that is, the output connection, it is possible to quickly change the path. This allows to reduce the probability of occurrence of congestion.

Regarding the function of the components of the expansion tree configuration node of the network in the present invention, it can be achieved through hardware, and it can also be achieved by loading the expansion tree reconfiguration program (application) 950. This expansion tree reconfiguration The program executes the above device and enters the memory of the computer processing unit to control the computer processing unit. In order to achieve this function, the expansion tree configuration program 950 is stored on a magnetic disk, semiconductor memory or other storage medium; and loaded from the storage medium to the computer processing unit to control the operation of the computer processing unit.

According to the present invention, the following functions can be achieved.

First, it is possible to reduce the possibility of congestion, and it is possible to reduce the delay in arrival or frame loss due to congestion. This is because when the expansion tree existing before the configuration change operation continues to operate, an expansion tree including a newly added node is generated; after the new node is stabilized, the expansion tree is converted to use; and multiple expansion trees with different root nodes are set system.

Second, it is possible to reconfigure the expansion tree so that the addition/removal of nodes belonging to the expansion tree can be performed without stopping the network. This is because when the expansion tree existing before the configuration change operation continues to operate, an expansion tree including a newly added node is generated; and after the new node is stabilized, the execution of the expansion tree is converted to use.

Third, it is possible to distribute the load. This is because the connection cost is calculated based on dynamic information, such as idle bandwidth and server load.

Fourth, it is possible to distribute the load without stopping the network due to expansion tree reconfiguration and path changes. This is because when the expansion tree that exists before the change continues to operate, the tree structure after the cost is changed is generated; and after the new expansion tree is stabilized, the tree structure used is changed.

Fifth, it is possible to choose the path to the goal with the least cost. This is because the tree structure with the target as the root node is used to transmit the frame.

Sixth, it is possible to increase the utilization rate of the connection and distribute the load without having to concentrate the load on the neighboring root nodes. The reason is that the expanded tree structure with different root nodes is set for plural numbers.

Seventh, it is possible to avoid network interruption due to the occurrence of the root node. This is because, by using the tree structure with the target as the root node to send the frame, to exclude the scattered frame other than the frame with the target as the root node, it cannot be affected by the root node error within the extended time. The fact of transmission, it is possible to prevent the termination of the network due to root node errors.

Eighth, it is possible to prevent the expansion tree from being set up by using the IEEE 802.1D area; in case of error, alternate switching and path switching; it is possible to reduce the possibility of congestion and frame loss. This is because the cost of the area using IEEE 802.1D is set to be higher to prevent the expansion tree from being set up by the area using IEEE 802.1D.

Ninth, it is possible to speed up the detour and prevent the occurrence of congestion and the loss of the frame. The reason is that the number of tree managers is the same as the number of areas using IEEE 802.1D; a different tree structure is established for each area using IEEE 802.1D, and the cost of the area using IEEE 802.1D is set to be higher: and In the case where a detour is necessary due to an error, the conversion is performed to use a tree structure, in which higher costs are allocated to this area.

Tenth, due to the long transmission period of the greeting frame used by the extended tree protocol, the error cannot be detected quickly. However, by adding the error detection of the transmission/reception frame about the error detection in a short period of time The tester can quickly detect errors when using the greeting frame. This allows to reduce the possibility of congestion and missing frames.

Eleventh, in the past, although the path to the target with the smallest cost could not always be selected when spreading, in this embodiment, by using a tree structure whose source node is the root node to transmit the frame, select It is possible to transmit scattered frames with the smallest cost and the path to all nodes.

Twelfth, because the tree structure with its target as the root node is used to transmit the scatter frame to exclude scatter frames other than the frame whose target is the root node, it cannot be extended under the influence of the root node error The fact is transmitted within time, so it is possible to prevent network termination due to root node errors. It also reduces the possibility of congestion and frame loss.

Thirteenth, in the past, although the path to the destination with the smallest cost cannot always be selected when distributing, by using the tree structure with the destination node as the root node to transmit a single transmission frame, the choice has the smallest cost and The path to the target node is possible.

Fourteenth, in the past, although there was a connection error on the root port side, it took a long time to switch the output destination port, and the frame transmission stopped during this period. In the present invention, by It is preset in the sending form. Regarding the alternate output connection used in the case of an error, it is connected to the root port side, that is, the output connection. In the case of an error, it is possible to quickly change the path. It allows to reduce the probability of occurrence of congestion.

Although the present invention is disclosed as above in a preferred embodiment, it is not meant to be limiting. The scope of the present invention, anyone who is familiar with the art, without departing from the spirit and scope of the present invention, can make some changes and modifications. Therefore, the scope of protection of the present invention shall be defined as the scope of the attached patent application. allow.

<p>3200VLAN tagged Ethernet frame</p><p>3300VLAN tagged Ethernet frame</p><p>3400Extended mark Ethernet frame</p><p>3201MAC address</p><p>3202Source MAC address 3202</p><p>3203VLAN Tag</p><p>3204Ethernet attribute information</p><p>3205Payload</p><p>3206FCS</p><p>3300Extended mark Ethernet frame</p><p>3201MAC address</p><p>3202Source MAC address</p><p>3203VLAN Tag</p><p>3204Ethernet attribute information</p><p>3205Payload</p><p>3206FCS</p><p>3500Transfer label</p><p>3501User distinguishing label</p><p>3502Protection Label</p><p>3503OAM&amp;P label</p><p>3504Characteristic Information Label</p><p>3505Frame Control Label</p><p>3506Safety Label</p><p>3507User Extension Label</p><p>3508Distribution of transmission labels</p><p>EXOANS ION TAGExtension tag</p><p>BPDU AREABPDU area</p><p>2201MAC destination address</p><p>2202MAC destination address</p><p>2203label area</p><p>2204Category</p><p>2206FCS</p><p>22051Protocol Identifier</p><p>22052Protocol version identifier</p><p>22053BPDU type</p><p>22054Flag</p><p>22055Root identifier</p><p>22056Root path cost</p><p>22057Bridge identifier</p><p>22058Port identifier</p><p>22059Message age</p><p>2205AMaximum existence time</p><p>2205BGreeting time</p><p>2205CDelayed forwarding</p><p>21...28, 81...86Connect</p><p>11...16node</p><p>91...96User</p><p>111Frame Transmission Unit</p><p>112Label Insertion Unit</p><p>113Label removal unit</p><p>114Label Form</p><p>1150Differentiator</p><p>1151, 1152Tree Manager</p><p>116Tree Selector</p><p>117label form</p><p>118Configuration interface</p><p>119Resource Monitor</p><p>950Expansion Tree Configuration Program</p><p>1141label</p><p>1142Output port</p><p>11511Label removal unit</p><p>11512BPDU sender/receiver</p><p>11513Label Insertion Unit</p><p>11514Tree Controller</p><p>11515Tree form</p><p>1161Label removal unit</p><p>1162GVRP sender/receiver</p><p>1163Label Insertion Unit</p><p>1164Main controller</p><p>1165Stable timer</p><p>1166Arrival interval timer</p><p>11641...11649Status</p><p>1171Target MAC address</p><p>1172Insert label</p><p>29, 30Connect</p><p>17node</p><p>1164 αMain controller</p><p>1167Cost Reference Timer</p><p>1168Calculator</p><p>1169Smoothing unit</p><p>11641...11649Status</p><p>1164A, 1164BStatus</p><p>1153Tree Manager</p><p>87, 88Connect</p><p>97User</p><p>120Error Detector</p><p>111 γFrame transmission unit</p><p>114 γLabel Form</p><p>1151 γ,1152 γ,1153 γTree manager</p><p>6101node</p><p>6102Genbu</p><p>111 βFrame Transmission Unit</p><p>114 βlabel form</p><p>1151 β, 1152 β, 1153 βTree manager</p><p>1144Distribution output port</p><p>111 αFrame transmission unit</p><p>114 αLabel Form</p><p>1151 α,1152 α,1153 αTree manager</p><p>1143Alternate output port</p><p>2800TPID</p><p>2801TCI</p><p>2802Priority area</p><p>2803CFI</p><p>2804VLAN-ID</p><p>5001Extended label recognition area</p><p>5002Extended label information area</p><p>5003Priority/Tag Type Field</p><p>5004Extended label information field</p>

In order to make the above-mentioned objects, features and advantages of the present invention more obvious and understandable, a preferred embodiment is specifically cited below, and in conjunction with the accompanying drawings, the detailed description is as follows: Figure 1 shows a description of the prior art VLAN tag B The schematic diagram of the configuration example of the Ethernet frame.

Figure 2 shows a schematic diagram illustrating an example of the configuration of the extended mark Ethernet frame in the present invention.

FIG. 3 shows a schematic diagram illustrating another example of the configuration of the extended mark Ethernet frame in the present invention.

Figure 4 shows a schematic diagram illustrating an example of the arrangement of the extended label storage area in the present invention.

Figure 5 is a schematic diagram illustrating the format of the frame configuration for configuring the BPDU frame in the present invention.

Figure 6 is a schematic diagram illustrating the frame configuration of the topology change notification BPDU frame in the present invention.

Fig. 7 shows a block diagram of the configuration of the first embodiment of the present invention.

Fig. 8 shows a block diagram of the configuration of the node 11 in the first embodiment of the present invention.

FIG. 9 shows a form of a configuration example of the transmission form 114 in the first embodiment of the present invention.

Figure 10 is a block diagram showing the configuration of the tree manager 1151 in the first embodiment of the present invention.

Fig. 11 shows a block diagram of the arrangement of the tree selector 116 in the first embodiment of the present invention.

Figure 12 shows the operation flow chart of the main controller 1164 in the first embodiment of the present invention.

FIG. 13 shows a sheet of an example of the layout of the label sheet 117 in the first embodiment of the present invention.

FIG. 14 shows a block diagram of the configuration of the expanded tree 51 after the node 700 is added in the first embodiment of the present invention.

FIG. 15 shows a block diagram of the configuration of the expanded tree 52 after the node 700 is added in the first embodiment of the present invention.

Figure 16 shows a continuous diagram of the exchange of control frames in the first embodiment of the present invention.

Figure 17 shows a block diagram of the arrangement of the tree selector 116 in the second embodiment of the present invention.

Figure 18 shows the operation flow chart of the main controller 1164 in the second embodiment of the present invention.

Figure 19 shows the operation flow chart of the main controller 1164 in the third embodiment of the present invention.

FIG. 20 shows a form of a configuration example of the transmission form 11 in the fourth embodiment of the present invention.

FIG. 21 shows a form of a configuration example of the transmission form 114 in the fourth embodiment of the present invention.

FIG. 22 shows a sheet of an example of the layout of the label sheet 117 in the fourth embodiment of the present invention.

FIG. 23 is a block diagram showing the arrangement of the tree structure 61 in the fourth embodiment of the present invention.

Fig. 24 is a block diagram showing the arrangement of the tree structure 62 in the fourth embodiment of the present invention.

Fig. 25 is a block diagram showing the arrangement of the tree structure 63 in the fourth embodiment of the present invention.

Fig. 26 is a block diagram showing the arrangement of the tree structure 64 in the fourth embodiment of the present invention.

Fig. 27 is a block diagram showing the arrangement of the tree structure 65 in the fourth embodiment of the present invention.

Fig. 28 is a block diagram showing the arrangement of the tree structure 66 in the fourth embodiment of the present invention.

Fig. 29 is a block diagram showing the configuration of the fourth embodiment of the present invention.

Fig. 30 is a block diagram showing the arrangement of the tree structure 74 in the fourth embodiment of the present invention.

Figure 31 is a block diagram showing the configuration of the main controller 1151 in the fifth embodiment of the present invention.

Fig. 32 is a block diagram showing the arrangement of the tree structure 71 in the fifth embodiment of the present invention.

Fig. 33 is a block diagram showing the arrangement of the tree structure 72 in the fifth embodiment of the present invention.

Fig. 34 is a block diagram showing the arrangement of the tree structure 73 in the fifth embodiment of the present invention.

Figure 35 is a block diagram showing the configuration of the node 11 in the sixth embodiment of the present invention.

Fig. 36 is a block diagram showing the arrangement of the tree structure 67 in the sixth embodiment of the present invention.

Fig. 37 is a block diagram showing the arrangement of the tree structure 68 in the sixth embodiment of the present invention.

Fig. 38 is a block diagram showing the arrangement of the tree structure 69 in the sixth embodiment of the present invention.

Fig. 39 is a block diagram showing the arrangement of the tree structure 70 in the sixth embodiment of the present invention.

Fig. 40 is a block diagram showing the configuration of the node 11 in the seventh embodiment of the present invention.

Figure 41 is a block diagram showing the configuration of the node 11 in the eighth embodiment of the present invention.

Fig. 42 shows a sheet which is an example of the arrangement of the transmission sheet 114? in the eighth embodiment of the present invention.

Figure 43 is a block diagram showing the arrangement of the tree manager 1151γ in the eighth embodiment of the present invention.

FIG. 44 is a schematic diagram showing an example of the setting state of the tree structure 61 in the eighth embodiment of the present invention.

Fig. 45 is a block diagram showing the configuration of the node 11 in the ninth embodiment of the present invention.

FIG. 46 shows a sheet of a configuration example of the transmission sheet 114β in the ninth embodiment of the present invention.

Figure 47 is a block diagram showing the configuration of the tree manager 1151β in the ninth embodiment of the present invention.

FIG. 48 is a schematic diagram showing an example of the setting state of the tree structure 61 in the ninth embodiment of the present invention.

Fig. 49 is a block diagram showing the configuration of the node 11 in the tenth embodiment of the present invention.

Fig. 50 shows a sheet which is an example of the arrangement of the transmission sheet 114α in the tenth embodiment of the present invention.

Figure 51 is a block diagram showing the configuration of the tree manager 1151α in the tenth embodiment of the present invention.

FIG. 52 is a schematic diagram of a list of an example of the setting state of the tree structure 61 in the tenth embodiment of the present invention.

Figure 53 is a schematic diagram showing an example of the configuration of the extension frame of the present invention.

Figure 54 shows a schematic diagram of the port status of each node in the expansion tree configuration in Figure 23.