Transit logical switch within logical router

• US 10,129,180 B2
• Filed: 07/30/2015
• Issued: 11/13/2018
• Est. Priority Date: 01/30/2015
• Status: Active Grant

• Current Assignee: Nicira Incorporated (Broadcom, Inc.)
• Original Assignee: Nicira Incorporated (Broadcom, Inc.)
• Inventors: Zhang, Ronghua, Chandrashekhar, Ganesan
• Primary Examiner(s): Zaidi, Iqbal
• Application Number:
  US14/814,477
• Publication Number:
  US 20160226700A1
• Time in Patent Office: 1,202 Days
• Field of Search: 370230-339
• CPC Class Codes: H04L 12/4633 Interconnection of networks using encapsulation techniques, e.g. tunneling
• CPC Class Codes: H04L 12/4654 wherein a VLAN tag represents a customer VLAN, e.g. C-Tag
• CPC Class Codes: H04L 12/66 Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
• CPC Class Codes: H04L 2012/4629 using multilayer switching, e.g. layer 3 switching
• CPC Class Codes: H04L 2101/663 Transport layer addresses, e.g. aspects of transmission control protocol [TCP] or user datagram protocol [UDP] ports
• CPC Class Codes: H04L 41/0654 using network fault recovery ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437
• CPC Class Codes: H04L 41/122 of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network
• CPC Class Codes: H04L 41/40 using virtualisation of network functions or resources, e.g. SDN or NFV entities
• CPC Class Codes: H04L 41/5041 characterised by the time relationship between creation and deployment of a service
• CPC Class Codes: H04L 41/5077 wherein the managed service relates to simple transport services, i.e. providing only network infrastructure
• CPC Class Codes: H04L 43/08 Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
• CPC Class Codes: H04L 43/106 using time related information in packets, e.g. by adding timestamps
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/033 by updating distance vector protocols
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/306 Route determination based on the nature of the carried application
• CPC Class Codes: H04L 45/38 Flow based routing
• CPC Class Codes: H04L 45/42 : Centralised routing
• CPC Class Codes: H04L 45/44 : Distributed routing
• CPC Class Codes: H04L 45/586 : of virtual routers
• CPC Class Codes: H04L 45/64 : using an overlay routing layer
• CPC Class Codes: H04L 45/72 : Routing based on the source address
• CPC Class Codes: H04L 45/74 : Address processing for routing
• CPC Class Codes: H04L 45/742 : Route cache; Operation thereof
• CPC Class Codes: H04L 45/745 : Address table lookup; Address filtering
• CPC Class Codes: H04L 47/19 : at layers above the network layer network arrangements for networked applications for scheduling or organising the servicing of application requests H04L67/60
• CPC Class Codes: H04L 49/25 : Routing or path finding in a switch fabric
• CPC Class Codes: H04L 49/3009 : Header conversion, routing tables or routing tags
• CPC Class Codes: H04L 49/3063 : Pipelined operation
• CPC Class Codes: H04L 49/354 : for supporting virtual local area networks [VLAN]
• CPC Class Codes: H04L 49/9068 : in the network interface card
• CPC Class Codes: H04L 61/103 : across network layers, e.g. resolution of network layer into physical layer addresses or address resolution protocol [ARP]
• CPC Class Codes: H04L 61/2503 : Translation of Internet protocol [IP] addresses
• CPC Class Codes: H04L 61/2585 : through application level gateway [ALG]
• CPC Class Codes: H04L 67/1001 : for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1038 : Load balancing arrangements to avoid a single path through a load balancer
• CPC Class Codes: H04L 67/1095 : Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• CPC Class Codes: H04L 67/568 : Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/63 : Routing a service request depending on the request content or context
• CPC Class Codes: H04L 69/321 : Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers
• CPC Class Codes: H04L 69/326 : in the transport layer [OSI layer 4] H04L69/16 takes precedence
• CPC Class Codes: H04L 69/329 : in the application layer [OSI layer 7]

Abstract

Some embodiments provide a method for handling failure at one of several peer centralized components of a logical router. At a first one of the peer centralized components of the logical router, the method detects that a second one of the peer centralized components has failed. In response to the detection, the method automatically identifies a network layer address of the failed second peer. The method assumes responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and a distributed component of the logical router. The message instructs recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

Claims

1. A method for handling failure at one of a plurality of peer centralized components of a logical router, wherein the logical router is for handling communications between a logical network implemented in a datacenter and physical networks external to the datacenter, the method comprising:

at a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed;

in response to the detection, automatically identifying a network layer address for an interface of the failed second peer that communicates with a distributed component of the logical router and is different from a network layer address for an interface of the first peer that communicates with the distributed component of the logical router; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and the distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

2. The method of claim 1, wherein detecting that the second peer centralized component has failed comprises detecting that a tunnel between a first machine at which the first peer centralized component operates and a second machine at which the second peer centralized component operates is no longer up.

3. The method of claim 1, wherein detecting that the second peer centralized component has failed comprises receiving a message from the second peer centralized component that connectivity to an external network is no longer available.

4. The method of claim 1, wherein both of the first and second peers are designated as active for handling communication between the logical network and the physical networks.

5. The non-transitory machine readable medium of claim 1, wherein both of the first and second peers are designated as active for handling communication between the logical network and the physical networks.

6. A method for handling failure at one of a plurality of peer centralized components of a logical router, the method comprising:

at a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed by receiving a message from the second peer centralized component that connectivity to an external network is no longer available, wherein the second peer centralized component sends the message when the second peer centralized component is unable to exchange dynamic routing information with the external network;

in response to the detection, automatically identifying a network layer address of the failed second peer; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and a distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

7. The method of claim 6, wherein the logical router is for handling communications between a logical network implemented in a datacenter and physical networks external to the datacenter, wherein the identified network layer address of the failed second peer is a network layer address for an interface that communicates with the distributed component of the logical router.

8. The method of claim 7, wherein the identified network layer address of the failed second peer is different from a network layer address for an interface of the first peer that communicates with the distributed component of the logical router.

9. A method for handling failure at one of a plurality of peer centralized components of a logical router, the method comprising:

at a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed by receiving a message from the second peer centralized component that connectivity to an external network is no longer available, wherein the second peer centralized component sends the message when the second peer centralized component can no longer exchange data traffic with the external network;

in response to the detection, automatically identifying a network layer address of the failed second peer; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and a distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

10. The method of claim 9, wherein the method is performed by a local network controller that operates on a same machine as the first peer centralized component.

11. The method of claim 9, wherein the method is performed by the first peer centralized component.

12. A method for handling failure at one of a plurality of peer centralized components of a logical router, wherein the logical router is for handling communications between a logical network implemented in a datacenter and physical networks external to the datacenter, the method comprising:

at a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed;

in response to the detection, automatically identifying a network layer address of the failed second peer that communicates with the distributed component of the logical router and is the same as a network layer address for an interface of the first peer that communicates with a distributed component of the logical router; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and the distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

13. The method of claim 12, wherein prior to failing, the second peer was designated as active for handling communication between the logical network and the physical networks and the first peer was designated as standby for handling communication between the logical network and the physical networks.

14. The method of claim 12, wherein detecting that the second peer centralized component has failed comprises detecting that a tunnel between a first machine at which the first peer centralized component operates and a second machine at which the second peer centralized component operates is no longer up.

15. A non-transitory machine readable medium storing a program which when executed by at least one processing unit handles failure at one of a plurality of peer centralized components of a logical router, wherein the logical router is for handling communications between a logical network implemented in a datacenter and physical networks external to the datacenter, the program comprising sets of instructions for:

at a machine that hosts a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed;

in response to the detection, automatically identifying a network layer address for an interface of the failed second peer that communicates with a distributed component of the logical router and is different from a network layer address for an interface of the first peer that communicates with the distributed component of the logical router; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and the distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

16. The non-transitory machine readable medium of claim 15, wherein the set of instructions for detecting that the second peer centralized component has failed comprises a set of instructions for detecting that a tunnel between a first machine at which the first peer centralized component operates and a second machine at which the second peer centralized component operates is no longer functioning.

17. The non-transitory machine readable medium of claim 15, wherein the set of instructions for detecting that the second peer centralized component has failed comprises a set of instructions for receiving a message from the second peer centralized component that connectivity to an external network is no longer available.

18. A non-transitory machine readable medium storing a program which when executed by at least one processing unit handles failure at one of a plurality of peer centralized components of a logical router, the program comprising sets of instructions for:

at a machine that hosts a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed by receiving a message from the second peer centralized component that connectivity to an external network is no longer available, wherein the second peer centralized component sends the message when the second peer centralized component is unable to exchange dynamic routing information with the external network;

in response to the detection, automatically identifying a network layer address of the failed second peer; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and a distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

22. The non-transitory machine readable medium of claim 18, wherein the logical router is for handling communications between a logical network implemented in a datacenter and physical networks external to the datacenter, wherein the identified network layer address of the failed second peer is a network layer address for an interface that communicates with the distributed component of the logical router.

23. The non-transitory machine readable medium of claim 22, wherein the identified network layer address of the failed second peer is different from a network layer address for an interface of the first peer that communicates with the distributed component of the logical router.

19. A non-transitory machine readable medium storing a program which when executed by at least one processing unit handles failure at one of a plurality of peer centralized components of a logical router, the program comprising sets of instructions for:

at a machine that hosts a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed by receiving a message from the second peer centralized component that connectivity to an external network is no longer available, wherein the second peer centralized component sends the message when the second peer centralized component can no longer exchange data traffic with the external network;

in response to the detection, automatically identifying a network layer address of the failed second peer; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and a distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

20. The non-transitory machine readable medium of claim 19, wherein the logical router is for handling communications between a logical network implemented in a datacenter and physical networks external to the datacenter, wherein the identified network layer address of the failed second peer is a network layer address for an interface that communicates with the distributed component of the logical router.

21. The non-transitory machine readable medium of claim 19, wherein the set of instructions for detecting that the second peer centralized component has failed comprises a set of instructions for receiving a message from the second peer centralized component that connectivity to an external network is no longer available.

24. A non-transitory machine readable medium storing a program which when executed by at least one processing unit handles failure at one of a plurality of peer centralized components of a logical router, wherein the logical router is for handling communications between a logical network implemented in a datacenter and physical networks external to the datacenter, the program comprising sets of instructions for:

at a machine that hosts a first one of the peer centralized components of the logical router, detecting that a second one of the peer centralized components has failed;

in response to the detection, automatically identifying a network layer address of the failed second peer that communicates with a distributed component of the logical router and is the same as a network layer address for an interface of the first peer that communicates with the distributed component of the logical router; and

assuming responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and the distributed component of the logical router, the message instructing recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

25. The non-transitory machine readable medium of claim 24, wherein prior to failing, the second peer was designated as active for handling communication between the logical network and the physical networks and the first peer was designated as standby for handling communication between the logical network and the physical networks.

26. The non-transitory machine readable medium of claim 24, detecting that the second peer centralized component has failed comprises detecting that a tunnel between a first machine at which the first peer centralized component operates and a second machine at which the second peer centralized component operates is no longer up.