EP2436156B1 - Lastenausgleich zwischen schicht-2-domänen - Google Patents

Lastenausgleich zwischen schicht-2-domänen Download PDF

Info

Publication number
EP2436156B1
EP2436156B1 EP10781357.8A EP10781357A EP2436156B1 EP 2436156 B1 EP2436156 B1 EP 2436156B1 EP 10781357 A EP10781357 A EP 10781357A EP 2436156 B1 EP2436156 B1 EP 2436156B1
Authority
EP
European Patent Office
Prior art keywords
packet
load balancing
packets
mux
individual
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
EP10781357.8A
Other languages
English (en)
French (fr)
Other versions
EP2436156A4 (de
EP2436156A2 (de
Inventor
Parveen Patel
David Maltz
Albert Greenberg
Lihua Yuan
Randy Kern
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Microsoft Technology Licensing LLC
Original Assignee
Microsoft Technology Licensing LLC
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 Microsoft Technology Licensing LLC filed Critical Microsoft Technology Licensing LLC
Publication of EP2436156A2 publication Critical patent/EP2436156A2/de
Publication of EP2436156A4 publication Critical patent/EP2436156A4/de
Application granted granted Critical
Publication of EP2436156B1 publication Critical patent/EP2436156B1/de
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/09—Mapping addresses
    • H04L61/10—Mapping addresses of different types
    • H04L61/103—Mapping addresses of different types across network layers, e.g. resolution of network layer into physical layer addresses or address resolution protocol [ARP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
    • 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
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/09—Mapping addresses
    • H04L61/25—Mapping addresses of the same type
    • H04L61/2503—Translation of Internet protocol [IP] addresses
    • H04L61/2592—Translation of Internet protocol [IP] addresses using tunnelling or encapsulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1027—Persistence of sessions during load balancing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/63—Routing a service request depending on the request content or context
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2212/00—Encapsulation of packets
    • 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

Definitions

  • Load balancers can be a critical piece of network infrastructure that can distribute a set of requests over a set of servers capable of processing the requests.
  • Conventional load balancers can include pairs of devices, each of which is specialized hardware. Because of this use of specialized hardware, conventional load balancers tend to cost a lot of money.
  • Another drawback is that they use a scale-up strategy: a single pair of load balancers can handle a number of concurrent requests limited by the capacity of the hardware. More powerful load balancers containing hardware with more capacity are purchased to handle additional requests.
  • DSR Direct Server Return
  • DSR Direct Server Return
  • EP 1 494 422 discloses a load balancing method in which a source address and a destination VIP address of incoming packets are replaced by an originating address and a target address of a load balancing infrastructure.
  • the method includes obtaining a source/destination pair from a packet; accessing an encapsulation mapping table using the source/destination pair to locate an encapsulation mapping entry; extracting a flow identifier from the encapsulation mapping entry; and replacing part of the packet with the flow identifier to produce an encapsulated packet.
  • the invention provides a load balancing method and system as claimed hereinafter.
  • a network load balancer can assist with enhancing the utilization of resources in a network by classifying incoming packets into sessions and distributing packet traffic for individual sessions to a selected resource(s) (e.g., server(s)).
  • a selected resource(s) e.g., server(s)
  • DSR Direct Server Return
  • FIG. 1 shows a high level view of some of the present concepts.
  • FIG. 1 shows a network environment 100 where external client(s) 102 can communicate with a scalable load balancing system 104 via the internet 106.
  • Load balancing or spreading can be considered any suitable means by which a networking device can spread traffic across a set of valid next hops.
  • Scalable load balancing system 104 can include a load balancing functional layer 108 that is scalable in that it can support an essentially unlimited amount of target devices indicated at 110.
  • the term 'essentially unlimited' can mean generally as many target devices as are desired by an entity controlling scalable load balancing system 104.
  • the number of target devices can be tens or hundreds of thousands, or more.
  • the load balancing functionality layer 108 is configured such that communications from external client 102 can pass through, and be distributed by the load balancing functionality to individual target devices as indicated by arrow 112. However, return communications represented by arrow 114 do not need to pass through load balancing functionality layer 108 on the way back to external client 102.
  • some implementations can achieve load balancing functionality 108 utilizing inter layer-2 domain packet delivery techniques.
  • these inter layer-2 domain packet delivery techniques can allow load balancing optimization techniques, such as DSR, to be used across multiple IP subnets and thereby allow the use of essentially unlimited target devices 110.
  • load balancing optimization techniques such as DSR
  • networks using the Internet Protocol can divide hosts that share a common bit prefix in their IP Addresses into an IP subnet.
  • IP internet protocol
  • Individual IP subnets can be associated with one of several layer-2 domains of the scalable load balancing system 104.
  • individual incoming packets of a packet flow can be encapsulated using, for example, IP-in-IP encapsulation. This can be accomplished, for example, by a multiplexer (MUX or Mux) of the load balancing functionality 108.
  • MUX multiplexer
  • Encapsulated incoming packets can be routed to resources or target devices 110 on the scalable load balancing system 104 by passing through load balancing functionality 108 before reaching individual target devices.
  • the load balancing functionality can use an optimization technique, such as DSR, to reduce/minimize packet flow traffic on the load balancing functionality.
  • the target devices e.g., servers
  • Components e.g., software components
  • the results (outgoing packets) can then be routed out of the scalable load balancing system 104 to external client 102 (e.g., the client receiving one or more of the incoming packets) without passing through (i.e. traversing) the load balancing functionality 108.
  • scalable load balancing system 104 can enable new functionalities, including functionality associated with load spreading and Gratuitous Address Resolution Protocol (G-ARP). These concepts are expanded upon below.
  • FIG. 2 illustrates another example network environment 200 according to one or more embodiments.
  • Network environment 200 provides example structures or components that can accomplish the concepts introduced above in relation to FIG. 1 .
  • Network environment 200 can include external client(s) 202 that communicate with a scalable load balancing system 204 via the internet 106 or other network.
  • Scalable load balancing system 204 can include a set of routers 206, a set of dynamic load balancers (DLBs) 208, and a set of target devices 210.
  • the set of routers 206 are manifest as routers 206(1) and 206(n).
  • the set of DLBs 208 are manifest as DLBs 208(1) and 208(n) that include multiplexers (or MUXes) 212(1) and 212(n), respectively.
  • the set of target devices 210 is manifest as application servers 214(1) and 214(n) and local load balancers 216(1) and 216(n).
  • Dotted arrows indicated generally at 218 show potential communication paths between components of scalable load balancing system 204.
  • Bold solid arrows 220(1) and 220(2) show two potential packet flow pathways through network environment 200 from external client 202 to application server 214(1).
  • Bold solid arrow 222 represents a return packet flow path from application server 214(1) to external client 202.
  • bold arrows 220(1) and 220(2) can represent a search query from external client 202 that is handled by application server 214(1).
  • application server 214(1) can be termed the 'target device'.
  • the target device is an application-level application server
  • the sample target device could additionally or alternatively be another type of target device, such as a local load balancer - an application-level load balancer for instance.
  • the incoming packet flow i.e., bold arrows 220(1) and 220(2)
  • the outgoing return packet flow i.e., bold arrow 222
  • this can be accomplished by utilizing a DSR optimization technique.
  • Example DSR optimization techniques are described below.
  • MUX(es) 212(1) and/or 212(n) on one or more of the DLBs 208(1) and 208(n) can use IP-in-IP encapsulation to send the packet flow to the target device 210. While specific encapsulation examples are provided, encapsulation can be any means for addressing a packet for delivery along a path or a portion of a path.
  • a decapsulation component 222(1)-222(n) on the target device can decapsulate a packet or packets of the incoming packet flow and send the results (i.e., the outgoing packet flow) back to the external client 202.
  • the decapsulation components 222(1)-222(n) can be manifested on the target device 210 as software components that are executable by a processor of the target device.
  • routers 206 can use Equal Cost MultiPath (ECMP) to spread packet loads across MUXes 212(1) and 212(n) of the DLBs 208.
  • the MUXes can offer consistent hashing to packets that are sent to the target devices 210.
  • the DLBs 208 and the target devices 210 can be implemented on a single device, such as a server(s).
  • a single computing device, such as a server can include DLB 208(1) with MUX 212(1) and application server 214(1).
  • the DLBs can be on separate devices from the target devices.
  • each of the DLBs 208 in this example can be configured to provide an application program interface (API) to mange virtual IP (VIP) to direct IP (DIP) mappings (e.g., VIP ⁇ ⁇ Slot 1 , Slot 2 , Slot 3 , ..., Slot N ⁇ ) of a VIP-DIP map.
  • VIP application program interface
  • DIP direct IP
  • Individual slots are assigned to a DIP.
  • a single DIP can appear multiple times in this VIP to DIP map.
  • This VIP to DIP map can be referred to as a VipMap.
  • each address may also be associated with a port number (e.g., a transmission control protocol (TCP) port such as port 80).
  • TCP transmission control protocol
  • a VIP address or VIP address and port number can be mapped to a list consisting of entries that are either a DIP address alone or a DIP address and a port number.
  • a single DIP address may appear multiple times, either alone, with a different port number, or with the same port number, in any combination.
  • the individual MUXes 212(1)-212(n) of the DLBs 208 can each be configured to hash header fields from the individual incoming packet flow packets and send the individual packets to an appropriate IP address associated with the target device(s) 210.
  • the MUX(es) of the DLB(s) can then send the example incoming packet to an address indicated in Slot i .
  • a potential advantage of this design is that packets that are part of the same flow (e.g., a TCP flow where all packets share the same 5-tuple of IP source address, IP destination address, TCP source port, TCP destination port and IP protocol number) can be forwarded to the same target device 210, regardless of which DLB 208 processes the packet.
  • a TCP flow where all packets share the same 5-tuple of IP source address, IP destination address, TCP source port, TCP destination port and IP protocol number
  • FIG. 3 illustrates another example network environment 300 that offers an alternative to network environment 200 described above.
  • network environment 300 is similar to network environment 200.
  • the local load balancers (LLBs) can be thought of as an intervening layer between the DLB and the target devices.
  • network environment 300 includes an external client 302 that communicates with scalable network balancing system 304 via the internet or other network 306.
  • Network balancing system 304 includes a router layer 308, a DLB layer 310, a LLB layer 312, and a target device layer 314.
  • the target device layer 314 includes application servers 314(1)-314(n).
  • LLB layer 312 includes LLB's 312(1)-312(n).
  • Decapsulation components 316(1)-316(n) are resident on LLBs 312(1)-312(n), respectively.
  • the external client's communication can be encapsulated at the DLB layer 310 and decapsulated upon receipt at the LLB layer 312.
  • the communication can then be forwarded to the appropriate application server 314(1)-314(n).
  • Any return communication to external client 302 can bypass the DLB and LLB layers 310 and 312, respectively. Bypassing the DLB and LLB layers can avoid potential bottlenecks and/or conserve system resources for incoming communications.
  • FIG. 4 illustrates another high level example of components of a network environment 400 of a scalable load balancing system.
  • these components include query generators 402(1)-402(n), access routers (AR) 404(1)-404(n), layer-2 aggregation switches 406(1)-406(n), and top of rack (ToR) switches 408(1)-408(n).
  • the ToRs can communicate with various server rack components such as MUXes (M), health monitors (H), servers (S), load balancers (B).
  • the ARs 404(1)-404(n) can be configured with N routes, each of these routes points its next-hop to an intermediate IP (IIP) address (IIP1 to IIPN) that has the same cost.
  • IIP intermediate IP
  • the routes may all be next hops for the VIP. Therefore, the AR may evenly distribute the traffic among the N IIP addresses.
  • These routes could be configured as static routes on the AR with equal metrics (i.e., equal-cost static routes (discussed below relative to FIG. 5 )).
  • these routes could be dynamically established via a routing protocol (e.g., Border Gateway Protocol (BGP) or Open Shortest Path First (OSPF)) speaker with the appropriate session with the AR.
  • BGP Border Gateway Protocol
  • OSPF Open Shortest Path First
  • the AR can be configured to announce the VIP.
  • IIPs may be partitioned across the MUX's (M).
  • MIP MUX's
  • a MUX in addition to its own IP address (MIP), may also be configured with one or more IIP address so that it can answer the ARP request for the IIPs configured. Therefore, individual MUX may receive a share of forwarded traffic. Upon receiving a packet, the individual MUX can run a consistent hashing algorithm to select one active DLB to forward the traffic.
  • the MUX's may use the same consistent hashing algorithm based on the same set of active DLBs. Therefore, a packet can be forwarded to the same DLB no matter which MUX receives it from the AR 404(1)-404(n). Note than when a new DLB is added or removed from the pool, this can trigger some local configuration change; however, existing connections can be preserved.
  • FIG. 5 shows a network environment 500 and associated technique for configuring N equal-cost static routes.
  • network environment 500 includes an access router 404(1) (introduced in FIG. 4 ), IIP(1)-IIP(n), MUXes 212(1)-212(n) and DLBs 208(1)-208(n) (introduced in FIG. 2 ).
  • Network environment 500 can configure N equal-cost static routes for each VIP.
  • the NEXT HOP of these equal-cost static routes point to an Intermediate IP (IIP) address IIP(1)-IIP(n).
  • IIP addresses may be drawn from a separate address pool independent of VIP and DIP pool. This implementation can also turn on load spreading so that traffic will be equally distributed to the N IIP address.
  • a routing protocol such as a BGP connection to the routers could be used to inform them of the MUXes that are alive and taking packets for each VIP.
  • Various implementations can address the issue of how to preserve long-running connections as MUX modules come and go.
  • An approach utilized in some implementations can be to retain the state for individual flows handled at every MUX, and give a copy of this state to individual MUXes as they are added to the scalable load balancing system.
  • state information In order to handle the addition or removal of MUXes without breaking existing connections, one alternative is for state information to be created whenever a new connection is first handled by any MUX. This state can be shared among MUXes either directly by a peer to peer mechanism or indirectly by sending it to a logically centralized store from which any MUX needing to handle packets for a connection can determine the DIP to which other MUXes have sent that connection's packets.
  • the MUXes can be either forwarding packets using a current mapping between VIPs and DIPs (i.e., a VipMap) or in a transition period where they are changing from forwarding packets using one VipMap (V) to forwarding packets using another VipMap (V').
  • the MUXes can be made to agree on V, V' and their current transitioning state (that is, whether they are in the state of transitioning between V and V' or they have all begun using only V' for all packets). When not in transition, all MUXes forward all packets using the current VipMap.
  • the MUXes When in transition, the MUXes create a piece of local state whenever they see a packet for a new connection (e.g., a TCP SYN packet). When forwarding packets other than those indicating a new connection, the MUX sees if it has state for that connection. If it has state, the MUX forwards the packet using the new VipMap V', otherwise, it forwards the packet using the old VipMap V.
  • a new connection e.g., a TCP SYN packet.
  • the MUX 212(1)-212(n) may have the following major components: (1) the IIP module which claims ownership of an IIP to the router and receives traffic for that IIP, (2) the consistent hashing module which determines which DLB 208(1)-208(n) to forward the traffic, (3) the packet rewriter that modifies the packet, (4) the local DLB monitor. Any or all of these components can be implemented on readily available (i.e., commodity) servers and/or on the routers in various implementations. MUX components are described in more detail below relative to FIGS. 6-8 .
  • the IIP module (IIP(1)-IIP(n)) may be responsible to register the MUX 212(1)-212(n) to the router through the ARP protocol. Basically, the IIP module may establish on the router an IP-MAC mapping of the IIP address and the MUX MAC address.
  • IP Address iip IP Address iip
  • the IIP address can be added up as a secondary IP address on the MUX interface. Note that it is possible for a MUX to have multiple secondary IP addresses.
  • 'AddIP()' may cause the MUX network stack to send 3 gratuitous ARP (G-ARP) requests, which can update the router's ARP table (or triggers IP address conflict detection on itself).
  • G-ARP gratuitous ARP
  • the operating system can broadcast a G-ARP (within the same L2 domain).
  • This G-ARP request may ask for the IP address it is claiming. If no other machine replies with this IP address, the IP address may be added successfully. Otherwise, an IP address conflict can be detected and the MUX stack may prevent the machine from claiming this IP address. This can happen if another MUX has claimed the IIP (e.g. failover) and failed to remove it. This scenario can be handled through external measures (e.g. by switching off the defending machine).
  • MUX "B” When a new MUX, for purposes of example, MUX "B" needs to replace MUX "A" (e.g., because planned downtime of MUX A and/or system failure at MUX A) the new MUX B may add the IIP(s) of MUX A to its own interface.
  • a module such as described above may direct packet flows to one or more stateful modules in a pool of servers, where the stateful module may keep per flow state.
  • the inbound packets may flow routes from client to module to stateful module to target server that handles the associated request.
  • the outbound flow may route from target server to stateful module to the client.
  • Per flow state at the stateful module may enable individual stateful modules to apply policy at flow level to support additional load balancing features.
  • the stateful module can, for example, inspect cookies or URLs to customize the load balancing to the target server to depend on the application, on the client request, and/or on the role and/or the load and/or conditions on servers and network elements. This embodiment may be advantageous because it can spread out CPU and state intensive workloads to as many servers as necessary.
  • the module can adapt its routing to the stateful module to depend on information deeper than header information carried in TCP/IP and application headers.
  • the module can learn or participate in cryptographic protocols, enabling decryption of portions of a packet.
  • the stateful module's choice of target server can then depend on these decrypted portions.
  • the mechanism can be constructed so that the target server returns the outbound flow to the stateful module that is able (and potentially most appropriate) to handle it. This may benefit from the use of programmable CPUs to implement the module.
  • the module may include the original destination address in some part of the packet header, such as an Internet Protocol (IP) option, and send the packet to the target device.
  • IP Internet Protocol
  • the target device can extract this information from the packet header and use it to send outgoing packets directly to the source (e.g., an external client), where some of the packets do not pass through the module.
  • IP Internet Protocol
  • FIG. 6 shows an example scalable load balancing system architecture 600 that can accomplish the concepts described above and below.
  • scalable load balancing system architecture 600 can include a scalable load balancing manager 602, a MUX role is represented at 604 and a DIP role is represented at 606.
  • Load balancing system architecture 600 can further include a health monitor 608, a health probe 610, and a route manager 612.
  • the MUX role 604 can involve a MUX controller 614 operating in a user mode 616 and a MUX driver 618 operating in a kernel mode 620.
  • the DIP role 606 can involve a DIP controller 622 operating in a user mode 624 and a decap driver 626 operating in a kernel mode 628.
  • Scalable load balancing manager 602 can be thought of as the entry point for interactions with scalable load balancing system architecture 600.
  • Scalable load balancing manager 602 can provide an API that can be used to manage an instance of the scalable load balancing concepts.
  • a scalable load balancing instance can be specified using an XML configuration or an API.
  • Scalable load balancing manager 602 can be responsible for configuring VIP:DIP mapping on MUX machines and ensuring that the MUX machines stay in sync. Furthermore, scalable load balancing manager 602 can also facilitate preservation of long-running connections when DIPs are added or gracefully removed from a pool. This feature is described in more detail below relative to FIG. 9 .
  • the scalable load balancing manager 602 can be replicated and a master selection algorithm can be used to ensure consistency of state.
  • a MUX role 604 may be configured with one or more Intermediate IP Addresses (IIPs).
  • IIPs Intermediate IP Addresses
  • a router such as router 404(1) may be configured to forward towards a set of IIPs the packets destined to a VIP.
  • the MUX configured with a given IIP will perform the MUX processing for packets forwarded towards that IIP.
  • the MUX controller 614 can control the MUX driver 618.
  • the MUX controller can export a web services API that is used by the Scalable Load Balancing Manager 602 to control the MUX.
  • the MUX controller can perform the following functionality:
  • the MUX driver 618 can implement the base packet modification functionality.
  • the MUX driver can hash the header fields of incoming packet, pick up a DIP for it based on the hash value and the current VIP map and encapsulate the packet for delivery.
  • the MUX driver 618 can also maintain a cache of hash:DIP mapping of all long-running connections for every VIP.
  • DIP controller 622 can control the decap driver 626 on the DIP machine. Similar to the Mux Controller 614, the DIP controller 622 can export a web services API that is used by the scalable load balancing manager 602 to control and query the DIP machine. In some implementations, the DIP controller 622 can perform the following functions:
  • Decap driver 626 can decapsulate IP-in-IP packets that are destined to the specified VIP. This feature helps to avoid breaking on-going communications with specific applications. For example, if there is an application that is using raw sockets to send IP-in-IP (e.g., a virtual private network VPN app), then the decap driver 626 does not decapsulate those.
  • IP-in-IP e.g., a virtual private network VPN app
  • Route manager 612 can be responsible for configuring the routers when MUX machines are added or removed from the pool.
  • the route manager can use a routing protocol, such as OSPF or BGP, or an interface to configure static routes on the routers.
  • Health monitor 608 can be responsible for maintaining the health state of MUX and DIP machines and possibly for routes involved in request processing. Toward this end, the health monitor can monitor one or more network parameters that may be of value in determining the health of the network and/or network components.
  • the scalable load balancing manager 602 can use the health monitor 608 as the authoritative source of health information about MUXes and DIPs. If the health monitor 608 notifies the scalable load balancing manager 602 about a health change event, the scalable load balancing manager can take appropriate action of adding or removing that node from the corresponding pool.
  • health monitor 608 may be employed to monitor the health of MUXes, DLBs and/or the routes to those machines.
  • health monitor 608 can consist of three modules, a VPN dialer, a MUX monitor, and a DLB monitor.
  • DLB may provide a HTTP interface.
  • Health monitor 608 may employ various kinds of health probes 610 to establish the health of target components. For example, the health monitor may send an "http get" to fetch a small text/xml file from DLB. If the file contains the 'magic word' the health monitor and DLB agreed upon, then the health monitor may consider that the DLB is up and running, and determine if a DLB or MUX is running as expected.
  • the health monitor components may live on separate devices than the MUX devices.
  • Health probe 610 can be used by health monitor 608.
  • the health monitor can use various health probes to accomplish its job.
  • the health probes 610 can actively monitor an aspect of health of the target machine, e.g., a ping probe monitors connectivity and liveness of the machine.
  • Other health probes may simply query the machine/role for its health - the machine/role can be responsible for maintaining a record of its health, the probe simply queries it periodically.
  • an HTTP probe is successful, this may indicate everything is up and running. But since it runs over TCP, it is possible that the DLB might be running out of the sockets or other resources temporarily. It is also possible during a denial of service (DoS) attack that a DLB might be running out of resources (e.g., sockets) for a sustained period of time.
  • DoS denial of service
  • One solution to this may be to maintain a persistent HTTP connection.
  • most server/browser implementations will timeout persistent TCP connections. For example, some browsers may time out a persistent connection after 60 seconds. Therefore, the health monitor is prepared to renew a persistent connection if it is closed, and should not necessarily view the closure of a persistent connection as indicating a DIP failure.
  • the packets will be forwarded to the same DLB. Therefore, the flow (e.g., a TCP connection) should not be disturbed.
  • a separate pool of MUXes may be made available as the hot standby of the active MUXes.
  • the health monitor 608 upon detecting a MUX failure, may start one or more MUXes to take over the IIPs of the failed MUX. At the same time, the health monitor may switch off the failed MUX.
  • Similar techniques can be used as are used for a hot standby. Since MUXes operate in stateless mode, some implementations can safely switch off a MUX after all the packets have been drained from it.
  • DLB planned downtime can be handled through stateful MUX map transition.
  • MUX planned downtime is handled via the following steps:
  • the health monitor 608 can send periodic probes to MUXes and DLBs to monitor unexpected failures.
  • the health monitor can instruct MUX to update its VipMap to avoid using the failed DLB.
  • the health monitor can instruct another MUX in the same VLAN to install the IIP (and use G-ARP to announce to the router).
  • the health monitor can send KeepAlive probes every two seconds, and announce a MUX/DLB dead after 3 consecutive failures.
  • MUX failover ⁇ 1 second
  • a virtual group of MUXes for each IIP may be utilized.
  • the cost of this fast failover may be more network usage during normal operation. The following steps can be used to manage the MUXes and IIP for the VIP:
  • FIG. 7 illustrates an example configuration of MUX 212(1) (introduced in FIG. 2 ) according to one or more embodiments. Taken collectively, FIGS. 7 and 8 illustrate how packets can be encapsulated and decapsulated along a path.
  • FIG. 7 involves user mode 702 and kernel mode 704, but concentrates on functionality provided by the MUX's MUX driver 618 in the kernel mode.
  • the MUX driver is implemented as an extension of the IP layer of the network stack.
  • a packet 706 is received by MUX driver 618, such as from an application server.
  • the packet includes a source client address at 708 and a destination VIP address at 710.
  • the packet migrates through the physical Network Interface Card (NIC) layer 712, and the Network Driver Interface Specification (NDIS) layer 714.
  • the packet is handled by the MUX driver's forwarder 716 in the IP layer 718.
  • the forwarder encapsulates packet 706 to generate packet 720.
  • This packet includes the source client address at 708 and the destination VIP address at 710 encapsulated by a source MUX address 722 and a destination DIP address 724.
  • the original packet 706 is encapsulated in packet 720 in a manner that gives the impression that it is from MUX 212(1) rather than from client 708.
  • MUX 212(1) can implement layer-4 load balancing, a.k.a., VIP:DIP mapping. Traffic from the clients can be sent to one of the MUX nodes by tier 1 (typically via Equal Cost Multi Path (ECMP) routing.)
  • ECMP Equal Cost Multi Path
  • MUX 212(1) receives a packet 706, it can hash the packet header fields (it is flexible in terms of which fields are hashed) and can pick a DIP based on this hash. (An example of this process is described below relative to FIG. 9 ).
  • the MUX can then encapsulate the original packet 706 in a new IP header that indicates the chosen DIP as the destination (i.e., destination DIP address 724) and the MUX as the source IP address. (Alternatively, the MUX can use the original sender as the source IP.)
  • the MUX nodes in a load balancing cluster can use the same hash function. Furthermore, the MUX nodes can maintain state during addition and graceful-deletion of DIPs. This can allow packets for a given flow to be forwarded to the same server in the next tier regardless of which MUX receives the packet.
  • FIG. 8 illustrates an example of the DIP role 606 introduced above relative to FIG. 6 .
  • DIP decap driver 626 can perform decapsulation on encapsulated packet 720 introduced in FIG. 7 .
  • the DIP decap driver is implemented as an extension of the IP layer of the networking stack.
  • FIG. 7 offers an example for achieving encapsulation at the front end of a delivery path
  • FIG. 8 offers an example at the back end of decapsulating the original packet 706 introduced above.
  • decap driver 626 can receive encapsulated packet 720.
  • the decap driver can remove the encapsulation (i.e., source MUX address 722 and Destination DIP address 724) to produce packet 706 once the encapsulated packet travels over the path and is ready for delivery to destination VIP address 710.
  • the above described MUX 212(1) and DIP role 606 can be employed with the present concepts to facilitate encapsulation of a packet, such as packet 706 that is associated with an application address (i.e., destination VIP address 710) with a location address (i.e., destination DIP 724) so that the packet 706 can be transported over layer-3 infrastructure and ultimately delivered to the layer-2 destination VIP address 710. Further, the encapsulated packet can travel over a selected path defined by the encapsulation and the selected path can be easily reselected for subsequent packets to avoid congestion.
  • an application address i.e., destination VIP address 710
  • a location address i.e., destination DIP 724
  • this configuration can facilitate disruption-free (or reduced disruption) growing and shrinking of a network node pool (i.e., components of scalable load balancing systems 104, 204 and/or 304).
  • scalable load balancing system status tends not to be static. For instance, more application servers can come on-line and/or application servers can go off-line, switches can go out or come on, communications are initiated and finalized, etc.
  • the present concepts can allow graceful transitioning from an existing scalable load balancing system mapping to a new scalable load balancing systems mapping. For instance, the present concepts can track existing or ongoing communications of an existing mapping.
  • Some implementations can attempt to maintain continuity for those ongoing communications utilizing the existing mapping while utilizing a new mapping that reflects scalable load balancing system changes for new communications. These implementations can then 'gracefully' transition from the old mapping to the new mapping in a manner that is relatively seamless.
  • FIG. 9 illustrates an example method 900 of mapping a hash space to a DIP pool.
  • the mapping can allow removal of a DIP from a VIP pool with no disruption to traffic not going to the affected DIP.
  • a first mapping between a hash space (i.e., potential hash values) and a pool of available DIPs is shown at 902.
  • a second mapping between the hash space and a different pool of available DIPS is shown at 904.
  • second mapping 904 occurred as a result of DIP 1 going down (i.e., becoming unavailable) as is indicated at 906.
  • hash values are mapped to DIP 1 at 908(1), 908(2), and 908(3), to DIP 2, at 910(1), 910(2), and 910(3), to DIP3 at 912(1), 912(2), and 912(3), and to DIP 4 at 914(1), 914(2), and 914(3).
  • hash values are distributed among the available DIPs in a manner that can reduce or avoid bottlenecks.
  • this implementation redistributes DIP 1's load among the remaining available DIPs in a manner that avoids suddenly overburdening any individual available DIP.
  • the first portion of the hash that was mapped to DIP 1 at 908(1) in first mapping 902 is reassigned to DIP 2 as indicated at 916.
  • DIP 1's second portion 908(2) is reassigned to DIP 3 as indicated at 918.
  • DIP 1's third portion 908(3) is reassigned to DIP 4 as indicated at 920.
  • this implementation seamlessly, redistributes packet flow from a four-way distribution as seen in first mapping 902 to a three-way distribution as seen in second mapping 904 in an equitable way that can avoid overburdening any of the remaining DIPS and thereby avoids potentially creating a bottleneck associated with an overburdened DIP.
  • MUX such as MUX 212(1)
  • VIP-DIP map M which determines a VIP's mapping to one or more application servers (DLBs).
  • M can be changed to M' gracefully. Since there might be long-lived connections, optionally, a deadline T can be defined. The MUX can then change M to M' once T is reached or the graceful change is completed.
  • the MUX can compute both H(P) and H'(P), where H(P) can be computed using the map M and H'(P) can be computed using map M'.
  • the DLB could be informed about the same M->M' transition, and then it can calculate if it (i.e., the DLB) is affected by this transition.
  • a DLB decides that it is being transitioned out, it can gracefully drain the connections it has.
  • the DLB HTTP server can disable 'HTTP Keepalive'. As such, the DLB HTTP server can terminate the underlying TCP connection with a FIN (TCP FIN packet, which completes a TCP connection).
  • TCP FIN packet TCP FIN packet, which completes a TCP connection.
  • the FIN can be thought of as a flag in the TCP header that indicates that the sender of this packet wants to terminate the connection.
  • An external client may re-start a connection. However, this will likely start a new handshake, for which the MUX can route the new TCP connection to the new DLB.
  • persistent HTTP connections can be handled like the established TCP connections described below.
  • the present implementations can use IP-in-IP encapsulation so that DSR can be used across potentially all target devices rather than just a subnet.
  • load balancers can be implemented as scalable logical tiers as desired.
  • the concepts can also preserve connections during system transitions. For instance, DIPs can be added or removed, loads can be rebalanced and/or system capacity can be adjusted while gracefully transitioning connections. Consistent hashing can be achieved at the MUX layer to allow scalability and to allow removal of failed DIPs without keeping state. Further, system monitoring, controlling, and/or managing functions can be co-located with load balancing functions. This can enable a master to ensure address continuity among the MUXes, among other potential advantages.
  • FIG. 10 illustrates a flow diagram of a method 1000 that describes steps or acts of an example associated with preserving long running connections with respect to expansion of a DIP pool for a VIP, in accordance with one or more embodiments.
  • the method can be implemented in connection with any suitable hardware, software (e.g., including firmware), or any combination thereof.
  • the method can be stored on computer-readable storage media that can be executed by a processor of a computing device to perform the method.
  • one or more of the steps of the method can be repeated any number of times. Additionally or alternatively, one or more of the steps may be omitted in at least some embodiments.
  • new connections are identified for a network or scalable load balancing system. In at least some embodiments, this can be accomplished by looking for TCP SYN.
  • step 1004 state is kept for the new connections.
  • an existing or old hash is used for existing or old connections and a new hash can be used for new connections.
  • DIPS are queried. In at least some embodiments, this can include querying DIPS for long-running connections that are to be preserved. Alternatively, the load balancing system can determine active connections by interpreting packet headers.
  • the state for preserved connections is expired. In at least some embodiments, this can include expiring the state for preserved connections as they terminate at the DIPs.
  • Method 1000 is offered for explanatory purposes and should not be viewed in a limiting manner.
  • an alternative method that can be employed during a transition can utilize the following algorithm:
  • FIG. 11 illustrates a flow diagram that describes steps or acts of an example method 1100.
  • the method can be implemented in connection with any suitable hardware, software (e.g., including firmware), or any combination thereof.
  • the method can be stored on computer-readable storage media that can be executed by a processor of a computing device to perform the method.
  • one or more of the steps of the method can be repeated any number of times. Additionally or alternatively, one or more of the steps may be omitted in at least some embodiments.
  • network packets can be spread among a series of modules.
  • the modules are MUX modules configured to be implemented on servers and/or in routers. The spreading can be oblivious to individual characteristics of the packets, except that packets to a destination may be delivered to a MUX module that contains the state needed to handle packets for that destination.
  • individual network packets are spread among modules using an ECMP router.
  • network packets can be encapsulated at individual modules.
  • the encapsulation of the packet comprises IP-in-IP encapsulation and/or preserves one or more VIP address to which the packet was sent.
  • a potentially valuable feature of the techniques described herein is associated with encapsulating the network packets based on characteristics of the packets (e.g., the 5-tuple, IP src addr, IP dst addr, IP Protocol number, TCP src port, and/or TCP dst port) so that packets that are part of the same request can, in some embodiments, be all handled by the same target device, regardless of which MUX module encapsulates the packet.
  • a target device to which the network packets are encapsulated using a state shared among the modules can be chosen.
  • the state shared among the modules is a key space of a consistent hash function. Additionally or alternatively, in at least some embodiments, the state shared among the modules can be changed in response to a failure of the target device.
  • the network packets can be forwarded from the modules.
  • Step 1110 the health of the target devices, MUX modules, routers and the routes between various components can be monitored.

Claims (15)

  1. Lastausgleichsverfahren (1100), umfassend:
    Verteilen (1102) von Netzpaketen zwischen einer Reihe von Modulen (212);
    Einkapseln (1104) eines einzelnen Netzpakets (706) eines Paketflusses an einem einzelnen Modul (212) einer Lastausgleichsschicht (108), um eine Quelladresse (708) einer externen Clientvorrichtung (102, 202) und eine Zieladresse (710) des einzelnen Netzpakets wie durch das einzelne Modul empfangen beizubehalten;
    Auswählen (1106) einer Zielvorrichtung (110, 210), an welche das einzelne Netzpaket eingekapselt wird, um ein eingekapseltes Paket (720) unter Verwendung eines von den Modulen (212) gemeinsam genutzten Zustands zu schaffen, wobei das eingekapselte Paket das einzelne Netzpaket mit der beibehaltenen Quelladresse (708) und der beibehaltenen Zieladresse (710) umfasst, und wobei eine Quelladresse (722) des eingekapselten Pakets sich auf das einzelne Modul bezieht und eine Zieladresse (724) des eingekapselten Pakets sich auf die Zielvorrichtung bezieht;
    Weiterleiten (1108) des eingekapselten Pakets aus dem einzelnen Modul (212) für die Zielvorrichtung;
    Entkapseln des eingekapselten Pakets durch eine Entkapselungskomponente (222) der Zielvorrichtung (110, 210); und
    Routen wenigstens einiger ausgehender Pakete des Paketflusses zur externen Clientvorrichtung (102, 202) ohne Passieren der Lastausgleichsschicht (108).
  2. Verfahren (1100) nach Anspruch 1, wobei der unter den Modulen (212) der Reihe geteilte Zustand ein Schlüsselraum einer konsistenten Hashfunktion ist.
  3. Verfahren (1100) nach Anspruch 1, bei dem einzelne Netzpakete zwischen den Modulen (212) der Reihe unter Verwendung von Equal-Cost Multipath-Routing verteilt werden.
  4. Verfahren (1100) nach Anspruch 1, ferner umfassend ein Überwachen (1110) eines Gesundheitszustands der Zielvorrichtung (110, 210).
  5. Verfahren (1100) nach Anspruch 1, wobei der von den Modulen (212) der Reihe gemeinsam genutzte Zustand in Reaktion auf einen Ausfall der Zielvorrichtung (110, 210) geändert wird.
  6. Verfahren (1100) nach Anspruch 1, ferner umfassend ein Ändern aktiver Module (212) der Reihe in Standby-Module basierend auf einem Lastparameter und/oder einem oder mehreren anderen Parametern, um zu vermeiden, dass Ausfallzeiten für einen bereitgestellten Dienst verursacht werden.
  7. Verfahren (1100) nach Anspruch 1, wobei die Zielvorrichtung (110, 210) ein Mitglied einer Gruppe von Zielvorrichtungen ist (110, 210), und in einem Fall, in dem ein Hinweis empfangen wird, dass eine oder mehrere bestehende Zielvorrichtungen (110, 210) der Gruppe nicht mehr verfügbar sein werden oder ein oder mehrere neue Zielvorrichtungen (110, 210) zur Verfügung stehen, ein Umstellen auf eine Konfiguration erfolgt, die mit zukünftigen Kommunikationen verbundene Netzpakete an eine neue Gruppe von Zielvorrichtungen (110, 210) verteilt, während mit den laufenden Kommunikationen verbundene Netzpakete ferner an die Zielvorrichtungen (110, 210) der Gruppe gesendet werden.
  8. Verfahren (1100) nach Anspruch 1, wobei das Einkapseln der Netzpakete IP-in-IP-Einkapseln umfasst.
  9. Computerlesbares Speichermedium, auf welchem Befehle gespeichert sind, die, wenn sie von einer Verarbeitungsvorrichtung ausgeführt werden, bewirken, dass die Verarbeitungsvorrichtung das Verfahren (1100) nach einem der vorangehenden Ansprüche ausführt.
  10. System (104, 204), umfassend:
    eine Lastausgleichsschicht (108), die ausgelegt ist, einzelne ankommende Pakete eines Paketflusses aus einer externen Clientvorrichtung (102, 202) einzukapseln, um eingekapselte Pakete bereitzustellen, wobei jedes eingekapselte Paket (720) das einzelne ankommende Paket (706) mit einer beibehaltenen Quelladresse (708) und einer beibehaltenen Zieladresse (710) umfasst, und wobei eine Quelladresse (722) des eingekapselten Pakets sich auf die Lastausgleichsschicht bezieht und eine Zieladresse (724) des eingekapselten Pakets sich auf eine Zielvorrichtung bezieht, wobei die Lastausgleichsschicht (108) ferner ausgelegt ist, die eingekapselten Pakete zu den Zielvorrichtungen (110, 210) des Systems (104, 204) zu routen, wobei die Zielvorrichtungen (110,210) ein oder mehrere Internet-Protokoll (IP) Teilnetze umfassen, und wobei die gekapselten Pakete einen oder mehrere Lastausgleicher (208, 216) der Lastausgleichsschicht (108) passieren, bevor sie einzelne Zielvorrichtungen erreichen (110, 210); und
    wobei die einzelnen Zielvorrichtungen (110, 210) eine Entkapselungskomponente (222) umfassen, welche ausgelegt ist, Pakete aus der Lastausgleichsschicht (108) zu entkapseln, und wobei die einzelnen Zielvorrichtungen (110, 210) ausgelegt sind, wenigstens einige der ausgehenden Pakete des Paketflusses ohne Passieren irgendeines der einen oder mehreren Lastausgleicher (208, 216) an die externe Clientvorrichtung (102, 202) zu routen (222).
  11. System (104, 204) nach Anspruch 10, wobei die Lastausgleichsschicht (108) ausgelegt ist, die einzelnen ankommenden Pakete unter Verwendung von IP-in-IP-Einkapselung oder Paketmodifikation und/oder IP-Optionen einzukapseln.
  12. System (104, 204) nach Anspruch 11, wobei die Lastausgleichsschicht (108) wenigstens einen dynamischen Lastausgleicher (208) und wenigstens einen Multiplexer (212) umfasst, und wobei der wenigstens eine Multiplexer (212) ausgelegt ist, die einzelnen ankommenden Pakete einzukapseln.
  13. System (104, 204) nach Anspruch 11, wobei die Lastausgleichsschicht (108) wenigstens einen Multiplexer (212) umfasst, und wobei der wenigstens eine Multiplexer (212) ausgelegt ist, die einzelnen ankommenden Pakete unter Verwendung von IP-in-IP-Einkapselung einzukapseln.
  14. System (104, 204) nach Anspruch 11, wobei einzelne Zielvorrichtungen (110) mehrere virtuelle lokale Netze umfassen.
  15. System (104, 204) nach Anspruch 11, wobei der eine oder die mehreren Lastausgleicher (208, 216) dynamische Lastausgleicher (208) umfassen, die ausgelegt sind, eine Anwendungsprogrammschnittstelle bereitzustellen, um Zuordnungen der Lastausgleichsschicht (108) von virtueller IP (VIP) auf direkte IP (DIP) zu verwalten.
EP10781357.8A 2009-05-28 2010-05-28 Lastenausgleich zwischen schicht-2-domänen Active EP2436156B1 (de)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US18205709P 2009-05-28 2009-05-28
US12/605,388 US8416692B2 (en) 2009-05-28 2009-10-26 Load balancing across layer-2 domains
PCT/US2010/036757 WO2010138936A2 (en) 2009-05-28 2010-05-28 Load balancing across layer-2 domains

Publications (3)

Publication Number Publication Date
EP2436156A2 EP2436156A2 (de) 2012-04-04
EP2436156A4 EP2436156A4 (de) 2013-09-11
EP2436156B1 true EP2436156B1 (de) 2016-11-09

Family

ID=43220098

Family Applications (2)

Application Number Title Priority Date Filing Date
EP10781358.6A Active EP2436157B1 (de) 2009-05-28 2010-05-28 Agile datenzentrennetzwerkarchitektur
EP10781357.8A Active EP2436156B1 (de) 2009-05-28 2010-05-28 Lastenausgleich zwischen schicht-2-domänen

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP10781358.6A Active EP2436157B1 (de) 2009-05-28 2010-05-28 Agile datenzentrennetzwerkarchitektur

Country Status (9)

Country Link
US (1) US8416692B2 (de)
EP (2) EP2436157B1 (de)
JP (1) JP5960050B2 (de)
KR (1) KR101678711B1 (de)
CN (2) CN102726021B (de)
CA (2) CA2763032A1 (de)
ES (1) ES2614614T3 (de)
HK (1) HK1175321A1 (de)
WO (2) WO2010138937A2 (de)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4030736A1 (de) * 2021-05-24 2022-07-20 Beijing Baidu Netcom Science And Technology Co., Ltd. Lastausgleichssystem, -verfahren und -vorrichtung, und speichermedium

Families Citing this family (89)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9497039B2 (en) * 2009-05-28 2016-11-15 Microsoft Technology Licensing, Llc Agile data center network architecture
US9391716B2 (en) 2010-04-05 2016-07-12 Microsoft Technology Licensing, Llc Data center using wireless communication
US8499093B2 (en) * 2010-05-14 2013-07-30 Extreme Networks, Inc. Methods, systems, and computer readable media for stateless load balancing of network traffic flows
US8225131B2 (en) * 2010-06-17 2012-07-17 Microsoft Corporation Monitoring service endpoints
CN102143041B (zh) * 2010-07-02 2014-03-26 华为技术有限公司 一种网络流量分担的方法、装置及系统
US8391174B2 (en) * 2010-07-13 2013-03-05 Hewlett-Packard Development Company, L.P. Data packet routing
US8755283B2 (en) * 2010-12-17 2014-06-17 Microsoft Corporation Synchronizing state among load balancer components
US8934483B2 (en) 2011-01-20 2015-01-13 Broadcom Corporation Data center switch
US8612550B2 (en) 2011-02-07 2013-12-17 Microsoft Corporation Proxy-based cache content distribution and affinity
US8776207B2 (en) 2011-02-16 2014-07-08 Fortinet, Inc. Load balancing in a network with session information
WO2012131428A1 (en) * 2011-03-28 2012-10-04 Telefonaktiebolaget L M Ericsson (Publ) Method, apparatus and computer program product for updating load balancer configuration data
US9210048B1 (en) * 2011-03-31 2015-12-08 Amazon Technologies, Inc. Clustered dispersion of resource use in shared computing environments
CN102971990B (zh) 2011-05-19 2015-08-19 华为技术有限公司 一种生成隧道转发表项的方法和网络设备
EP3010179A1 (de) 2011-06-20 2016-04-20 Plexxi Inc. Verfahren zur verarbeitung eines multicast-frames in einem optischen netzwerk
US8812727B1 (en) * 2011-06-23 2014-08-19 Amazon Technologies, Inc. System and method for distributed load balancing with distributed direct server return
US9274825B2 (en) 2011-08-16 2016-03-01 Microsoft Technology Licensing, Llc Virtualization gateway between virtualized and non-virtualized networks
US9301026B2 (en) 2011-11-01 2016-03-29 Plexxi Inc. Affinity modeling in a data center network
US9204207B2 (en) 2011-11-01 2015-12-01 Plexxi Inc. Hierarchy of control in a data center network
US9337931B2 (en) 2011-11-01 2016-05-10 Plexxi Inc. Control and provisioning in a data center network with at least one central controller
US9288555B2 (en) 2011-11-01 2016-03-15 Plexxi Inc. Data center network architecture
EP2774047B1 (de) * 2011-11-01 2019-06-26 Hewlett-Packard Enterprise Development LP Steuerung und bereitstellung in einem datencenternetzwerk mit mindestens einer zentralen steuerung
US20130159487A1 (en) * 2011-12-14 2013-06-20 Microsoft Corporation Migration of Virtual IP Addresses in a Failover Cluster
US8954575B2 (en) * 2012-05-23 2015-02-10 Vmware, Inc. Fabric distributed resource scheduling
US9262253B2 (en) 2012-06-28 2016-02-16 Microsoft Technology Licensing, Llc Middlebox reliability
US9229800B2 (en) 2012-06-28 2016-01-05 Microsoft Technology Licensing, Llc Problem inference from support tickets
US8805990B2 (en) 2012-07-12 2014-08-12 Microsoft Corporation Load balancing for single-address tenants
US8831000B2 (en) * 2012-10-10 2014-09-09 Telefonaktiebolaget L M Ericsson (Publ) IP multicast service join process for MPLS-based virtual private cloud networking
US9246998B2 (en) 2012-10-16 2016-01-26 Microsoft Technology Licensing, Llc Load balancer bypass
CN103780502A (zh) 2012-10-17 2014-05-07 阿里巴巴集团控股有限公司 一种负载均衡下的数据交互系统、方法及装置
US9325748B2 (en) 2012-11-15 2016-04-26 Microsoft Technology Licensing, Llc Characterizing service levels on an electronic network
US9565080B2 (en) 2012-11-15 2017-02-07 Microsoft Technology Licensing, Llc Evaluating electronic network devices in view of cost and service level considerations
CN102983995B (zh) * 2012-11-19 2017-05-03 浪潮电子信息产业股份有限公司 一种基于数据中心的组网设计方法
US10938917B2 (en) * 2012-12-19 2021-03-02 Micro Focus Llc Triggering a high availability feature in response to detecting impairment of client experience
CN103905473B (zh) * 2012-12-25 2017-12-15 华为技术有限公司 云计算系统、负载均衡系统、负载均衡方法及装置
US9450874B2 (en) 2013-01-04 2016-09-20 Futurewei Technologies, Inc. Method for internet traffic management using a central traffic controller
US9832136B1 (en) 2013-01-23 2017-11-28 Liberty Mutual Insurance Company Streaming software to multiple virtual machines in different subnets
CN103971687B (zh) * 2013-02-01 2016-06-29 腾讯科技（深圳）有限公司 一种语音识别系统中的负载均衡实现方法和装置
US9112801B2 (en) 2013-03-15 2015-08-18 International Business Machines Corporation Quantized congestion notification in a virtual networking system
WO2014142971A1 (en) * 2013-03-15 2014-09-18 Hewlett-Packard Development Company , L. P. Traffic control across a layer 2 - layer 3 boundary in a software defined network
JP6264737B2 (ja) * 2013-03-25 2018-01-24 日本電気株式会社 負荷分散システム
US10069903B2 (en) 2013-04-16 2018-09-04 Amazon Technologies, Inc. Distributed load balancer
US9559961B1 (en) 2013-04-16 2017-01-31 Amazon Technologies, Inc. Message bus for testing distributed load balancers
US9871712B1 (en) 2013-04-16 2018-01-16 Amazon Technologies, Inc. Health checking in a distributed load balancer
US10135914B2 (en) 2013-04-16 2018-11-20 Amazon Technologies, Inc. Connection publishing in a distributed load balancer
US10038626B2 (en) 2013-04-16 2018-07-31 Amazon Technologies, Inc. Multipath routing in a distributed load balancer
US9553809B2 (en) 2013-04-16 2017-01-24 Amazon Technologies, Inc. Asymmetric packet flow in a distributed load balancer
US9354928B1 (en) * 2013-04-24 2016-05-31 Brian K. Buchheit User facing load balancing via virtual machine synchronization
JP6131710B2 (ja) * 2013-05-16 2017-05-24 富士通株式会社 通信システム、負荷分散装置、および、負荷分散プログラム
US9350601B2 (en) 2013-06-21 2016-05-24 Microsoft Technology Licensing, Llc Network event processing and prioritization
EP3020161B1 (de) 2013-07-11 2018-03-21 Plexxi Inc. Netzwerkknotenverbindungskonfiguration
US9742636B2 (en) * 2013-09-11 2017-08-22 Microsoft Technology Licensing, Llc Reliable address discovery cache
US9888405B2 (en) 2013-11-05 2018-02-06 Cisco Technology, Inc. Networking apparatuses and packet statistic determination methods employing atomic counters
US9876715B2 (en) 2013-11-05 2018-01-23 Cisco Technology, Inc. Network fabric overlay
US10412159B1 (en) 2014-02-07 2019-09-10 Amazon Technologies, Inc. Direct load balancing using a multipath protocol
US20150271075A1 (en) * 2014-03-20 2015-09-24 Microsoft Corporation Switch-based Load Balancer
US9660914B1 (en) 2014-05-08 2017-05-23 Google Inc. System and method for providing congestion notification in layer 3 networks
US9560124B2 (en) * 2014-05-13 2017-01-31 Google Inc. Method and system for load balancing anycast data traffic
US10440123B2 (en) * 2014-06-13 2019-10-08 Abb Schweiz Ag Method and system for secure bidirection communication for industrial devices
US9882814B2 (en) * 2014-09-25 2018-01-30 Intel Corporation Technologies for bridging between coarse-grained and fine-grained load balancing
US9876714B2 (en) 2014-11-14 2018-01-23 Nicira, Inc. Stateful services on stateless clustered edge
US11533255B2 (en) * 2014-11-14 2022-12-20 Nicira, Inc. Stateful services on stateless clustered edge
US10044617B2 (en) 2014-11-14 2018-08-07 Nicira, Inc. Stateful services on stateless clustered edge
US9866473B2 (en) 2014-11-14 2018-01-09 Nicira, Inc. Stateful services on stateless clustered edge
CN105704180B (zh) * 2014-11-27 2019-02-26 英业达科技有限公司 数据中心网络的配置方法及其系统
US9979640B2 (en) * 2014-12-23 2018-05-22 Intel Corporation Reorder resilient transport
US9800653B2 (en) * 2015-03-06 2017-10-24 Microsoft Technology Licensing, Llc Measuring responsiveness of a load balancing system
US9954751B2 (en) 2015-05-29 2018-04-24 Microsoft Technology Licensing, Llc Measuring performance of a network using mirrored probe packets
US10191757B2 (en) 2015-06-26 2019-01-29 Microsoft Technology Licensing Llc Seamless address reassignment via multi-tenant linkage
CN105024860A (zh) * 2015-07-23 2015-11-04 上海斐讯数据通信技术有限公司 一种远程通信控制方法及系统
JP6505172B2 (ja) * 2016-08-25 2019-04-24 エヌエイチエヌ エンターテインメント コーポレーションＮＨＮ Ｅｎｔｅｒｔａｉｎｍｅｎｔ Ｃｏｒｐｏｒａｔｉｏｎ 仮想ネットワーク環境で仮想スイッチを利用してロードバランシングを処理する方法およびシステム
JP6505171B2 (ja) * 2016-08-25 2019-04-24 エヌエイチエヌ エンターテインメント コーポレーションＮＨＮ Ｅｎｔｅｒｔａｉｎｍｅｎｔ Ｃｏｒｐｏｒａｔｉｏｎ 仮想ネットワーク環境でループバックインタフェースを利用してｄｓｒロードバランシングを処理する方法およびシステム
US10320895B2 (en) 2016-11-15 2019-06-11 Microsoft Technology Licensing, Llc Live migration of load balanced virtual machines via traffic bypass
US10305973B2 (en) 2017-01-09 2019-05-28 International Business Machines Corporation Distributed load-balancing for software defined networks
US11296984B2 (en) 2017-07-31 2022-04-05 Nicira, Inc. Use of hypervisor for active-active stateful network service cluster
US10951584B2 (en) 2017-07-31 2021-03-16 Nicira, Inc. Methods for active-active stateful network service cluster
US11570092B2 (en) * 2017-07-31 2023-01-31 Nicira, Inc. Methods for active-active stateful network service cluster
US11153122B2 (en) 2018-02-19 2021-10-19 Nicira, Inc. Providing stateful services deployed in redundant gateways connected to asymmetric network
US10880206B2 (en) * 2018-06-13 2020-12-29 Futurewei Technologies, Inc. Multipath selection system and method for datacenter-centric metro networks
US11102114B2 (en) 2018-12-28 2021-08-24 Alibaba Group Holding Limited Method, apparatus, and computer-readable storage medium for network optimization for accessing cloud service from on-premises network
CN111343093B (zh) * 2020-02-28 2021-07-09 腾讯科技（深圳）有限公司 业务数据的传输方法及装置
US11636059B2 (en) 2020-03-31 2023-04-25 Samsung Electronics Co., Ltd. Scaling performance in a storage server with storage devices
US11689455B2 (en) 2020-05-28 2023-06-27 Oracle International Corporation Loop prevention in virtual layer 2 networks
JP2023535149A (ja) 2020-07-14 2023-08-16 オラクル・インターナショナル・コーポレイション Ｖｌａｎスイッチングおよびルーティングサービスのためのシステムおよび方法
US20220210063A1 (en) 2020-12-30 2022-06-30 Oracle International Corporation Layer-2 networking information in a virtualized cloud environment
US11671355B2 (en) 2021-02-05 2023-06-06 Oracle International Corporation Packet flow control in a header of a packet
US11777897B2 (en) 2021-02-13 2023-10-03 Oracle International Corporation Cloud infrastructure resources for connecting a service provider private network to a customer private network
CN113422735B (zh) * 2021-06-22 2022-08-05 恒安嘉新（北京）科技股份公司 负载均衡配置方法、汇聚分流器及介质
CN115941455A (zh) * 2021-08-13 2023-04-07 华为技术有限公司 数据中心的云网络和运营商网络互通的方法和通信装置
US11799761B2 (en) 2022-01-07 2023-10-24 Vmware, Inc. Scaling edge services with minimal disruption

Family Cites Families (36)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6718387B1 (en) 1997-12-10 2004-04-06 Sun Microsystems, Inc. Reallocating address spaces of a plurality of servers using a load balancing policy and a multicast channel
US6801949B1 (en) * 1999-04-12 2004-10-05 Rainfinity, Inc. Distributed server cluster with graphical user interface
WO2002035359A2 (en) * 2000-10-26 2002-05-02 Prismedia Networks, Inc. Method and system for managing distributed content and related metadata
US7296268B2 (en) * 2000-12-18 2007-11-13 Microsoft Corporation Dynamic monitor and controller of availability of a load-balancing cluster
US7333482B2 (en) * 2000-12-22 2008-02-19 Interactive People Unplugged Ab Route optimization technique for mobile IP
US20020184368A1 (en) * 2001-04-06 2002-12-05 Yunsen Wang Network system, method and protocols for hierarchical service and content distribution via directory enabled network
US6999462B1 (en) * 2001-06-18 2006-02-14 Advanced Micro Devices, Inc. Mapping layer 2 LAN priorities to a virtual lane in an Infiniband™ network
US20030009559A1 (en) * 2001-07-09 2003-01-09 Naoya Ikeda Network system and method of distributing accesses to a plurality of server apparatus in the network system
WO2003009539A1 (fr) * 2001-07-10 2003-01-30 Fujitsu Limited Systeme de communication a terminal mobile et procede de communication
US7213065B2 (en) * 2001-11-08 2007-05-01 Racemi, Inc. System and method for dynamic server allocation and provisioning
US20030154236A1 (en) * 2002-01-22 2003-08-14 Shaul Dar Database Switch enabling a database area network
US7512702B1 (en) * 2002-03-19 2009-03-31 Cisco Technology, Inc. Method and apparatus providing highly scalable server load balancing
JP2003281109A (ja) * 2002-03-26 2003-10-03 Hitachi Ltd 負荷分散方法
US7007103B2 (en) 2002-04-30 2006-02-28 Microsoft Corporation Method to offload a network stack
US7636917B2 (en) * 2003-06-30 2009-12-22 Microsoft Corporation Network load balancing with host status information
US7590736B2 (en) * 2003-06-30 2009-09-15 Microsoft Corporation Flexible network load balancing
US7606929B2 (en) * 2003-06-30 2009-10-20 Microsoft Corporation Network load balancing with connection manipulation
US7289334B2 (en) 2003-08-27 2007-10-30 Epicenter, Inc. Rack architecture and management system
KR100962647B1 (ko) * 2003-10-27 2010-06-11 삼성전자주식회사 모바일 단말기의 이동성 지원 방법 및 그 시스템
EP1528744A1 (de) * 2003-10-30 2005-05-04 Hewlett-Packard Development Company, L.P. Lastausgleichsgerät und -verfahren
US7860095B2 (en) * 2003-10-30 2010-12-28 Hewlett-Packard Development Company, L.P. Method and apparatus for load-balancing
JP2005260594A (ja) * 2004-03-11 2005-09-22 Oki Techno Creation:Kk ネットワークシステム及び通信装置
US8255422B2 (en) * 2004-05-28 2012-08-28 Microsoft Corporation Highly reliable and scalable architecture for data centers
US8422500B2 (en) * 2004-07-02 2013-04-16 Rockstar Consortium Us Lp VLAN support of differentiated services
GB2418326B (en) 2004-09-17 2007-04-11 Hewlett Packard Development Co Network vitrualization
US20070002770A1 (en) * 2005-06-30 2007-01-04 Lucent Technologies Inc. Mechanism to load balance traffic in an ethernet network
JP4619943B2 (ja) * 2005-12-28 2011-01-26 富士通株式会社 パケット通信方法、パケット通信システム
US7660296B2 (en) * 2005-12-30 2010-02-09 Akamai Technologies, Inc. Reliable, high-throughput, high-performance transport and routing mechanism for arbitrary data flows
US8875135B2 (en) * 2006-04-17 2014-10-28 Cisco Systems, Inc. Assigning component operations of a task to multiple servers using orchestrated web service proxy
US8014308B2 (en) * 2006-09-28 2011-09-06 Microsoft Corporation Hardware architecture for cloud services
JP2008199348A (ja) * 2007-02-14 2008-08-28 Fujitsu Ltd 中継装置、中継プログラム及び通信システム
US8054840B2 (en) * 2007-06-12 2011-11-08 International Business Machines Corporation Data center virtual local area network system and method
US20090063706A1 (en) * 2007-08-30 2009-03-05 International Business Machines Corporation Combined Layer 2 Virtual MAC Address with Layer 3 IP Address Routing
JP4729549B2 (ja) * 2007-09-26 2011-07-20 日本電信電話株式会社 負荷制御方法及び装置及びプログラム
US8285789B2 (en) 2007-10-05 2012-10-09 Intel Corporation Flattened butterfly processor interconnect network
US9497039B2 (en) 2009-05-28 2016-11-15 Microsoft Technology Licensing, Llc Agile data center network architecture

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4030736A1 (de) * 2021-05-24 2022-07-20 Beijing Baidu Netcom Science And Technology Co., Ltd. Lastausgleichssystem, -verfahren und -vorrichtung, und speichermedium

Also Published As

Publication number Publication date
CN102449963B (zh) 2014-11-05
EP2436156A4 (de) 2013-09-11
US20100302940A1 (en) 2010-12-02
EP2436157B1 (de) 2016-03-30
CA2759957C (en) 2017-02-28
ES2614614T3 (es) 2017-06-01
KR101678711B1 (ko) 2016-11-22
CA2763032A1 (en) 2010-12-02
HK1175321A1 (zh) 2013-06-28
CN102449963A (zh) 2012-05-09
KR20120019462A (ko) 2012-03-06
WO2010138936A3 (en) 2011-03-03
CA2759957A1 (en) 2010-12-02
WO2010138937A2 (en) 2010-12-02
EP2436157A2 (de) 2012-04-04
CN102726021A (zh) 2012-10-10
JP5960050B2 (ja) 2016-08-02
US8416692B2 (en) 2013-04-09
CN102726021B (zh) 2016-07-06
EP2436156A2 (de) 2012-04-04
WO2010138936A2 (en) 2010-12-02
EP2436157A4 (de) 2012-04-04
WO2010138937A3 (en) 2011-03-03
JP2012528551A (ja) 2012-11-12

Similar Documents

Publication Publication Date Title
EP2436156B1 (de) Lastenausgleich zwischen schicht-2-domänen
JP7281531B2 (ja) ＳＲｖ６とＢＧＰを使用するマルチクラウド接続
Nordström et al. Serval: An {End-Host} stack for {Service-Centric} networking
US9979628B2 (en) Providing cloud-based services using dynamic network virtualization
JP6129928B2 (ja) アジャイルデータセンタネットワークアーキテクチャ
Mann et al. CrossRoads: Seamless VM mobility across data centers through software defined networking
EP2652924B1 (de) Statussynchronisierung zwischen lastenausgleichskomponenten
JP6393742B2 (ja) 分散型ロード・バランサでの多重パス経路指定
EP2817926B1 (de) Delegierte weiterleitung und adressenauflösung in einem fragmentierten netzwerk
US8543718B2 (en) Technique for efficiently and dynamically maintaining bidirectional forwarding detection on a bundle of links
CN109937401B (zh) 经由业务旁路进行的负载均衡虚拟机的实时迁移
EP2845372B1 (de) Zwei ebenen paketvermittlung durch zustandsunabhängige erste ebene paketvermittlung an eine servergruppe und zustandsabhängige zweite ebene paketvermittlung an einen server in einer gruppe
US8676980B2 (en) Distributed load balancer in a virtual machine environment
US8218561B2 (en) Flow redirection employing state information
US10673736B2 (en) Traffic reduction in data center fabrics
US20150189009A1 (en) Distributed multi-level stateless load balancing
US9712649B2 (en) CCN fragmentation gateway
EP2705645A1 (de) Nachbarschaftserkennung auf namensbasis und multi-hop-diensterkennung in informationszentrierten netzwerken
US10412159B1 (en) Direct load balancing using a multipath protocol
JP2016515790A (ja) 分散型ロードバランサでの接続公開
US10880380B2 (en) Synchronization of routing information in an edge system cluster
US9509600B1 (en) Methods for providing per-connection routing in a virtual environment and devices thereof
US9246804B1 (en) Network routing
Barré et al. Implementation and evaluation of the Shim6 protocol in the Linux kernel
Noghani et al. EVPN/SDN assisted live VM migration between geo-distributed data centers

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20111027

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20130812

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/707 20130101ALN20130806BHEP

Ipc: H04L 12/715 20130101AFI20130806BHEP

Ipc: H04L 12/46 20060101ALI20130806BHEP

Ipc: H04L 29/08 20060101ALI20130806BHEP

Ipc: H04L 29/12 20060101ALI20130806BHEP

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC

17Q First examination report despatched

Effective date: 20150923

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602010037884

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012560000

Ipc: H04L0012715000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/707 20130101ALN20160503BHEP

Ipc: H04L 12/715 20130101AFI20160503BHEP

Ipc: H04L 12/46 20060101ALI20160503BHEP

Ipc: H04L 29/12 20060101ALI20160503BHEP

Ipc: H04L 29/08 20060101ALI20160503BHEP

INTG Intention to grant announced

Effective date: 20160520

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 844816

Country of ref document: AT

Kind code of ref document: T

Effective date: 20161115

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602010037884

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

REG Reference to a national code

Ref country code: SE

Ref legal event code: TRGR

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 8

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 844816

Country of ref document: AT

Kind code of ref document: T

Effective date: 20161109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170210

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170209

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170309

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170309

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2614614

Country of ref document: ES

Kind code of ref document: T3

Effective date: 20170601

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602010037884

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170531

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20170209

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: BE

Payment date: 20170413

Year of fee payment: 8

Ref country code: IT

Payment date: 20170522

Year of fee payment: 8

Ref country code: SE

Payment date: 20170511

Year of fee payment: 8

Ref country code: ES

Payment date: 20170602

Year of fee payment: 8

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20170810

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170531

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170528

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170528

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20170528

REG Reference to a national code

Ref country code: SE

Ref legal event code: EUG

REG Reference to a national code

Ref country code: BE

Ref legal event code: FP

Effective date: 20170201

Ref country code: BE

Ref legal event code: MM

Effective date: 20180531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CZ

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180528

Ref country code: SE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180529

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180528

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180531

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20100528

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20190913

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20180529

Ref country code: CY

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20161109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602010037884

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20161109

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602010037884

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012715000

Ipc: H04L0045640000

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230501

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20230419

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230420

Year of fee payment: 14

Ref country code: DE

Payment date: 20230419

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230420

Year of fee payment: 14