WO2014110986A1 - Procédé d'interconnexion de réseaux trill, dispositif et système - Google Patents

Procédé d'interconnexion de réseaux trill, dispositif et système Download PDF

Info

Publication number
WO2014110986A1
WO2014110986A1 PCT/CN2014/070124 CN2014070124W WO2014110986A1 WO 2014110986 A1 WO2014110986 A1 WO 2014110986A1 CN 2014070124 W CN2014070124 W CN 2014070124W WO 2014110986 A1 WO2014110986 A1 WO 2014110986A1
Authority
WO
WIPO (PCT)
Prior art keywords
edge
identification information
root
distribution tree
forwarding entry
Prior art date
Application number
PCT/CN2014/070124
Other languages
English (en)
Chinese (zh)
Inventor
冀智刚
夏寅贲
宋雪飞
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2014110986A1 publication Critical patent/WO2014110986A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4604—LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462—LAN interconnection over a bridge based backbone
    • H04L12/4625—Single bridge functionality, e.g. connection of two networks over a single bridge
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling

Definitions

  • TRILL NETWORK METHOD, DEVICE, AND SYSTEM This application claims priority to Chinese Patent Application No. 201310027036. 4, entitled “TRILL Network Interconnection Method, Device and System", filed on January 18, 2013. The entire contents of which are incorporated herein by reference.
  • the present invention relates to the field of communications technologies, and in particular, to a TRILL network interconnection method, apparatus, and system.
  • BACKGROUND With the development of network technologies, the size and number of data centers (data centers) are rapidly increasing. In general, DC is interpreted as a "multi-functional building that can accommodate multiple servers and communication devices. These devices are placed together because they have the same environmental requirements and physical security requirements, and are placed for maintenance.
  • the DC consists of multiple servers, switches, and routers.
  • the bridge (Br idge) running the Transatent Interconnection of Lot s of Links (called TRI1) is called the Route Bridge (Route-Br idge), which has routing forwarding.
  • the characteristic bridge device, the network constructed by RB is called TRILL Network.
  • the interconnection between the DCs based on the TRILL is implemented in the following two ways: 1. A plurality of DCs are used as one TRILL Campus 0 , and the routing RBs for forwarding packets between the DCs are managed by the egress RBs of the DCs.
  • Each DC is interconnected as an independent TRILL Campus. If the first host of the first DC needs to broadcast in a certain distribution tree of the second DC, the first RB connected to the first host in the first DC adds a first TRILL packet header to the data frame, first The RB in the DC forwards the data frame to the RB of the first DC as a router according to the information of the first TRILL packet header, and the RB removes the first TRILL packet header, and Message routing to the second The RB of the DC as a router adds a second TRILL header to the root tree of the distribution tree through the distribution tree in the second DC.
  • the prior art because the processing capacity of the router and the storage space are limited, the number of entries of the routing table managed by the router is limited, so the routing range is also limited, and the large-scale interconnection between DCs cannot be satisfied. Since the router manages the routing path between multiple DCs and the routing table is large, its convergence time will increase when the router manages the routing table within a DC. Therefore, the prior art is suitable for small-scale inter-DC interconnections and cannot support large-scale inter-DC interconnection.
  • the DCs of the DCs that send the packets need to decapsulate the packets, and receive DCs of the packets, because the DCs use the respective distribution trees to forward the packets, so that the packets are forwarded between different DCs.
  • the router needs to re-encapsulate the packet.
  • the router needs to allocate a large amount of hardware resources to support packet encapsulation and decapsulation. The packet forwarding efficiency is low. Summary of the invention
  • the embodiment of the present invention provides a TRILL network interconnection method, device, and system, which can solve the problem of low packet forwarding efficiency and inability to support large-scale inter-DC interconnection due to packet encapsulation and decapsulation.
  • the present invention provides a multi-link semi-transparent interconnect TR I LL network interconnection method, where the method includes:
  • the first edge RB of the first data center DC receives the RB identification information sent by the second edge RB of the second DC, where the RB identification information carries the RB identity identifier of the root RB in the second DC and the a combination of second DC identity IDs;
  • the first edge RB establishes a distribution tree forwarding entry according to the RB identification information, so as to send a packet according to the distribution tree forwarding entry.
  • the first edge RB receives the RB identification information that is sent by the second edge RB by using a border gateway protocol BGP.
  • the first edge RB establishes the distribution tree forwarding entry by using a shortest path first algorithm SPF algorithm according to the RB identification information;
  • the first edge RB forwards the RB identification information to other RBs in the first DC, so that the other RB establishes its own distribution tree forwarding item through the SPF algorithm according to the RB identification information.
  • the first edge RB acquires a port number corresponding to the next hop RB, and adds the port number of the corresponding next hop RB to the distribution tree forwarding entry;
  • the other RBs obtain the port number corresponding to the next hop RB, and add the port number of the corresponding next hop RB to the distribution tree forwarding entry established by itself.
  • the RB identifier information sent by the first edge RB of the first data center DC that is received by the second edge RB of the second DC carries:
  • VLAN ID of the virtual local area network, where the VLAN ID is used to identify the root of the first DC
  • the first edge RB receives the extended information sent by the second edge RB, and the extended information is used to describe the root RB of the second DC Correspondence between RB identification information and VLAN ID.
  • the fifth possibility of the first aspect is also provided in a fifth possible implementation manner of the first aspect, the first edge RB Establishing a correspondence between the RB identification information of the root RB in the first DC and the RB identification information of the root RB in the second DC according to the VL AN ID, thereby converting the extended information into a local distribution tree forwarding table item.
  • the present invention provides a multi-link semi-transparent interconnect TRILL network interconnection method, where the method includes:
  • the second edge RB of the second data center DC sends the RB identification information to the first edge RB of the first DC, where the RB identification information carries the RB identity identifier ID of the root RB in the second DC and the A combination of the two DC identity IDs, so that the first edge RB establishes a distribution tree forwarding entry according to the RB identification information, and sends a packet according to the distribution tree forwarding entry.
  • the second edge RB sends the RB identification information to the first edge RB by using a border gateway protocol BGP.
  • the second possible implementation manner of the second aspect is further provided, and the second possibility in the second aspect
  • the RB identifier information sent by the second edge RB to the first edge RB further carries:
  • VLAN ID of the virtual local area network, where the VLAN ID is used to identify a VLAN in which the root RB in the first DC and the tree root RB in the second DC belong to the same; the second edge RB is in the first edge RB And transmitting the extended information, where the extended information is used to describe a correspondence between the RB identification information of the root RB and the VLAN ID of the second DC.
  • the present invention provides a multi-link translucent interconnect TRILL network interconnection device, where the device is a first edge RB in the first data center DC, and the device includes:
  • a receiving unit configured to receive RB identification information that is sent by the second edge RB of the second DC, where the RB identification information carries the RB identity identifier and the second DC identity of the root RB in the second DC Combination of IDs;
  • the processing unit is configured to establish a distribution tree forwarding entry according to the RB identification information received by the receiving unit.
  • the receiving unit is further configured to receive the RB identifier information that is sent by the second edge RB by using a border gateway protocol BGP.
  • the processing unit specifically includes:
  • a calculation subunit configured to establish, according to the RB identification information received by the receiving unit, the distribution tree forwarding entry by using a shortest path SPF algorithm
  • a sending subunit configured to forward the RB identification information received by the receiving unit to other RBs in the first DC.
  • a third possible implementation of the third aspect is also provided, in the third aspect
  • the calculating subunit is further configured to obtain a port number corresponding to the next hop RB, and add the port number of the corresponding next hop RB to the distribution tree forwarding entry.
  • the receiving unit is further configured to receive extended information sent by the second edge RB, where the extended information is used to describe a root RB in the second DC Correspondence between the RB identification information and the VLAN ID.
  • the processing unit is further configured to establish RB identifier information of the root RB in the first DC according to the VLAN ID, and the second DC Correspondence between RB identification information of the RB of the root tree.
  • the present invention provides a multi-link semi-transparent interconnected TRILL network interconnection device, where the device is a second edge RB in the second data center DC, and the device includes: a sending unit, configured to send RB identification information to the first edge RB of the first DC, where the RB identification information carries an RB identity identifier ID and a second DC identity identifier of the root RB in the second DC The combination.
  • the sending unit is further configured to send the RB identifier information to the first edge RB by using a border gateway protocol BGP.
  • the sending unit is further configured to send the extended information to the first edge RB, where the extended information is used to describe a correspondence between the RB identification information of the root RB and the VLAN ID of the second DC relationship.
  • the present invention provides a multi-link semi-transparent interconnect TRILL network interconnection system, the system comprising a first edge RB and a second edge RB.
  • the TRILL network interconnection method, device and system provided by the present invention because the RB identification information received by the first edge RB is a combination of the RB identity identifier ID of the root RB and the second DC identity identifier in the second DC,
  • the distribution tree forwarding entry established by the first edge RB includes a distribution tree forwarding entry for each root RB of the first DC.
  • the first edge RB and the second edge RB in the present invention do not need to decapsulate and encapsulate the packet, as the first edge RB and the second edge RB need to decapsulate and encapsulate the packet.
  • the allocation of hardware resources supporting packet encapsulation and decapsulation can be reduced, and the packet forwarding efficiency is high.
  • the first edge RB and the second edge RB respectively manage the routing tables of the respective DCs in the first DC and the second DC by using the first edge RB or the second edge RB to manage all the routing tables in the first DC and the second DC. Therefore, it can support the interconnection between large-scale DCs.
  • FIG. 1 is a flowchart of a method for interconnecting TR I LL networks according to an embodiment of the present invention
  • FIG. 1 is a flowchart of another method for interconnecting TR I LL networks according to an embodiment of the present invention
  • FIG. 4 is a flowchart of a method for a TRILL network interconnection method according to an embodiment of the present invention
  • FIG. 5 is a structure of a first first edge RB according to an embodiment of the present invention.
  • FIG. 6 is a schematic structural diagram of a second first edge RB according to an embodiment of the present invention.
  • Figure ⁇ is a schematic structural diagram of a third first edge RB in the embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of a first second edge RB according to an embodiment of the present invention.
  • FIG. 9 is a schematic structural diagram of a first TR I LL network interconnection system according to an embodiment of the present invention
  • FIG. 10 is a schematic structural diagram of a fourth first edge RB according to an embodiment of the present invention
  • FIG. 11 is a schematic structural diagram of a second second edge R B according to an embodiment of the present invention.
  • FIG. 12 is a schematic structural diagram of a second TR I LL network interconnection system according to an embodiment of the present invention.
  • the technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. example. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.
  • the structure of the TRILL header is as shown in Table 1.
  • TRILL Ether type is the network type of the TRILL protocol; V is the TRILL version number, currently 0, if the disc is not 0, the packet is discarded; R is the reserved field.
  • M is a multicast identifier, Q means unicast, 1 means multicast;
  • OpLng (0 P _Length) is the length of the TRILL header extension option;
  • Hop is the hop count;
  • Egres s RBr idge Nickname (export RB name) The broadcast is the RB identification information of the RB connected to the server.
  • the Ingres s RBr idge Nickname is the RB identification information of the RB connected to the server. , is used to identify the source RB that adds TRILL ⁇ header to ⁇ .
  • the naming of the root RB, the other RBs, and the next hops mentioned in the following embodiments are named according to the function of an RB in the process of sending a single TRILL packet, and the sending of the single TRILL packet is an entry.
  • the RB name (the first RB identification information of the RB connected to the server) is the starting point, and the exit RB name is used as the termination point. Therefore, the same RB may be used as a root RB or other RB or next hop RB for different ⁇ transmissions.
  • the embodiment of the invention provides a TRILL network interconnection method. As shown in FIG. 1, the method includes:
  • Step 101 The first edge RB of the first data center DC receives the RB identification information sent by the second edge RB of the second DC.
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier.
  • the structure of the RB identification information is: DC ID: RB ID, by combining the DC ID and the RB ID, so that each RB in the first DC and the second DC has unique identification information.
  • the structure of the foregoing RB identifier information may also be: RB ID: DC ID.
  • Step 102 The first edge RB establishes a distribution tree forwarding entry according to the RB identification information.
  • the first edge RB establishes a distribution tree forwarding entry according to the RB identification information, so as to send a packet according to the distribution tree forwarding entry.
  • the first edge RB may receive the received RB identification information.
  • Sending to each RB in the first DC, the first edge RB and the RBs in the first DC are not only configured according to the RB identification information in the first DC, but also based on the distribution tree forwarding entry in the first DC.
  • the RB identification information in the second DC establishes a distribution tree forwarding entry for each root RB in the second DC.
  • the first edge RB After the received RB identification information, the first edge RB generates a topology for the RB identification information in a Link State Database (LSDB), including the following two methods:
  • the first edge RB adds an entry in the LSDB, where the entry is a set of correspondences after the RB identifier of the first edge RB is replaced by the RB identifier information.
  • the RB identification information of the first edge RB is 01: 01.
  • the entries in the LSDB that start with the first edge RB are "01: 01-01: 02" and "01: 01-01: 03".
  • the first edge RB receives the second edge RB and sends the RB identification information, if the received RB identification information is 02: 02, the entry is added: "02: 02-01: 02" and "02: 02-01: 03".
  • the root of the tree can be randomly selected or selected according to preset rules. Select a root RB in the first DC, and then find the root RB as the starting entry in the LSDB. For example: Select the RB with the RB ID of 01: 05, starting with 01: 05. The entries are "01: 05-01: 03" and "01: 05-01: 06". After the first edge RB receives the second edge RB and sends the RB identification information, if the RB identification information received at this time is 02: 02, the entry is added: "02: 02-01: 03" and "02: 02-01: 06".
  • the preset rule may be, but is not limited to, a hash algorithm.
  • the SPF algorithm is combined with the entry in the LSDB to form a distribution tree forwarding entry.
  • the first edge RB After the first edge RB generates a topology for the RB identification information in the LSDB, the first edge RB advertises the new entry in the LSDB, that is, the LSPs, in the first DC.
  • the second edge RB of the second DC may obtain the RB identification information of each root RB in the first DC.
  • the interconnection of the first DC and the second DC can be implemented.
  • the first RB connected to the first host in the first DC adds a TRILL packet header to the data frame, where the TRILL
  • the entry RB name in the header is the name of the first RB connected to the first host in the first DC
  • the egress RB name is the RB identification information of the RB in the second DC that is the root of the distribution tree.
  • the RB in the first DC forwards the data frame to the first edge RB of the first DC by using the RB in the first DC according to the information of the TRILL packet header, and the first edge RB directly routes the packet to the second edge.
  • each RB in the second DC checks the "M" field in the TRILL packet header, and multicasts the packet according to the distribution tree entry.
  • the foregoing packet sending process is only the second edge RB of the second DC to the first edge of the first DC
  • the unidirectional technical solution sends the RB identification information to the second edge RB of the second DC, and the first edge RB of the first DC to the other DCs.
  • the edge RB sends the RB identification information, network interconnection between multiple DCs can be implemented.
  • the TRILL network interconnection method provided by the present invention, because the RB identification information received by the first edge RB is a combination of the RB identity identifier ID of the root RB and the second DC identity identifier in the second DC,
  • the distribution tree forwarding entry established by the first edge RB includes, in addition to the distribution tree forwarding entry for each root RB of the first DC, A forwarding entry for each of the distribution tree root RBs in the second DC.
  • the first edge RB and the second edge RB in the present invention do not need to decapsulate and encapsulate the packet, as the first edge RB and the second edge RB need to decapsulate and encapsulate the packet.
  • the allocation of hardware resources supporting packet encapsulation and decapsulation can be reduced, and the packet forwarding efficiency is high.
  • the first edge RB or the second edge RB is managed.
  • the first edge RB and the second edge RB respectively manage routing tables of respective DCs, and thus can support interconnection between large-scale DCs.
  • the embodiment of the present invention provides a TRILL network interconnection method, as shown in FIG. 1, the method includes:
  • Step 201 The second edge RB of the second data center DC sends the RB identification information to the first edge RB of the first DC.
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier ID, so that the first edge RB is established according to the RB identifier information.
  • the distribution tree forwarding entry sends a packet according to the distribution tree forwarding entry.
  • the RB identification information sent by the second edge RB of the second DC to the first edge RB of the first DC may be used to distinguish between the RB in the first DC and the RB in the second DC. And making each RB in the first DC and the second DC have unique identification information.
  • the first edge RB in the embodiment of the present invention may be based on the received RB identification information in the second DC, as compared with the second edge RB in the prior art, in which the first edge RB and the second edge RB need to decapsulate and encapsulate the packet.
  • a distribution tree forwarding entry is created, and the first edge RB and the second edge RB need not be decapsulated and encapsulated, and the amount of hardware resources allocated by the edge RB to support packet encapsulation and decapsulation is reduced. high.
  • the first edge RB and the second edge RB respectively manage the respective first and second edge RBs in the first DC and the second DC.
  • the routing table of the DC so it can support the interconnection between large-scale DCs.
  • the embodiment of the present invention further provides a TRILL network interconnection method. As shown in FIG. 3, the method includes:
  • Step 301 The second edge RB of the second data center DC sends the RB identification information to the first edge RB of the first DC.
  • the RB identifier information carries the RB identity label of the root RB in the second DC.
  • the RB identification information sent by the second edge RB of the second DC to the first edge RB of the first DC may distinguish the first intra DC and the second intra RB, so that each RB in the first DC and the second DC is unique Identification information.
  • the second edge RB sends the RB identification information to the first edge RB by using a border gateway protocol BGP.
  • the first additional information is also sent.
  • An additional information is used to indicate whether the RB corresponding to the RB identification information in the additional information is a distribution tree root RB.
  • the first additional information further includes RB identification information.
  • the first additional information further includes a VLAN ID corresponding to the RB identification information, and is used to match the data format in the first DC.
  • Root Nickname (RB RB identification information of the root RB)
  • the first edge RB of the first data center DC receives the second DC
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier.
  • the first entry in the first additional information determines whether the RB identification information is the RB identification information of the root RB.
  • the first edge RB receives the RB identification information that is sent by the second edge RB through the border gateway protocol BGP.
  • Step 302 The first edge RB establishes a distribution tree forwarding entry according to the RB identification information.
  • the first edge RB establishes a distribution tree forwarding entry according to the RB identification information, so as to send a packet according to the distribution tree forwarding entry.
  • the first edge RB may receive the received RB identification information.
  • Sending to other RBs in the first DC, the first edge RBs and other RBs in the first DC are not only configured according to the RB identification information in the first DC, but also based on the distribution tree forwarding entries in the first DC.
  • the RB identification information in the second DC establishes a distribution tree forwarding entry for each root RB in the second DC.
  • the step 302 specifically includes:
  • Step 401 The first edge RB establishes the distribution tree forwarding entry by using a shortest path first algorithm SPF algorithm according to the RB identification information.
  • the first edge RB generates a topology for the RB identification information in its own LSDB after receiving the RB identification information, including the following two methods:
  • the first edge RB adds an entry in the LSDB, where the entry is a set of correspondences after the RB identifier of the first edge RB is replaced by the RB identifier information.
  • the RB identification information of the first edge RB is 01: 01
  • the entries starting with the first edge RB in the LSDB are "01: 01-01: 02" and "01: 01-01: 03”.
  • the first edge RB receives the second edge RB and sends the RB identification information, if the received RB identification information is 02:02, the entry is added: "02: 02-01: 02" and "02: 02-01: 03".
  • the root of the tree can be randomly selected or selected according to preset rules. Select a root RB in the first DC, and then find the root RB as the starting entry in the LSDB. For example: Select the RB with the RB ID of 01: 05, starting with 01: 05. The entries are "01: 05-01: 03" and "01: 05-01: 06". After the first edge RB receives the second edge RB and sends the RB identification information, if the received RB identification information is 02: 02, the entry is added: "02: 02-01: 03" and "02: 02-01: 06".
  • the preset rule may be, but is not limited to, a hash algorithm.
  • the SPF algorithm is combined with the entry in the LSDB to form a distribution tree forwarding entry.
  • you create a distribution tree forwarding entry you need to refer to the priority of each entry in the LSDB. The higher the priority of the starting RB identifier in the entry is, the greater the probability that the root RB is determined.
  • the RB identification information of the root RB is elected as the root of the root in the first DC, and the RB identification information of the root RB in the second DC is given the same root priority as the RB identification information of the root RB in the first DC ( roo t pr i or i ty ).
  • the SPF algorithm calculates the distance to each target RB by using a certain RB as the root (ROOT).
  • Each RB calculates the topology structure of the routing domain according to a unified database during calculation.
  • the structure is similar to a tree.
  • the SPF algorithm it is called the shortest path tree.
  • the operation of the SPF algorithm can be used to obtain the path with the least number of hops between the root RB and the destination RB of the shortest path tree, and the RB identification information of the RB closest to the root RB in the path is used as the distribution tree forwarding table. Items are saved.
  • the port list formed by the SPF algorithm as the port number of the root RB may be saved as a distribution tree forwarding entry, that is, the first edge RB obtains the port number corresponding to the next hop RB.
  • the port number corresponding to the next hop RB is added to the distribution tree forwarding entry.
  • the port number can be sent to multiple RBs at the same time.
  • Step 402 The first edge RB forwards the RB identification information to other RBs in the first DC.
  • the first edge RB After the first edge RB generates a topology for the received RB identification information in the LSDB, the first edge RB advertises the newly added entries in the LSDB, that is, LSPs, in the first DC. After the advertised, each RB in the first DC can obtain the newly added entry corresponding to the RB identification information.
  • the first edge RB forwards the RB identification information to other RBs in the first DC, so that the other RB establishes its own distribution tree forwarding entry by using the SPF algorithm according to the RB identification information.
  • the first edge RB sends the received RB identification information to other RBs in the first DC.
  • the other RBs can obtain the RB identification information of the next hop RB that sends the 4 ⁇ text to the RB in the second DC by using the SPF algorithm described in step 401, and save the RB identification information.
  • the port list formed by the SPF algorithm as a port number on the root RB is saved as a distribution tree forwarding entry, and the port number can be simultaneously sent to multiple destination RBs, that is, the other RBs.
  • the first RB connected to the first host in the first DC adds a TRILL packet header to the data frame, where the TRILL
  • the entry RB name in the header is the name of the first RB connected to the first host in the first DC
  • the egress RB name is the name of the RB in the second DC that is the root RB of the distribution tree.
  • the RB that is connected to the first host compares the egress RB name in the TRILL packet header with each of the distribution tree forwarding entries saved in the TRILL packet header, and finds the RB identifier information of the next hop RB corresponding to the egress RB name. Or the port list, and the packet is sent to the next hop RB.
  • Each RB checks the "M" field in the TRILL packet header, and multicasts the packet according to the distribution tree entry.
  • the packet is a multicast packet in the first DC.
  • the first edge RB and the second edge RB need to decapsulate and encapsulate the packet, and the foregoing sending process passes the second edge RB of the second DC to the first of the first DC.
  • the RB identification information sent by the edge RB may distinguish the RBs in the first DC and the RBs in the second DC, so that each RB in the first DC and the second DC has unique identification information.
  • the first edge RB may establish a distribution tree forwarding entry according to the received RB identification information in the second DC, and the first edge RB sends the received RB identification information to other RBs in the first DC, so as to be first.
  • the other RBs in the DC establish a distribution tree forwarding entry according to the received RB identification information in the second DC. Therefore, the first edge RB and the second edge RB can be successfully sent to the RB of another DC without the decapsulation and encapsulation of the packet, so that the RB checks the TRILL header.
  • the packet is multicast according to the distribution tree entry, and the allocation of hardware resources that the edge RB is used to support packet encapsulation and decapsulation is reduced, and the packet forwarding efficiency is high.
  • the first edge RB and the second edge RB are respectively sent in the foregoing process. Manage the routing tables of their respective DCs, thus supporting large-scale interconnections between DCs.
  • the RB identification information that is sent by the second edge RB to the first edge RB further includes: a virtual local area network VLAN identity identifier, where the VLAN ID is used to identify the A VLAN in which the root RB in the first DC and the root RB in the second DC belong to the same VLAN.
  • the step 301 is further refined to: the second edge RB of the second data center DC sends the RB identification information to the first edge RB of the first DC, which specifically includes: the second edge RB is toward the first
  • the edge RB sends the extended information, where the extended information is used to describe the correspondence between the RB identification information of the RB and the VLAN ID in the second DC.
  • the second edge RB sends the RB identification information to the first edge RB through BGP, in addition to transmitting the same information as the content type in the prior art, the second additional information is also sent as shown in Table 3.
  • the additional information is used to indicate whether it is the root RB, the RB identification information of the root RB, and the correspondence between the root RB and the VLAN.
  • the RB identification information of the root RB and the correspondence between the root RB and the VLAN are extended information.
  • Root Ni ckname (RB RB identification information of the root RB)
  • the first edge RB of the first data center DC receives the RB sent by the second edge RB of the second DC
  • the identifier information includes: the first edge RB receives the extension information sent by the second edge RB, and the extension information is used to describe the RB identifier information of the root RB in the second DC and the VLAN ID. Correspondence relationship.
  • the RB identification information sent by the first edge RB of the first data center DC that is received by the second edge RB of the second DC further carries: a virtual local area network VLAN ID, where the VLAN ID is used to identify the first DC The RB and the VLAN of the second DC in which the root RB belongs.
  • Step 302 is further refined, the first edge RB establishes a correspondence between the RB identification information of the RB in the first DC and the RB identification information of the root RB in the second DC according to the VLAN ID, thereby The extended information is converted into a local distribution tree forwarding entry.
  • the first edge RB of the first DC receives the second additional information sent by the second edge RB of the second DC, according to the extended information, that is, the VLAN ID
  • the RB of the RB corresponding to the VLAN ID in the first DC is searched for.
  • Identification information, and the RB identification information and the root RB in the second additional information are saved as a distribution tree forwarding entry.
  • Each distribution tree forwarding entry constitutes a distribution tree forwarding table, as shown in Table 4:
  • the second RB identifier information is the RB identifier information of the root RB in the second DC
  • the first RB identifier information is the RB identifier information corresponding to the RBs in the same VL AN in the first DC and the second RB identifier information.
  • the RB identifier information in the second DC of the TRILL 4 ⁇ header can be found by using the RB identifier information in the first DC in the first DC by the RB identifier information of the RB RB in the first DC. information.
  • the first RB connected to the second host in the second DC adds a TRILL 4 header to the data frame.
  • the name of the entry RB in the TRILL header is the name of the first RB connected to the second host in the second DC
  • the egress RB name is the RB identification information in the first DC as the root RB of the distribution tree. If the RB identifier information in the TRILL 4 ⁇ header is 02: 01 and the corresponding VLAN ID is LVAN1, the first edge RB of the first DC is obtained by querying Table 4 in the first DC.
  • the RB identification information 01: 01 the first edge RB of the first DC decapsulates and encapsulates the TRILL 4 ⁇ header, and changes the name of the exit RB in the TRILL header to 01: 01 for internal DC Forward. Because the forwarding of the packet in the first DC is the prior art, the RB can be successfully sent to the RB corresponding to the egress RB name, and each RB checks the "M" field in the TRILL packet header, and performs the ⁇ ⁇ according to the distribution tree entry. Multicast.
  • the transmission process of the above-mentioned message saves the second edge RB compared to the decapsulation and encapsulation of the second edge RB of the second DC.
  • the encapsulation step is performed.
  • the RBs other than the edge RB do not need to perform the calculation of the next hop distribution tree forwarding entry for the RBs in other DCs, and the edge RB is used to support packet encapsulation and decapsulation.
  • the allocation of resources is high, and the packet forwarding efficiency is high, which further reduces the workload of other RBs.
  • first edge RB and the second edge RB in the sending process of the packet are respectively compared with the first routing RB or the second edge RB managing the entire routing table in the first DC and the second DC.
  • step 302 may be further refined as: the first edge RB is received according to the received
  • the RB identification information randomly establishes a distribution tree forwarding entry.
  • the random establishment is performed by the first edge RB as the set of correspondence between the received RB identification information in the second DC and the arbitrary tree root RB identification information in the first DC.
  • the RB can be sent to the VLAN corresponding to the VLAN ID through any port of the RB. Therefore, the technical effect of interconnecting between different DCs can also be achieved by the above method.
  • the establishment of the distribution tree forwarding entry and the distribution tree may be completed by using a controller (Cont roler) configured for each DC. Maintenance of forwarding entries.
  • a controller Cont roler
  • Each RB only needs to receive the indication information sent by the controller, such as sending a message through an interface. Since the controller and each edge RB and other RB functions are clear, the efficiency of each RB will be further improved.
  • the TRILL network interconnection method provided by the embodiment of the present invention is a one-way technical solution after the second edge RB of the second DC sends the RB identification information to the first edge RB of the first DC, where the first edge of the first DC is RB.
  • the second edge RB of the second DC sends the RB identification information, and after the first edge RB of the first DC sends the RB identification information to the other edge RBs of other DCs, the network interconnection between the multiple DCs can be implemented.
  • the RB identification information sent by the second edge RB of the second DC to the first edge RB of the first DC may distinguish the RB and the second in the first DC
  • the RBs in the DC are such that each RB in the first DC and the second DC has unique identification information.
  • the first edge RB may establish a distribution tree forwarding entry according to the received RB identification information in the second DC, and the first edge RB sends the received RB identification information to other RBs in the first DC, so as to be first.
  • the other RBs in the DC establish a distribution tree forwarding entry according to the received RB identification information in the second DC.
  • the first edge RB and the second edge RB are absent
  • the packet is successfully sent to the RB of another DC, so that the RB checks the "M" field in the TRILL packet header, and the packet is matched according to the distribution tree entry.
  • Multicasting is performed to reduce the allocation of hardware resources for edge packet RBs to support packet encapsulation and decapsulation. The packet forwarding efficiency is high.
  • Another implementation manner of the TRILL network interconnection method provided by the embodiment of the present invention is compared with the decapsulation and encapsulation of the first edge RB of the first DC and the second edge RB of the second DC in the second technology.
  • the sending process of the above-mentioned ⁇ ⁇ omitting the de-encapsulation step of the second edge RB, and the RBs other than the DC edge RB need not perform the calculation of the next-hop distribution tree forwarding entry for the RBs in other DCs.
  • the edge RB is used to support the allocation of hardware resources for packet encapsulation and decapsulation, and the packet forwarding efficiency is high, thereby further reducing the workload of other RBs.
  • first edge RB and the second edge RB are respectively managed in the foregoing two implementation manners by using the first edge RB or the second edge RB to manage all the routing tables in the first DC and the second DC.
  • the routing table of the respective DCs can support the interconnection between large-scale DCs.
  • the embodiment of the present invention provides a TRILL network interconnection device, where the device is a first edge RB in the first data center DC.
  • the first edge routing bridge RB includes: a receiving unit 51.
  • RB identification information for receiving the second edge RB of the second DC.
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier ID, so that the first edge RB is established according to the RB identifier information.
  • the distribution tree forwarding entry sends a packet according to the distribution tree forwarding entry.
  • the receiving unit 51 is further configured to receive the RB identifier information that is sent by the second edge RB by using the border gateway protocol BGP.
  • the receiving unit 51 when receiving the RB identification information, receives the first additional information in addition to the information of the BGP content type in the prior art.
  • the first additional information is used to indicate whether the RB corresponding to the RB identification information in the additional information is a distribution tree root RB, and the first additional information further includes RB identification information.
  • the first additional information further includes a VLAN ID corresponding to the RB identification information, and is used to match the data format in the first DC.
  • the processing unit 52 is configured to establish a distribution tree forwarding entry according to the RB identification information received by the receiving unit 51.
  • the processing unit 52 establishes a tree for the second DC according to the RB identification information in the second DC received by the receiving unit 51, in addition to establishing the distribution tree forwarding entry for the first DC according to the RB identification information in the first DC.
  • the distribution tree forwarding entry of the root RB is established.
  • the processing unit 52 as shown in FIG. 6, specifically includes:
  • the calculating subunit 521 is configured to establish the distribution tree forwarding entry by using a shortest path SPF algorithm according to the RB identification information received by the receiving unit 51.
  • the SPF algorithm calculates the distance to each target RB by using a certain RB as the root (ROOT).
  • Each RB calculates the topology structure of the routing domain according to a unified database during calculation. The structure is similar to a tree. In the SPF algorithm, it is called the shortest path tree.
  • the calculation sub-unit 521 performs the operation of the SPF algorithm to obtain a path with the least number of hops between the root RB and the destination RB of the shortest path tree, and uses the RB identification information closest to the root RB in the path as the distribution tree.
  • the forwarding entry is saved to the storage unit 61.
  • the storage unit 61 may also store, by using the SPF algorithm, a port list formed by the port number on the root RB as a distribution tree forwarding entry, so that the sending subunit 522 can simultaneously transmit through the port number.
  • Multiple destination RBs send ⁇ . That is, the first edge RB obtains the port number corresponding to the next hop RB, and adds the port number of the corresponding next hop RB to the distribution tree forwarding entry.
  • the sending subunit 522 is configured to forward the RB identification information received by the receiving unit 51 to other RBs in the first DC.
  • the sending sub-unit 522 sends the RB identification information received by the receiving unit 51 to other RBs in the first DC.
  • the other RBs can obtain the RB identification information of the next hop RB for transmitting the RB to the RB in the second DC through the calculation sub-unit 521 therein, and save the RB identification information to the storage unit 61.
  • the calculating sub-unit 521 is further configured to obtain a port number corresponding to the next hop RB, and add the port number of the corresponding next hop RB to the distribution tree forwarding entry.
  • the calculation sub-unit 521 can also calculate the port number group on the root RB calculated by the SPF algorithm.
  • the port list is saved as a distribution tree forwarding entry to the storage unit 61, and the port number can be sent to the plurality of destination RBs at the same time, that is, the other RB obtains the port number corresponding to the next hop RB, and the The port number corresponding to the next hop is added to the distribution tree forwarding entry established by itself.
  • the packet sending process is performed by the first edge RB and the second edge RB in the prior art.
  • the information may distinguish between the first intra-DC RB and the second intra-DC RB such that each RB within the first DC and the second DC has unique identification information.
  • the calculation sub-unit 521 establishes a distribution tree forwarding entry according to the RB identification information in the second DC received by the receiving unit 51, and the sending sub-unit 522 sends the RB identification information received by the receiving unit 51 to other RBs in the first DC.
  • the calculation sub-unit 521 of the other RBs can establish a distribution tree forwarding entry according to the received RB identification information in the second DC, so that the first edge RB and the second edge RB do not need to decapsulate and encapsulate the packet.
  • the RB is successfully sent to the RB of another DC, so that the RB checks the "M" field in the TRILL header, multicasts the packet according to the distribution tree entry, and reduces the edge RB for support.
  • the amount of hardware resources allocated for packet encapsulation and decapsulation is high.
  • the computing subunit 521 of the first edge RB manages the routing table of the first DC, as compared with the first routing RB or the second edge RB managing all routing tables in the first DC and the second DC, Therefore, it is possible to support interconnection between large-scale DCs.
  • the receiving unit 51 is further configured to receive extended information sent by the second edge RB, where the extended information is used to describe RB identification information of a root RB in the second DC. Correspondence between VLAN IDs.
  • the second edge RB sends the RB identification information to the receiving unit 51 through BGP, in addition to transmitting the same information as the content type in the prior art, the second additional information, as shown in Table 3, is also sent.
  • the information is used to indicate whether it is the root RB, the RB identification information of the root RB, and the correspondence between the root RB and the VLAN.
  • the RB identification information of the root RB and the correspondence between the root RB and the VLAN are extended information.
  • the processing unit 52 is further configured to establish, according to the VLAN ID, a correspondence between the RB identification information of the root RB in the first DC and the RB identification information of the root RB in the second DC. After the receiving unit 51 receives the second additional information sent by the second edge RB of the second DC, the processing unit 52 searches for the RB identification information of the RB corresponding to the VLAN ID in the first DC according to the extended information, that is, the VLAN ID. And storing the RB identification information and the RB identification information of the root RB in the second additional information and the VLAN ID as a distribution tree forwarding entry to the storage unit 61.
  • the encapsulating unit 71 changes the egress RB name in the TRILL packet header to the RB identification information of the first DC inner root RB corresponding to the original egress RB name, that is, the VLAN ID established by the processing unit 52, so that the RB in the first DC is encapsulated according to the encapsulation.
  • the TRILL packet header encapsulated by the unit 71 can be forwarded to the RB in the first DC.
  • the transmission process of the foregoing The encapsulation unit 71 of the edge RB of the first DC only needs to encapsulate the header, and the processing unit 52 of the other RBs other than the first edge RB of the first DC does not need to perform the next RB in other DCs.
  • the calculation of the forwarding tree forwarding entry is performed to reduce the allocation of hardware resources for the edge encapsulation and decapsulation of the edge RB.
  • the packet forwarding efficiency is high, and the workload of other RBs is further reduced.
  • the computing subunit 521 of the first edge RB manages the routing table of the first DC, as compared with the first routing RB or the second edge RB managing all routing tables in the first DC and the second DC, Therefore, it is possible to support interconnection between large-scale DCs.
  • the calculating sub-unit 521 can also establish a distribution tree forwarding entry randomly according to the RB identification information received by the receiving unit 51.
  • the random establishment is performed by the first edge RB as the set of correspondence between the received RB identification information in the second DC and the arbitrary tree root RB identification information in the first DC. Since any RB in the first DC can send the message to the VLAN corresponding to the VLAN ID through a certain port of the RB, the technical effect of the interconnection between different DCs can also be achieved by the above method.
  • the embodiment of the present invention provides a TRILL network interconnection device, where the device is a second edge RB in the second data center DC.
  • the second edge RB includes:
  • the sending unit 81 is configured to send RB identification information to the first edge RB of the first DC.
  • the RB identification information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier.
  • the RB identification information sent by the sending unit 81 to the first edge RB of the first DC may distinguish the RB in the first DC and the RB in the second DC, so that each RB in the first DC and the second DC has unique identification information.
  • the sending unit 81 is further configured to send the RB identification information to the first edge RB by using a border gateway protocol BGP.
  • the sending unit 81 sends the RB identification information to the first edge RB through BGP, in addition to transmitting the same information as the BGP content type in the prior art, the sending unit 81 sends the first additional information as shown in Table 2 for indicating Whether the RB corresponding to the RB identification information in the additional information is the distribution tree root RB, the first additional information further includes the RB identification information.
  • the first additional information further includes a VLAN ID corresponding to the RB identification information, and is used to match the data format in the first DC.
  • the transmitting unit 81 of the second edge RB of the second DC transmits the first additional information to the receiving unit 51 of the first edge RB of the first DC
  • the calculating sub-unit 521 as the first edge RB of the receiving end receives according to the receiving
  • the RB identification information in the second DC received by the unit 51 establishes a distribution tree forwarding entry, and the sending sub-unit 522 sends the RB identification information received by the receiving unit 51 to other RBs in the first DC, so as to calculate other RBs.
  • the unit 521 establishes a distribution tree forwarding entry according to the received RB identification information in the second DC, and the packet is successfully obtained on the premise that the first edge RB and the second edge RB do not need to decapsulate and encapsulate the packet.
  • the RB is sent to the RB of another DC, so that the RB checks the "M" field in the TRILL packet header, and multicasts the packet according to the distribution tree entry, and reduces the edge RB to support packet encapsulation and decapsulation.
  • the allocation of hardware resources and the efficiency of packet forwarding are high.
  • the sending unit 81 is further configured to send the extended information to the first edge RB, where the extended information is used to describe a correspondence between the RB identification information of the root RB and the VLAN ID of the second DC .
  • the sending unit 81 When the sending unit 81 sends the RB identification information to the first edge RB through BGP, in addition to transmitting the same information as the content type in the prior art, the sending unit 81 also sends the second attached as shown in Table 3. The information is added, and the second additional information is used to indicate whether the root RB, the RB identification information of the root RB, and the correspondence between the root RB and the VLAN.
  • the RB identification information of the root RB and the correspondence between the root RB and the VLAN are extended information.
  • the transmitting unit 81 of the second edge RB of the second DC transmits the first additional information to the receiving unit 51 of the first edge RB of the first DC
  • the first edge RB as the receiving end only needs to pass the first DC
  • the encapsulating unit 71 of the edge RB encapsulates the header, and the processing unit 52 of the other RBs other than the first edge RB of the first DC does not need to perform the next jump distribution tree forwarding entry for the RBs in other DCs.
  • the calculation reduces the allocation of hardware resources to support packet encapsulation and decapsulation, and the packet forwarding efficiency is high, which further reduces the workload of other RBs.
  • the embodiment of the present invention provides a TRILL network interconnection system. As shown in FIG. 9, the system is composed of a first edge RB91 of a first DC and a second edge RB92 of a second DC.
  • the second edge RB92 sends the RB identification information to the first edge RB91.
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier ID.
  • the first edge RB91 receives the RB identification information sent by the second edge RB92 of the second DC.
  • the second edge RB92 may send the RB identification information to the first edge RB91 by using the border gateway protocol BGP.
  • the first additional information shown in Table 2 is also sent.
  • the first additional information is used to indicate whether the RB corresponding to the RB identification information in the additional information is a distribution tree root RB, and the first additional information further includes RB identification information.
  • the first additional information further includes a VLAN ID corresponding to the RB identification information, and is used to match the data format in the first DC.
  • the RB identification information received by the first edge RB91 establishes a distribution tree forwarding entry.
  • the first edge RB91 is configured to establish, according to the RB identification information in the first DC, the RB identification information in the second DC.
  • the first edge RB91 establishes the distribution tree forwarding entry by using a shortest path SPF algorithm according to the received RB identification information.
  • the SPF algorithm calculates the distance to each target RB by using a certain RB as the root (ROOT).
  • Each RB calculates the topology structure of the routing domain according to a unified database during calculation.
  • the structure is similar to a tree.
  • the SPF algorithm it is called the shortest path tree.
  • the first edge RB91 performs the operation of the SPF algorithm to obtain a path with the least number of hops between the root RB and the destination RB of the shortest path tree, and uses the RB identification information closest to the root RB in the path as the distribution tree. Forward the entry to save.
  • the first edge RB91 may also save the port list formed by the SPF algorithm as a port number on the root RB as a distribution tree forwarding entry, so that the port number can be simultaneously sent to multiple destination RBs through the port number. Text. That is, the first edge RB91 obtains the port number corresponding to the next hop RB, and adds the port number of the corresponding next hop RB to the distribution tree forwarding entry.
  • the first edge RB91 forwards the received RB identification information to other RBs in the first DC.
  • the first edge RB91 sends the received RB identification information to other RBs in the first DC, so that each RB in the first DC can send the RB to the RB in the second DC.
  • the other RBs can obtain the RB identification information of the next hop RB for the RB in the second DC, and save the RB identification information.
  • the first edge RB91 is further configured to obtain a port number corresponding to the next hop RB, and add the port number of the corresponding next hop RB to the distribution tree forwarding entry.
  • the first edge RB91 may also store the port list formed by the SPF algorithm as a port number on the root RB as a distribution tree forwarding entry, and send the packet to multiple destination RBs through the port number at the same time.
  • the port number corresponding to the next hop RB is obtained, and the port number corresponding to the next hop RB is added to the distribution tree forwarding entry established by itself.
  • the first edge RB91 and the second edge RB92 need to decapsulate and encapsulate the packet, and the foregoing sending process is performed by the second edge RB92 of the second DC.
  • the RB identification information sent by the first edge RB91 of the DC may distinguish the first intra-RB and the second intra-RB, so that each RB in the first DC and the second DC has unique identification information.
  • the first edge RB91 establishes a distribution tree forwarding entry according to the received RB identification information in the second DC, and sends the received RB identification information to other RBs in the first DC, so that the other RBs receive the second DC.
  • the RB identification information is used to establish a distribution tree forwarding entry, so that the first edge RB91 and the second edge RB92 can successfully send the packet to the RB of another DC without the need to decapsulate and encapsulate the packet.
  • the RB checks the "M" field in the TRILL packet header, and multicasts the packet according to the distribution tree entry, and reduces the allocation amount of the hardware resources supported by the edge RB to support packet encapsulation and decapsulation, and the packet forwarding efficiency. high.
  • the first edge RB91 manages the routing table of the first DC by using the first edge RB91 or the second edge RB92 to manage all routing tables in the first DC and the second DC, thereby supporting large-scale The interconnection between the DCs.
  • first edge RB91 is further configured to receive the extended information sent by the second edge RB92, where the extended information is used to describe a correspondence between the RB identification information of the root RB and the VLAN ID of the second DC. .
  • the second edge RB92 sends the RB identification information to the first edge RB91 through BGP, in addition to transmitting the same information as the content type in the prior art, the second additional information is also sent as the second additional information shown in Table 3. It is used to indicate whether it is the root RB, the RB identification information of the root RB, and the correspondence between the root RB and the VLAN.
  • the RB identification information of the root RB and the correspondence between the root RB and the VLAN are extended information.
  • the first edge RB91 is further configured to establish, according to the VLAN ID, a correspondence between the RB identification information of the root RB in the first DC and the RB identification information of the root RB in the second DC.
  • the first edge RB91 After receiving the second additional information sent by the second edge RB92 of the second DC, the first edge RB91 searches for the root RB identification information corresponding to the VLAN ID in the first DC according to the extended information, that is, the VLAN ID.
  • the RB identification information and the RB identification information of the root RB in the second additional information and the VLAN ID are saved as a distribution tree forwarding entry.
  • the first edge RB91 changes the name of the egress RB in the TRILL header to the RB identification information of the root RB in the first DC corresponding to the original egress RB name, that is, the VLAN ID, so that the first DC An edge RB91 encapsulated TRILL 4 header can be forwarded to the RB in the first DC.
  • the transmission process of the above-mentioned message is only
  • the RB of the first DC is encapsulated by the edge RB of the first DC.
  • the RBs other than the first edge RB91 of the first DC do not need to perform the calculation of the next hop distribution tree forwarding entry for the RBs in other DCs.
  • the edge RB is used to support the allocation of hardware resources for packet encapsulation and decapsulation, and the packet forwarding efficiency is high, thereby further reducing the workload of other RBs.
  • the first edge RB91 manages the routing table of the first DC by using the first edge RB91 or the second edge RB92 to manage all routing tables in the first DC and the second DC, thereby supporting large-scale The interconnection between the DCs.
  • the TRILL network interconnection system provided by the embodiment of the present invention is a second edge RB92, for example, the second edge RB92 of the second DC, and is unidirectional when transmitting the RB identification information to the first edge RB91, for example, the first edge RB91 of the first DC.
  • the first edge RB91 of the first DC sends the RB identification information to the second edge RB92 of the second DC
  • the first edge RB91 of the first DC sends the RB identification information to other edge RBs of other DCs
  • Network interconnection between multiple DCs when the first edge RB91 of the first DC sends the RB identification information to the second edge RB92 of the second DC, and the first edge RB91 of the first DC sends the RB identification information to other edge RBs of other DCs.
  • the embodiment of the present invention provides a TRILL network interconnection device, where the device is a first edge RB in the first data center DC.
  • the first edge RB includes:
  • the receiver 1001 is configured to receive RB identification information sent by the second edge RB of the second DC.
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier, so that the processor 1002 establishes a distribution tree according to the RB identifier information.
  • the transmitter 1003 sends a message according to the distribution tree forwarding entry.
  • the receiver 1001 is further configured to receive the RB identifier information that is sent by the second edge RB through the border gateway protocol BGP.
  • the receiver 1001 when receiving the RB identification information, receives the first additional information in addition to the information of the BGP content type in the prior art.
  • the first additional information is used for Indicates whether the RB corresponding to the RB identification information in the additional information is a distribution tree root RB, and the first additional information further includes RB identification information.
  • the first additional information further includes a VLAN ID corresponding to the RB identification information, and is used to match the data format in the first DC.
  • the processor 1002 is configured to establish a distribution tree forwarding entry according to the RB identification information received by the receiver 1001.
  • the processor 1002 establishes, according to the first DC internal RB identification information, a distribution tree forwarding entry for the first DC, and the RB identification information in the second DC received by the receiver 1001.
  • the distribution tree forwarding entry of each tree root RB is established, according to the first DC internal RB identification information, a distribution tree forwarding entry for the first DC, and the RB identification information in the second DC received by the receiver 1001. The distribution tree forwarding entry of each tree root RB.
  • the processor 1002 is further configured to establish, according to the RB identifier information received by the receiver 1001, the distribution tree forwarding entry by using a shortest path SPF algorithm.
  • the SPF algorithm calculates the distance to each target RB by using a certain RB as the root (ROOT).
  • Each RB calculates the topology structure of the routing domain according to a unified database during calculation.
  • the structure is similar to a tree.
  • the SPF algorithm it is called the shortest path tree.
  • the processor 1002 obtains a path with the least number of hops between the root RB and the destination RB of the shortest path tree, and uses the RB identification information of the path closest to the root RB as the distribution tree.
  • the publication item is saved to the memory 1004.
  • the memory 1004 may store, as the distribution tree forwarding entry, a port list formed by the processor 1002 as a port number on the root RB, so that the transmitter 1003 can simultaneously access the multiple destination RBs through the port number. Send a message. That is, the first edge RB obtains the port number corresponding to the next hop RB, and adds the port number of the corresponding next hop RB to the distribution tree forwarding entry.
  • the transmitter 1003 is configured to forward the RB identification information received by the receiver 1001 to other RBs in the first DC.
  • the transmitter 1003 sends the RB identification information received by the receiver 1001 to other RBs in the first DC.
  • the other RBs can obtain the RB identification information of the next hop RB for transmitting the ciphertext to the RB in the second DC through the processor 1002 therein, and save the RB identification information to the memory 1004.
  • the processor 1002 is further configured to obtain a port number corresponding to the next hop RB, where the corresponding The port number of the one-hop RB is added to the distribution tree forwarding entry.
  • the memory 1004 stores the port list formed by the processor 1002 as a port number on the root RB according to the SPF algorithm as a distribution tree forwarding entry.
  • the transmitter 1003 can simultaneously send the port number to the multiple destination RBs by using the port number, that is, the other RB obtains the port number corresponding to the next hop RB, and adds the port number of the corresponding next hop RB to the distribution established by itself.
  • the tree is forwarded in the table entry.
  • the foregoing sending process passes the second edge RB of the second DC.
  • the RB identification information transmitted to the receiver 1001 may distinguish between the first intra-DC RB and the second intra-DC RB such that each RB within the first DC and the second DC has unique identification information.
  • the processor 1002 establishes a distribution tree forwarding entry according to the RB identification information in the second DC received by the receiver 1001, and the transmitter 1003 sends the RB identification information received by the receiver 1001 to other RBs in the first DC, so that the other
  • the processor 1002 of the RB establishes a distribution tree forwarding entry according to the received RB identification information in the second DC, which may be implemented on the premise that the first edge RB and the second edge RB do not need to decapsulate and encapsulate the packet.
  • the packet is successfully sent to the RB of another DC, so that the RB checks the "M" field in the TRILL packet header, and multicasts the packet according to the distribution tree entry, and reduces the edge RB to support packet encapsulation.
  • the processor 1002 of the first edge RB manages the routing table of the first DC, as compared with the first routing RB or the second edge RB managing all routing tables in the first DC and the second DC, Can support large-scale interconnection between DCs.
  • the receiver 1001 is further configured to receive the extended information sent by the second edge RB, where the extended information is used to describe a correspondence between the RB identification information of the root RB and the VLAN ID in the second DC relationship.
  • the second edge RB sends the RB identification information to the receiver 1001 through BGP, in addition to transmitting the same information as the content type in the prior art, the second additional information, as shown in Table 3, is also sent.
  • the information is used to indicate whether it is the root RB, the RB identification information of the root RB, and the correspondence between the root RB and the VLAN.
  • the RB identification information of the root RB and the root RB The correspondence with the VLAN is extended information.
  • the processor 1002 is further configured to establish, according to the VLAN ID, a correspondence between the RB identification information of the root RB in the first DC and the RB identification information of the root RB in the second DC.
  • the processor 1002 After the receiver 1001 receives the second additional information sent by the second edge RB of the second DC, the processor 1002 searches for the RB identification information of the RB corresponding to the VLAN ID in the first DC according to the extended information, that is, the VLAN ID. And storing the RB identification information and the RB identification information of the root RB in the second additional information and the VLAN ID as a distribution tree forwarding entry to the memory 1004.
  • the processor 1002 changes the name of the egress RB in the TRILL header to the RB identification information of the first DC inner root RB corresponding to the original egress RB name, that is, the VLAN ID, so that the RB in the first DC is encapsulated according to the processor 1002.
  • the TRILL ⁇ header can be forwarded to the RB in the first DC.
  • the sending process of the foregoing packet only needs to pass the
  • the processor 1002 of the edge RB of a DC encapsulates the header of the RB, and the processor 1002 of the RB other than the first edge RB of the first DC does not need to perform the next jump distribution tree for the RBs in other DCs.
  • the calculation of the forwarding entry reduces the allocation of hardware resources that the edge RB is used to support packet encapsulation and decapsulation.
  • the packet forwarding efficiency is high, and the workload of other RBs is further reduced.
  • the processor 1002 of the first edge RB manages the routing table of the first DC, as compared with the first routing RB or the second edge RB managing all routing tables in the first DC and the second DC, Can support large-scale interconnection between DCs.
  • the processor 1002 may also randomly establish a distribution tree forwarding entry according to the RB identification information received by the receiver 1001.
  • the random establishment is that the first edge RB associates the received RB identification information in the second DC with any tree root RB identification information in the first DC as a set of correspondence.
  • the RBs in the first DC can send packets to the VLAN corresponding to the VLAN ID through a certain port of the RB. Therefore, the technical effects of interconnecting between different DCs can also be implemented in the foregoing manner.
  • An embodiment of the present invention provides a TRILL network interconnection device, where the device is in the second data.
  • the transmitter 1101 is configured to send RB identification information to the first edge RB of the first DC.
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier.
  • the RB identification information sent by the transmitter 1101 to the first edge RB of the first DC can distinguish the first
  • the intra-DC RB and the second intra-RB RB have unique identification information in each of the first DC and the second DC.
  • the transmitter 101 is further configured to send the RB identification information to the first edge RB by using a border gateway protocol BGP.
  • the transmitter 1101 When transmitting the RB identification information to the first edge RB by using the BGP, the transmitter 1101 sends the first additional information as shown in Table 2, in addition to the information of the BGP content type in the prior art.
  • the first additional information is used to indicate whether the RB corresponding to the RB identification information in the additional information is a distribution tree root RB, and the first additional information further includes RB identification information.
  • the first additional information further includes a VLAN ID corresponding to the RB identification information, and is used to match the data format in the first DC.
  • the processor 1002 as the first edge RB of the receiving end receives according to the receiving
  • the RB identification information in the second DC received by the device 1001 establishes a distribution tree forwarding entry, and the transmitter 1003 sends the RB identification information received by the receiver 1001 to other RBs in the first DC, so that the processor 1002 of the other RBs And establishing the distribution tree forwarding entry according to the received RB identification information in the second DC, so that the first edge RB and the second edge RB can successfully send the packet to the first edge RB and the second edge RB without decapsulating and encapsulating the packet.
  • the RB checks the "M" field in the TRILL packet header, and multicasts the packet according to the distribution tree entry, and reduces the hardware resources used by the edge RB to support packet encapsulation and decapsulation. The amount of allocation, the message forwarding efficiency is high.
  • the transmitter 1101 is further configured to send the extended information to the first edge RB, where the extended information is used to describe a correspondence between the RB identification information of the root RB and the VLAN ID of the second DC. .
  • the transmitter 1101 sends the second additional information as shown in Table 3, in addition to the information of the content type in the prior art.
  • the information is used to indicate whether it is the root RB, the RB identification information of the root RB, and the correspondence between the root RB and the VLAN.
  • the RB identification information of the root RB and the correspondence between the root RB and the VLAN are extended information.
  • the first edge RB as the receiving end only needs to pass the first DC
  • the processor 1002 of the edge RB encapsulates the header of the RB, and the processor 1002 of the RB other than the first edge RB of the first DC does not need to perform the next jump distribution tree forwarding entry for the RBs in other DCs.
  • the calculation reduces the allocation of hardware resources to support packet encapsulation and decapsulation, and the packet forwarding efficiency is high, which further reduces the workload of other RBs.
  • the embodiment of the present invention provides a TRILL network interconnection system. As shown in FIG. 12, the system is composed of a first edge RB1201 and a second edge RB1202.
  • the second edge RB1202 such as the second edge RB1202 of the second DC, to the first edge
  • RB1201 for example, the first edge RB1201 of the first DC, sends the RB identification information.
  • the RB identifier information carries a combination of the RB identity identifier ID of the root RB in the second DC and the second DC identity identifier.
  • the first edge RB1201 receives the RB identification information sent by the second edge RB1202 of the second DC.
  • the second edge RB 1202 may send the RB identification information to the first edge RB 1201 by using a border gateway protocol BGP.
  • the first additional information shown in Table 1 is also sent.
  • the first additional information is used to indicate whether the RB corresponding to the RB identification information in the additional information is a distribution tree root RB, and the first additional information further includes RB identification information.
  • the first additional information further includes a VLAN ID corresponding to the RB identification information, where Matches the data format within the first DC.
  • the RB identification information received by the first edge RB 1201 establishes a distribution tree forwarding entry.
  • the first edge RB 1201 establishes, according to the RB identification information in the first DC, the tree in the second DC, according to the RB identification information in the second DC.
  • the distribution tree forwarding entry of the root RB is a distribution tree forwarding entry of the root RB.
  • the first edge RB 1201 establishes the distribution tree forwarding entry by using a shortest path SPF algorithm according to the received RB identification information.
  • the SPF algorithm calculates the distance to each target RB by using a certain RB as the root (ROOT).
  • Each RB calculates the topology structure of the routing domain according to a unified database during calculation.
  • the structure is similar to a tree.
  • the SPF algorithm it is called the shortest path tree.
  • the first edge RB1201 is operated by the SPF algorithm to obtain a path with the least number of hops between the root RB and the destination RB of the shortest path tree, and the RB identification information of the path closest to the root RB is used as the distribution tree. Forward the entry to save.
  • the first edge RB 1201 may also save the port list formed by the SPF algorithm as a port number on the root RB as a distribution tree forwarding entry, so that the port number can be simultaneously sent to multiple destination RBs through the port number. Text. That is, the first edge RB1201 obtains the port number corresponding to the next hop RB, and adds the port number of the corresponding next hop RB to the distribution tree forwarding entry.
  • the first edge RB 1201 forwards the received RB identification information to other RBs in the first DC.
  • the first edge In order to enable each RB in the first DC to send a message to the RB in the second DC, the first edge
  • the RB 1201 sends the received RB identification information to other RBs in the first DC.
  • the other RBs may obtain the RB identification information of the next hop RB for the RB in the second DC, and save the RB identification information.
  • the first edge RB1201 is further configured to obtain a port number corresponding to the next hop RB, and add the port number corresponding to the next hop RB to the distribution tree forwarding entry.
  • the first edge RB 1201 may also save the port list formed by the SPF algorithm as a port number on the root RB as a distribution tree forwarding entry, and the port number may be simultaneously
  • the multiple destination RBs send the packet, that is, the other RBs obtain the port number corresponding to the next hop RB, and add the port number of the corresponding next hop RB to the distribution tree forwarding entry established by itself.
  • the RB identification information sent by the RB 1202 to the first edge RB 1201 of the first DC may distinguish the first intra-DC intra-RB and the second intra-DC RB such that each RB in the first DC and the second DC has unique identification information.
  • the first edge RB 1201 establishes a distribution tree forwarding entry according to the received RB identification information in the second DC, and sends the received RB identification information to other RBs in the first DC, so that the other DC receives the second DC.
  • the RB identification information is used to establish a distribution tree forwarding entry, and the RB can be successfully sent to another DC without the decapsulation and encapsulation of the first edge RB1 201 and the second edge RB 1202.
  • the RB checks the "M" field in the TRILL packet header, and multicasts the packet according to the distribution tree entry, and reduces the allocation amount of the hardware resources supported by the edge RB to support packet encapsulation and decapsulation.
  • the text forwarding efficiency is high.
  • the first edge RB 1201 manages the routing table of the first DC by using the first edge RB 1201 or the second edge RB 1202 to manage all the routing tables in the first DC and the second DC, thereby supporting large-scale The interconnection between the DCs.
  • first edge RB 1201 is further configured to receive the extended information sent by the second edge RB 1202, where the extended information is used to describe a correspondence between the RB identification information of the root RB and the VLAN ID of the second DC. .
  • the second edge RB 1202 sends the RB identification information to the first edge RB 1201 through BGP, in addition to transmitting the same information as the content type in the prior art, the second additional information, as shown in Table 3, is also sent. It is used to indicate whether it is the root RB, the RB identification information of the root RB, and the correspondence between the root RB and the VLAN.
  • the RB identification information of the root RB and the correspondence between the root RB and the VLAN are extended information.
  • the first edge RB 1201 is further configured to establish, according to the VLAN ID, a correspondence between the RB identification information of the root RB in the first DC and the RB identification information of the root RB in the second DC.
  • the RB identification information of the RB corresponding to the VLAN ID in the first DC is searched according to the extended information, that is, the VLAN ID, and the RB identification information of the root RB in the RB identification information and the second additional information is The VLAN ID is saved as a distribution tree forwarding entry.
  • the first edge RB 1201 changes the name of the egress RB in the TRILL packet header to the RB identification information of the root RB in the first DC corresponding to the original egress RB name, that is, the VLAN ID, so that the first edge RB1201 in the first DC is encapsulated.
  • the TRILL 4 header can be forwarded to the RB in the first DC.
  • the sending process of the foregoing message is only required.
  • the RB of the first DC is encapsulated by the edge RB of the first DC, and the RBs other than the first edge RB1201 of the first DC do not need to perform calculation of the next jump distribution tree forwarding entry for the RBs in other DCs.
  • the edge RB is used to support the allocation of hardware resources for packet encapsulation and decapsulation, and the packet forwarding efficiency is high, thereby further reducing the workload of other RBs.
  • the first edge RB 1201 manages the routing table of the first DC by using the first edge RB 1201 or the second edge RB 1202 to manage all the routing tables in the first DC and the second DC, thereby supporting large-scale The interconnection between the DCs.
  • the TRILL network interconnection system provided by the embodiment of the present invention is a second edge RB 1202, for example, the second edge RB 1202 of the second DC, and is unidirectional when transmitting the RB identification information to the first edge RB 1201, for example, the first edge RB 1201 of the first DC.
  • the technical solution is that when the first edge RB 1201 of the first DC sends the RB identification information to the second edge RB 1202 of the second DC, and the first edge RB 1201 of the first DC sends the RB identification information to other edge RBs of other DCs, Network interconnection between multiple DCs.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may contribute to the prior art or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium.
  • the instructions include a plurality of instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (proces sor) to perform all or part of the steps of the methods of the various embodiments of the present invention.
  • the foregoing storage medium includes: a USB flash drive, a removable hard disk, a read-only memory (ROM), a random access memory (RAM, Random Acces s Memory), a magnetic disk or an optical disk, and the like, which can store program codes. medium.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

L'invention se rapporte au domaine technique des communications. L'invention concerne un procédé d'interconnaion de réseaux TRILL, un dispositif et un système correspondant, permettant de résoudre le problème de faible rendement de transmission de paquets lié au fait qu'une grande quantité de ressources matérielles doit être attribuée à chaque pont de routage (RB) marginal pour supporter l'encapsulation et de la désencapsulation de paquets au cours de l'interconnexion entre des centres de données (DC). Le procédé de la présente invention comprend les étapes suivantes : le premier RB marginal d'un premier DC reçoit des informations d'identification de RB transmises par le second RB marginal d'un second DC, les informations d'identification de RB comprenant la combinaison de l'identification (ID) d'un RB racine dans un second DC et l'ID du second DC; et le premier RB marginal établit une entrée de transmission à arbre de distribution en fonction des informations d'identification de RB de sorte que le paquet peut être transmis selon l'entrée de transmission à arbre de distribution. La présente invention s'applique principalement au processus d'interconnexion entre DC.
PCT/CN2014/070124 2013-01-18 2014-01-04 Procédé d'interconnexion de réseaux trill, dispositif et système WO2014110986A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310027036.4A CN103095579B (zh) 2013-01-18 2013-01-18 Trill网络互联方法、装置及系统
CN201310027036.4 2013-01-18

Publications (1)

Publication Number Publication Date
WO2014110986A1 true WO2014110986A1 (fr) 2014-07-24

Family

ID=48207732

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/070124 WO2014110986A1 (fr) 2013-01-18 2014-01-04 Procédé d'interconnexion de réseaux trill, dispositif et système

Country Status (2)

Country Link
CN (1) CN103095579B (fr)
WO (1) WO2014110986A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103095579B (zh) * 2013-01-18 2016-03-30 华为技术有限公司 Trill网络互联方法、装置及系统
CN103346962B (zh) * 2013-06-20 2016-08-17 杭州华三通信技术有限公司 未知单播报文转发方法及路由桥
CN104954264B (zh) * 2014-03-24 2018-07-13 华为技术有限公司 组播连接标识符分配方法、装置
CN105323084B (zh) * 2014-07-01 2020-03-10 中兴通讯股份有限公司 三层网管管理trill网络的方法、装置及系统
CN106209626B (zh) * 2016-07-26 2019-12-06 新华三技术有限公司 自适应下发路由方法以及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101933366A (zh) * 2008-01-30 2010-12-29 高通股份有限公司 使用路由表管理无线中继节点
CN102075446A (zh) * 2011-03-01 2011-05-25 杭州华三通信技术有限公司 多链接透明互联网络异地互联方法及运营商边缘设备
CN102123091A (zh) * 2011-02-25 2011-07-13 福建星网锐捷网络有限公司 多链接透明传输互连转发表生成方法、装置及网络设备
CN103095579A (zh) * 2013-01-18 2013-05-08 华为技术有限公司 Trill网络互联方法、装置及系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101933366A (zh) * 2008-01-30 2010-12-29 高通股份有限公司 使用路由表管理无线中继节点
CN102123091A (zh) * 2011-02-25 2011-07-13 福建星网锐捷网络有限公司 多链接透明传输互连转发表生成方法、装置及网络设备
CN102075446A (zh) * 2011-03-01 2011-05-25 杭州华三通信技术有限公司 多链接透明互联网络异地互联方法及运营商边缘设备
CN103095579A (zh) * 2013-01-18 2013-05-08 华为技术有限公司 Trill网络互联方法、装置及系统

Also Published As

Publication number Publication date
CN103095579B (zh) 2016-03-30
CN103095579A (zh) 2013-05-08

Similar Documents

Publication Publication Date Title
JP6189942B2 (ja) 個別管理方式を使用する仮想転送インスタンスの遠端アドレスへのｖｌａｎタグ付きパケットのルーティング
EP2945320B1 (fr) Procédé, dispositif et système d'acheminement de transmission de données de virtualisation de réseau
CN102035729B (zh) 一种组播数据转发方法
WO2022100554A1 (fr) Procédé d'acheminement de message bier, dispositif et système
US9929936B2 (en) Method for sending multicast packet and switch
US20160043941A1 (en) Method and system for controlling an underlying physical network by a software defined network
US8730979B2 (en) Method and system for increasing forwarding efficiency of virtual private LAN service network
WO2014201974A1 (fr) Procédé de traitement de paquets d'acheminement de service, dispositif et système de réseau
WO2018214809A1 (fr) Procédé et dispositif de transmission de message, et support de stockage
WO2013026384A1 (fr) Procédé de transmission de données de service, nœud de réseau et système
CN114465946B (zh) 获取转发表项的方法、装置以及系统
WO2012119390A1 (fr) Procédé et système de notification de migration de machine virtuelle
WO2015144018A1 (fr) Procédé de transmission d'informations, dispositif et système de communication
WO2014121468A1 (fr) Procédé et dispositif d'établissement de canal de données de multidiffusion dans un système de virtualisation de réseau
WO2014110986A1 (fr) Procédé d'interconnexion de réseaux trill, dispositif et système
WO2018014767A1 (fr) Procédé et dispositif de détermination d'informations, et support de stockage
WO2013139159A1 (fr) Procédé de transmission de paquet dans un réseau et dispositif côté fournisseur
WO2015180120A1 (fr) Procédé de réacheminement de paquets, procédé de distribution d'entrées de réacheminement, et dispositif réseau
CN102045250B (zh) Vpls中组播报文的转发方法和服务提供商边缘设备
CN102255787B (zh) 一种基于服务质量的报文处理方法和运营商网络边缘设备
WO2014139157A1 (fr) Procédé de traitement de paquet et dispositif et système de paquet
WO2022117018A1 (fr) Procédé et appareil de transmission de paquet
CN112822097A (zh) 报文转发的方法、第一网络设备以及第一设备组
WO2012113251A1 (fr) Procédé et système d'interconnexion avec un réseau trill
WO2022116895A1 (fr) Procédé, dispositif et système de transfert de paquets bier

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14740601

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14740601

Country of ref document: EP

Kind code of ref document: A1