In general, embodiments of the present invention provide systems, methods and computer readable media for a universal relevance service framework for ranking and personalizing items.

In general, embodiments of the present invention provide systems, methods and computer readable media for a universal relevance service framework for ranking and personalizing items.

An apparatus and a method for managing network flow congestion are provided. The method for managing network flow congestion includes: receiving a plurality of packets; identifying whether each packet belongs to a predetermined protocol; distinguishing a plurality of connections of the packets belonged to the predetermined protocol; monitoring a buffer usage of each different connections; and performing a congestion check procedure on the currently monitored connection. In the congestion check procedure, when the buffer usage of the currently monitored connection exceeds a threshold, a congestion processing procedure is triggered.

Described is a method for estimating throughput between first and second communication devices, the method comprising: determining maximum bottleneck throughput of a communication link between the first communication device and a third communication device, wherein the communication link between the first and third communication devices applies a common access network as between a communication link between the first and second communication devices; determining Round Trip Time (RTT) between the first and second communication devices; transmitting packet by applying User Datagram Protocol (UDP) from the third communication device to the first communication device; measuring packet loss rate associated with the transmitted packet by monitoring sequence number of the packet; and translating measured packet loss rate to Transmission Control Protocol (TCP) throughput according to maximum bottleneck throughput and RTT.

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

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

A system transports a plurality of UDP datagrams from a sending application to a receiving application by creating a TCP tunnel between a TCP sending-end and a TCP receiving-end, encapsulating the datagrams in TCP packets at the TCP transmitting-end, transmitting the TCP packets via the TCP tunnel to the TCP receiving-end over a network using a TCP/IP protocol, and extracting the datagrams from the TCP packet and forwarding the extracted datagrams to the receiving application. The TCP tunnel may provide the same delay and responsiveness as UDP protocol. The TCP receiving-end may detect when a packet is missing and request retransmission when a packet is missing, so that the TCP sending-end retransmits the missing packets. The transmitting of TCP packets to the TCP receiving-end continues when the receiving-end detects a missing packet, so that there is no lag in the forwarding of the extracted datagrams. Retransmitted packets may be discarded.

A method includes determining a delivery performance of a data flow being transmitted from a first network equipment to a second network equipment over a network; determining whether the network is congested based on the determined delivery performance of the data flow being transmitted to the second network equipment; and pacing delivery of the data flow to the second network equipment by reducing a rate at which the data flow is delivered to the second network equipment when the network is determined to be congested.

A method includes determining a delivery performance of a data flow being transmitted from a first network equipment to a second network equipment over a network; determining whether the network is congested based on the determined delivery performance of the data flow being transmitted to the second network equipment; and pacing delivery of the data flow to the second network equipment by reducing a rate at which the data flow is delivered to the second network equipment when the network is determined to be congested.

The present disclosure relates to network security software cooperatively configured on plural nodes to authenticate and authorize devices, applications, users, and data protocol in network communications by exchanging nonpublic identification codes, application identifiers, and data type identifiers via pre-established communication pathways and comparing against pre-established values to provide authorized communication and prevent compromised nodes from spreading malware to other nodes.