WO2007051409A1 - A bridge, a bridged network and a data processing method in the bridged network - Google Patents

Abstract

A data process method in the bridged network and a bridged network. The said bridged network, connected by the bridge, comprises: a tree is generated by regarding a edge bridge as a root, and a forwarding path table is established by sending the enrolling packet; the bridge port except the external port of the bridged network turns off the learning procedure of the source address of the data; when the data packet from the external of the bridged network arrives the bridged network, the data packet is forwarded in the bridged network by regarding the ingress bridge at which the data packet arrive as a root, and at a export the data packet is forwarded out through a external port. The present invention overcomes the problem of the learning of MAC address caused by the asymmetry of the path, and establishes the forward path table fulfilling the shortest path forwarding, and adopts the path forwarding technique with the high efficiency to fulfill the superiority performance proved by the bridged network as the operation Ethernet.

Description

 Data processing method, bridge and bridge network in bridged network

 The present invention relates to the field of communications, and in particular, to a data processing method in a bridge network, a bridge, and a bridge network. Background technique

 In the traditional Ethernet bridge interconnected network, since the same tree is used for packet forwarding in the same broadcast domain, in general, the data packet cannot be forwarded according to the shortest path, and the data is concentrated in a certain Transfer on some links.

 In order to enable the bridge to forward data according to the shortest path, the shortest path bridge project team of the International Standards Organization (IEEE) and the TRILL working group of the International Standards Organization (IETF) are currently conducting research in two ways.

 The initial idea of the IEEE Shortest Path Bridge project team is: still use the spanning tree to forward all packets, generate a tree for each bridge as the root, and in order to forward packets according to the shortest path, whether it is broadcast packet\multicast data Packet\unknown data packet, or unicast data packet. During the forwarding process of the data packet, the first bridge that arrives at the data packet is used as the root for data packet forwarding (also called: the tree rooted at the entrance bridge). Forward). This method actually means: Multiple trees are used for packet forwarding in the same broadcast domain.

 The method of the IETF TRILL working group is: The bridge has a router-like route calculation and forwarding function (also called the bridge is a RBridge), which can form a "routing bridge network topology" based on the link state protocol and can calculate The shortest path to any destination RBridge. For unicast packets, it can be forwarded by the shortest path based on the egress RB address corresponding to the packet (rather than based on the final destination address, ie not based on the destination host's MAC address). In addition, the RBridge network can calculate the spanning tree according to the network topology, and broadcast packets\multicast packets\unknown packets are forwarded along the tree.

The reason why the IEEE uses the different methods from the IETF TRILL working group to implement the shortest path bridge is the cause. It is: It is considered that TRILL increases the processing of TTL in order to avoid the loop, which leads to a large hardware change, and only the transformation on the spanning tree has less impact on hardware changes.

 Currently IEEE is in the shortest path bridge study, which proposes two schemes around spanning tree:

(1) Use the original spanning tree protocol spanning tree: RSTP/MSTP;

 (2) Establish a spanning tree using a link state protocol.

 If the link state protocol is used to modify the Ethernet, in order to complete the functions of the existing fast spanning tree protocol and multiple spanning tree protocols, the link state protocol needs to do a lot of adaptation work, so the workload is not too small. Therefore, the IEEE currently does not determine which solution is a mandatory option. From the current IEEE research, it has carried out many studies on the scheme (1).

 How do you forward data when a tree created using the spanning tree protocol is created? If the link state protocol is used to establish the spanning tree, since each bridge knows the entire network topology, it creates a spanning tree that includes the entire tree, so it knows the tree branch where any bridge is located, so once the tree is generated it knows How to forward data. If you use the original spanning tree protocol to create a tree, each bridge can only know that one tree passes through the root port and designated port of the bridge. It does not know the information of the entire tree. Therefore, if the portal is the root, the unicast packet is used. When forwarding, it does not know the tree branch to which the destination address is accessed. Therefore, the forwarding path needs to be obtained through address learning.

 However, each tree is generated independently, which results in a path a from the edge bridge A to the edge bridge Z (with A as the root). The path z from the edge bridge Z to the edge bridge A (with Z as the root) is inconsistent. Therefore, the forwarding mechanism rooted at the ingress bridge will result in the inability to obtain a normal forwarding path using the usual source address learning method. This is actually due to the difficulty of address learning due to path asymmetry. The reason why the above two paths are inconsistent is because: When two or more (including two) equivalent paths occur, different trees are independently generated, and different blocking methods are used for the equal path to cause inconsistency in path selection.

In order to enable the service provider network to avoid storing and processing too many MAC addresses to improve the performance of the service provider network, Nortel has proposed a technical solution with the patent number "US 2004/0184408", using MAC in MAC mechanism. The basic technical content is: When the user data packet arrives at the service provider bridge (ie, the border device of the service provider network), the service provider re-encapsulates an external MAC header, and the external MAC header contains the source service provider address and destination. Service provider Address. In order to encapsulate the external header, the service provider border device needs to utilize the received source address of the data packet with the external MAC header for mapping learning of the user's destination MAC address and the service provider's destination address. The service provider address here refers to the address inside the service provider network. This technology enables the core bridge of the service provider network to mask out the customer MAC address.

 The technical solution of the prior art one:

 In the shortest path forwarding system with the entry root, in order to overcome the learning obstacle caused by path asymmetry, the IEEE proposed (by Cisco) PATH vector symmetric path generation method (aq-nfinn-shortest-path-0905.pdf), which The purpose of this is to ensure that the path a from the edge bridge A to the edge bridge Z coincides with the path z from the edge bridge Z to the edge bridge A. To implement the method, it is predetermined to use the N-bit PATH vector in the process of establishing the bridge using MSTP, N cannot be smaller than the number of bridges in the network, and each bridge is assigned a fixed bit.

 In order to be compatible with the original MSTP protocol of MSTP, it is currently required to replace the Bridge ID in {Root ID, Root Path Cost, Bridge ID, Port ID} in the priority vector with the PATH vector, so the bit of the vector The number is 64.

 In addition, an algorithm (or static configuration) is used in advance to ensure that the cost of the link is reversed. During the establishment of multiple spanning trees, the PATH vector is created and propagated as follows: Each bridge initializes an empty PATH vector as the root of the tree and adds the vector to the corresponding BPDU message in the root of the tree.

 When a PATH vector is propagated to a bridge, if the bridge can determine that the port receiving the BPDU is the root port of the corresponding tree of the BPDU according to the unique minimum root cost, it will be assigned to itself in the PATH vector contained in the BPDU. Fill in the location 1 and store the vector locally, then continue to propagate the vector to the non-root port; otherwise, if the bridge calculates the two shortest equivalence root costs of the corresponding tree, it is processed as follows: Take the two, etc. The two PATH vectors corresponding to the valence root (and let the PATH vector be set to 1 for the bit of the bridge), determine the path corresponding to one of the PATH vectors according to a prescribed criterion. For example, two vector values are converted into an N-bit integer, and the path corresponding to the vector with the large value is blocked.

Through the above method, different trees can be guaranteed in the process of generating, when an equivalent path occurs, different The spanning tree protocol process can determine the blocked path according to the corresponding two equivalent PATH vectors and adopt the same blocking criterion, thereby ensuring the positive and negative paths between the two points when forwarding data using different trees. Consistency (ie symmetry).

 Disadvantages of prior art one:

 Since the number of bits in the PAHT vector is proportional to the network size, the number of bits in the PATH vector is very much related to the scalability of the network, so this method is not conducive to network expansion. For the compatibility of the protocol, the current number of bits in the PATH vector is 64, which obviously does not meet the scalability requirements.

 In addition, since the scheme can only be used in the case of a point-to-point link, the link to the multi-point access still causes path asymmetry.

 The technical solution of the prior art 2:

 NEC proposed a technical solution for Ethernet-optimized packet forwarding method. The patent number is US 2003-642480. The patent name is: network system, spanning tree configuration method, spanning tree configuration node, spanning tree configuration program, one of which is basic. The technical point is:

 (1) Fast forwarding of data packets by inserting a TAG forwarding flag at the ingress bridge; (2) By forwarding data using a tree rooted at the destination (egress bridge), the data packet can be routed along the shortest path to the destination.

 For traditional Ethernet, a user packet is forwarded with a MAC address on the path it goes through, and one goal that the patent wants to achieve is to replace the MAC address with a TAG tag with a small number of bits.

However, how to insert TAG, how to replace the MAC on the path that the user data packet goes through with TAG, the patent does not give a method. For this reason, NEC then proposes a new technical solution, patent number: 003-642481, patent name For: network system, learning bridge node, learning method and its programs. A basic problem it solves is: Being able to learn in the tree topology of path asymmetry that the network ingress bridge can learn the forwarding tag TAG (the TAG and a MAC MAC address association) used to forward the packet to the destination. To this end, it proposes a basic method: The bridge node periodically sends the learning packet in the opposite direction to the user packet path, including the TAG and its associated source address in the learning packet, and the source address is derived from a source address buffer table. . The method can solve the learning of the forwarding tag TAG caused by the path asymmetry. In the transmission of the bridge learning packet, other bridge nodes along the learning path can learn to forward the TAG. In fact, the traditional bridge learning method "source address learning method" is obviously also a reverse learning method, but since the packet forwarding uses a public tree, the path symmetry of the tree itself does not hinder learning, but when using different tree forwarding, the path Asymmetry hinders learning. In order to overcome this, the patent proposes to let the bridge actively send the reverse learning package, but the patent does not learn from the source address, but learns the TAG associated with the source address.

 Disadvantages of prior art 2:

 The program does not describe the "How to choose the opposite path to spread the learning package", and this is the key to a problem. The patent does not give a clear description of how to treat the original user packet address learning process. The system uses TAG for forwarding and is therefore not compatible with existing technologies that currently use MAC addresses for forwarding data.

 The system TAG learning is related to the source MAC address of a cache. Therefore, when this technology is adopted in the carrier Ethernet, the number of client MAC addresses is large, which will bring difficulties to the TAG allocation. A large number of TAGs will also be The carrier network creates a heavy load. Summary of the invention

 The present invention provides a data processing method, a bridge, and a bridge network in a bridge network, which are used to solve the MAC address learning problem caused by the path asymmetry existing in the prior art.

 The invention includes:

 A data processing method in a bridge network, where the bridge network is connected through a bridge, including:

 Generating a tree rooted at each edge bridge of the bridged network, and transmitting a registration packet to establish a forwarding path table for each tree;

 When a packet from outside the bridge network arrives at the bridge network, the entry bridge to which the packet arrives is the root, the packet is forwarded according to the forwarding path table in the bridge network, and the data packet is sent out through the external port at the egress bridge.

A bridge, comprising: a control protocol unit, configured to establish a forwarding path table, where the forwarding path table is a forwarding path table of the spanning tree rooted at the ingress bridge;

 a forwarding path table storage unit, configured to store the forwarding path table;

 a packet forwarding unit, configured to forward the received data packet according to the forwarding path table.

 A bridged network, connected by a bridge, the bridge includes:

 a control protocol unit, configured to establish a forwarding path table, where the forwarding path table is a forwarding path table of the spanning tree rooted at the ingress bridge;

 a forwarding path table storage unit, configured to store the forwarding path table;

 a packet forwarding unit, configured to forward the received data packet according to the forwarding path table.

 A data processing method in a bridge network, where the bridge network is connected through a bridge, including:

 Generating a tree rooted at each edge bridge, and the bridge node on the tree establishes a forwarding path table about the root bridge by sending a registration packet;

 When a packet from outside the bridged network reaches the bridged network:

 For multicast packets, the tree rooted along the entry bridge to which the packet arrives is forwarded within the bridged network; or

 For a unicast packet, the tree rooted along the destination egress bridge that the packet leaves the bridging network arrives in the bridge network;

 The packet is sent out through the external port at the egress bridge.

 A bridge, comprising:

 a control protocol unit, configured to establish a forwarding path table, where the forwarding path table is a forwarding path table of a spanning tree rooted at each edge bridge;

 a forwarding path table storage unit, configured to store the forwarding path table;

 The packet type judging unit is configured to judge the received packet type, and select a forwarding manner according to the packet type.

 A bridged network, connected by a bridge, the bridge includes:

a control protocol unit, configured to establish a forwarding path table, where the forwarding path table is for each side a forwarding path table of the spanning tree along the bridge;

 a forwarding path table storage unit, configured to store a forwarding path table;

 The packet type judging unit is configured to judge the received packet type, and select a forwarding manner according to the packet type.

 The winter invention overcomes the problem of MAC address learning caused by path asymmetry, establishes a forwarding path table that satisfies the shortest path forwarding, and can adopt an efficient path forwarding technology to satisfy the superior performance that the bridge network can provide as a carrier Ethernet. DRAWINGS

 1 is a schematic structural diagram of a bridge network according to the first aspect of the present invention;

 2 is a schematic structural diagram of a bridge according to the first aspect of the present invention;

 3 is a schematic structural diagram of a control protocol body unit according to the first aspect of the present invention;

 4 is a schematic diagram of a process of establishing a forwarding path table according to the first solution of the present invention;

 Figure 5 is a schematic structural view of the second embodiment of the present invention;

 6 is a schematic structural diagram of a bridge according to the second aspect of the present invention;

 7 is a schematic structural diagram of a data packet type determining unit in the second solution of the present invention;

 FIG. 8 is a schematic structural diagram of a control protocol body unit in the second embodiment of the present invention. detailed description

 Specific embodiments of the present invention are described below in conjunction with the drawings.

 The solution of the present invention is carried out around the first scheme of the IEEE: a shortest path forwarding method for researching data in a plurality of spanning trees established using a spanning tree protocol, wherein a packet forwarding method using an ingress bridge as a root is to be studied. Option One:

The first solution is to establish an entry-origin-based shortest path forwarding system in a bridged network, including the following: In the bridge network, a tree is generated with each edge bridge as the root.

 In addition to bridging the external port of the network, for other bridge ports, because the control protocol unit is responsible for establishing the forwarding path table, in order to avoid conflicts with the forwarding path table established by the original packet source address learning process, it is necessary to close the original Packet source address learning function.

 The forwarding path table process is established by using a control protocol to establish a forwarding path table for each tree.

 Here, the control protocol is used to establish a forwarding path table process, and the control protocol forwarding path table establishing process can control the bridge nodes of the bridged network and establish a corresponding forwarding path table.

 In the above-mentioned bridge network, when data from outside the bridge network arrives at the bridge network, the first bridge (ie, the entrance bridge) that arrives at the data packet forwards the data packet in the bridge network, and if multicast Or the broadcast mode forwards the data packet, and the sent data packet carries the root bridge address information.

 In the edge bridge, the existing MAC in MAC technology can be used to perform mapping association learning between the two destination addresses according to the MAC address of the external header of the data packet and the MAC address of the internal header.

 When using this scheme, the bridged network can adopt the existing MAC in MAC mechanism. At the ingress bridge, before the data is sent to the internal port, the packet has been added with an external MAC header. The source address of the MAC header is the bridge of the entrance bridge. The address or the external port address of the ingress bridge. The destination address of the MAC header can be the bridge address of the egress bridge or the external port address of the egress bridge. The outlet of the bridge network needs to remove the external header of the package. In this scheme, the address format and the number of occupied bits of the external MAC header are allowed to be different from the internal MAC header.

 The forwarding path table establishment process in the above solution is as follows:

 After a tree is generated, the control protocol body unit of each bridge node except the root bridge node actively sends a registration packet to the root port of the tree, and one registration packet carries one or more registration packets that need to be registered. The network topology element address of the bridge (the MAC address of the external port of the bridge or the bridge MAC address of a bridge). For the convenience of presentation, these addresses are also referred to as registered addresses. The destination MAC address of the registration packet is the specific control protocol body unit multicast address. The bridge that initiates registration here is called the source bridge.

The intermediate bridge receives the transmitted registration packet and hands the packet to the control protocol body unit. Get one or more forwarding entries based on the registered address in the registration package and the associated registration packet receiving port: MAC address (corresponding registered address), port. The intermediate bridge adds the forwarding entry to the forwarding data table. The bridge then proceeds to forward the registration packet to the root port of the tree.

 After receiving the transmitted registration packet, the root bridge hands the packet to the control protocol unit. The control protocol unit registers the registered address and the associated registration packet receiving port, thereby obtaining one or more forwarding entries: destination MAC address (source address of the symptom), and sending port. The bridge adds the forwarding entry to the forwarding data table.

 The control protocol body unit involved in the foregoing solution may be a logic control unit disposed on the bridge, and the set of logical control information is used to control the bridge to establish the forwarding path table, and the forwarding path table is Summarize to the forwarding database.

 Further, after receiving the registration packet, the root bridge may send the verification packet to the source bridge that sends the registration packet in the reverse direction; if the source bridge sending the registration packet does not receive the valid verification packet within a certain period of time, the method repeats Send the corresponding registration package, otherwise stop sending. The verification process of the control packet can also be performed between the bridge that sends the adjacent registration packet and the bridge that receives the registration packet.

 Further, a bridge can send a control registration packet according to other needs, such as management configuration requirements, and perform related control on the sent registration packet.

 The above process is actually the registration of the bridge network element address, that is, after receiving a registration packet, the bridge forms a forwarding entry according to the registered address and the receiving port. Further, the "unregistered" registration package can be sent as needed. After receiving an unregistered registration package, the bridge deletes a forwarding entry based on the registered address and the receiving port. As with the previous registration package process, the same control is required for deregistration.

 The above process can be further optimized: If a bridge is a core node (no external port), it does not need to send the registration packet actively. If you do this, when a bridge finds it becomes an edge bridge, it should actively send the registration packet.

 When the network topology changes, delete the original forwarding path table and regenerate the new tree. Then repeat the above steps.

The sending of the above registration packet may also require no verification method, but the edge bridge periodically sends the registration packet, and the control protocol body unit has a corresponding aging mechanism for the registered address (the same as the traditional Bridge aging mechanism).

 Using the shortest path forwarding system described above, when the data packet arrives through the external port, it needs to encapsulate an external MAC header for the data packet, according to the mapping relationship between the destination MAC address of the data packet and the egress bridge address or the egress bridge external port address. Determine the egress bridge address or the egress bridge external port address and encapsulate the corresponding external MAC header destination address, and then use the formed forwarding path table to perform packet forwarding in the bridged network. For packets that cannot determine the destination address of the external MAC, broadcast or multicast can be performed.

 FIG. 1 is a schematic diagram of a new bridge structure proposed by the present invention and a schematic diagram of a bridge network based on the bridge. In the network system, a tree is generated with each edge bridge as a root, and an edge bridge is generated. With the MAC in MAC encapsulation function, a process of creating a forwarding path table can be initiated, and the core bridge can control the registration packet to establish a forwarding path table. After the packet from the external port arrives at the bridged network, the forwarding path table of the tree rooted at the ingress bridge in the bridged network is forwarded.

 As can be seen from the figure, the bridge network is connected through a bridge node, and the bridge also includes:

 a control protocol unit, configured to establish a forwarding path table, where the forwarding path table is a forwarding path table of the spanning tree rooted at the ingress bridge;

 a forwarding path table storage unit, configured to store a forwarding path table;

 The packet forwarding unit is configured to forward the received data packet according to the forwarding path table.

 The control protocol body unit further includes:

 A registration packet sending unit, configured to send a registration package to a root port of the tree.

 The registration packet sending unit may send a registration packet to the root port of the tree to form a forwarding path table. The registration packet processing unit processes the registration packet sent by other bridges to establish a forwarding path table.

 The registration packet processing unit is configured to receive the registration packet, and extract registration packet carrying information to form a forwarding path table.

 a confirmation packet sending unit, configured to send a confirmation packet to a bridge that sends the registration packet after the registration packet processing unit receives the registration packet;

The confirmation packet sending unit is located in a control protocol body unit of the bridge receiving the registration packet, and is used for The receiving status of the registration packet is fed back.

 The confirmation packet reception determining unit is configured to set a time threshold for receiving the verification packet, and if the verification packet is not received within the set time threshold, resend the registration packet to the bridge receiving the registration packet.

 The confirmation packet receiving determining unit is configured to determine whether the initiated registration packet normally arrives at the bridge that receives the registration packet.

 In the above solution, the same bridge may be provided with multiple of the above functional units at the same time, which depends on the location of the bridge in the network. For example, if a registered bridge is initiated, it may also be the receiver of the registration packet in another registration process, so that the registration packet processing unit can be set in its control protocol unit, and the packet transmission unit can be confirmed.

 2 and 3 are detailed structural diagrams of the control protocol body unit of the bridge that initiates registration in the scheme and the bridge that receives the registration.

 As shown in FIG. 4, the process of initiating a forwarding path table establishment is described. When the edge B and A know that the tree rooted at C is generated, the process of creating a forwarding path table is actively created, and the registration packet is sent. The registration packet is always transmitted along the root port of the tree, and the control protocol body unit that receives the registration packet is based on the edge. The address of the bridge ^ A and the receiving port establish a forwarding entry. In order to enable the control protocol body unit to process the received control registration packet, the receiving destination address of the registration packet shall be the control protocol body unit multicast address. After receiving the registration packet and establishing the forwarding path entry, the root bridge C sends a confirmation message to the source bridge. Fang Zhong 2:

 When data is forwarded by the shortest path using different trees in the same broadcast domain, the forwarding path table cannot be established by the traditional address learning method due to the asymmetry of the path. If we can build a bridged network, the network does not need to learn the forwarding path table (except for the user-facing port), and the problem is solved. We can establish a shortest path forwarding system combining the ingress root bridge and the egress root bridge to achieve such a function as follows:

 When using this method, in addition to the external port of the bridge, for other bridge ports, the original user packet source address learning process needs to be closed.

In this scheme, multicast packets are submitted with the entrance bridge as the root (can contain broadcast packets\multicast) Packets\unknown packets, etc.), submit unicast packets with the exit bridge as the root.

 After the tree is generated, in addition to the root bridge, each bridge establishes a forwarding path table that does not depend on the user data flow for the tree passing through the bridge: the root bridge MAC address or the root bridge external port MAC address, the root port ( The number of root ports corresponding to an address is not allowed to exceed one. The forwarding path table can be automatically established by the data plane, or can be configured by the control protocol body unit, or manually configured.

 The scheme can use the existing MAC in MAC technology to learn the mapping association between the MAC address of the external header of the packet and the MAC address of the internal header, and obtain an address mapping table.

 In this scheme, the bridge network needs to adopt the following encapsulation mechanism: In the ingress bridge, before the data is sent to the internal port, the data packet adds an external MAC header, and the source MAC address contained in the external MAC header is the address of the ingress bridge or the ingress bridge. The external port address, the destination address of the external MAC header is the address of the egress bridge or the external port address of the egress bridge. The outer MAC header of the package needs to be removed at the exit of the bridged network. The address format and occupied bits of the external MAC header are allowed to be different from the internal MAC header.

 If the packet to be sent to the internal port on the ingress bridge adopts the encapsulation mode: Encapsulate the local external access port address, you need to configure the bridge address information of the local access port to configure other bridges.

 When the data packet arrives at the ingress bridge, the type of the data packet is determined by using the address mapping table information. If the data packet is \ broadcast packet\unknown data packet\multicast data packet, the tree with the entry root is used in the bridge network for packet forwarding. If it is a unicast packet, it is forwarded in the bridge network with the egress bridge as the root. When broadcasting or multicast forwarding packets, the encapsulated packets indicate the root of the forwarding.

 Obviously in this system, packet forwarding can be done without the usual address learning inside the bridged network, because for unicast packets, the data is always forwarded towards the root port. The system also implements the shortest path forwarding of packets.

 As shown in Figure 5, it is a schematic diagram of the structure of the bridged network in Option 2. As can be seen from the figure, the bridged network is connected through the bridge node, and the intermediate bridge and the edge bridge are wrapped.

As shown in FIG. 6 , it is a schematic structural diagram of the solution bridge. As shown in the figure, the bridge includes: a control protocol body unit, configured to control establish a forwarding path table, where the forwarding path table is a bridge with each edge a forwarding path table for the spanning tree of the root; a forwarding path table storage unit, configured to store a forwarding path table;

 The packet type judging unit is configured to judge the received packet type, and select a forwarding mode according to the packet type.

 As shown in FIG. 7, the packet type determining unit further includes:

 a unicast packet forwarding unit, configured to forward the unicast data packet by using an egress bridge as a root;

 And a multicast packet forwarding unit, configured to forward the broadcast or multicast data packet and the unknown data packet by using an ingress bridge as a root.

 As shown in FIG. 8, in the network, the control protocol body unit further includes:

 The registration packet processing unit receives the registration packet sent by the other bridges and establishes a forwarding path table; the registration packet sending unit is configured to send the registration packet to the designated port of all the bridges to be forwarded in the tree. The verification packet sending unit is configured to send a confirmation packet to the bridge that sends the registration packet after receiving the registration packet sent by the other bridge.

 The confirmation packet reception determining unit is configured to set a time threshold for receiving the verification packet, and if the verification packet is not received within the set time threshold, resend the registration packet to the bridge receiving the registration packet.

 6 and FIG. 8 are schematic diagrams showing the structure of a bridge and a packet type judging unit that initiate registration in the scheme, and it can be seen that the bridge is provided with a control protocol body unit, a forwarding path table storage unit, and a packet type judging unit. Network element. The packet type judging unit is provided with a unicast packet forwarding unit and a multicast packet forwarding unit.

 In the bridged network shown in Figure 5, a tree is generated with each edge bridge as the root, and the figure shows the tree generated by the bridge B as the root. When the data reaches the ingress bridge A and judges that the egress bridge of the data packet is B, the data packet is forwarded toward the root port direction; when the data arrives at the ingress bridge B and the data packet is broadcasted when judging the data packet, the data is The packet is broadcast along a tree rooted at B. third solution:

Both scheme 1 and scheme 2 are applied in MAC in MAC, and the solution of the invention can also be applied to other network mechanisms, if MAC in MAC mechanism is not used or MAC is only used for some external ports. In the MAC mechanism, we can establish the following shortest path system in a bridged network, and establish a forwarding path table for the registered address by the control protocol body unit:

 1. Generate a tree with each edge bridge as the root, use the tree with the entry root to forward the broadcast packet \ multicast packet \ unknown packet, and use the tree with the exit root to forward the unicast packet.

 2. When using this method, in addition to the external port, for other bridge ports, the original user packet source address learning function needs to be turned off.

 3. The control protocol body unit of each edge bridge initiates a registration protocol registration process controlled by the control protocol according to the user source address it accesses to establish a forwarding path table. The registered address is derived from the user source address obtained by the address learning when the user arrives at the edge bridge, and the network topology element address located on the bridge; the user address follows the original address to learn the aging process.

 In the third scheme, the registration address registration process controlled by the control protocol body unit follows the following steps: Each edge bridge selects a tree in which it is located, and sends a registration packet to all designated ports of the tree, and the destination address of the registration packet may be one. A specific multicast address. In addition, a registration packet contains: a root bridge address, one or more registered addresses that need to be registered; the process can be further optimized to: The registration packet is not sent to the bridge external port.

 After receiving the registration packet, each bridge obtains one or more forwarding path entries according to the receiving port and the registered address in the registration packet. The forwarding entry includes: the registration address, the port, and continues according to the tree root bridge indicated by the registration package. Broadcast along the tree, sending the registration packet to a designated port other than the non-receiving port; the process can be further optimized to: The registration packet is not sent to the external port.

 The sending of the foregoing registration packet may be performed by using a periodic discovery mechanism or a verification mechanism. The periodic sending mechanism is: the root bridge node periodically sends the registration packet; the bridge node needs to obtain a corresponding aging mechanism for the forwarding entry established by the bridge node. .

 The confirmation sending mechanism is: The bridge receiving the registration packet sends a confirmation message to the bridge that sends the registration packet after receiving the registration packet, and if the bridge sending the registration packet does not receive the confirmation packet within the set time threshold, then A registration package is sent to the bridge that receives the registration packet.

Further optimization can be made as follows: When the tree topology changes, the edge bridge immediately sends a registration packet according to the address it accesses, and the processing of the registration packet is the same as the above steps. Further, the data packet forwarding of the data plane can be optimized as follows: When the topology changes, the edge bridge needs to wait for a certain period of registration packet processing, and then sends a unicast user data packet to avoid a large number of broadcasts of the data packet to the network. influences.

 The address registration process in scenario 3 can also be changed to the following steps:

 Each edge bridge selects a tree in which it resides, periodically sends a registration packet to all designated ports of the tree. The destination address of the registration packet can be a specific multicast address. In addition, a registration packet also contains: Bridge Address, one or more registered addresses, registration type; registration types include: Add, Delete; The process can be further optimized to: The registration packet is not sent to the port.

 After each bridge receives the registration packet, if the registration type is: Increase, one or more forwarding entries are obtained according to the receiving port and the address in the registration packet. The forwarding entries include: registration address, port; if the registration type is: Delete , according to the address in the receiving port and the registration package, delete the original corresponding forwarding path table. Then, according to the edge bridge indicated by the registration packet, continue to broadcast along the tree rooted at the edge bridge, that is, the registration packet is sent to the designated port other than the non-receiving port; the process can be further optimized to: The registration packet is not sent to the external port .

 Further optimization can be made as follows: When the tree topology changes, the edge bridge immediately sends a registration packet according to the address it accesses, and the processing of the registration packet is the same as the above steps.

 Further, the data packet forwarding of the data plane can be optimized as follows: When the topology changes, the edge bridge needs to wait for a certain period of registration packet processing, and then sends a unicast user data packet to avoid a large number of broadcasts of the data packet to the network. influences. Option 4:

 If the MAC in MAC mechanism is not used or only the MAC in MAC mechanism is used for some external ports, the following shortest path system can be established in a bridged network, and the forwarding protocol table for the user address is established by the control protocol:

1. In a bridged network, a tree is generated with each edge bridge as the root. When the data from outside the bridged network reaches the bridged network, the first bridge (ie, the entrance bridge) that arrives at the packet is the root of the tree. Forward packets within the bridged network. 2. When using this method, in addition to the external port, for other bridge ports, the original user data packet source address learning function needs to be turned off.

 3. Each edge bridge initiates an address registration process based on the registered address it accesses to establish a forwarding path table. The registered address is derived from: the user source address obtained by the address learning when the user data packet arrives at the edge bridge, and the network topology element address located on the bridge; the user address follows the original address learning aging process.

 The address registration process follows the following steps:

 The edge bridge sends a registration packet to each tree in which the edge bridge is located (where the edge bridge is not the root of the tree). The registration packet address is a specific multicast address used. In addition, a registration packet also contains: Address, one or more registered addresses; the message is forwarded along the root port of the specified tree.

 After receiving the registration packet, each bridge obtains one or more forwarding entries according to the address in the receiving port and the registration packet. The forwarding entry includes: the registration address, the port, and then the tree root bridge indicated by the registration package, continuing along The root port of the tree corresponding to the root bridge forwards the registration packet.

 The transmission of the above registration packet may be sent using a periodic discovery mechanism or a verification mechanism.

 The periodic sending mechanism is: The root bridge node periodically sends the registration packet; the bridge node needs to adopt a corresponding aging mechanism for the forwarding entry it establishes.

 The confirmation sending mechanism is: After receiving the registration packet, the bridge receiving the registration packet sends a confirmation message to the bridge that sends the registration packet, and if the bridge sending the registration packet does not receive the confirmation packet within the set time value, Re-send the registration package to the bridge that receives the packet.

 Further optimization can be made as follows: When the tree topology changes, the edge bridge immediately sends a registration packet according to the registered address it accesses, and the processing of the registration packet is the same as the above steps.

 Further, the data packet forwarding of the data plane can be optimized as follows: When the topology changes, the edge bridge needs to wait for a certain period of registration packet processing, and then sends a unicast user data packet to avoid broadcast of a large number of data packets to the network. influences.

 The above address registration process is also changed to the following steps:

The edge bridge sends a registration packet for each tree in which the edge bridge is located (the edge bridge is not the tree root of the tree). The destination address of the message is a specific multicast address. In addition, a registration packet also contains: 06 002918 Bridge address, one or more registered addresses, registration type; registration types include: Add, Delete; The message is forwarded along the root port of the specified tree.

 After each bridge receives the registration package, if the registration type is: increase, 'the one or more forwarding items are obtained according to the registration port and the registration address in the registration package. The forwarding items include: registration address, port; if the registration type is : Delete, according to the registered port and the registered address in the registration package, delete the original corresponding forwarding item: registration address, port. Then, according to the tree root bridge indicated by the registration package, continue to forward along the root port of the tree corresponding to the tree root bridge.

 Further optimization can be made as follows: When the tree topology changes, the edge bridge immediately sends a registration packet according to the registered address it accesses, and the processing of the registration packet is the same as the above steps.

 Further, the data packet forwarding of the data plane can be optimized as follows: When the topology changes, the edge bridge needs to wait for a certain period of registration packet processing, and then send a unicast data packet to avoid the impact of a large number of data packet broadcasts on the network. .

 The process of the present invention establishes a forwarding path table, which can close the original data plane address learning function and reduce the burden of hardware processing.

 Since the control protocol body unit can establish a forwarding path table only for the bridge or bridge port address within the bridge network, the forwarding path table establishment process only performs the generation or change of the bridge network topology, and therefore the number of MAC addresses in the forwarding path table creation process. Greatly reduced, the time taken to establish the forwarding path table is also greatly shortened.

 The forwarding path table may be established for the internal network topology element address of the bridge network. After the internal topology changes, the forwarding path table for the network topology element address is quickly established in the bridge network, so that the topology is not changed. Broadcast of user data packets.

 Since the technical solution overcomes the learning difficulties caused by the path asymmetry tree, and has the above-mentioned considerable advantages, even in the symmetric tree system generated by using the PATH vector, we can still use the technical solution to complete the forwarding path table. Established, and in addition to the edge bridge, there is no need to engage in an address learning process based on the user data stream in the data plane.

In the embodiment of the present invention, the control protocol (spanning tree protocol) is responsible for establishing the packet forwarding path table, and the original data plane address learning process can be closed, the software upgrade is easy, and the hardening is reduced. The burden of processing.

 It is apparent that those skilled in the art can make various modifications and variations to the invention without departing from the spirit and scope of the invention. Thus, it is intended that the present invention cover the modifications and variations of the inventions

Claims

Rights request A data processing method in a bridge network, wherein the bridge network is connected through a bridge, and is characterized by:  Generating a tree rooted at each edge bridge of the bridged network, and transmitting a registration packet to establish a forwarding path table for each tree;  When a packet from outside the bridge network arrives at the bridge network, the entry bridge to which the packet arrives is the root, the packet is forwarded according to the forwarding path table in the bridge network, and the data packet is sent out through the external port at the egress bridge.  2. The method of claim 1 wherein said data packet is encapsulated with an external address at the ingress bridge and the outer address of the encapsulation is decapsulated at the egress bridge.  3. The method according to claim 1, wherein the forwarding path table is established, and the method comprises the following steps:  A. After the tree is generated by the edge bridge, the bridge on the tree sends a registration packet to the root port of the tree to initiate registration, where the registration packet carries the source address, the destination address, and the registered address information.  B. The bridge receiving the registration packet, according to the registered address information and the receiving port, after obtaining the forwarding item and recording, continuing to forward the registration packet to the root port until the registration packet is forwarded to the Said ^^ port;  C. The root port receives the registration packet, and obtains a forwarding item according to the registered address information in the registration package and records the packet.  4. The method of claim 3, wherein in step A:  The registered address information is:  One or more registered addresses, or  Bridge the external port address of the network, the bridge address of the bridge, or the user MAC address;  The destination address is: a multicast address;  The source address is the originating registration bridge address. 5. The method according to claim 3, wherein in the step B and the step C, The forwarding entry includes: a destination MAC address and a sending port identifier.  The method according to claim 3, further comprising the step of: after receiving the registration packet, the root port sends a confirmation packet to the bridge that initiates registration.  7. The method according to claim 3, further comprising: sending the unregistered packet by the bridge that initiates registration; after receiving the unregistered packet, the registered bridge cancels the registration already performed, and deletes the corresponding Forwarding item.  The method according to claim 3, wherein when the network topology changes in the bridge network, the bridge of the bridge network deletes the original forwarding path table; and when the tree is regenerated, Re-form a new forwarding path table.  9. The method of claim 3 wherein said step A is performed periodically. 10. The method of claim 1, wherein the packet source address learning function is turned off except for bridging other ports of the network external port.  11. A bridge, characterized by comprising:  a control protocol unit, configured to establish a forwarding path table, where the forwarding path table is a forwarding path table of the spanning tree rooted at the ingress bridge;  a forwarding path table storage unit, configured to store the forwarding path table;  a packet forwarding unit, configured to forward the received data packet according to the forwarding path table.  The bridge according to claim 11, wherein the control protocol body unit further comprises:  a registration packet processing unit, configured to receive a registration packet sent by another bridge and establish a forwarding path table; and a registration packet sending unit, configured to send a registration packet to a root port of the tree.  The bridge according to claim 12, wherein the control protocol body unit further comprises:  a confirmation packet sending unit, configured to send a confirmation packet to a bridge that sends the registration packet after the registration packet processing unit receives the registration packet; a confirmation packet receiving determining unit, configured to set a time threshold for receiving the verification packet, and if the bridge that sends the registration packet does not receive the confirmation packet within the set time threshold, re-registering with the receiving The bridge of the packet sends the registration packet.  A bridge network, connected by a bridge, wherein the bridge includes: a control protocol body unit, configured to establish a forwarding path table, where the forwarding path table is a forwarding tree with an entry bridge as a root Path table  a forwarding path table storage unit, configured to store the forwarding path table;  a packet forwarding unit, configured to forward the received data packet according to the forwarding path table.  The network according to claim 14, wherein the control protocol body unit further comprises:  a registration packet processing unit, configured to receive a registration packet sent by another bridge and establish a forwarding path table; and a registration packet sending unit, configured to send a registration packet to a root port of the tree.  The network according to claim 15, wherein the control protocol body unit further comprises:  a confirmation packet sending unit, configured to send a confirmation packet to a bridge that sends the registration packet after the registration packet processing unit receives the registration packet;  The confirmation packet reception determining unit is configured to set a time threshold for receiving the verification packet, and if the verification packet is not received within the set time threshold, resend the registration packet to the bridge receiving the registration packet.  17. A data processing method in a bridged network, wherein the bridged network is connected by a bridge, and is characterized by:  Generating a tree rooted at each edge bridge, and the bridge node on the tree establishes a forwarding path table about the root bridge by sending a registration packet;  When a packet from outside the bridged network reaches the bridged network:  For multicast packets, the tree rooted along the entry bridge to which the packet arrives is forwarded within the bridged network; or  For a unicast packet, the tree rooted along the destination egress bridge that the packet leaves the bridging network arrives in the bridge network;  The packet is sent out through the external port at the egress bridge. 18. The method of claim 17, wherein the forwarding path table is established, include:  After the tree is rooted on the edge bridge, the bridge is configured with a forwarding entry, and the forwarding entry includes: a destination MAC address and a sending port identifier, where the sending port is a root port of the tree. Or  After the tree with the edge bridge as the root node is generated, the bridges other than the root bridge on the tree establish a forwarding entry, where the forwarding entry includes: a destination MAC address, a sending port identifier, where the destination MAC address is a tree Root bridge MAC address, the send port is the root port of the tree.  The method of claim 18, wherein the establishing of the forwarding path table comprises:  A. After the tree with the edge bridge as the root node is generated, the root bridge on the tree sends a registration packet to all specified ports of the tree, where the registration packet includes a source address, a destination address, and a registered address information. B. After receiving the registration packet, the bridge other than the root bridge in the bridge network obtains the forwarding entry according to the registered address information, and then forwards the registration packet to all designated ports of the tree until the The registration packet described is forwarded to all ports of the tree other than the root bridge port.  The method according to claim 19, wherein, in the step B, the forwarding item includes: a destination MAC address, and a sending port identifier.  The method according to claim 19, wherein in the step A: the registered address information may be one or more registered addresses;  The registered address is an address of an external port of the bridge network or a bridge address or a user MAC address of the root bridge;  The destination address is a multicast address;  The source address is a root bridge address.  The method according to claim 19, further comprising: the root bridge of the tree sends an unregistered packet, and after the bridge receives the unregistered packet, cancels the registration that has been performed, and deletes the corresponding forwarding. item. The method according to claim 19, wherein when the bridge topology changes, the bridge deletes the original forwarding path table; and when the tree is regenerated, the method is re-formed New forwarding path table.  24. The method of claim 19, wherein said step A is performed periodically.  The method according to claim 17, wherein the multicast data packet comprises a multicast data packet, a broadcast data packet, and an unknown data packet.  26. The method of claim 17, wherein the packet source address learning function is turned off except for bridge ports other than the external port of the bridge.  27. A bridge, characterized by comprising:  a control protocol unit, configured to establish a forwarding path table, where the forwarding path table is a forwarding path table of a spanning tree rooted at each edge bridge;  a forwarding path table storage unit, configured to store the forwarding path table;  The packet type judging unit is configured to judge the received packet type, and select a forwarding manner according to the packet type.  The bridge according to claim 27, wherein the packet type judging unit further comprises:  a unicast data packet forwarding unit, configured to forward the unicast data packet to an egress bridge as a root when the received data packet is a unicast data packet;  And a multicast packet forwarding unit, configured to: when the received data packet is a multicast data packet, forward the multicast data packet by using an ingress bridge as a root.  The bridge according to claim 28, wherein the control protocol body unit further comprises:  The registration packet processing unit receives the registration packet sent by the other bridges and establishes a forwarding path table; the registration packet sending unit is configured to send the registration packet to the designated port of all the bridges to be forwarded in the tree. The bridge of claim 29, wherein the control protocol body unit further comprises: a confirmation packet sending unit, configured to send a confirmation packet to a bridge that sends the registration packet after receiving the registration packet sent by the other bridge; The confirmation packet reception determining unit is configured to set a time threshold for receiving the verification packet, and if the verification packet is not received within the set time threshold, the registration packet is resent to the bridge receiving the registration packet.  31. A bridge network, connected by a bridge, wherein the bridge includes: a control protocol body unit, configured to establish a forwarding path table, where the forwarding path table is a spanning tree rooted at each edge bridge Forwarding path table;  a forwarding path table storage unit, configured to store a forwarding path table;  The packet type judging unit is configured to judge the received packet type, and select a forwarding manner according to the packet type.  The network of claim 31, wherein the packet type judging unit further comprises:  a unicast data packet forwarding unit, configured to forward the unicast data packet to an egress bridge as a root when the received data packet is a unicast data packet;  And a multicast packet forwarding unit, configured to: when the received data packet is a multicast data packet, forward the multicast data packet by using an ingress bridge as a root.  The network according to claim 31, wherein the control protocol body unit further comprises:  The registration packet processing unit receives the registration packet sent by the other bridges and establishes a forwarding path table; the registration packet sending unit is configured to send the registration packet to the designated port of all the bridges to be forwarded in the tree. 34. The network of claim 31, wherein the control protocol body unit further comprises:  a confirmation packet sending unit, configured to send a confirmation packet to a bridge that sends the registration packet after receiving the registration packet sent by the other bridge;  The confirmation packet reception determining unit is configured to set a time threshold for receiving the verification packet, and if the verification packet is not received within the set time threshold, resend the registration packet to the bridge receiving the registration packet.