WO2020073908A1 - 一种发送路由信息的方法和装置 - Google Patents

一种发送路由信息的方法和装置 Download PDF

Info

Publication number
WO2020073908A1
WO2020073908A1 PCT/CN2019/110065 CN2019110065W WO2020073908A1 WO 2020073908 A1 WO2020073908 A1 WO 2020073908A1 CN 2019110065 W CN2019110065 W CN 2019110065W WO 2020073908 A1 WO2020073908 A1 WO 2020073908A1
Authority
WO
WIPO (PCT)
Prior art keywords
network node
tenant
routing information
routing
session
Prior art date
Application number
PCT/CN2019/110065
Other languages
English (en)
French (fr)
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 华为技术有限公司
Priority to EP19871460.2A priority Critical patent/EP3846396A4/en
Publication of WO2020073908A1 publication Critical patent/WO2020073908A1/zh
Priority to US17/226,990 priority patent/US11374860B2/en
Priority to US17/833,525 priority patent/US11863438B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/44—Distributed routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/033—Topology update or discovery by updating distance vector protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/64—Routing or path finding of packets in data switching networks using an overlay routing layer

Definitions

  • the present application relates to the field of communication technologies, and in particular, to a method and device for sending routing information.
  • SD-WAN software-defined wide-area network
  • CPE customer premises equipment
  • RR Route Reflector
  • RR can be connected to multiple CPEs of different enterprise tenants, so it is necessary to advertise routes for multiple CPEs of different enterprise tenants.
  • CPEs of different tenants do not need to send and receive routes to each other. If the RR needs to handle the routing advertisement service of multiple tenants, when the RR receives routing information of a tenant, it only needs to send routing information to other network nodes belonging to the tenant, and does not need to send routes to the network nodes of other tenants. information. That is, RR needs to advertise different routes for different tenants. Otherwise, if RR sends routing information to all tenant network nodes, the tenant network nodes will store some unnecessary routing information, resulting in waste of resources. In addition, RR The business processing time is extended and the performance is reduced.
  • the RR can determine the network nodes belonging to the tenant corresponding to the routing information, so that the RR can only send routing information to the determined network nodes of the specific tenant, but this way of determining This is more complicated, which makes the RR take longer to advertise routes, which reduces the performance of the RR.
  • Embodiments of the present application provide a method and an apparatus for sending routing information, so that RR adopts a simpler way to determine the network nodes to which the same tenant needs to be advertised, thereby saving the time for RR to advertise routes and improving the network Node performance.
  • an embodiment of the present application provides a method for sending routing information.
  • the method includes: a first network node receives routing information sent by a second network node; the first network node determines the routing information and a tenant identification Corresponding; the first network node determines that the third network node belongs to the tenant corresponding to the tenant identifier; in response to determining that the third network node belongs to the tenant corresponding to the tenant identifier, the first network node Three network nodes send the routing information.
  • the first network node can determine the third network node according to the tenant identifier corresponding to the received routing information during the process of issuing routes, that is, it determines the network nodes belonging to the same tenant to which the route needs to be issued,
  • the implementation is simpler, and the time required for the first network node to advertise the route can be shortened, thereby improving the performance of the first network node.
  • the determining, by the first network node, that the routing information corresponds to a tenant identifier includes: the first network node determining the first session and the Corresponding to the tenant identifier, the first network node receives the routing information through the first session, and the first session is a border gateway protocol session between the first network node and the second network node.
  • the correspondence between the first session and the tenant identification may be established in advance, so that if the first network node determines to be based on the first session After receiving the routing information sent by the second network node, it can be determined that the tenant identification corresponding to the first session is determined according to the established correspondence, and the routing information received by the first network node is based on the first session Therefore, the determined tenant ID corresponds to the routing information.
  • the determining by the first network node that the routing information corresponds to the tenant identification includes: the first network node determining the location where the routing information is sent.
  • the second network node belongs to the tenant corresponding to the tenant identifier.
  • the correspondence between the second network node and the tenant identification may be established in advance, so that when the first network node receives the routing information, it can determine the second network node that sends the routing information based on the correspondence The corresponding tenant ID. It can be understood that the second network node corresponds to the tenant identifier, that is, it indicates that the second network node belongs to the tenant corresponding to the tenant identifier.
  • the method further includes: the first network node according to The routing information generates a routing table entry, and adds the routing table entry to the routing information database corresponding to the tenant ID.
  • different tenants correspond to different routing information bases, so that routing table entries of different tenants are not stored in one routing information base, thereby reducing the number of routing table entries in the routing information base to be looked up and can be reduced The time to search for routing entries during packet forwarding to improve forwarding efficiency.
  • the first network node upon receiving the message sent by the device under the tenant corresponding to the tenant identification, can based on the routing table entry stored in the routing information database The message is forwarded to the corresponding next network node to achieve message forwarding.
  • the first network node determines that the third network node belongs
  • the tenant corresponding to the tenant ID includes: the first network node determines that the second session corresponds to the tenant ID, and the second session is a boundary between the first network node and the third network node Gateway protocol session.
  • the correspondence between the second session and the tenant ID may be established in advance.
  • the first network node determines the tenant ID, it may determine that the second corresponding to the tenant ID is determined according to the established correspondence.
  • a third network node that constitutes a second session with the first network node may be determined according to the second session. In this way, a third network node that belongs to the tenant corresponding to the tenant identifier can be determined according to the second session.
  • the first network node The sending of the routing information by the node includes: the first network node sending the routing information to the third network node through an execution module corresponding to the tenant identifier; wherein, the first network node has different
  • the tenant identification corresponds to different execution modules, and the execution modules include a central processor, thread, or process.
  • the first A plurality of execution modules corresponding to a network node can execute a process of sending routing information to a third network node belonging to a tenant corresponding to a different tenant identifier in parallel, thereby improving the processing efficiency of the first network node.
  • the second network node is a customer premises equipment CPE
  • the tenant identifier includes a tenant identifier; or, the second network node is a route reflector RR, and the tenant identifier includes one or more tenant identifiers.
  • the first network node is based on the routing information sent by the CPE , The tenant ID of the tenant to which the CPE belongs can be determined, and the number of tenant IDs determined is only one; if the second network node is a node RR that supports routing connection in the network, since the RR may serve multiple tenants That is, the RR may belong to multiple tenants.
  • the first network node may determine tenant IDs of multiple tenants based on the routing information sent by the RR, and the number of tenant IDs determined There may be multiple, of course, if the RR only serves one tenant, the tenant ID determined may also be only one.
  • the first network node determining that the routing information corresponds to a tenant identifier includes: the first network The node parses the routing characteristics in the routing information, and determines the tenant ID corresponding to the routing information from the one or more tenant IDs according to the routing characteristics.
  • the tenant IDs corresponding to the routing information can be filtered from the multiple tenant IDs.
  • a network node advertises a route, it only needs to advertise the route to the third network node belonging to the tenant corresponding to the tenant ID, instead of publishing the route to the network node belonging to the tenant corresponding to the other tenant ID, thereby reducing the number of advertised by the first network node The size of the route.
  • the routing feature includes any one or more of the following: the prefix address and community attribute of the routing information , Extended community attributes, autonomous system paths.
  • an embodiment of the present application further provides an apparatus for sending routing information, which is applied to a first network node, and includes: a receiving module for receiving routing information sent by a second network node; and a first determining module , Used to determine that the routing information corresponds to the tenant identification; a second determination module, used to determine that the third network node belongs to the tenant corresponding to the tenant identification; a sending module, used to determine that the third network node belongs to the tenant The tenant corresponding to the tenant identifier sends the routing information to the third network node.
  • the first determination module is specifically configured to determine that the first session corresponds to the tenant ID, and the first network node uses the first The routing information is received in a session, and the first session is a border gateway protocol session between the first network node and the second network node.
  • the first determining module is specifically configured to determine that the second network node that sends the routing information belongs to a tenant corresponding to the tenant identifier .
  • the apparatus further includes: a generation module, configured to The routing information generates a routing table entry; an addition module is used to add the routing table entry to the routing information library corresponding to the tenant ID.
  • the second determining module is specifically configured to determine the second The second session corresponds to the tenant identification, and the second session is a border gateway protocol session between the first network node and the third network node.
  • the sending module is specifically configured to pass the tenant Identify the corresponding execution module and send the routing information to the third network node;
  • different tenant identifiers on the first network node correspond to different execution modules, and the execution modules include a central processor, a thread, or a process.
  • the second network node is a customer premises equipment CPE
  • the tenant identifier includes a tenant identifier; or, the second network node is a route reflector RR, and the tenant identifier includes one or more tenant identifiers.
  • the first determining module includes: a parsing unit for parsing routing features in the routing information The determining unit is configured to determine the tenant ID corresponding to the routing information from the one or more tenant IDs according to the routing characteristics.
  • the routing feature includes any one or more of the following: prefix address of the routing information, community attribute , Extended community attributes, autonomous system paths.
  • the apparatus for sending routing information provided in the second aspect corresponds to the method for sending routing information provided in the first aspect, so for various possible implementation manners of the apparatus for sending routing information provided in the second aspect, refer to the method provided in the first aspect Various possible implementations of the method of sending routing information.
  • an embodiment of the present application provides a computer-readable storage medium having instructions stored therein, which when executed on a computer or processor, causes the computer or processor to execute the On the one hand or any of its possible design methods.
  • an embodiment of the present application provides a computer program product containing instructions, which when executed on a computer or processor, causes the computer or processor to execute the first aspect as described above or any possible design thereof The method.
  • the first network node may determine the tenant identifier corresponding to the routing information, and then determine the third network node, which belongs to the third network node The tenant identifier corresponds to the tenant, so that the first network node can send corresponding routing information to the third network node to complete the routing advertisement. It can be seen that during the process of issuing routes, the first network node can determine the third network node by the tenant identifier corresponding to the received routing information, that is, the network node belonging to the same tenant that needs to be issued the route to it is determined The implementation is simpler, and the time required for the first network node to advertise the route can be shortened, thereby improving the performance of the first network node.
  • Figure 1 is a schematic diagram of the network structure including CPE1 and CPE2;
  • FIG. 2 is a schematic diagram of a network structure involved in an exemplary application scenario provided by an embodiment of the present application
  • FIG. 3 is a schematic flowchart of a method for sending routing information in an embodiment of the present application
  • FIG. 4 is a schematic flowchart of another method for sending routing information in an embodiment of the present application.
  • FIG. 5 is a schematic flowchart of another method for sending routing information in an embodiment of the present application.
  • FIG. 6 is a schematic flowchart of another method for sending routing information in an embodiment of the present application.
  • FIG. 7 is a schematic structural diagram of an apparatus for sending routing information in an embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of a device for sending routing information in an embodiment of the present application.
  • CPEs that belong to different tenants usually do not need to send and receive routes to each other, and for different CPEs that belong to the same tenant, based on network deployment requirements, different CPEs usually cannot send and receive routes directly to each other, but through Send and receive routes with specific RR and other network nodes.
  • CPE1 and CPE2 cannot directly send and receive routes between each other.
  • CPE1 usually sends routing information to RR, and then RR sends routing information to CPE2 , So as to establish the routing path between CPE1 and CPE2.
  • CPE1 and CPE2 belong to the same tenant, while the remaining CPEs belong to another tenant.
  • the RR will connect multiple CPEs belonging to different tenants. Therefore, if the RR receives the routing information sent by the CPE, it will analyze the routing characteristics in the routing information from multiple networks adjacent to the RR.
  • the network nodes (which can be CPEs or other RRs) that belong to the tenant corresponding to the routing information are determined from the nodes. Specifically, the route characteristics obtained by parsing are compared with the route characteristics of routes that the RR can advertise to other network nodes. Yes, and determine the network node corresponding to the route with the same route characteristics, and then the RR can send routing information to the determined network node.
  • this method of analyzing the routing features from the routing information and comparing the routing features to determine the network nodes that need to receive the routing information has a complicated implementation process, and the number of network nodes adjacent to the RR is usually large , Making the number of routes with RR more than the routing feature more, it takes a long time to adopt this method, thereby reducing the performance of the network node.
  • the tenant identifier corresponding to the received routing information may be used to determine the network node that needs to receive the routing information, thereby saving time and determining the network node The performance of network nodes.
  • a tenant ID may be set in advance for tenants to which network nodes in the network belong. Network nodes belonging to the same tenant correspond to the same tenant ID, and different tenants correspond to different tenant IDs.
  • the first network node may only publish to the third network node having the same tenant identity as the second network node Routing, without the need to publish routes to network nodes corresponding to other tenant IDs, so that the network node receiving the routing information can be determined.
  • this determination requires receiving routing
  • the method of the information network node is more convenient, which can shorten the time required for the first network node to publish the route and improve the performance of the first network node.
  • CPE1 and CPE2 belong to tenant 1 and can establish a routing path through RR1.
  • the network composed of CPE1 and CPE2 belonging to the tenant 1 can also be called network segment 1, such as Slice 1, which means that different tenants
  • the identifier can represent different network fragments; CPE3, CPE4, and CPE5 belong to tenant 2, and a routing path can be established through RR1 and / or RR2.
  • the network of CPE3, CPE4, and CPE5 belonging to the tenant 2 can also be called Network segment 2, such as Slice 2; CPE6 belongs to tenant 3.
  • CPE1 can advertise routes to RR1, that is, send routing information to RR1.
  • RR1 can determine that the routing information sent by CPE1 corresponds to the tenant ID of tenant 1, , RR1 can determine CPE2 belonging to tenant 1, and send routing information to the determined CPE2, so that a routing path is established between CPE1 and CPE2 through RR1.
  • RR1 determines the CPE2 belonging to tenant 1 according to the tenant ID of tenant 1, and then only advertises the route to CPE2, so that RR1 can determine the required route in a shorter time. It advertises the route CPE2, which can further improve the performance of network nodes.
  • FIG. 3 shows a schematic flowchart of a method for sending routing information according to an embodiment of the present application.
  • the method may specifically include:
  • S301 The first network node receives routing information sent by the second network node.
  • the first network node may be a node in the network that can support routing connection between the second network node and the third network node, such as a router or switch in the network, and the second network node may belong to a certain tenant Device, or a node in the network that can support the device to establish routing connections with other network nodes.
  • the first network node and the second network node are adjacent network nodes. For example, when this embodiment is applied in the application scenario shown in FIG.
  • the second network node may be CPE1, and the first network node adjacent to the second network node is to support CPE1 and CPE2 to establish a route Connected RR1; of course, the second network node can also be RR1, and RR1 can support CPE3 to establish routing connections with CPE4 and CPE5 respectively, then the first network node adjacent to the second network node can also support routing connection RR2.
  • the first network node determines that the routing information corresponds to the tenant identifier.
  • a corresponding tenant identifier may be established for each tenant, and the tenant identifier may be used to distinguish multiple tenants served by the first network node.
  • the routing information sent by different second network nodes belonging to the same tenant corresponds to the same tenant identifier
  • the routing information sent by the second network nodes belonging to different tenants corresponds to different tenant identifiers.
  • you can segment the devices under the tenant in the network Specifically, you can divide the devices in the network that belong to the same tenant into the same network segment.
  • the network segment is composed of devices that belong to the same tenant.
  • the network segment corresponds to the tenant ID of the tenant, that is, devices of different tenants belong to different network segments, and different network segments correspond to different tenant IDs.
  • the first network node may use the configuration information of the tenant ID in advance to configure the tenant ID for the second network node adjacent to the first network node, which may specifically be the use of the tenant ID
  • the session between the first network node and the second network node configures the tenant identification for the second network node.
  • the tenant represented by the tenant identifier is the tenant served by the first network node or the tenant to which the second network node belongs.
  • the first network node may determine the tenant identification corresponding to the first session.
  • the first session may be a BGP (Border Gateway Protocol, Border Gateway Protocol) session between the first network node and the second network node.
  • the correspondence between the first session and the tenant identification between the first network node and the second network node may be established in advance, so that after receiving the routing information sent by the second network node, the first network node may first The first session transmitting the routing information is determined, and then, according to the pre-established correspondence between the first session and the tenant ID, the tenant ID corresponding to the first session is determined.
  • the tenant identity may also be directly determined according to the second network node.
  • the correspondence between the second network node and the tenant ID may be established in advance, and it may be configured on the first network node. In this way, when the first network node After receiving the routing information, the network node that sends the routing information may first be determined as the second network node, and then, according to the pre-established correspondence between the second network node and the tenant ID, the tenant corresponding to the second network node may be determined Logo.
  • the first network node may receive routing information sent by multiple network nodes, and for each network node, a correspondence between the network node and the tenant ID of the tenant to which the network node belongs may be established in advance. Relationship, and the corresponding relationship between multiple network nodes and tenant identifications is configured on the first network node.
  • the tenant identifier determined by the first network node based on the received routing information may be one or more.
  • the first network node may receive the routing information sent by the CPE according to the first session between the CPE and the first network node Corresponding relationship with the tenant ID, it is determined that the routing information corresponds to only one tenant ID, that is, the tenant ID of the tenant to which the CPE belongs.
  • the first network node may not be able to accurately determine which tenant needs to be based on the routing information sent by the second network node Establish a routing connection. Based on this, if the first network node serves only one tenant, the tenant ID determined based on the routing information is still one, but if the first network node serves multiple tenants, the first network node can determine multiple tenants based on the routing information.
  • Tenant IDs where the tenant corresponding to each determined tenant ID is the tenant served by the first network node, and the multiple tenant IDs include the target tenant in addition to the target tenant's tenant ID The tenant IDs of other tenants, where the target tenant is the tenant to which the device that needs to establish a routing connection belongs.
  • the first network node cannot determine which tenant needs to establish a routing connection between devices under the received routing information, the tenant must be the tenant served by the first network node. Therefore, by determining the first network The tenant identifiers of multiple tenants served by the node, and ultimately the established routing connection will inevitably include the routing connections that need to be established between the devices under the target tenant.
  • the determined multiple tenant identifiers may be tenant identifiers corresponding to tenants jointly served by the first network node and the second network node, and of course, may also be all tenants served by the first network node The corresponding tenant ID.
  • the first network node determines that the third network node belongs to the tenant corresponding to the tenant identifier.
  • the first network node may further determine the third network node belonging to the tenant corresponding to the tenant identification based on the determined tenant identification.
  • the third network node may be a device belonging to the tenant corresponding to the tenant identifier, or a node in the network that can support the device of the tenant to establish a routing connection with other network nodes.
  • the first network node and the third network node are adjacent network nodes. For example, when this embodiment is applied in the application scenario shown in FIG.
  • the third network node adjacent to the first network node may need to establish a routing connection with CPE1 CPE2 at this time, the second network node is CPE1; it may also be RR2 supporting CPE3 to establish a routing connection with CPE4 and CPE5 respectively, and at this time, the second network node is CPE3.
  • the first network node determines the third network node, it may be determined according to the second session corresponding to the determined tenant identification.
  • the correspondence between the session and the tenant ID may be established in advance.
  • the session is the session between the first network node and the network node that needs to receive routing information.
  • the tenant corresponding to the tenant ID is the first network node and the tenant. Tenants jointly served by other network nodes.
  • the first network node determines the tenant ID, it can determine the second session corresponding to the tenant ID based on the established relationship between the session and the tenant ID, and then the third network can be determined according to the second session Node, wherein the second session is a session between the first network node and the third network node.
  • the second session may specifically be a BGP session.
  • the first network node may send routing information to the third network node to implement the connection between the first network node and the second network On the basis of the established routes between the nodes, continue to build routing paths.
  • the process of the first network node sending routing information to third network nodes of different tenants is independent of each other, that is, when the first network node sends routing information to the third network node belonging to the tenant corresponding to tenant ID A, It does not affect the first network node to send routing information to the third network node belonging to the tenant corresponding to the tenant identifier B.
  • mutually independent execution modules may be set based on the tenants served by the first network node, each tenant's execution module corresponds to the tenant's tenant identification, and different tenant's execution modules correspond to For different tenant IDs.
  • the execution module on the first network node corresponding to the tenant identifier may perform the sending of the routing information.
  • the first network node determines multiple tenant identities based on the received routing information
  • multiple execution modules corresponding to the first network node can execute in parallel to the third network node belonging to tenants corresponding to different tenant identities
  • the process of sending routing information can improve the processing efficiency of the first network node.
  • the execution module corresponding to each tenant identifier may include a central processor, thread, or process on the first network node.
  • the first network node may also generate a routing table entry based on the routing information, and may add the routing table entry to the routing information library corresponding to the tenant ID in.
  • the routing information database may be stored on the first network node, so that the first network node can be based on the routing when receiving the message sent by the device under the tenant corresponding to the tenant ID
  • the routing table entry stored in the information database forwards the message to the corresponding next network node to achieve message forwarding.
  • the routing information database corresponding to the tenant identification may not only store routing entries generated based on routing information sent by the second network node, but also store routing information sent based on other network nodes adjacent to the first network node The generated routing table entry.
  • routing information bases can be set for different tenants, so that routing table entries of different tenants can be avoided from being stored in one routing information base, thereby reducing the number of routing table entries in the routing information base to be looked up, It can reduce the time for searching routing table entries during packet forwarding and improve forwarding efficiency.
  • the first network node may determine multiple tenant identifiers based on the routing information sent by the second network node, so that the first network node will send routing information to a third network node corresponding to the multiple tenant identifiers.
  • a corresponding filtering strategy may be set on the first network node, and multiple tenant identifiers are determined for the routing information at the first network node.
  • the filtering strategy can be used to determine to which tenant the device establishing the routing connection belongs, that is, the tenant ID of the tenant to which the device establishing the routing connection belongs is determined from multiple tenant IDs, so that the first network node only identifies
  • the corresponding third network node advertises the route, so that the scale of the route advertised by the first network node can be reduced.
  • FIG. 4 shows a schematic flowchart of another method for sending routing information according to an embodiment of the present application.
  • the method may specifically include:
  • S401 The first network node receives the routing information sent by the second network node.
  • the first network node determines that the routing information corresponds to the tenant identifier.
  • steps S401 to S402 are similar to steps S301 to S302 in the previous embodiment.
  • steps S401 to S402 are similar to steps S301 to S302 in the previous embodiment.
  • S403 The first network node parses the routing feature in the routing information.
  • the first network node determines the tenant ID corresponding to the routing information from one or more tenant IDs according to the resolved routing characteristics.
  • the first network node determines multiple tenant identities based on the received routing information.
  • the first network node may establish a correspondence between the first session and multiple tenant identifiers, and the first session is a session between the first network node and the second network node. It is possible to filter the multiple tenant IDs by using the preset filtering policy of the tenant ID, and determine the tenant ID corresponding to the routing information, that is, the tenant ID of the tenant to which the device that establishes the routing connection belongs.
  • the first network node may determine whether multiple tenant identities have been determined based on the routing information. If so, the routing characteristics in the routing information may be parsed. In one example, the specific One or more characteristics of the routing information community attribute, extended community attribute, route prefix address, and autonomous system path are resolved. Then, the first network node may compare the parsed routing features with the routing features corresponding to each tenant ID, and determine the tenant ID corresponding to the same routing feature as the tenant ID corresponding to the routing information.
  • the first network node after filtering out the tenant ID corresponding to the routing information from multiple tenant IDs, the first network node only needs to publish the route to the third network node belonging to the tenant corresponding to the tenant ID when advertising the route, rather than to The network node of the tenant corresponding to the other tenant identifier publishes the route, thereby reducing the scale of the route issued by the first network node.
  • S405 The first network node determines that the third network node belongs to the tenant corresponding to the determined tenant identifier.
  • the routing characteristics of the routing information can be used.
  • the tenant IDs corresponding to the routing information are filtered out in each tenant ID, so that when the first network node advertises the route, it only needs to advertise the route to the third network node belonging to the tenant corresponding to the tenant ID, rather than belonging to other tenants.
  • the third network node that identifies the corresponding tenant advertises the route, which can further reduce the scale of the route advertised by the first network node.
  • the second network node can be either a device belonging to a certain tenant (such as CPE) or a node in the network that supports routing connection (such as RR, etc.), the embodiments of the present application can be applied to at least In two different scenarios.
  • the technical solutions of the embodiments of the present application will be described below with reference to two specific scenarios.
  • FIG. 5 shows a schematic flowchart of another method for sending routing information according to an embodiment of the present application.
  • the method may specifically include:
  • the RR receives the routing information sent by the CPE.
  • the correspondence between the first session and the tenant ID may be established in advance, and the first session may be a BGP session between the CPE and the RR.
  • the RR can find out the tenant ID corresponding to the first session between the CPE and the RR according to the established correspondence between the first session and the tenant ID, and use it as the The tenant ID corresponding to the routing information.
  • the determined tenant ID is also the tenant ID of the tenant to which the CPE belongs.
  • S503 The RR determines that the third network node belongs to the tenant corresponding to the tenant identifier.
  • the correspondence between the second session and the tenant identification may be established in advance, and the second session may be a BGP session between the RR and the third network node.
  • the second relationship corresponding to the tenant identification can be determined by using the corresponding relationship, and then the third network node that has the second session with the RR is determined according to the second session.
  • the RR can determine the third network node by the tenant identifier corresponding to the received routing information, that is, the network node that needs to receive the routing information is determined, which can shorten the cost of the network node to publish the route. Duration, which in turn improves the performance of network nodes.
  • the technical solution of the embodiment of the present application is described by using the second network node as a device belonging to a certain tenant, while in other application scenarios, the second network node may also be supported in the network
  • the first network node is RR1 and the second network node is RR2.
  • RR1 may determine multiple tenant IDs based on the routing information sent by RR2. To reduce the route size advertised by RR1, you can set a corresponding filtering policy on RR1, and use this filtering policy to determine RR1 To filter multiple tenant IDs.
  • FIG. 6 shows a schematic flowchart of another method for sending routing information according to an embodiment of the present application.
  • the method may specifically include:
  • RR1 receives the routing information sent by RR2.
  • RR1 determines the tenant ID corresponding to the routing information from multiple tenant IDs according to the resolved routing characteristics, and uses it as the target tenant ID.
  • RR1 may determine multiple tenant IDs based on the received routing information. Then, the tenant ID filtering policy set in advance on RR1 may be used to filter the multiple tenant IDs to determine the need. The tenant ID of the tenant to which the routing connection device belongs.
  • RR1 can determine whether multiple tenant IDs have been determined based on the routing information, and if so, it can analyze the routing characteristics in the routing information. RR1 may determine multiple tenant IDs according to the established correspondence between the first session and multiple tenant IDs, and according to the corresponding relationship between the first session and the tenant IDs. In one example, it may specifically resolve one or more characteristics of the routing information's community attribute, extended community attribute, route prefix address, and autonomous system path. Then, RR1 may compare the parsed routing features with the routing features corresponding to each tenant ID, and determine the tenant ID corresponding to the same routing feature as the tenant ID corresponding to the routing information.
  • RR1 after filtering out the tenant ID corresponding to the routing information from multiple tenant IDs, RR1 only needs to advertise the route to the third network node belonging to the tenant corresponding to the tenant ID when advertising the route, rather than to other tenant IDs.
  • the network node of the corresponding tenant advertises the route, thereby reducing the scale of the route advertised by RR1.
  • RR1 determines that the third network node belongs to the tenant corresponding to the determined tenant identifier.
  • RR1 In response to determining that the third network node belongs to the tenant corresponding to the tenant identifier, RR1 sends routing information to the third network node.
  • the routing features of the routing information can be used from many
  • the tenant IDs corresponding to the routing information are filtered out from each tenant ID, so that when RR1 advertises routes, it only needs to advertise routes to the third network node belonging to the tenant corresponding to the tenant ID, rather than to tenants belonging to other tenant IDs.
  • the third network node of publishes routes, which in turn can reduce the scale of the routes advertised by RR1.
  • FIG. 7 shows a schematic structural diagram of an apparatus for sending routing information according to an embodiment of the present application.
  • the apparatus 700 may specifically include:
  • the receiving module 701 is configured to receive routing information sent by the second network node
  • the first determining module 702 is configured to determine that the routing information corresponds to the tenant identification
  • the second determining module 703 is configured to determine that the third network node belongs to the tenant corresponding to the tenant identifier
  • the sending module 704 is configured to send the routing information to the third network node in response to determining that the third network node belongs to the tenant corresponding to the tenant identifier.
  • the first determining module 702 is specifically configured to determine that the first session corresponds to the tenant identifier, and the first network node receives the routing information through the first session.
  • the first session is a border gateway protocol session between the first network node and the second network node.
  • the corresponding relationship between the first session and the tenant identification may be established in advance, so that if the first network node determines to receive the second network node based on the first session
  • the routing information sent it can be determined that the tenant ID corresponding to the first session is determined according to the established correspondence, and the routing information received by the first network node is based on the first session received, therefore, the determined The tenant ID corresponds to the routing information.
  • the first determining module 702 is specifically configured to determine that the second network node that sends the routing information belongs to a tenant corresponding to the tenant identifier.
  • the correspondence between the second network node and the tenant identification may be established in advance, so that when the first network node receives the routing information, it can determine the second network node that sends the routing information based on the correspondence The corresponding tenant ID. It can be understood that the second network node corresponds to the tenant identifier, that is, it indicates that the second network node belongs to the tenant corresponding to the tenant identifier.
  • the apparatus 700 further includes:
  • a generating module configured to generate a routing entry according to the routing information
  • An adding module is used to add the routing table entry to the routing information database corresponding to the tenant ID.
  • the first network node upon receiving the message sent by the device under the tenant corresponding to the tenant identification, can based on the routing table entry stored in the routing information database The message is forwarded to the corresponding next network node to achieve message forwarding.
  • different tenants can correspond to different routing information bases, so that routing table entries of different tenants are not stored in one routing information base, thereby reducing the number of routing table entries in the routing information base to be looked up and can be reduced The time to search for routing entries during packet forwarding to improve forwarding efficiency.
  • the second determining module 703 is specifically configured to determine that the second session corresponds to the tenant identifier, and the second session is one of the first network node and the third network node Boundary Gateway Protocol session.
  • the correspondence between the second session and the tenant ID may be established in advance.
  • the first network node determines the tenant ID, it may determine that the second corresponding to the tenant ID is determined according to the established correspondence.
  • a third network node that constitutes a second session with the first network node may be determined according to the second session. In this way, a third network node that belongs to the tenant corresponding to the tenant identifier can be determined according to the second session.
  • the sending module 704 is specifically configured to send the routing information to the third network node through an execution module corresponding to the tenant identification;
  • different tenant identifiers on the first network node correspond to different execution modules, and the execution modules include a central processor, a thread, or a process.
  • the first network node Since the process of the first network node sending routing information to the third network nodes of different tenants is independent of each other, when the first network node determines multiple tenant identities based on the received routing information, the first network node The corresponding multiple execution modules can execute the process of sending routing information to the third network node belonging to the tenant corresponding to the different tenant identifiers in parallel, thereby improving the processing efficiency of the first network node.
  • the second network node is a customer premises equipment CPE
  • the tenant identifier includes a tenant identifier
  • the second network node is a route reflector RR, and the tenant identifier includes one or more tenant identifiers.
  • the first network node can determine based on the routing information sent by the CPE Out of the tenant ID of the tenant to which the CPE belongs, the number of tenant IDs determined is also only one; if the second network node is a node RR that supports routing connections in the network, the RR may serve multiple tenants, namely the RR It may belong to multiple tenants. Therefore, corresponding to the tenant IDs of multiple tenants, the first network node may determine the tenant IDs of multiple tenants based on the routing information sent by the RR. The number of tenant IDs determined may be more Of course, if the RR serves only one tenant, the tenant ID determined may be only one.
  • the first determining module 701 includes:
  • a parsing unit used to parse the routing features in the routing information
  • the determining unit is configured to determine the tenant ID corresponding to the routing information from the one or more tenant IDs according to the routing characteristics.
  • the tenant IDs corresponding to the routing information can be filtered from the multiple tenant IDs.
  • a network node advertises a route, it only needs to advertise the route to the third network node belonging to the tenant corresponding to the tenant ID, instead of publishing the route to the network node belonging to the tenant corresponding to the other tenant ID, thereby reducing the number of advertised by the first network node The size of the route.
  • the routing feature includes any one or more of the following: a prefix address of the routing information, a community attribute, an extended community attribute, and an autonomous system path.
  • the previous embodiment describes the apparatus for sending routing information in the embodiment of the present application from the perspective of a functional entity.
  • the following describes the device for sending routing information in the embodiment of the present application in detail from the perspective of hardware processing.
  • the device includes: a processor, a memory, a communication interface, and a bus; the processor, the communication interface, and the memory communicate with each other through the bus; The communication interface is used to receive and send data; the memory is used to store instructions; and the processor is used to execute the instructions in the memory, performing the following operations:
  • the first network node determining that the routing information corresponds to the tenant identification includes:
  • the first network node determines that the first session corresponds to the tenant identifier, the first network node receives the routing information through the first session, and the first session is the first network node and the A border gateway protocol session between second network nodes.
  • the first network node determining that the routing information corresponds to the tenant identification includes:
  • the first network node determines that the second network node sending the routing information belongs to the tenant corresponding to the tenant identifier.
  • the method further includes:
  • the first network node generates a routing entry based on the routing information, and adds the routing entry to the routing information database corresponding to the tenant ID.
  • the first network node determining that the third network node belongs to the tenant corresponding to the tenant identifier includes:
  • the first network node determines that the second session corresponds to the tenant identifier, and the second session is a border gateway protocol session between the first network node and the third network node.
  • the sending of the routing information by the first network node to the third network node includes:
  • the first network node sends the routing information to the third network node through an execution module corresponding to the tenant ID; where different tenant IDs on the first network node correspond to different execution modules,
  • the execution module includes a central processor, thread or process.
  • the second network node is a customer premises equipment CPE
  • the tenant identifier includes a tenant identifier
  • the second network node is a route reflector RR, and the tenant identifier includes one or more tenant identifiers.
  • the first network node determining that the routing information corresponds to the tenant identification includes:
  • the first network node parses the routing characteristics in the routing information, and determines the tenant ID corresponding to the routing information from the one or more tenant IDs according to the routing characteristics.
  • the routing feature includes any one or more of the following: a prefix address of the routing information, a community attribute, an extended community attribute, and an autonomous system path.
  • the communication interface may include a receiver 801 and a transmitter 802.
  • the receiver 801, the transmitter 802, the processor 803, and the memory 804 may be connected through a bus or in other ways. In FIG. 8, connection through a bus is used as an example.
  • the memory 804 may include a read-only memory and a random access memory, and provide instructions and data to the processor 803. A part of the memory 804 may also include a non-volatile random access memory (English full name: Non-Volatile Random Access Memory, English abbreviation: NVRAM).
  • the memory 804 stores an operating system and operation instructions, executable modules or data structures, or a subset thereof, or an extended set thereof, where the operation instructions may include various operation instructions for implementing various operations.
  • the operating system may include various system programs for implementing various basic services and processing hardware-based tasks.
  • the processor 803 controls the operation of the device 800, and the processor 803 may also be called a central processing module (English full name: Central Processing Unit, English abbreviation: CPU).
  • the various components are coupled together through a bus system.
  • the bus system may also include a power bus, a control bus, and a status signal bus.
  • various buses are called bus systems in the figure.
  • the method disclosed in the above embodiments of the present application may be applied to the processor 803, or implemented by the processor 803.
  • the processor 803 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in the processor 803 or instructions in the form of software.
  • the aforementioned processor 803 may be a general-purpose processor, a digital signal processor (English full name: digital signal processing, English abbreviation: DSP), an application specific integrated circuit (English full name: Application Specific Integrated Circuit, English abbreviation: ASIC), field programmable Gate array (English full name: Field-Programmable Gate Array, English abbreviation: FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present application may be implemented or executed.
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied and executed by a hardware decoding processor, or may be executed and completed by a combination of hardware and software modules in the decoding processor.
  • the software module may be located in a mature storage medium in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, and a register.
  • the storage medium is located in the memory 804, and the processor 803 reads the information in the memory 804 and completes the steps of the above method in combination with its hardware.
  • the receiver 801 can be used to receive input digital or character information, and generate signal input related to device 800 related settings and function control.
  • the transmitter 802 can include a display device such as a display screen, and the transmitter 802 can be used to output numbers through an external interface Or character information.
  • the processor 803 is configured to perform the following operations:
  • embodiments of the present application also provide a computer-readable storage medium, in which instructions are stored in the computer-readable storage medium, which when executed on a computer or processor, causes the computer or processor to execute the above-mentioned transmission routing information Methods.
  • embodiments of the present application also provide a computer program product containing instructions, which when executed on a computer or processor, causes the computer or processor to execute the above method for sending routing information.
  • the embodiments in this specification are described in a progressive manner.
  • the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments.
  • the description is relatively simple, and the relevant part can be referred to the description of the method embodiment.
  • the device embodiments described above are only schematic, wherein the modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules, that is, may be located in one place Or, it can be distributed to multiple network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art can understand and implement without paying creative labor.

Landscapes

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

Abstract

本申请公开了一种发送路由信息的方法和装置，包括：第一网络节点接收第二网络节点发送的路由信息，并确定该路由信息与租户标识对应，然后，第一网络节点可以确定第三网络节点属于该租户标识对应的租户，并响应与确定第三网络节点属于该租户标识对应的租户，向第三网络节点发送路由信息。可见，第一网络节点在发布路由的过程中，可以通过接收到的路由信息所对应的租户标识来确定出第三网络节点，也即确定出了需要向其发布路由的属于同一租户的网络节点，实现更加简单，从而可以缩短第一网络节点发布路由所需耗费的时长，进而提高了第一网络节点的性能。

Description

一种发送路由信息的方法和装置
本申请要求于2018年10月12日提交中国国家知识产权局、申请号、申请名称为“一种发送路由信息的方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，特别是涉及一种发送路由信息的方法和装置。
背景技术
在软件定义广域网(software-defined wide-area network，SD-WAN)中，众多用户驻地设备(customer-premises equipment，CPE)分布在不同的企业租户处，每个CPE用于发布一个企业租户的路由。而路由反射器(Route Reflector，RR)用于提供了CPE之间的路由交换，即其中一个CPE向RR发送路由信息后，RR向另一个CPE发送路由信息，以建立两个CPE之间的路由路径。其中，RR可以连接多个不同企业租户的CPE，从而需要为多个不同企业租户的CPE发布路由。
通常情况下，不同租户的CPE之间并不需要相互收发路由。若RR上需要处理多个租户的路由发布业务，当RR接收到一个租户的路由信息时，仅需要向属于该租户的其它网络节点发送路由信息，而并不需要向其他租户的网络节点发送路由信息。也即，RR需要针对不同的租户发布不同的路由，否则，如果RR向所有租户的网络节点都发送路由信息，则租户的网络节点会存储一些不需要的路由信息，导致资源浪费，另外，RR的业务处理时间延长、性能下降。虽然，通过解析路由信息中的路由特征，RR可以确定出属于该路由信息对应的租户的网络节点，从而RR能够仅向所确定出的特定租户的网络节点发送路由信息，但是，这种确定方式较为复杂、这使得RR需要较长时间来发布路由，从而降低了RR的性能。
发明内容
本申请实施例提供一种发送路由信息的方法和装置，以使得RR采用更为简便地方式来确定出需要向其发布路由的属于同一租户的网络节点，从而节省RR发布路由的时间、提升网络节点性能。
第一方面，本申请实施例提供了一种发送路由信息的方法，该方法包括：第一网络节点接收第二网络节点发送的路由信息；所述第一网络节点确定所述路由信息与租户标识对应；所述第一网络节点确定第三网络节点属于所述租户标识对应的租户；响应于确定所述第三网络节点属于所述租户标识对应的租户，所述第一网络节点向所述第三网络节点发送所述路由信息。
由于第一网络节点在发布路由的过程中，可以通过接收到的路由信息所对应的租户标识来确定出第三网络节点，也即确定出了需要向其发布路由的属于同一租户的网 络节点，实现更加简单，可以缩短第一网络节点发布路由所需耗费的时长，进而提高了第一网络节点的性能。
结合第一方面，在第一方面的第一种可能的实施方式中，所述第一网络节点确定所述路由信息与租户标识对应，包括：所述第一网络节点确定第一会话与所述租户标识对应，所述第一网络节点通过所述第一会话接收所述路由信息，所述第一会话为所述第一网络节点和所述第二网络节点之间的边界网关协议会话。
在该实施方式中，由于第一网络节点与第二网络节点之间存在第一会话，因此可以预先建立第一会话与租户标识的对应关系，这样，若第一网络节点确定基于该第一会话接收到第二网络节点发送的路由信息，则可以确定根据已建立的对应关系，确定第一会话所对应的租户标识，而第一网络节点接收到的路由信息是基于该第一会话接收到的，因此，所确定的租户标识与该路由信息相对应。
结合第一方面，在第一方面的第二种可能的实施方式中，所述第一网络节点确定所述路由信息与租户标识对应包括：所述第一网络节点确定发送所述路由信息的所述第二网络节点属于所述租户标识对应的租户。
在该实施方式中，可以预先建立第二网络节点与租户标识的对应关系，这样，当第一网络节点接收到该路由信息后，就可以基于该对应关系，确定发送路由信息的第二网络节点所对应的租户标识。可以理解，第二网络节点对应于该租户标识，也即表明该第二网络节点属于该租户标识对应的租户。
结合第一方面至第一方面的第二种可能的实施方式中的任意一种实施方式，在第一方面的第三种可能的实施方式中，该方法还包括：所述第一网络节点根据所述路由信息生成路由表项，并将所述路由表项添加到所述租户标识对应的路由信息库中。可选地，不同的租户对应不同的路由信息库，这样避免了不同租户的路由表项存储在一个路由信息库中，从而减少了需要查找的路由信息库中的路由表项的数量，能够减少报文转发时查找路由表项的时间，提高转发效率。
由于基于该路由信息生成并存储了路由表项，则第一网络节点在接收到该租户标识对应的租户下的设备所发送的报文时，能够基于该路由信息库中存储的路由表项将该报文转发至相应的下一网络节点，以实现报文的转发。
结合第一方面至第一方面的第三种可能的实施方式中的任意一种实施方式，在第一方面的第四种可能的实施方式中，所述第一网络节点确定第三网络节点属于所述租户标识对应的租户，包括：所述第一网络节点确定第二会话与所述租户标识对应，所述第二会话为所述第一网络节点和所述第三网络节点之间的边界网关协议会话。
在该实施方式中，可以预先建立第二会话与租户标识的对应关系，这样，若第一网络节点确定租户标识后，则可以确定根据已建立的对应关系，确定该租户标识所对应的第二会话，进而可以根据该第二会话确定出与第一网络节点构成第二会话的第三网络节点。这样，就可以根据该第二会话确定出同属于该租户标识对应的租户的第三网络节点。
结合第一方面至第一方面的第四种可能的实施方式中的任意一种实施方式，在第一方面的第五种可能的实施方式中，所述第一网络节点向所述第三网络节点发送所述路由信息，包括：所述第一网络节点通过所述租户标识对应的执行模块，向所述第三网络节点发送所述路由信息；其中，在所述第一网络节点上不同的租户标识对应于不同的执行模块，所述执行模块包括中央处理器、线程或进程。
在实施方式中，由于第一网络节点向不同租户的第三网络节点发送路由信息的过程是相互独立的，因此，当第一网络节点基于接收到的路由信息确定出多个租户标识时，第一网络节点上与其对应的多个执行模块就可以并行执行向属于不同租户标识对应的租户的第三网络节点发送路由信息的过程，从而可以提升第一网络节点的处理效率。
结合第一方面至第一方面的第五种可能的实施方式中的任意一种实施方式，在第一方面的第六种可能的实施方式中，所述第二网络节点为用户驻地设备CPE，所述租户标识包括一个租户标识；或，所述第二网络节点为路由反射器RR，所述租户标识包括一个或多个租户标识。
在该实施方式中，若第二网络节点为某个租户下的CPE，由于该CPE只属于一个租户，因此，只对应于一个租户的租户标识，则第一网络节点基于该CPE发送的路由信息，可以确定出该CPE所属租户的租户标识，所确定的租户标识的数量也仅为一个；若第二网络节点为网络中支持路由连接的节点RR，由于该RR可能会服务于多个租户，即该RR可能属于多个租户，因此，对应于多个租户的租户标识，则第一网络节点基于该RR发送的路由信息，可以确定出多个租户的租户标识，所确定的租户标识的数量可能为多个，当然，若RR仅服务于一个租户，则所确定的租户标识也可以只为一个。
结合第一方面的第六种可能的实施方式，在第一方面的第七种可能的实施方式中，所述第一网络节点确定所述路由信息与租户标识对应，包括：所述第一网络节点解析所述路由信息中的路由特征，根据所述路由特征从所述一个或多个租户标识中确定出所述路由信息对应的租户标识。
在该实施方式中，若第一网络节点基于路由信息确定出多个租户标识，则利用预先设置的过滤策略，可以从多个租户标识中过滤出与该路由信息对应的租户标识，这样，第一网络节点在发布路由时只需向属于该租户标识对应的租户的第三网络节点发布路由，而不用向属于其它租户标识对应的租户的网络节点发布路由，从而可以减少第一网络节点所发布的路由的规模。
结合第一方面的第七种可能的实施方式，在第一方面的第八种可能的实施方式中，所述路由特征包括以下任意一种或多种：所述路由信息的前缀地址、团体属性、扩展团体属性、自治系统路径。
第二方面，本申请实施例还提供了一种发送路由信息的装置，该装置应用于第一网络节点，该包括：接收模块，用于接收第二网络节点发送的路由信息；第一确定模块，用于确定所述路由信息与租户标识对应；第二确定模块，用于确定第三网络节点属于所述租户标识对应的租户；发送模块，用于响应于确定所述第三网络节点属于所 述租户标识对应的租户，向所述第三网络节点发送所述路由信息。
结合第二方面，在第二方面的第一种可能的实施方式中，所述第一确定模块，具体用于确定第一会话与所述租户标识对应，所述第一网络节点通过所述第一会话接收所述路由信息，所述第一会话为所述第一网络节点和所述第二网络节点之间的边界网关协议会话。
结合第二方面，在第二方面的第二种可能的实施方式中，所述第一确定模块，具体用于确定发送所述路由信息的所述第二网络节点属于所述租户标识对应的租户。
结合第二方面至第二方面的第二种可能的实施方式中的任意一种实施方式，在第二方面的第三种可能的实施方式中，该装置还包括：生成模块，用于根据所述路由信息生成路由表项；添加模块，用于将所述路由表项添加到所述租户标识对应的路由信息库中。
结合第二方面至第二方面的第三种可能的实施方式中的任意一种实施方式，在第二方面的第四种可能的实施方式中，所述第二确定模块，具体用于确定第二会话与所述租户标识对应，所述第二会话为所述第一网络节点和所述第三网络节点之间的边界网关协议会话。
结合第二方面至第二方面的第四种可能的实施方式中的任意一种实施方式，在第二方面的第五种可能的实施方式中，所述发送模块，具体用于通过所述租户标识对应的执行模块，向所述第三网络节点发送所述路由信息；
其中，在所述第一网络节点上不同的租户标识对应于不同的执行模块，所述执行模块包括中央处理器、线程或进程。
结合第二方面至第二方面的第五种可能的实施方式中的任意一种实施方式，在第二方面的第六种可能的实施方式中，所述第二网络节点为用户驻地设备CPE，所述租户标识包括一个租户标识；或，所述第二网络节点为路由反射器RR，所述租户标识包括一个或多个租户标识。
结合第二方面的第六种可能的实施方式，在第二方面的第七种可能的实施方式中，所述第一确定模块，包括：解析单元，用于解析所述路由信息中的路由特征；确定单元，用于根据所述路由特征从所述一个或多个租户标识中确定出所述路由信息对应的租户标识。
结合第二方面的第七种可能的实施方式，在第而方面的第八种可能的实施方式中，所述路由特征包括以下任意一种或多种：所述路由信息的前缀地址、团体属性、扩展团体属性、自治系统路径。
第二方面提供的发送路由信息的装置，对应于第一方面提供的发送路由信息的方法，故第二方面提供的发送路由信息的装置的各种可能的实施方式，可以参照第一方面提供的发送路由信息的方法的各种可能的实施方式。
第三方面，本申请实施例提供了一种计算机可读存储介质，该计算机可读存储介质中存储有指令，当其在计算机或处理器上运行时，使得该计算机或处理器执行如上 述第一方面或者其任一种可能的设计中的方法。
第四方面，本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机或处理器上运行时，使得该计算机或处理器执行如上述第一方面或者其任一种可能的设计中的方法。
在本申请实施例中，第一网络节点在接收到第二网络节点发送的路由信息后，可以确定出与该路由信息对应的租户标识，继而确定出第三网络节点，该第三网络节点属于该租户标识对应的租户，这样，第一网络节点就可以向第三网络节点发送相应的路由信息，完成路由的发布。可见，第一网络节点在发布路由的过程中，可以通过接收到的路由信息所对应的租户标识来确定出第三网络节点，也即确定出了需要向其发布路由的属于同一租户的网络节点，实现更加简单，可以缩短第一网络节点发布路由所需耗费的时长，进而提高了第一网络节点的性能。
附图说明
为了更清楚地说明本申请实施例中的技术方案，下面将对实施例描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请中记载的一些实施例，对于本领域普通技术人员来讲，还可以根据这些附图获得其他的附图。
图1为包含CPE1与CPE2的网络结构示意图；
图2为本申请实施例提供的一种示例性应用场景所涉及的网络结构示意图；
图3为本申请实施例中一种发送路由信息的方法流程示意图；
图4为本申请实施例中又一种发送路由信息的方法流程示意图；
图5为本申请实施例中另一种发送路由信息的方法流程示意图；
图6为本申请实施例中再一种发送路由信息的方法流程示意图；
图7为本申请实施例中一种发送路由信息的装置结构示意图；
图8为本申请实施例中一种发送路由信息的设备结构示意图。
具体实施方式
在部分网络中，分属于不同租户的CPE之间通常并不需要相互收发路由，而对于属于同一租户的不同CPE，基于网络部署的要求，不同CPE相互之间通常无法直接收发路由，而是通过与特定的RR等网络节点进行路由的发送与接收。例如，如图1所示，CPE1与CPE2相互之间无法直接收发路由，当需要建立CPE1与CPE2之间的路由路径时通常先是CPE1向RR发送路由信息，然后，再是RR向CPE2发送路由信息，从而实现CPE1与CPE2之间路由路径的建立。其中，CPE1与CPE2属于同一租户，而其余CPE属于另一租户。
通常情况下，RR会连接着多个属于不同租户的CPE，因此，RR若接收到CPE发送的路由信息，则会通过对路由信息中的路由特征进行解析，从与RR相邻的多个网络节 点中确定出属于该路由信息对应的租户的网络节点(可以是CPE，也可以是其它RR)，具体是将解析得到的路由特征与RR所能向其它网络节点发布的路由的路由特征进行比对，并确定出路由特征一致的路由所对应的网络节点，进而RR可以向所确定的网络节点发送路由信息。
但是，这种需要从路由信息中解析出路由特征并进行路由特征比对的确定需要接收路由信息的网络节点的方式，实施过程较为复杂，并且，与RR相邻的网络节点的数量通常较多，使得RR比对路由特征的路由数量也多，采用这种方式需要耗费较长的时间，从而降低了网络节点的性能。
基于此，为了解决上述技术问题，在本申请实施例中，可以利用与接收到的路由信息对应的租户标识来确定需要接收该路由信息的网络节点，从而可以节省确定该网络节点的时间，提升网络节点的性能。具体的，可以预先为网络中网络节点所属的租户设置租户标识，属于同一租户的网络节点对应于同一租户标识，而不同的租户对应于不同的租户标识，由于属于不同租户的网络节点之间通常不需要相互收发路由，因此，第一网络节点在接收到与第一网络节点相邻的第二网络节点发送路由信息后，可以仅向与第二网络节点具有相同租户标识的第三网络节点发布路由，而无需向对应于其它租户标识的网络节点发布路由，从而可以确定接收该路由信息的网络节点，相比于通过解析路由信息中的路由特征并进行路由特征比对这种确定需要接收路由信息的网络节点的方式更加简便，可以缩短第一网络节点发布路由所需耗费的时长，提高第一网络节点的性能。
举例来说，本申请实施例的场景之一，可以是应用至如图2所示的SD-WAN网络拓扑结构中。其中，CPE1与CPE2同属于租户1，并且可以通过RR1建立路由路径，属于该租户1的CPE1与CPE2所组成的网络也可以称为网络分片1，如：Slice 1，也就是说不同的租户标识可以代表不同的网络分片；CPE3、CPE4与CPE5同属于租户2，并且，可以通过RR1和/或RR2建立路由路径，属于该租户2的CPE3、CPE4与CPE5所组成的网络也可以称为网络分片2，如Slice 2；CPE6属于租户3。
假设当前CPE1需要与CPE2建立路由路径，则CPE1可以向RR1发布路由，即向RR1发送路由信息，RR1在接收该路由信息后，可以确定出CPE1发送的路由信息对应于租户1的租户标识，然后，RR1可以确定出属于租户1的CPE2，并向所确定的CPE2发送路由信息，从而使得CPE1与CPE2之间通过RR1建立了路由路径。在CPE1与CPE2之间建立路由路径的过程中，RR1是根据租户1的租户标识确定出属于该租户1的CPE2，进而只向CPE2发布路由，使得RR1可以在较短的时间内确定出需要向其发布路由的CPE2，进而可以提高网络节点的性能。
可以理解的是，上述场景仅是本申请实施例提供的一个场景示例，本申请实施例并不限于此场景。
下面结合附图，通过实施例来详细说明本申请实施例中发送路由信息的方法的具体实现方式。
参见图3，图3示出了本申请实施例中一种发送路由信息的方法流程示意图，该方法具体可以包括：
S301：第一网络节点接收第二网络节点发送的路由信息。
本实施例中，第一网络节点可以是网络中能够为第二网络节点与第三网络节点支持路由连接的节点，如网络中的路由器或者交换机等，而第二网络节点可以是属于某个租户的设备，或是网络中能够支持该设备与其他网络节点建立路由连接的节点。其中，第一网络节点与第二网络节点为相邻的网络节点。举例来说，当本实施例应用于图2所示的应用场景中时，第二网络节点可以为CPE1，则与第二网络节点相邻的第一网络节点，即为支持CPE1与CPE2建立路由连接的RR1；当然，第二网络节点也可以为RR1，并且RR1可以支持CPE3分别与CPE4和CPE5建立路由连接，则与第二网络节点相邻的第一网络节点，即为同样可以支持路由连接的RR2。
S302：第一网络节点确定该路由信息与租户标识对应。
通常情况下，相互之间需要进行路由连接的设备往往是属于同一个租户，而分属于不同租户的设备之间并不需要进行路由连接。基于此，本实施例中，可以为每个租户建立相应的租户标识，该租户标识可以用于对第一网络节点所服务的多个租户进行区分。相应的，属于同一个租户的不同第二网络节点所发送的路由信息对应于同一个租户标识，属于不同租户的第二网络节点所发送的路由信息对应的租户标识不同。实际应用中，可以将网络中租户下的设备进行分片，具体可以是将网络中属于同一租户的设备划分为同一个网络分片，则该网络分片是由属于同一租户的设备所组成，并且，该网络分片与该租户的租户标识相对应，即不同租户的设备属于不同的网络分片，而不同的网络分片对应于不同的租户标识。
在一种确定租户标识的示例性实施方式中，第一网路节点可以预先利用租户标识的配置信息，为与第一网络节点相邻的第二网络节点配置租户标识，具体可以是利用租户标识以及第一网络节点与第二网络节点之间的会话为第二网络节点配置租户标识。其中，该租户标识所表征的租户，为第一网络节点所服务的租户或者是第二网络节点所属的租户。这样，第一网络节点在基于第一网络节点与第二网络节点之间的第一会话接收到第二网络节点发送的路由信息后，可以确定与该第一会话对应的租户标识。在一种示例中，第一会话可以是第一网络节点与第二网络节点之间的BGP(Border Gateway Protocol，边界网关协议)会话。
具体实现时，可以预先建立第一网络节点与第二网络节点之间的第一会话与租户标识的对应关系，这样，当第一网络节点接收到第二网络节点发送的路由信息后，首先可以确定出传输该路由信息的第一会话，然后，根据预先建立的第一会话与租户标识的对应关系，确定出该第一会话所对应的租户标识。
实际应用中，除了根据会话来确定租户标识外，还可以根据第二网络节点直接确定出租户标识。具体的，在另一种确定租户标识的示例性实施方式中，可以预先建立第二网络节点与租户标识的对应关系，并可以将其配置于第一网络节点上，这样，当第一网络节点接收到路由信息后，可以先确定出发送该路由信息的网络节点为第二网 络节点，然后，根据预先建立的第二网络节点与租户标识的对应关系，确定出第二网络节点所对应的租户标识。可以理解的是，实际应用中第一网络节点可能会接收到多个网络节点发送的路由信息，则可以针对于每个网络节点，预先建立该网络节点与该网络节点所属租户的租户标识的对应关系，并将多个网络节点与租户标识的对应关系配置于第一网络节点。
值的注意的是，在不同的应用场景中，第一网络节点基于接收到的路由信息所确定的租户标识可能是一个或多个。
具体的，当第二网络节点为CPE时，由于该CPE只属于一个租户，因此，第一网络节点在接收到该CPE发送的路由信息后，可以根据该CPE与第一网络节点的第一会话与租户标识的对应关系，确定该路由信息只对应于一个租户标识，即该CPE所属租户的租户标识。
当第二网络节点为RR时，由于该RR可能会服务于多个租户，则，第一网络节点仅凭第二网络节点发送的路由信息可能无法准确确定出需要为哪个租户下的设备之间建立路由连接。基于此，若第一网络节点只服务于一个租户，则基于路由信息所确定的租户标识仍然为一个，但是若第一网络节点服务于多个租户，则第一网络节点可以基于路由信息确定多个租户标识，其中，所确定的每个租户标识所对应的租户均是第一网络节点所服务的租户，并且，多个租户标识中除了包含目标租户的租户标识外，还包含除目标租户以外的其它租户的租户标识，其中，目标租户即为需要建立路由连接的设备所属的租户。可以理解，虽然第一网络节点仅凭接收到的路由信息无法确定哪个租户下的设备之间需要建立路由连接，但是该租户必然是第一网络节点所服务的租户，因此，通过确定第一网络节点所服务的多个租户的租户标识，最终所建立的路由连接必然会包含目标租户下的设备之间所需建立的路由连接。在一些可能的实施方式中，所确定的多个租户标识，可以是第一网络节点与第二网络节点共同服务的租户对应的租户标识，当然，也可以是第一网络节点所服务的所有租户对应的租户标识。
S303：第一网络节点确定第三网络节点属于该租户标识对应的租户。
第一网络节点在确定出租户标识后，可以基于所确定的租户标识进一步确定出属于该租户标识对应的租户的第三网络节点。其中，第三网络节点可以是属于该租户标识对应的租户的设备，或是网络中能够支持该租户的设备与其他网络节点建立路由连接的节点。其中，第一网络节点与第三网络节点为相邻的网络节点。举例来说，当本实施例应用于图2所示的应用场景中时，若第一网络节点为RR1，则与第一网络节点相邻的第三网络节点，可以是与CPE1需要建立路由连接的CPE2，此时，第二网络节点为CPE1；也可以是支持CPE3分别与CPE4和CPE5建立路由连接的RR2，此时，第二网络节点为CPE3。
作为一种示例，第一网络节点在确定第三网络节点时，可以是根据与所确定出的租户标识对应的第二会话来进行确定。具体实现时，可以预先建立会话与租户标识的对应关系，该会话即为第一网络节点与需要接收路由信息的网络节点之间的会话，该租户标识所对应的租户为第一网络节点与该其它网络节点所共同服务的租户。这样， 当第一网络节点确定出租户标识后，可以将基于已经建立的会话与租户标识的对应关系，确定与该租户标识对应的第二会话，进而可以根据该第二会话确定出第三网络节点，其中，第二会话为第一网络节点与第三网络节点之间的会话。在一种示例中，该第二会话具体可以是BGP会话。
S304：响应于确定第三网络节点属于该租户标识对应的租户，第一网络节点向第三网络节点发送路由信息。
由于所确定出的第三网络节点与第一网络节点属于同一租户标识所对应的租户，因此，第一网络节点可以向第三网络节点发送路由信息，以实现在第一网络节点与第二网络节点之间已建立路由的基础上继续建立路由路径。
值得注意的是，第一网络节点向不同租户的第三网络节点发送路由信息的过程是相互独立的，即第一网络节点向属于租户标识A对应的租户的第三网络节点发送路由信息时，并不会影响第一网络节点向属于租户标识B对应的租户的第三网络节点发送路由信息。基于此，在一些可能的实施方式中，可以基于第一网络节点所服务的租户设置相互独立的执行模块，每个租户的执行模块对应于该租户的租户标识，并且，不同租户的执行模块对应于不同的租户标识。当第一网络节点需要向属于某个租户标识的租户的第三网络节点发送路由信息时，可以由第一网络节点上与该租户标识对应的执行模块执行路由信息的发送。这样，当第一网络节点基于接收到的路由信息确定出多个租户标识时，第一网络节点上与其对应的多个执行模块就可以并行执行向属于不同租户标识对应的租户的第三网络节点发送路由信息的过程，从而可以提升第一网络节点的处理效率。作为一种示例，各个租户标识所对应的执行模块，可以包括第一网络节点上的中央处理器、线程或者进程等。
实际应用中，第一网络节点在基于接收到的路由信息确定出租户标识后，还可以基于该路由信息生成路由表项，并且可以将该路由表项添加到与该租户标识对应的路由信息库中。在一些可能的实施方式中，该路由信息库可以存储于第一网络节点上，以便于第一网络节点在接收到该租户标识对应的租户下的设备所发送的报文时，能够基于该路由信息库中存储的路由表项将该报文转发至相应的下一网络节点，以实现报文的转发。
可以理解，由于该租户标识对应的租户下的设备之间，不仅可以通过第一网络节点与第二网络节点实现路由连接，还可以通过第一网络节点与其它网络节点实现路由连接，因此，该租户标识所对应的路由信息库中，不仅可以存储有基于第二网络节点发送的路由信息所生成的路由表项，还可以存储有基于与第一网络节点相邻的其它网络节点发送的路由信息所生成的路由表项。
进一步的，可以为不同的租户设置不同的路由信息库，这样可以避免了不同租户的路由表项存储在一个路由信息库中，从而减少了需要查找的路由信息库中的路由表项的数量，能够减少报文转发时查找路由表项的时间，提高转发效率。
实际应用中，第一网络节点基于第二网络节点发送的路由信息所确定的租户标识可能为多个，从而使得第一网络节点会向多个租户标识对应的第三网络节点发送路由 信息。基于此，在一些可能的实施方式中，为了减少第一网络节点所发布的路由规模，可以在第一网络节点上设置相应的过滤策略，在第一网络节点为路由信息确定出多个租户标识时，利用该过滤策略可以确定出建立路由连接的设备属于哪个租户，也即从多个租户标识中确定出建立路由连接的设备所属租户的租户标识，以使得第一网络节点只向该租户标识所对应的第三网络节点发布路由，从而可以减少第一网络节点所发布的路由规模。
具体的，参阅图4，图4示出了本申请实施例中又一种发送路由信息的方法流程示意图，该方法具体可以包括：
S401：第一网络节点接收第二网络节点发送的路由信息。
S402：第一网络节点确定该路由信息与租户标识对应。
本实施例中，步骤S401至步骤S402与上一实施例中的步骤S301至步骤S302类似，其具体实现过程可参照上一实施例的相关之处描述即可，在此不做过多赘述。
S403：第一网络节点解析路由信息中的路由特征。
S404：第一网络节点根据所解析出的路由特征，从一个或者多个租户标识中确定出该路由信息对应的租户标识。
本实施例中，第一网络节点若基于接收到的路由信息确定出了多个租户标识。在一个示例中，第一网络节点可以建立第一会话与多个租户标识的对应关系，该第一会话为第一网络节点和第二网络节点之间的会话。可以利用预先设置的租户标识的过滤策略，对该多个租户标识进行过滤，从中确定出与该路由信息对应的租户标识，也即确定出建立路由连接的设备所属租户的租户标识。
作为一种具体实现的示例，第一网络节点可以判断基于路由信息是否确定出了多个租户标识，若是，则可以对路由信息中的路由特征进行解析，在一种示例中，具体可以是对路由信息的团体属性、扩展团体属性、路由的前缀地址以及自治系统路径中的一种或者多种特征进行解析。然后，第一网络节点可以将解析得到的路由特征与各个租户标识所对应的路由特征进行比对，并将路由特征一致所对应的租户标识确定为与该路由信息对应的租户标识。这样，从多个租户标识中过滤出与该路由信息对应的租户标识后，第一网络节点在发布路由时只需向属于该租户标识对应的租户的第三网络节点发布路由，而不用向属于其它租户标识对应的租户的网络节点发布路由，从而可以减少第一网络节点所发布的路由的规模。
S405：第一网络节点确定第三网络节点属于所确定的租户标识对应的租户。
S406：响应于确定第三网络节点属于租户标识对应的租户，第一网络节点向第三网络节点发送路由信息。
本实施例中，在上一实施例的基础上，通过设置针对于租户标识的过滤策略，可以在第一网络节点基于路由信息确定出多个租户标识时，能够利用路由信息的路由特征从多个租户标识中过滤出与该路由信息对应的租户标识，从而使得第一网络节点在发布路由时只需向属于该租户标识所对应的租户的第三网络节点发布路由，而不用向 属于其它租户标识对应的租户的第三网络节点发布路由，进而可以减少第一网络节点所发布的路由的规模。
实际应用中，由于第二网络节点既可以是属于某个租户的设备(如CPE等)，也可以是网络中支持路由连接的节点(如RR等)，因此，本申请实施例可以应用于至少两种不同的场景中。为了更加详细的介绍本申请实施例的技术方案，下面结合具体的两种场景对本申请实施例的技术方案进行描述。
结合第二网络节点为属于某个租户的CPE的应用场景，本申请实施例提供了一种发送路由信息的方法，其中，第一网络节点为RR。参阅图5，图5示出了本申请实施例中另一种发送路由信息的方法流程示意图，该方法具体可以包括：
S501：RR接收CPE发送的路由信息。
S502：RR确定该路由信息与租户标识对应。
本实施例中，可以预先建立第一会话与租户标识的对应关系，该第一会话可以是CPE与RR之间的BGP会话。这样，当RR接收到CPE发送的路由信息后，可以根据已建立的第一会话与租户标识的对应关系，查找出该CPE与RR之间的第一会话所对应的租户标识，并将其作为路由信息对应的租户标识。当然，所确定的租户标识也即为该CPE所属租户的租户标识。
S503：RR确定第三网络节点属于该租户标识对应的租户。
本实施例中，可以预先建立第二会话与租户标识的对应关系，该第二会话可以是RR与第三网络节点之间的BGP会话。这样，当RR确定租户标识后，利用该对应关系就可以确定出与该租户标识对应的第二会话，进而根据该第二会话确定与RR之间存在第二会话的第三网络节点。
S504：响应于确定第三网络节点属于租户标识对应的租户，RR向第三网络节点发送路由信息。
本实施例中，RR可以通过接收到的路由信息所对应的租户标识来确定出第三网络节点，也即确定出了需要接收该路由信息的网络节点，可以缩短网络节点发布路由所需耗费的时长，进而提高了网络节点的性能。
上述结合应用场景的实施例中，是以第二网络节点为属于某个租户的设备对本申请实施例的技术方案进行说明，而在另一些应用场景中，第二网络节点也可以是网络中支持路由连接的节点，假设第一网络节点为RR1，第二网络节点为RR2。在这种应用场景下，RR1基于RR2发送的路由信息所确定的租户标识可能为多个，为了减少RR1发布的路由规模，可以在RR1上设置相应的过滤策略，并利用该过滤策略对RR1确定的多个租户标识进行过滤。
结合RR2为支持路由连接的节点的应用场景，本申请实施例提供了一种发送路由信息的方法。参阅图6，图6示出了本申请实施例中再一种发送路由信息的方法流程 示意图，该方法具体可以包括：
S601：RR1接收RR2发送的路由信息。
S602：RR1确定该路由信息与租户标识对应。
S603：RR1解析路由信息中的路由特征。
S604：RR1根据所解析出的路由特征，从多个租户标识中确定出该路由信息对应的租户标识，并将其作为目标租户标识。
本实施例中，RR1基于接收到的路由信息可能会确定出多个租户标识，则，可以利用预先在RR1上设置的租户标识的过滤策略，对该多个租户标识进行过滤，从中确定出需要建立路由连接的设备所属租户的租户标识。
具体实现时，RR1可以判断是否基于路由信息确定出了多个租户标识，若是，则可以对路由信息中的路由特征进行解析。RR1可以根据已建立的第一会话与多个租户标识的对应关系，根据第一会话与租户标识的对应关系，确定多个租户标识。在一种示例中，具体可以是对路由信息的团体属性、扩展团体属性、路由的前缀地址以及自治系统路径中的一种或者多种特征进行解析。然后，RR1可以将解析得到的路由特征与各个租户标识所对应的路由特征进行比对，并将路由特征一致所对应的租户标识确定为与该路由信息对应的租户标识。这样，从多个租户标识中过滤出与该路由信息对应的租户标识后，RR1在发布路由时只需向属于该租户标识对应的租户的第三网络节点发布路由，而不用向属于其它租户标识对应的租户的网络节点发布路由，从而可以减少RR1所发布的路由的规模。
S605：RR1确定第三网络节点属于所确定的租户标识对应的租户。
S606：响应于确定第三网络节点属于租户标识对应的租户，RR1向第三网络节点发送路由信息。
本实施例中，在上一实施例的基础上，通过在RR1上设置针对于租户标识的过滤策略，可以在RR1基于路由信息确定出多个租户标识时，能够利用路由信息的路由特征从多个租户标识中过滤出与该路由信息对应的租户标识，从而使得RR1在发布路由时只需向属于该租户标识所对应租户的第三网络节点发布路由，而不用向属于其它租户标识对应的租户的第三网络节点发布路由，进而可以减少RR1所发布的路由的规模。
此外，本申请实施例还提供了一种发送路由信息的装置。参阅图7，图7示出了本申请实施例中一种发送路由信息的装置结构示意图，该装置700具体可以包括：
接收模块701，用于接收第二网络节点发送的路由信息；
第一确定模块702，用于确定所述路由信息与租户标识对应；
第二确定模块703，用于确定第三网络节点属于所述租户标识对应的租户；
发送模块704，用于响应于确定所述第三网络节点属于所述租户标识对应的租户，向所述第三网络节点发送所述路由信息。
在一些可能的实施方式中，所述第一确定模块702，具体用于确定第一会话与所述租户标识对应，所述第一网络节点通过所述第一会话接收所述路由信息，所述第一会话为所述第一网络节点和所述第二网络节点之间的边界网关协议会话。
由于第一网络节点与第二网络节点之间存在第一会话，因此可以预先建立第一会话与租户标识的对应关系，这样，若第一网络节点确定基于该第一会话接收到第二网络节点发送的路由信息，则可以确定根据已建立的对应关系，确定第一会话所对应的租户标识，而第一网络节点接收到的路由信息是基于该第一会话接收到的，因此，所确定的租户标识与该路由信息相对应。
在一些可能的实施方式中，所述第一确定模块702，具体用于确定发送所述路由信息的所述第二网络节点属于所述租户标识对应的租户。
在该实施方式中，可以预先建立第二网络节点与租户标识的对应关系，这样，当第一网络节点接收到该路由信息后，就可以基于该对应关系，确定发送路由信息的第二网络节点所对应的租户标识。可以理解，第二网络节点对应于该租户标识，也即表明该第二网络节点属于该租户标识对应的租户。
在一些可能的实施方式中，该装置700还包括：
生成模块，用于根据所述路由信息生成路由表项；
添加模块，用于将所述路由表项添加到所述租户标识对应的路由信息库中。
由于基于该路由信息生成并存储了路由表项，则第一网络节点在接收到该租户标识对应的租户下的设备所发送的报文时，能够基于该路由信息库中存储的路由表项将该报文转发至相应的下一网络节点，以实现报文的转发。
进一步地，不同的租户可以对应不同的路由信息库，这样避免了不同租户的路由表项存储在一个路由信息库中，从而减少了需要查找的路由信息库中的路由表项的数量，能够减少报文转发时查找路由表项的时间，提高转发效率。
在一些可能的实施方式中，所述第二确定模块703，具体用于确定第二会话与所述租户标识对应，所述第二会话为所述第一网络节点和所述第三网络节点之间的边界网关协议会话。
在该实施方式中，可以预先建立第二会话与租户标识的对应关系，这样，若第一网络节点确定租户标识后，则可以确定根据已建立的对应关系，确定该租户标识所对应的第二会话，进而可以根据该第二会话确定出与第一网络节点构成第二会话的第三网络节点。这样，就可以根据该第二会话确定出同属于该租户标识对应的租户的第三网络节点。
在一些可能的实施方式中，所述发送模块704，具体用于通过所述租户标识对应的执行模块，向所述第三网络节点发送所述路由信息；
其中，在所述第一网络节点上不同的租户标识对应于不同的执行模块，所述执行模块包括中央处理器、线程或进程。
由于第一网络节点向不同租户的第三网络节点发送路由信息的过程是相互独立的，因此，当第一网络节点基于接收到的路由信息确定出多个租户标识时，第一网络节点上与其对应的多个执行模块就可以并行执行向属于不同租户标识对应的租户的第三网络节点发送路由信息的过程，从而可以提升第一网络节点的处理效率。
在一些可能的实施方式中，所述第二网络节点为用户驻地设备CPE，所述租户标识包括一个租户标识；或，
所述第二网络节点为路由反射器RR，所述租户标识包括一个或多个租户标识。
可以理解，若第二网络节点为某个租户下的CPE，由于该CPE只属于一个租户，因此，只对应于一个租户的租户标识，则第一网络节点基于该CPE发送的路由信息，可以确定出该CPE所属租户的租户标识，所确定的租户标识的数量也仅为一个；若第二网络节点为网络中支持路由连接的节点RR，由于该RR可能会服务于多个租户，即该RR可能属于多个租户，因此，对应于多个租户的租户标识，则第一网络节点基于该RR发送的路由信息，可以确定出多个租户的租户标识，所确定的租户标识的数量可能为多个，当然，若RR仅服务于一个租户，则所确定的租户标识也可以只为一个。
在一些可能的实施方式中，所述第一确定模块701，包括：
解析单元，用于解析所述路由信息中的路由特征；
确定单元，用于根据所述路由特征从所述一个或多个租户标识中确定出所述路由信息对应的租户标识。
在该实施方式中，若第一网络节点基于路由信息确定出多个租户标识，则利用预先设置的过滤策略，可以从多个租户标识中过滤出与该路由信息对应的租户标识，这样，第一网络节点在发布路由时只需向属于该租户标识对应的租户的第三网络节点发布路由，而不用向属于其它租户标识对应的租户的网络节点发布路由，从而可以减少第一网络节点所发布的路由的规模。
在一些可能的实施方式中，所述路由特征包括以下任意一种或多种：所述路由信息的前缀地址、团体属性、扩展团体属性、自治系统路径。
以上是对本申请实施例提供的发送路由信息的装置介绍，具体实现方式可以参见上文图3对应的发送路由信息的方法实施例中的描述，达到的效果与上述方法实施例一致，这里不再赘述。
上一实施例是从功能实体的角度对本申请实施例中发送路由信息的装置进行描述，下面从硬件处理的角度对本申请实施例中发送路由信息的设备进行详细描述。
接下来介绍本申请实施例提供的一种发送路由信息的设备，所述设备包括：处理器，存储器，通信接口和总线；所述处理器、通信接口、存储器通过所述总线相互的通信；所述通信接口，用于接收和发送数据；所述存储器用于存储指令；所述处理器用于执行所述存储器中的所述指令，执行如下操作：
接收第二网络节点发送的路由信息；
确定所述路由信息与租户标识对应；
确定第三网络节点属于所述租户标识对应的租户；
响应于确定所述第三网络节点属于所述租户标识对应的租户，向所述第三网络节点发送所述路由信息。
在一些可能的实施方式中，所述第一网络节点确定所述路由信息与租户标识对应，包括：
所述第一网络节点确定第一会话与所述租户标识对应，所述第一网络节点通过所述第一会话接收所述路由信息，所述第一会话为所述第一网络节点和所述第二网络节点之间的边界网关协议会话。
在一些可能的实施方式中，所述第一网络节点确定所述路由信息与租户标识对应，包括：
所述第一网络节点确定发送所述路由信息的所述第二网络节点属于所述租户标识对应的租户。
在一些可能的实施方式中，还包括：
所述第一网络节点根据所述路由信息生成路由表项，并将所述路由表项添加到所述租户标识对应的路由信息库中。
在一些可能的实施方式中，所述第一网络节点确定第三网络节点属于所述租户标识对应的租户，包括：
所述第一网络节点确定第二会话与所述租户标识对应，所述第二会话为所述第一网络节点和所述第三网络节点之间的边界网关协议会话。
在一些可能的实施方式中，所述第一网络节点向所述第三网络节点发送所述路由信息，包括：
所述第一网络节点通过所述租户标识对应的执行模块，向所述第三网络节点发送所述路由信息；其中，在所述第一网络节点上不同的租户标识对应于不同的执行模块，所述执行模块包括中央处理器、线程或进程。
在一些可能的实施方式中，所述第二网络节点为用户驻地设备CPE，所述租户标识包括一个租户标识；或，
所述第二网络节点为路由反射器RR，所述租户标识包括一个或多个租户标识。
在一些可能的实施方式中，所述第一网络节点确定所述路由信息与租户标识对应，包括：
所述第一网络节点解析所述路由信息中的路由特征，根据所述路由特征从所述一个或多个租户标识中确定出所述路由信息对应的租户标识。
在一些可能的实施方式中，所述路由特征包括以下任意一种或多种：所述路由信息的前缀地址、团体属性、扩展团体属性、自治系统路径。
以上是对本申请实施例提供的发送路由信息的设备介绍，具体实现方式可以参见上文图2对应的发送路由信息的方法实施例中的描述，达到的效果与上述方法实施例一致，这里不再赘述。
接下来对该设备进行详细说明，请参阅图8所示，设备800，包括：接收器801、发射器802、处理器803和存储器804(其中设备800中的处理器803的数量可以一个或多个，图8中以一个处理器为例)。其中，通信接口可包括接收器801、发射器802。在本申请的一些实施例中，接收器801、发射器802、处理器803和存储器804可通过总线或其它方式连接，其中，图8中以通过总线连接为例。
存储器804可以包括只读存储器和随机存取存储器，并向处理器803提供指令和数据。存储器804的一部分还可以包括非易失性随机存取存储器(英文全称：Non-Volatile Random Access Memory，英文缩写：NVRAM)。存储器804存储有操作系统和操作指令、可执行模块或者数据结构，或者它们的子集，或者它们的扩展集，其中，操作指令可包括各种操作指令，用于实现各种操作。操作系统可包括各种系统程序，用于实现各种基础业务以及处理基于硬件的任务。
处理器803控制设备800的操作，处理器803还可以称为中央处理模块(英文全称：Central Processing Unit，英文简称：CPU)。具体的应用中，的各个组件通过总线系统耦合在一起，其中总线系统除包括数据总线之外，还可以包括电源总线、控制总线和状态信号总线等。但是为了清楚说明起见，在图中将各种总线都称为总线系统。
上述本申请实施例揭示的方法可以应用于处理器803中，或者由处理器803实现。处理器803可以是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法的各步骤可以通过处理器803中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器803可以是通用处理器、数字信号处理器(英文全称：digital signal processing，英文缩写：DSP)、专用集成电路(英文全称：Application Specific Integrated Circuit，英文缩写：ASIC)、现场可编程门阵列(英文全称：Field-Programmable Gate Array，英文缩写：FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器804，处理器803读取存储器804中的信息，结合其硬件完成上述方法的步骤。
接收器801可用于接收输入的数字或字符信息，以及产生与设备800的相关设置以及功能控制有关的信号输入，发射器802可包括显示屏等显示设备，发射器802可用于通过外接接口输出数字或字符信息。
本申请实施例中，处理器803，用于执行如下操作：
接收第二网络节点发送的路由信息；
确定所述路由信息与租户标识对应；
确定第三网络节点属于所述租户标识对应的租户；
响应于确定所述第三网络节点属于所述租户标识对应的租户，向所述第三网络节点发送所述路由信息。
此外，本申请实施例还提供了一种计算机可读存储介质，该计算机可读存储介质中存储有指令，当其在计算机或处理器上运行时，使得该计算机或处理器执行上述发送路由信息的方法。
另外，本申请实施例还提供了一种包含指令的计算机程序产品，当其在计算机或处理器上运行时，使得该计算机或处理器执行上述发送路由信息的方法。
本申请实施例中提到的“第一网络节点”、“第一确定模块”等名称中的“第一”只是用来做名字标识，并不代表顺序上的第一。该规则同样适用于“第二”、“第三”等。
通过以上的实施方式的描述可知，本领域的技术人员可以清楚地了解到上述实施例方法中的全部或部分步骤可借助软件加通用硬件平台的方式来实现。基于这样的理解，本申请的技术方案可以以软件产品的形式体现出来，该计算机软件产品可以存储在存储介质中，如只读存储器(英文：read-only memory，ROM)/RAM、磁碟、光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者诸如路由器等网络通信设备)执行本申请各个实施例或者实施例的某些部分所述的方法。
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于装置实施例而言，由于其基本相似于方法实施例，所以描述得比较简单，相关之处参见方法实施例的部分说明即可。以上所描述的装置实施例仅仅是示意性的，其中作为分离部件说明的模块可以是或者也可以不是物理上分开的，作为模块显示的部件可以是或者也可以不是物理模块，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。本领域普通技术人员在不付出创造性劳动的情况下，即可以理解并实施。
以上所述仅是本申请示例性的实施方式，并非用于限定本申请的保护范围。

Claims (18)

  1. 一种发送路由信息的方法，其特征在于，包括：
    第一网络节点接收第二网络节点发送的路由信息；
    所述第一网络节点确定所述路由信息与租户标识对应；
    所述第一网络节点确定第三网络节点属于所述租户标识对应的租户；
    响应于确定所述第三网络节点属于所述租户标识对应的租户，所述第一网络节点向所述第三网络节点发送所述路由信息。
  2. 根据权利要求1所述的方法，其特征在于，所述第一网络节点确定所述路由信息与租户标识对应，包括：
    所述第一网络节点确定第一会话与所述租户标识对应，所述第一网络节点通过所述第一会话接收所述路由信息，所述第一会话为所述第一网络节点和所述第二网络节点之间的边界网关协议会话。
  3. 根据权利要求1所述的方法，其特征在于，所述第一网络节点确定所述路由信息与租户标识对应，包括：
    所述第一网络节点确定发送所述路由信息的所述第二网络节点属于所述租户标识对应的租户。
  4. 根据权利要求1至3任一项所述的方法，其特征在于，还包括：
    所述第一网络节点根据所述路由信息生成路由表项，并将所述路由表项添加到所述租户标识对应的路由信息库中。
  5. 根据权利要求1至4任一项所述的方法，其特征在于，所述第一网络节点确定第三网络节点属于所述租户标识对应的租户，包括：
    所述第一网络节点确定第二会话与所述租户标识对应，所述第二会话为所述第一网络节点和所述第三网络节点之间的边界网关协议会话。
  6. 根据权利要求1至5任一项所述的方法，其特征在于，所述第一网络节点向所述第三网络节点发送所述路由信息，包括：
    所述第一网络节点通过所述租户标识对应的执行模块，向所述第三网络节点发送所述路由信息；其中，在所述第一网络节点上不同的租户标识对应于不同的执行模块，所述执行模块包括中央处理器、线程或进程。
  7. 根据权利要求1至6任一项所述的方法，其特征在于，所述第二网络节点为用户驻地设备CPE，所述租户标识包括一个租户标识；或，
    所述第二网络节点为路由反射器RR，所述租户标识包括一个或多个租户标识。
  8. 根据权利要求7所述的方法，其特征在于，所述第一网络节点确定所述路由信息与租户标识对应，包括：
    所述第一网络节点解析所述路由信息中的路由特征，根据所述路由特征从所述一个或多个租户标识中确定出所述路由信息对应的租户标识。
  9. 根据权利要求8所述的方法，其特征在于，所述路由特征包括以下任意一种或多种：所述路由信息的前缀地址、团体属性、扩展团体属性、自治系统路径。
  10. 一种发送路由信息的装置，其特征在于，所述装置应用于第一网络节点，包括：
    接收模块，用于接收第二网络节点发送的路由信息；
    第一确定模块，用于确定所述路由信息与租户标识对应；
    第二确定模块，用于确定第三网络节点属于所述租户标识对应的租户；
    发送模块，用于响应于确定所述第三网络节点属于所述租户标识对应的租户，向所述第三网络节点发送所述路由信息。
  11. 根据权利要求10所述的装置，其特征在于，所述第一确定模块，具体用于确定第一会话与所述租户标识对应，所述第一网络节点通过所述第一会话接收所述路由信息，所述第一会话为所述第一网络节点和所述第二网络节点之间的边界网关协议会话。
  12. 根据权利要求10所述的装置，其特征在于，所述第一确定模块，具体用于确定发送所述路由信息的所述第二网络节点属于所述租户标识对应的租户。
  13. 根据权利要求10至12任一项所述的装置，其特征在于，还包括：
    生成模块，用于根据所述路由信息生成路由表项；
    添加模块，用于将所述路由表项添加到所述租户标识对应的路由信息库中。
  14. 根据权利要求10至13任一项所述的装置，其特征在于，所述第二确定模块，具体用于确定第二会话与所述租户标识对应，所述第二会话为所述第一网络节点和所述第三网络节点之间的边界网关协议会话。
  15. 根据权利要求10至14任一项所述的装置，其特征在于，所述发送模块，具体用于通过所述租户标识对应的执行模块，向所述第三网络节点发送所述路由信息；
    其中，在所述第一网络节点上不同的租户标识对应于不同的执行模块，所述执行模块包括中央处理器、线程或进程。
  16. 根据权利要求10至15任一项所述的装置，其特征在于，所述第二网络节点为用户驻地设备CPE，所述租户标识包括一个租户标识；或，
    所述第二网络节点为路由反射器RR，所述租户标识包括一个或多个租户标识。
  17. 根据权利要求16所述的装置，其特征在于，所述第一确定模块，包括：
    解析单元，用于解析所述路由信息中的路由特征；
    确定单元，用于根据所述路由特征从所述一个或多个租户标识中确定出所述路由信息对应的租户标识。
  18. 根据权利要求17所述的装置，其特征在于，所述路由特征包括以下任意一种或多种：所述路由信息的前缀地址、团体属性、扩展团体属性、自治系统路径。
PCT/CN2019/110065 2018-10-12 2019-10-09 一种发送路由信息的方法和装置 WO2020073908A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP19871460.2A EP3846396A4 (en) 2018-10-12 2019-10-09 METHOD AND DEVICE FOR SENDING ROUTING INFORMATION
US17/226,990 US11374860B2 (en) 2018-10-12 2021-04-09 Method and apparatus for sending routing information for network nodes
US17/833,525 US11863438B2 (en) 2018-10-12 2022-06-06 Method and apparatus for sending routing information for network nodes

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811191878.2 2018-10-12
CN201811191878.2A CN109412951B (zh) 2018-10-12 2018-10-12 一种发送路由信息的方法和装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/226,990 Continuation US11374860B2 (en) 2018-10-12 2021-04-09 Method and apparatus for sending routing information for network nodes

Publications (1)

Publication Number Publication Date
WO2020073908A1 true WO2020073908A1 (zh) 2020-04-16

Family

ID=65467104

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/110065 WO2020073908A1 (zh) 2018-10-12 2019-10-09 一种发送路由信息的方法和装置

Country Status (4)

Country Link
US (2) US11374860B2 (zh)
EP (1) EP3846396A4 (zh)
CN (2) CN109412951B (zh)
WO (1) WO2020073908A1 (zh)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106921573B (zh) * 2015-12-28 2020-04-14 华为技术有限公司 NVo3网络中用于发布租户路由的方法及装置
CN109412951B (zh) 2018-10-12 2021-06-22 华为技术有限公司 一种发送路由信息的方法和装置
CN113438159B (zh) * 2020-03-23 2023-04-18 华为技术有限公司 分段路由策略的传输方法及装置、网络传输系统
CN116347487A (zh) * 2021-12-24 2023-06-27 贵州白山云科技股份有限公司 设备组网方法、装置、介质及设备
CN115174475B (zh) * 2022-05-18 2023-08-08 天翼云科技有限公司 一种基于sdwan的数据传输方法及装置
CN115426314B (zh) * 2022-08-08 2024-05-14 中国电信股份有限公司 一种通信方法、装置、网络设备及处理器可读存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104067565A (zh) * 2012-01-20 2014-09-24 思科技术公司 用于多租户访问网络的连接系统
CN104348724A (zh) * 2013-07-31 2015-02-11 华为技术有限公司 一种支持多租户的数据转发方法和装置
US20150363221A1 (en) * 2013-02-25 2015-12-17 Hitachi Ltd. Method of managing tenant network configuration in environment where virtual server and non-virtual server coexist
CN106059922A (zh) * 2016-05-26 2016-10-26 杭州华三通信技术有限公司 路由注入方法及装置
CN106209688A (zh) * 2016-07-13 2016-12-07 腾讯科技（深圳）有限公司 云端数据组播方法、装置和系统
CN109412951A (zh) * 2018-10-12 2019-03-01 华为技术有限公司 一种发送路由信息的方法和装置

Family Cites Families (66)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2254813A1 (en) * 1998-11-18 2000-05-18 Northern Telecom Limited Distribution of reachability information in data virtual private networks
US7546380B2 (en) * 2002-10-28 2009-06-09 Cisco Technology, Inc. RPF multi-party reliable transport
US20060133265A1 (en) * 2004-12-22 2006-06-22 Alcatel Virtual private networking methods and systems
US7647426B2 (en) * 2006-01-12 2010-01-12 Cisco Technology, Inc. Method and apparatus for achieving Border Gateway Protocol convergence using alternate route information
CN100512301C (zh) * 2006-01-24 2009-07-08 中兴通讯股份有限公司 一种查询服务控制面网元的方法
US7492766B2 (en) * 2006-02-22 2009-02-17 Juniper Networks, Inc. Dynamic building of VLAN interfaces based on subscriber information strings
US8077721B2 (en) * 2007-03-15 2011-12-13 Cisco Technology, Inc. Methods and apparatus providing two stage tunneling
US8320361B2 (en) * 2009-02-27 2012-11-27 Cisco Technology, Inc. Advertising alternate paths at border gateway protocol route reflectors
US8935427B2 (en) * 2010-09-23 2015-01-13 Microsoft Corporation Providing virtual networks using multi-tenant relays
US9065726B2 (en) * 2010-10-19 2015-06-23 At&T Intellectual Property I, L.P. Methods and apparatus to utilize route parameter sets for exchanging routes in a communication network
US8559414B2 (en) * 2011-02-19 2013-10-15 Cisco Technology, Inc. Automatically detecting best paths from shadow route reflectors
US8537840B1 (en) * 2011-07-26 2013-09-17 Cisco Technology, Inc. Angular distance calculation for BGP best path selection
CN102624623B (zh) * 2012-03-13 2015-07-22 杭州华三通信技术有限公司 一种vpn路由信息发布方法及设备
US9331938B2 (en) * 2012-04-13 2016-05-03 Nicira, Inc. Extension of logical networks across layer 3 virtual private networks
US9898317B2 (en) * 2012-06-06 2018-02-20 Juniper Networks, Inc. Physical path determination for virtual network packet flows
US9178797B2 (en) * 2012-06-30 2015-11-03 Juniper Networks, Inc. Selective BGP graceful restart in redundant router deployments
US20140052877A1 (en) * 2012-08-16 2014-02-20 Wenbo Mao Method and apparatus for tenant programmable logical network for multi-tenancy cloud datacenters
US9065661B2 (en) * 2013-03-06 2015-06-23 Cisco Technology, Inc. Scalable multicast route distribution in a multitenant data center fabric in a network environment
US20150067189A1 (en) * 2013-08-28 2015-03-05 Connectloud, Inc. METHOD AND APPARATUS FOR CREATING SOFTWARE DEFINED ROUTING MESHED NETWORKS THROUGH A tELASTIC MESH CONTROLLER
US9264351B2 (en) * 2013-09-07 2016-02-16 Cisco Technology, Inc. System and method for utilization of a segmentation identification to support transmission of data to a destination node
CN103560948B (zh) * 2013-11-01 2016-11-02 中国联合网络通信集团有限公司 虚拟机之间的通信方法、设备和系统
KR20150076041A (ko) * 2013-12-26 2015-07-06 한국전자통신연구원 가상 사설 클라우드망에서 사설 ｉｐ 주소 기반의 멀티 테넌트를 지원하기 위한 시스템 및 그 방법
US10097372B2 (en) * 2014-01-09 2018-10-09 Ciena Corporation Method for resource optimized network virtualization overlay transport in virtualized data center environments
US20160080246A1 (en) * 2014-09-12 2016-03-17 Futurewei Technologies, Inc. Offloading Tenant Traffic in Virtual Networks
US10129180B2 (en) * 2015-01-30 2018-11-13 Nicira, Inc. Transit logical switch within logical router
JP6434821B2 (ja) * 2015-02-19 2018-12-05 アラクサラネットワークス株式会社 通信装置及び通信方法
US10015073B2 (en) * 2015-02-20 2018-07-03 Cisco Technology, Inc. Automatic optimal route reflector root address assignment to route reflector clients and fast failover in a network environment
US9386001B1 (en) 2015-03-02 2016-07-05 Sprint Communications Company L.P. Border gateway protocol (BGP) communications over trusted network function virtualization (NFV) hardware
US9900250B2 (en) * 2015-03-26 2018-02-20 Cisco Technology, Inc. Scalable handling of BGP route information in VXLAN with EVPN control plane
US10425382B2 (en) * 2015-04-13 2019-09-24 Nicira, Inc. Method and system of a cloud-based multipath routing protocol
US10135789B2 (en) * 2015-04-13 2018-11-20 Nicira, Inc. Method and system of establishing a virtual private network in a cloud service for branch networking
US9634893B2 (en) * 2015-07-21 2017-04-25 Cisco Technology, Inc. Auto-provisioning edge devices in a communication network using control plane communications
US10637889B2 (en) * 2015-07-23 2020-04-28 Cisco Technology, Inc. Systems, methods, and devices for smart mapping and VPN policy enforcement
US10069716B2 (en) * 2015-07-29 2018-09-04 At&T Intellectual Property I, L.P. Methods and apparatus to reflect routes from a remotely located virtual route reflector
US10084685B2 (en) * 2015-08-17 2018-09-25 Verizon Patent And Licensing Inc. Route reflector as a service
US10075363B2 (en) * 2015-08-31 2018-09-11 Nicira, Inc. Authorization for advertised routes among logical routers
US10091176B2 (en) * 2015-09-30 2018-10-02 Juniper Networks, Inc. Enhanced EVPN MAC route advertisement having MAC (L2) level authentication, security and policy control
US9860079B2 (en) * 2015-11-20 2018-01-02 Oracle International Corporation Redirecting packets for egress from an autonomous system using tenant specific routing and forwarding tables
US10536946B2 (en) * 2015-12-08 2020-01-14 Huawei Technologies Co., Ltd. Method and system for performing network slicing in a radio access network
US9985867B2 (en) * 2015-12-11 2018-05-29 Cisco Technology, Inc. Optimizing EVPN for data centers with redundant top-of-rack deployments
US9985883B2 (en) * 2016-02-26 2018-05-29 128 Technology, Inc. Name-based routing system and method
US10142427B2 (en) * 2016-03-31 2018-11-27 Huawei Technologies Co., Ltd. Systems and methods for service and session continuity in software defined topology management
US10454877B2 (en) * 2016-04-29 2019-10-22 Cisco Technology, Inc. Interoperability between data plane learning endpoints and control plane learning endpoints in overlay networks
US10931629B2 (en) * 2016-05-27 2021-02-23 Cisco Technology, Inc. Techniques for managing software defined networking controller in-band communications in a data center network
US10237176B2 (en) * 2016-06-30 2019-03-19 Juniper Networks, Inc. Auto discovery and auto scaling of services in software-defined network environment
CN107580360A (zh) * 2016-07-04 2018-01-12 中国移动通信有限公司研究院 一种网络切片选择的方法、设备及网络架构
EP3361648B1 (en) * 2017-02-08 2020-09-02 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Cellular communication network using a user equipment identifier
US10432519B2 (en) * 2017-05-26 2019-10-01 128 Technology, Inc. Packet redirecting router
US11283680B2 (en) * 2017-06-19 2022-03-22 Cisco Technology, Inc. Identifying components for removal in a network configuration
US10652102B2 (en) * 2017-06-19 2020-05-12 Cisco Technology, Inc. Network node memory utilization analysis
US10554493B2 (en) * 2017-06-19 2020-02-04 Cisco Technology, Inc. Identifying mismatches between a logical model and node implementation
US10587456B2 (en) * 2017-09-12 2020-03-10 Cisco Technology, Inc. Event clustering for a network assurance platform
US10554477B2 (en) * 2017-09-13 2020-02-04 Cisco Technology, Inc. Network assurance event aggregator
US11102053B2 (en) * 2017-12-05 2021-08-24 Cisco Technology, Inc. Cross-domain assurance
US11245622B2 (en) * 2018-01-05 2022-02-08 Telefonaktiebolaget Lm Ericsson (Publ) Data center failure management in an SDN deployment using border gateway node control
US10523450B2 (en) * 2018-02-28 2019-12-31 Oracle International Corporation Overlay network billing
US11516113B2 (en) * 2018-03-20 2022-11-29 Microsoft Technology Licensing, Llc Systems and methods for network slicing
CN108521377B (zh) * 2018-06-26 2020-11-03 新华三技术有限公司合肥分公司 路由发布方法及装置
US10715419B1 (en) * 2018-09-10 2020-07-14 Juniper Networks, Inc. Software defined networking between virtualized entities of a data center and external entities
WO2020092575A1 (en) * 2018-11-02 2020-05-07 Futurewei Technologies, Inc. System and method for implementing controller border gateway protocol (cbgp)
US10855584B2 (en) * 2018-12-28 2020-12-01 Alibaba Group Holding Limited Client-equipment-peering virtual route controller
US11902050B2 (en) * 2020-07-28 2024-02-13 VMware LLC Method for providing distributed gateway service at host computer
US11451413B2 (en) * 2020-07-28 2022-09-20 Vmware, Inc. Method for advertising availability of distributed gateway service and machines at host computer
US11463343B2 (en) * 2020-10-07 2022-10-04 Hewlett Packard Enterprise Development Lp SDWAN overlay routing service
US11848865B2 (en) * 2021-05-27 2023-12-19 Cisco Technology, Inc. Application programming interface (API)-based multi-tenant routing control plane
US20230110199A1 (en) * 2021-10-12 2023-04-13 Hewlett Packard Enterprise Development Lp Auto-grouping and routing platform

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104067565A (zh) * 2012-01-20 2014-09-24 思科技术公司 用于多租户访问网络的连接系统
US20150363221A1 (en) * 2013-02-25 2015-12-17 Hitachi Ltd. Method of managing tenant network configuration in environment where virtual server and non-virtual server coexist
CN104348724A (zh) * 2013-07-31 2015-02-11 华为技术有限公司 一种支持多租户的数据转发方法和装置
CN106059922A (zh) * 2016-05-26 2016-10-26 杭州华三通信技术有限公司 路由注入方法及装置
CN106209688A (zh) * 2016-07-13 2016-12-07 腾讯科技（深圳）有限公司 云端数据组播方法、装置和系统
CN109412951A (zh) * 2018-10-12 2019-03-01 华为技术有限公司 一种发送路由信息的方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3846396A4 *

Also Published As

Publication number Publication date
EP3846396A4 (en) 2021-11-10
CN109412951A (zh) 2019-03-01
CN113542128B (zh) 2023-03-31
US11374860B2 (en) 2022-06-28
CN113542128A (zh) 2021-10-22
US20210226888A1 (en) 2021-07-22
EP3846396A1 (en) 2021-07-07
CN109412951B (zh) 2021-06-22
US20220303211A1 (en) 2022-09-22
US11863438B2 (en) 2024-01-02

Similar Documents

Publication Publication Date Title
WO2020073908A1 (zh) 一种发送路由信息的方法和装置
WO2019223447A1 (zh) 一种生成路由的方法和设备
CN111901244B (zh) 一种网络报文转发系统
US20150355934A1 (en) Method for generating configuration information, and network control unit
CN107113241B (zh) 路由确定方法、网络配置方法以及相关装置
EP2731313A1 (en) Distributed cluster processing system and message processing method thereof
US11711243B2 (en) Packet processing method and gateway device
CN113438329B (zh) Mac地址发送方法、装置和系统
US20230208760A1 (en) Entry generation method, packet sending method, device, and system
WO2018068588A1 (zh) 提供组播业务的方法和软件定义网络控制器
CN114143283A (zh) 一种隧道自适应配置方法、装置，中心端设备及通信系统
KR20230035674A (ko) 경로 광고 방법 및 관련 디바이스
US20220345400A1 (en) Packet sending method and apparatus, and storage medium
US20230353479A1 (en) Edge Computing Data and Service Discovery Using an Interior Gateway Protocol (IGP)
WO2020029928A1 (zh) Bgp会话建立、发送接口地址和别名的方法及网络设备
EP4294080A1 (en) Route processing method and network device
EP4236245A1 (en) Route advertisement method, apparatus, and system
US20230421499A1 (en) Packet transmission method and apparatus
WO2023016110A1 (zh) 传输网络层可达信息的方法、装置、设备、系统及介质
CN114430393B (zh) 报文处理方法、装置及存储介质
EP4175252A1 (en) Router advertisement method and related device
EP4203414A1 (en) Service and topology exchange protocol having client-driven active-active repositories with high availability
US20230224245A1 (en) Packet Transmission Method and Apparatus
WO2024007584A1 (zh) 路由信息的处理方法、系统、网络设备和存储介质
WO2023138351A1 (zh) 一种流量转发方法、报文发送方法、消息发送方法及装置

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: 19871460

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019871460

Country of ref document: EP

Effective date: 20210401