Abstract: Crystals of the compound represented by formula (1), a method for the production thereof, and a method for producing an antibody-drug conjugate using the crystals.

Abstract: Handling of multiple connections during NAT traversal for a node behind a symmetric NAT is disclosed. The likelihood of connection failure during symmetric NAT traversal may be reduced by serializing critical time windows after port prediction. Once a connection request has been sent for a first connection, port prediction for a subsequent connection may be delayed until a connectivity check has begun for the first connection. This process may be repeated to handle NAT traversal for multiple simultaneous connections to different nodes.

Abstract: A peer node coupled to a plurality of other peer nodes in an overlay network may process a broadcast message from an upstream peer node containing a plurality of packets by identifying packet missing from the message, identifying an upstream node to which the peer node has an existing inbound connection and which has the missing packet, and obtaining the missing packet from the upstream node. A message from an upstream node may be processed by buffering a subset of the packets of the message in a buffer for a finite period of time before and after the peer node consumes the packets and by identifying one or more of the buffered packets to one or more finger nodes.

Abstract: The distribution of content over a peer to peer (P2P) network can be improved by utilizing at least one broadcast of the content in order to quickly seed the P2P network. When content is first to be distributed across the network, a broadcast can be scheduled that each peer device with broadcast receiving capability and within range of the broadcast is able to receive. As soon as a peer device receives at least a portion of the broadcast content, that peer can begin redistributing the content across the P2P network. Any errors or missing portions of the received broadcast content can be corrected by requesting a copy of the missing or incorrect portion from another peer on the P2P network.

Abstract: Example implementations are directed to the facilitation of UDP load balancing even in implementations that involve load balancers that support only TCP. In example implementations, the application can control the session lifetime through the accompanying TCP connection. Thus, example implementations can make use of any load balancer that supports only TCP.

Abstract: The distribution of content over a peer to peer (P2P) network can be improved by utilizing at least one broadcast of the content in order to quickly seed the P2P network. When content is first to be distributed across the network, a broadcast can be scheduled that each peer device with broadcast receiving capability and within range of the broadcast is able to receive. As soon as a peer device receives at least a portion of the broadcast content, that peer can begin redistributing the content across the P2P network. Any errors or missing portions of the received broadcast content can be corrected by requesting a copy of the missing or incorrect portion from another peer on the P2P network.

Abstract: The distribution of content over a peer to peer (P2P) network can be improved by utilizing at least one broadcast of the content in order to quickly seed the P2P network. When content is first to be distributed across the network, a broadcast can be scheduled that each peer device with broadcast receiving capability and within range of the broadcast is able to receive. As soon as a peer device receives at least a portion of the broadcast content, that peer can begin redistributing the content across the P2P network. Any errors or missing portions of the received broadcast content can be corrected by requesting a copy of the missing or incorrect portion from another peer on the P2P network.

Abstract: Example implementations are directed to the facilitation of UDP load balancing even in implementations that involve load balancers that support only TCP. In example implementations, the application can control the session lifetime through the accompanying TCP connection. Thus, example implementations can make use of any load balancer that supports only TCP.

Abstract: A peer node coupled to a plurality of other peer nodes in an overlay network may process a broadcast message from an upstream peer node containing a plurality of packets by identifying packet missing from the message, identifying an upstream node to which the peer node has an existing inbound connection and which has the missing packet, and obtaining the missing packet from the upstream node. A message from an upstream node may be processed by buffering a subset of the packets of the message in a buffer for a finite period of time before and after the peer node consumes the packets and by identifying one or more of the buffered packets to one or more finger nodes.

Abstract: A broadcast message may be initiated or received at a peer node. The node obtains an uplink bandwidth available for broadcasting the message over the network and a number of copies that can be broadcast based on the available bandwidth. The node determines a range of key values for finger nodes that should receive copies of the broadcast message from a finger table. The finger table entries include references to finger nodes and key values associated with the finger nodes. The node determines which other nodes should receive copies of the broadcast message from range of key values and the number of copies. The node also determines an End ID for each recipient node. A copy of the broadcast message and corresponding End ID is sent to a finger node if the finger node's key value is within a range of key values specified by the End ID.

Abstract: Handling of multiple connections during NAT traversal for a node behind a symmetric NAT is disclosed. The likelihood of connection failure during symmetric NAT traversal may be reduced by serializing critical time windows after port prediction. Once a connection request has been sent for a first connection, port prediction for a subsequent connection may be delayed until a connectivity check has begun for the first connection. This process may be repeated to handle NAT traversal for multiple simultaneous connections to different nodes.

Abstract: Prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels. Ready data for each channel may be transmitted over a network path up to the size of the reserved portion for that channel and not greater than a path maximum transmission unit (MTU) size for a network path. This abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: Handling of multiple connections during NAT traversal for a node behind a symmetric NAT is disclosed. The likelihood of connection failure during symmetric NAT traversal may be reduced by serializing critical time windows after port prediction. Once a connection request has been sent for a first connection, port prediction for a subsequent connection may be delayed until a connectivity check has begun for the first connection. This process may be repeated to handle NAT traversal for multiple simultaneous connections to different nodes.

Abstract: Broadcast messages are efficiently directed to nodes of an overlay network. Broadcast messages include an End ID parameter specifying the range of key values for nodes that should receive the broadcast message. Each node of an overlay network maintains a list of finger nodes and their respective key values. Upon receiving a broadcast message, a node assigns a finger node a new End ID value based upon the End ID value of the broadcast message or the key value of an adjacent finger node. The node compares a finger node's new End ID value with the finger node's key value to determine whether to forward the broadcast message to that finger node. A broadcast message forwarded to a finger node includes an End ID parameter equal to the new End ID value determined for the finger node. Nodes can aggregate response messages from its finger nodes.

Abstract: A broadcast message may be initiated or received at a peer node. The node obtains an uplink bandwidth available for broadcasting the message over the network and a number of copies that can be broadcast based on the available bandwidth. The node determines a range of key values for finger nodes that should receive copies of the broadcast message from a finger table. The finger table entries include references to finger nodes and key values associated with the finger nodes. The node determines which other nodes should receive copies of the broadcast message from range of key values and the number of copies. The node also determines an End ID for each recipient node. A copy of the broadcast message and corresponding End ID is sent to a finger node if the finger node's key value is within a range of key values specified by the End ID.

Abstract: Traversal of a Network Address Translator (NAT) can be facilitated for a mobile device configured to communicate with one or more other devices over a network via one or more wireless access points. A direction of travel can be estimated for the mobile device. One or more wireless access points the mobile device is likely to encounter can be predicted using the estimated direction of travel. Information regarding behavior of one or more NATs associated with the predicted wireless access point(s) can be predicted. Such information can be stored in such a way that the information is retrievable by one or more other devices or using the information to traverse one or more of the NATs. Alternatively, information can be retrieved regarding behavior of one or more NATs associated with the predicted wireless access points. This information can be used to traverse one or more of the NATs.

Abstract: A broadcast message may be initiated or received at a peer node. The node obtains an uplink bandwidth available for broadcasting the message over the network and a number of copies that can be broadcast based on the available bandwidth. The node determines a range of key values for finger nodes that should receive copies of the broadcast message from a finger table. The finger table entries include references to finger nodes and key values associated with the finger nodes. The node determines which other nodes should receive copies of the broadcast message from range of key values and the number of copies. The node also determines an End ID for each recipient node. A copy of the broadcast message and corresponding End ID is sent to a finger node if the finger node's key value is within a range of key values specified by the End ID.

Abstract: Prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels. Ready data for each channel may be transmitted over a network path up to the size of the reserved portion for that channel and not greater than a path maximum transmission unit (MTU) size for a network path. This abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: Disclosed are systems and methods for peer-to-peer communication over a network between a first node behind a first network address translator (NAT) and a second node behind a second NAT, despite the first NAT and the second NAT intervening between the first and second nodes. The first NAT is a Symmetric NAT. A port prediction is performed wherein the first node constructs a list of predicted transport addresses on the first NAT. A message containing the list of predicted transport addresses is sent from the first node to the second node. A connectivity check is performed with the second node using the predicted transport addresses.

Abstract: Traversal of a Network Address Translator (NAT) can be facilitated for a mobile device configured to communicate with one or more other devices over a network via one or more wireless access points. A direction of travel can be estimated for the mobile device. One or more wireless access points the mobile device is likely to encounter can be predicted using the an estimated direction of travel for the mobile device. Information regarding behavior of one or more NATs associated with the predicted wireless access point(s) can be predicted. Such information can be stored in such a way that the information is retrievable by one or more other devices or using the information to traverse one or more of the NATs. Alternatively, information can be retrieved regarding behavior of one or more NATs associated with the predicted wireless access points. This information can be used to traverse one or more of the NATs.