KR100777614B1 - Optimum Topological MSTP Network Structure and Mapping Method of the same - Google Patents

Abstract

The present invention provides an MSTP network apparatus for operating a spanning tree by combining a plurality of VLANs into a unit group MST to provide a loopless path in order to group the plurality of VLANs into an optimal network. An optimal topology MSTP network device and an optimal topology MSTP network configuration method, wherein the number of VLANs is defined as n × n−n <N ≦ n × n, and the MST is configured as a set of n × n square VLANs. To be a technical point.

According to the present invention described above, there is provided an optimal topology topology MSTP network apparatus and an optimal topology topology MSTP network configuration method for configuring an optimal network by minimizing the calculation time of the spanning tree and the transmission amount of BPDU in the MSTP network.

VLAN, Spanning Tree, MSTP, MST, BFS, IST

Description

Optimal Topological MSTP Network Structure and Mapping Method of the same

1 is a conceptual diagram of a spanning tree in an MSTP region

2 is a diagram illustrating a mesh topology of a VLAN in an MST region

3 is a spanning tree configuration diagram of a VLAN configured by a BFS algorithm in an MST region according to the concept of the present invention

4 is a block diagram of a mesh topology and a spanning tree in the MSTP region

5 and 6 are configuration diagrams of the MST area according to the number of VLANs

The present invention provides an MSTP network apparatus for operating a spanning tree by combining a plurality of VLANs into a unit group MST to provide a loopless path in order to group the plurality of VLANs into an optimal network. An optimal topology MSTP network device and an optimal topology MSTP network configuration method, wherein the number of VLANs is defined as n × n−n <N ≦ n × n, and the MST is configured as a set of n × n square VLANs. To be a technical point.

In general, in an IEEE 802.1 D spanning tree protocol (STP) network, one spanning tree instance operates for each VLAN.

Since the BPDU is periodically transmitted in the switch network in which the VLAN is set, the more the number of VLANs, the more the load is applied to the switch because the BPDU is transmitted as many as the number of VLANs in the STP.

In order to solve this problem, it is IEEE 802.1S multiple spanning tree protocol (MSTP) to operate a spanning tree instance by grouping a plurality of VLANs.

In other words, when using the conventional method in a network in which 100 VLANs are configured, 100 spanning trees should be calculated, but using MSTP, it is sufficient to calculate only the number of spanning tree instances grouped by VLANs.

Therefore, the spanning tree calculation time and the BPDU transmission amount are drastically reduced, which can greatly increase the efficiency of the network.

However, in the method of grouping VLANs in the MSTP, although the calculation time of the spanning tree and the amount of transmission of the BPDUs are changed according to the grouping of the VLANs, research on network optimization in the MSTP has not been conducted yet, and there is room for improvement. There is still a problem.

An object of the present invention is to provide an optimal topology MSTP network apparatus and an optimal topology topology MSTP network configuration for minimizing the calculation time of the spanning tree and the transmission amount of BPDU in the MSTP network.

In order to achieve the above object, the present invention provides an MSTP network apparatus for operating a spanning tree by grouping a plurality of VLANs into a unit group MST to provide a loopless path. The number N of the VLANs forming the unit group MST

determined in the range of n × n−n <N ≦ n × n,

The MST is a technical topologies of an optimal topology MSTP network device, characterized in that it consists of a set of n × n square VLANs.

In this case, the MST regions select each MST as an arbitrary CST route once in each MST region, form a spanning tree instance with a BFS algorithm between each MST node, and obtain a maximum path value MAX_NETt, thereby obtaining a network in the CST region. The configuration time (CST_TREE (CON))

MAX_NETt)/case 을 가지도록 구성하는 것을 특징으로 하는 최적 토플로지 MSTP 네트워크 장치로 되는 것이 바람직하다.CST_TREE (CON) = (

It is desirable to be an optimal topology MSTP network device, which is configured to have MAX_NETt) / case.

The present invention also relates to a method for constructing an MSTP network in which a plurality of VLANs are grouped into unit groups to operate a spanning tree and provide a loopless path in order to group the plurality of VLANs into an optimal network.

1. grouping the entire VLAN into a set of N units in the range n × n−n <N ≦ n × n;

2. configuring the unit N VLANs into an n × n square MST driven by an internal spanning tree (IST);

3. Each unit MST is the same path value 1 NETt Connecting to the mesh topologies driven by a common spanning tree;

Another technical gist of the method for constructing an optimal topology MSTP network is characterized by configuring a MST, which is a unit group of the MSTP, into a square VLAN set.

Where the square MST of 2 is

2-1. Numbering the VLANs which constitute the mesh topology in turn and having a connection priority as the number becomes smaller;

2-2. Constructing a spanning tree in ascending order (the smaller the VLAN number, the higher the priority), starting from the IST master, using the first VLAN switch as the IST master;

2-3. Spanning tree configuration time (SP_TREE) of the maximum value (MAX_St) among the path values from the IST mast to the terminal switch when the path value between each VLAN switch (the path value unit is set to St) is equal to 1 St. (CON))

SP_TREE (CON) = MAX_St

To obtain the step;

It is preferable that the optimal topology MSTP network construction method is characterized in that the spanning tree configuration time SP_TREE (CON) of the MST is determined by the BFS algorithm.

And the mesh topology of 3

3-1. Selecting each MST as an arbitrary CST route once in each MST area;

3-2. Forming a spanning tree instance with a BFS algorithm between each MST node to obtain a maximum path value MAX_NETt;

3-3. The time when the network is configured in the CST region (CST_TREE (CON))

MAX_NETt)/caseCST_TREE (CON) = (

MAX_NETt) / case

Obtaining a step;

3-4. The total speed of the MSTP network (MSTP_NET (T)) is the sum of the internal speed of the MST and the speed between the MSTs.

MSTP_NET (T) = SP_TREE (CON) + CST_TREE (CON)

MAX_NETt)/case= MAX_St + (

MAX_NETt) / case

Evaluating as; It is desirable to have an optimal topologies MSTP network construction method, which is implemented to form the optimal topologies at the highest speed.

Hereinafter, terms to be described below are terms defined in consideration of functions in the present invention and known terms, which may vary according to intentions or customs of users or operators, and the definitions refer to the contents throughout the present specification for describing the present invention. It should be based on, and summarized terms (English abbreviation and defined terms) described below are as follows.
MSTP: Multiple Spanning Tree Protocol
BPDU: Bridge PRotocol Data Unit
VLAN: Virtual Local Area Network
BFS: Breadth First Search
STP: Spanning Tree Protocol
CST: Common Spanning Tree
IST: Internal Spanning Tree
MST: Multiple Spanning Tree
S t : edge unit from one of the switches in the MST area to the other switch
SP_TREE (CON): Spanning tree configuration time configured by BFS algorithm
MAX_St : Maximum of path values from IST master to terminal switch
≠ Tt: edge unit connecting one MST to another
MAX_ ≠ Tt: Maximum path value of spanning tree composed by CST operation algorithm
CST_TREE (CON): Time when network is configured in CST area
case: The number of MST areas configured in the CST area.
MSTP_NET (T): overall speed of MSTP network
R: Row
C: Column
n: one VLAN
N: total number of VLANs that make up group MST

Hereinafter, the present invention will be described with reference to the above terms and drawings. In describing the present invention, when it is determined that the detailed description of the related well-known technology or configuration may unnecessarily obscure the gist of the present invention, the detailed description thereof will be described. The description will be omitted.
1 is a conceptual diagram of a spanning tree in an MSTP region, FIG. 2 is a diagram illustrating a mesh topology of a VLAN in an MST region, and FIG. 3 is a configuration of a spanning tree of a VLAN configured by a BFS algorithm in an MST region according to the inventive concept. 4 is a diagram illustrating a mesh topology and a spanning tree in an MSTP region, and FIGS. 5 and 6 are diagrams illustrating an MST region according to the number of VLANs.

The present invention described below more efficiently defines MSTP defined in IEEE 802.1s, which operates a spanning tree by grouping a plurality of VLANs into one group in an IEEE 802.1D Spanning Tree Protocol (STP) network environment and provides a loopless path. Method and apparatus.

Hereinafter, VLAN network grouping under the MSTP environment will be described. In the MSTP, VLANs are grouped into a unit group MST, and one spanning tree instance per group operates in the MST.

The MST defines an MST region name, an MST configuration number, a VLAN group number, and a VLAN number as an MST configuration value, thereby classifying a set of switches having the same MST configuration value into one MST region.

Hereinafter, the present invention will be described with an example of configuring an optimal MST with 100 VLANs.

1 illustrates the area relationship of the MST and the MSTP in the MSTP network.

In the MSTP, there is a CST that operates in common in the entire switch network including the IST and the MST region operating in one MST region.

The spanning tree instance configured in the MSTP is numbered from 0 to 15, and spanning tree instance 0 is called IST.

Since the MST transmits and receives a BPDU only in the IST, all the spanning tree instance information of the MST is included in the BPDU of the IST.

Hereinafter, the configuration of the spanning tree in the MST region will be described with reference to FIGS. 2 and 3.

2 is a model in which 25 VLANs are grouped into one according to a given condition and configured as a mesh topology.

The mesh topology is the operation algorithm of the spanning tree for the MST of the present invention as shown in FIG.

The BFS operating condition

One). Assuming switch 1 is the IST master, start BFS from the IST master.

2). Spanning trees are organized in ascending order (the smaller the VLAN number, the higher the priority).

3). The path value between each switch (the path value unit is set to St) is equally 1St.

4). The spanning tree configuration time SP_TREE (CON) of the MST configured by the BFS algorithm operation is the maximum value MAX_St among the path values from the IST mast to the terminal switch.

[Equation 1]

SP_TREE (CON) = MAX_St

For example, if MST is composed of 25 VLANs as one unit group, 5 × 5 square matrix is formed, and rows and columns are connected to 5 nodes and 4 trees.

At this time, each node is a VLAN, and each tree represents a path value of 1St, and as shown in FIG. 2, 25 VLANs are grouped into one and configured as a mesh topology as shown in FIG. 2.

When configuring the mesh topology, VLAN numbers are assigned in turn, and the smaller the number, the higher the connection priority.

Therefore, VLAN 1 operates as an IST master (starting point of spanning tree), and the spanning tree as shown in FIG. 3 is formed by the BFS algorithm.

As shown in FIG. 3, each spanning tree starting from the IST master is equally 4St in the square MST, and thus the maximum spanning tree value is 4St.

That is, as shown in FIG. 3, 25 VLANs are grouped into one to form a spanning tree, which is 4St (4 tree counts).

Since each spanning tree instance is configured at the same time with the same conditions and procedures, 100 VLANs divided into 4 MST groups (4 unit MST groups consisting of 5 × 5 square matrices of 25 each) form the spanning tree. Are all equally 4St.

Meanwhile, as shown in FIG. 1, each of the MST regions is also operated by a CST connected by a mesh topology.

At this time, the operation algorithm of the CST is

One). Path value between MST and MST is regarded as 1NETt

2). Designate any one of the MSTs as the CST root

3). BFS algorithm also works in CST area

to be.

For example, in four MST regions, each MST is selected as an arbitrary CST root once, and a spanning tree instance of 1NETt is formed between each node.

FIG. 4 illustrates four spanning trees constituted by arbitrary MSTs. In this case, it can be seen that the maximum path value MAX_NETt is 1 NETt.

When the network is configured with the mesh topology as described above, the maximum path value becomes the maximum value among the path values from the CST route to the terminal MST region.

In addition, since the time (CST_TREE (CON)) that the network is configured in the CST area depends on which area the CST route is set, the result obtained by dividing the maximum path values by the number of cases of the MST area. Becomes

[Formula 2]

MAX_NETt)/caseCST_TREE (CON) = (

MAX_NETt) / case

In the example in which 100 VLANs are grouped by 25 to group MSTs, the time when the network is formed by dividing into 4 MST areas by Equation 2 is calculated.

case = 4

The maximum path value between each MST is 1

MAX_NETt) = 4 이다.Because of (

MAX_NETt) = 4

therefore

CST_TREE (CON) = 4/4 = 1

The overall speed of the MSTP network (MSTP_NET (T)) is determined by the internal speed of the MST (Equation 1) and the speed between the MSTs (Equation 2).

[Equation 3]

MSTP_NET (T) = SP_TREE (CON) + CST_TREE (CON)

MAX_NETt)/case= MAX_St + (

MAX_NETt) / case

Is established.

For example, when 100 VLANs are configured as MSTP networks, 25 VLANs are formed as 1 group, and the MST is configured as a square of 5 × 5.

MSTP_NET (T) = 4St + 1 NETt = 5.

Table 1 below shows the number of MST regions when the 100 VLANs are grouped into a plurality of random numbers (the 10 rows are divided to the left and right, so the rows of the MST regions are fixed at 5), MAX_St, ∑MAX_NETt, and MSTP_NET ( The values of T) are plotted.

TABLE 1

VLAN 50 25 20 15 10 5 MST area 2 4 5 7 10 20 MAX_St 9 4 4 4 4 4 ∑MAX_NETt One One 1.6 2.4 2.4 3.3 MSTP_NET (T) 10 5 5.6 6.4 6.4 7.3

As shown in Table 1, when the VLAN grouping has 25 MST regions consisting of squares, it can be seen that MSTP_NET (T) has the smallest value, thereby forming the highest speed.

Hereinafter, the spanning tree instance configuration time of the MST region will be described again.

The MST area is composed of topologies divided into rows and columns, and the row is fixed because the area of the entire VLAN is divided left and right. (E.g. two 5-row MSTs separated by 10 rows left and right)

Therefore, the time for spanning tree instances of the MST to complete the spanning tree is always set when C ≤ R when the MST consisting of grouped VLANs as rows (R) and columns (C) as shown in FIG. has a MAX_St of n-1.

Therefore, in order for MSTP network to have the highest speed, C ≤ R, the maximum VLAN is included, and MAX_St must be the minimum condition.

Therefore, the MST condition that satisfies the two conditions where the maximum VLAN is included and MAX_St is the minimum is when C = R is square.

Meanwhile, as shown in FIG. 5, it can be seen that the condition of C = R is not always a condition that is filled in a square.

For example, if you fill a row and column with 24 VLANs, the rows and columns are all 5 together, but the last column is short of one digit.

However, even if there is insufficient VLAN, MAX_St, which determines the speed, does not change.

If you quantify this

MAX_St = n-1 St if (n × n, remainder (0), full type)

MAX_St = n-1 St if (n × n, remainder (-))

to be.

On the other hand, as shown in Figure 6 when configuring the MST with the number of VLANs remaining in the square

MAX_St = n St if (n × n, remainder (+))

It can be seen that the remaining number of VLAN groups in the square is a speed delay factor.

Therefore, it can be seen that the number of VLANs that form a square MST and are grouped so that the rest remain is an element to be avoided for network optimization.

In summary, the number of VLANs constituting the MST is N

It should be a number in the range satisfying n × n−n <N ≦ n × n.

To summarize the present invention described above, when configuring MSTP with a set of VLANs, the optimal number of VLAN groupings N should be set to a number satisfying n × nn <N ≤ n × n, and CST will be 1 NETt. In this case, the VLAN group forms a square MST, so that an optimal network having the highest speed and the lowest BPDU load is formed.

According to the present invention described above, there is an advantage in that an optimal topology MSTP network apparatus and an optimal topology MSTP network configuration method for configuring an optimal network by minimizing a calculation time of a spanning tree and a transmission amount of a BPDU in an MSTP network are provided.

Claims (5)

In order to group a plurality of VLANs into the network of the most efficient, MSTP network device that combines the plurality of VLANs into a unit group MST to operate the spanning tree and provide a loopless path, The number N of the VLANs forming the unit group MST determined in the range of n × n−n <N ≦ n × n, The MST is an optimal topology MSTP network device, characterized in that consisting of a square VLAN set of n × n. The device of claim 1, wherein the MSTP network device is Each MST is selected once as an arbitrary CST route, and a spanning tree instance is formed by a BFS algorithm between each MST nodes to obtain a maximum path value (MAX_NETt). The network configuration time (CST_TREE (CON)) in the CST region CST_TREE (CON) = (

MAX_NETt) / case (case = number of MST regions) Optimal topology MSTP network device, characterized in that configured to be. In order to group a plurality of VLANs into a network of optimum efficiency, MSTP network configuration method of operating a spanning tree by providing a plurality of VLANs in a unit group, providing a loop-free path, 1. grouping the entire VLAN into a set of N units in the range n × n−n <N ≦ n × n; 2. configuring the unit N VLANs into an n × n square MST driven by an internal spanning tree (IST); 3. Each unit MST is the same path value 1 NETt Connecting to the mesh topologies driven by a common spanning tree; Optimal topologies MSTP network configuration method characterized in that consisting of a square VLAN set of MST unit group of the MSTP. The square MST of claim 2, wherein 2-1. Numbering the VLANs which constitute the mesh topology in turn and having a connection priority as the number becomes smaller; 2-2. Constructing a spanning tree in ascending order (the smaller the VLAN number, the higher the priority), starting from the IST master, using the first VLAN switch as the IST master; 2-3. Spanning tree configuration time (SP_TREE) of the maximum value (MAX_St) among the path values from the IST mast to the terminal switch when the path value between each VLAN switch (the path value unit is set to St) is equal to 1 St. (CON)) SP_TREE (CON) = MAX_St To obtain the step; An optimal topology MSTP network construction method, wherein the spanning tree configuration time (SP_TREE (CON)) of the MST is determined by a BFS algorithm. 4. The mesh topology of claim 3 wherein 3-1. Selecting each MST as an arbitrary CST route once in each MST area; 3-2. Forming a spanning tree instance with a BFS algorithm between each MST node to obtain a maximum path value MAX_NETt; 3-3. The time when the network is configured in the CST region (CST_TREE (CON)) CST_TREE (CON) = (

MAX_NETt) / case Obtaining a step; 3-4. The total speed of the MSTP network (MSTP_NET (T)) is the sum of the internal speed of the MST and the speed between the MSTs. MSTP_NET (T) = SP_TREE (CON) + CST_TREE (CON) = MAX_St + (

MAX_NETt) / case Evaluating as; An optimal topologies MSTP network construction method, characterized in that it is carried out to form the optimal topologies of the highest speed.

Images