Abstract: The present disclosure relates to methods and systems for providing performance aware MUX selection for traffic in layer-4 load balancing. The methods and systems assign a subset of VIP ranges (VIP shards) to a subset of MUXes based on capacity of the MUXes. The methods and systems allow sources (end-hosts) in the same datacenter (DC) to select the MUXes for intra-DC traffic. The methods and systems allow the sources to use weights calculated by a controller for splitting the traffic across MUXes based on an end-to-end latency of the MUXes. The methods and systems allow the sources to know the MUXes handling the traffic by using packet modification and allow the MUXes to route the packets to reach specific MUXes.

Abstract: The present disclosure relates to methods and systems for reducing access control lists (ACLs). The methods and systems combine multiple allowed internet protocol (IP) addresses from the ACLs to a single or small number of IP prefixes. The methods and systems calculate a minimum of the bit changes in transforming the IP addresses from one to another. Using the information for the minimum bit changes in transforming the IP addresses from one to another, the methods and systems build a graph of IP addresses, where the nodes are the IP addresses, and the edges denote that the IP addresses are transformed from one to another using the minimum number of bit changes. The methods and systems recursively merge the nodes to reduce the ACL rules into a compressed ACL rule graph. The methods and systems generate a reduced set of ACL rules using the compressed ACL rule graph.

Abstract: Some embodiments provide a method of implementing capacity-aware load balancing across a set of data compute nodes (DCNs) by reducing latency for the set of DCNs. From the set of DCNs, the method identifies (1) a first subset of DCNs including DCNs that have a latency that is higher than an average latency computed for the set of DCNs and (2) a second subset of DCNs including DCNs that have a latency that is lower than the average latency computed for the set of DCNs. For each DCN in the first subset of DCNs, the method assigns to the DCN a weight value that corresponds to a target latency computed for the set of DCNs. Based on the assigned weight values for the first subset of DCNs, the method computes an excess weight value to be redistributed across the second subset of DCNs. The method redistributes the computed excess weight value across the second subset of DCNs.

Abstract: The present disclosure relates to methods and systems for load balancing traffic per the capacities of direct IPs (DIPs). The methods and systems use latency measurements from each DIP to determine the capacity of each DIP. The methods and systems use the latency measurements to determine the weights for each DIP using an Integer Linear Program (ILP). The weights identify an amount of traffic to provide to each DIP. The methods and systems provide the weights for each DIP to a load balancer controller to program the load balancer dataplane with the weights.

Abstract: The present disclosure relates to methods and systems for reducing access control lists (ACLs). The methods and systems combine multiple allowed internet protocol (IP) addresses from the ACLs to a single or small number of IP prefixes. The methods and systems calculate a minimum of the bit changes in transforming the IP addresses from one to another. Using the information for the minimum bit changes in transforming the IP addresses from one to another, the methods and systems build a graph of IP addresses, where the nodes are the IP addresses, and the edges denote that the IP addresses are transformed from one to another using the minimum number of bit changes. The methods and systems recursively merge the nodes to reduce the ACL rules into a compressed ACL rule graph. The methods and systems generate a reduced set of ACL rules using the compressed ACL rule graph.

Abstract: The present invention provides, among other things, methods of treating pruritic or inflammatory skin diseases or in disorders, or pruritus associated with a disease or disorder, with an anti-OSMR? antibody, including methods of treating pruritus, in associated with atopic dermatitis, chronic kidney disease-associated pruritus, uremic pruritus or prurigo nodularis, chronic idiopathic pruritus, chronic idiopathic urticaria, chronic spontaneous urticaria, cutaneous amyloidosis, lichen simplex chronicus, plaque psoriasis, lichens planus, inflammatory ichthyosis, mastocytosis and bullous pemphigoid, comprising a step of administering to a subject in need of treatment an anti-OSMR? antibody at a therapeutically effective dose and an administration interval for a treatment period sufficient to improve, stabilize or reduce one or more symptoms of the disease or disorder relative to a control.

Abstract: Some embodiments provide a novel method for assessing the suitability of network links for connecting compute nodes located at different geographic sites. The method of some embodiments identifies and analyzes sample packets from a set of flows exchanged between first and second compute sites that are connected through a first network link in order to identify attributes of the sampled packets. The method also computes attributes of predicted packets between the identified samples in order to identify attributes of each flow in the set of flows. The method then uses the identified and computed attributes of each flow in the set of flows to emulate the set of flows passing between the two compute sites through the second network link in order to assess whether a second network link should be used for future flows (e.g., future flows exchanged between the first and second compute sites).

Abstract: Some embodiments provide a method of implementing capacity-aware load balancing across a set of data compute nodes (DCNs) by reducing latency for the set of DCNs. From the set of DCNs, the method identifies (1) a first subset of DCNs including DCNs that have a latency that is higher than an average latency computed for the set of DCNs and (2) a second subset of DCNs including DCNs that have a latency that is lower than the average latency computed for the set of DCNs. For each DCN in the first subset of DCNs, the method assigns to the DCN a weight value that corresponds to a target latency computed for the set of DCNs. Based on the assigned weight values for the first subset of DCNs, the method computes an excess weight value to be redistributed across the second subset of DCNs. The method redistributes the computed excess weight value across the second subset of DCNs.

Abstract: A method for alleviating flow congestion at forwarding elements is provided. The method receives traffic related data from a plurality of forwarding elements of a network, and based on the traffic related data, determines congestion at a first forwarding element of the plurality of forwarding elements caused by at least one flow passing through the first forwarding element at a first rate. The method calculates, based on a burst size of the at least one flow, a second rate for the at least one flow such that when the at least one flow passes through the first forwarding element at the second rate the congestion at the first forwarding element is alleviated. The method rate limits the at least one flow by passing the at least one flow through a flow rate manager at the calculated second rate before transmitting the at least one flow to the first forwarding element.

Abstract: The present application relates to egressing traffic from an online service provider (OSP). A network system may determine routes for flows and rates for each flow in a coordinated manner based on end-to-end performance metrics for the flows. The network system includes a central controller configured to: receive end-to-end performance information and current rate information for traffic flows, each flow being from a source within the network system to an external destination, and calculate new rate information for the traffic flows. An aggregate rate for end-to-end flows remains constant from the current rate information to the new rate information. The network system includes at least one datacenter controller configured to assign routes for new traffic flows based on the end-to-end performance information of the traffic flows. The network system includes a plurality of end-hosts configured to enforce the new rate information for the traffic flows on the assigned routes.

Abstract: The present disclosure relates to methods and systems for reducing access control lists (ACLs). The methods and systems combine multiple allowed internet protocol (IP) addresses from the ACLs to a single or small number of IP prefixes. The methods and systems calculate a minimum of the bit changes in transforming the IP addresses from one to another. Using the information for the minimum bit changes in transforming the IP addresses from one to another, the methods and systems build a graph of IP addresses, where the nodes are the IP addresses, and the edges denote that the IP addresses are transformed from one to another using the minimum number of bit changes. The methods and systems recursively merge the nodes to reduce the ACL rules into a compressed ACL rule graph. The methods and systems generate a reduced set of ACL rules using the compressed ACL rule graph.

Abstract: A method for creating a flow profile is provided. The method identifies a first plurality of flow measurements, each of which corresponding to one of a plurality of flows exchanged between a computing entity and a service during a first time period. The method, for each of a first plurality of buckets each of which has a pair of lower and upper bounds, increments a counter of the corresponding bucket for each of the plurality of flow measurements that falls within the pair of bounds of that bucket. The method generates a second plurality of buckets by merging and splitting at least some of the first plurality of buckets, identifies a second plurality of flow measurements for the computing entity during a second time period, and distributes these measurements into the second plurality of buckets. The method generate the flow profile by aggregating the first and second pluralities of buckets.

Abstract: Some embodiments provide a method of implementing capacity-aware load balancing across a set of data compute nodes (DCNs) by reducing latency for the set of DCNs. From the set of DCNs, the method identifies (1) a first subset of DCNs including DCNs that have a latency that is higher than an average latency computed for the set of DCNs and (2) a second subset of DCNs including DCNs that have a latency that is lower than the average latency computed for the set of DCNs. For each DCN in the first subset of DCNs, the method assigns to the DCN a weight value that corresponds to a target latency computed for the set of DCNs. Based on the assigned weight values for the first subset of DCNs, the method computes an excess weight value to be redistributed across the second subset of DCNs. The method redistributes the computed excess weight value across the second subset of DCNs.

Abstract: The present application relates to egressing traffic from an online service provider (OSP). A network system may determine routes for flows and rates for each flow in a coordinated manner based on end-to-end performance metrics for the flows. The network system includes a central controller configured to: receive end-to-end performance information and current rate information for traffic flows, each flow being from a source within the network system to an external destination, and calculate new rate information for the traffic flows. An aggregate rate for end-to-end flows remains constant from the current rate information to the new rate information. The network system includes at least one datacenter controller configured to assign routes for new traffic flows based on the end-to-end performance information of the traffic flows. The network system includes a plurality of end-hosts configured to enforce the new rate information for the traffic flows on the assigned routes.

Abstract: A method for alleviating flow congestion at forwarding elements is provided. The method receives traffic related data from a plurality of forwarding elements of a network, and based on the traffic related data, determines congestion at a first forwarding element of the plurality of forwarding elements caused by at least one flow passing through the first forwarding element at a first rate. The method calculates, based on a burst size of the at least one flow, a second rate for the at least one flow such that when the at least one flow passes through the first forwarding element at the second rate the congestion at the first forwarding element is alleviated. The method rate limits the at least one flow by passing the at least one flow through a flow rate manager at the calculated second rate before transmitting the at least one flow to the first forwarding element.

Abstract: Some embodiments provide a novel method for assessing the suitability of network links for connecting compute nodes located at different geographic sites. The method of some embodiments identifies and analyzes sample packets from a set of flows exchanged between first and second compute sites that are connected through a first network link in order to identify attributes of the sampled packets. The method also computes attributes of predicted packets between the identified samples in order to identify attributes of each flow in the set of flows. The method then uses the identified and computed attributes of each flow in the set of flows to emulate the set of flows passing between the two compute sites through the second network link in order to assess whether a second network link should be used for future flows (e.g., future flows exchanged between the first and second compute sites).

Abstract: A method for alleviating flow congestion at forwarding elements is provided. The method receives traffic related data from a plurality of forwarding elements of a network, and based on the traffic related data, determines congestion at a first forwarding element of the plurality of forwarding elements caused by at least one flow passing through the first forwarding element at a first rate. The method calculates, based on a burst size of the at least one flow, a second rate for the at least one flow such that when the at least one flow passes through the first forwarding element at the second rate the congestion at the first forwarding element is alleviated. The method rate limits the at least one flow by passing the at least one flow through a flow rate manager at the calculated second rate before transmitting the at least one flow to the first forwarding element.

Abstract: Some embodiments provide a novel method for assessing the suitability of network links for connecting compute nodes located at different geographic sites. The method of some embodiments identifies and analyzes sample packets from a set of flows exchanged between first and second compute sites that are connected through a first network link in order to identify attributes of the sampled packets. The method also computes attributes of predicted packets between the identified samples in order to identify attributes of each flow in the set of flows. The method then uses the identified and computed attributes of each flow in the set of flows to emulate the set of flows passing between the two compute sites through the second network link in order to assess whether a second network link should be used for future flows (e.g., future flows exchanged between the first and second compute sites).

Abstract: Some embodiments provide a novel method for assessing the suitability of network links for connecting compute nodes located at different geographic sites. The method of some embodiments identifies and analyzes sample packets from a set of flows exchanged between first and second compute sites that are connected through a first network link in order to identify attributes of the sampled packets. The method also computes attributes of predicted packets between the identified samples in order to identify attributes of each flow in the set of flows. The method then uses the identified and computed attributes of each flow in the set of flows to emulate the set of flows passing between the two compute sites through the second network link in order to assess whether a second network link should be used for future flows (e.g., future flows exchanged between the first and second compute sites).

Abstract: A method for creating a flow profile is provided. The method identifies a first plurality of flow measurements, each of which corresponding to one of a plurality of flows exchanged between a computing entity and a service during a first time period. The method, for each of a first plurality of buckets each of which has a pair of lower and upper bounds, increments a counter of the corresponding bucket for each of the plurality of flow measurements that falls within the pair of bounds of that bucket. The method generates a second plurality of buckets by merging and splitting at least some of the first plurality of buckets, identifies a second plurality of flow measurements for the computing entity during a second time period, and distributes these measurements into the second plurality of buckets. The method generate the flow profile by aggregating the first and second pluralities of buckets.