Abstract: Various embodiments of the present technology generally relate to systems and methods for intelligent load shedding. More specifically, various embodiments of the present technology generally relate to intelligent load shedding of traffic based on current load state of target capacity. In some embodiments, a first server can send a capacity request indicating that the first server is nearing capacity and needs assistance with load. In response to the capacity request, an assistance request can be published to additional nearby servers. The servers can respond with a status update providing load and availability information. Based on the load and availability information (or other information such as latency), a second server from the additional servers can be selected and traffic can be routed away from the first server to the second server.

Abstract: Various embodiments of the present technology generally relate to systems and methods for intelligent load shedding. More specifically, various embodiments of the present technology generally relate to intelligent load shedding of traffic based on current load state of target capacity. In some embodiments, a domain name resolution request to translate a domain name into an Internet protocol (IP) address can be received at DNS server. A status of each of multiple scaling units mapped to the domain name can be determined. A set of IP addresses (e.g., four IP addresses) corresponding to a subset of the multiple scaling units closest to the requesting device with statuses indicating availability for new traffic can be identified. Then, the set of IP addresses can be sent to the requesting device. The requesting device can the select which IP address to use (e.g., randomly) to route the traffic.

Abstract: Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

Abstract: Various embodiments of the present technology generally relate to systems and methods for intelligent traffic management and routing. More specifically, various embodiments of the present technology generally relate to intelligent traffic management of cloud-based services based on predicted traffic and current load capacity of servers or scaling units. In some embodiments, traffic associated with one or more subnets can be monitored. Then using a record of historical traffic patterns and current traffic patterns, a prediction of future traffic can be generated. The predication can then be translated into an estimated load for one or more scaling units or servers. The current status of the one or more scaling units capable of handling traffic can be determined and future traffic can be routed based on the prediction generated and the status of the one or more scaling units.

Abstract: Various embodiments of the present technology generally relate to systems and methods for intelligent load shedding. More specifically, various embodiments of the present technology generally relate to intelligent load shedding of traffic based on current load state of target capacity. In some embodiments, a domain name resolution request to translate a domain name into an Internet protocol (IP) address can be received at DNS server. A status of each of multiple scaling units mapped to the domain name can be determined. A set of IP addresses (e.g., four IP addresses) corresponding to a subset of the multiple scaling units closest to the requesting device with statuses indicating availability for new traffic can be identified. Then, the set of IP addresses can be sent to the requesting device. The requesting device can the select which IP address to use (e.g., randomly) to route the traffic.

Abstract: Various embodiments of the present technology generally relate to systems and methods for intelligent load shedding. More specifically, various embodiments of the present technology generally relate to intelligent load shedding of traffic based on current load state of target capacity. In some embodiments, a first server can send a capacity request indicating that the first server is nearing capacity and needs assistance with load. In response to the capacity request, an assistance request can be published to additional nearby servers. The servers can respond with a status update providing load and availability information. Based on the load and availability information (or other information such as latency), a second server from the additional servers can be selected and traffic can be routed away from the first server to the second server.

Abstract: Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

Abstract: Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

Abstract: Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

Abstract: Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

Abstract: Architecture for efficiently ensuring that data is stored to the desired destination datastore such as for replication processes. A copy of data (e.g., messages) sent to a datastore for storage is stored at an alternate location until a received signal indicates that the storage and replication was successful. As soon as the feedback signal is received, the copy is removed from the alternate location, and hence, improves input/output (I/O) and storage patterns. The feedback mechanism can also be used for monitoring the status of data transport associated with log shipping, for example, and taking the appropriate actions when storage (e.g., replication) is not being performed properly.

Abstract: Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.

Abstract: A system provides high availability electronic message forwarding. When an electronic message is communicated to a first server, a copy of the electronic message is maintained at a second server. The electronic message is maintained on both servers until the electronic message is successfully communicated to a third server. After the message is delivered to the third server, the electronic message is removed from both the first server and the second server. If the first server fails to communicate the electronic message to the third server, the second server does so.

Abstract: A system provides high availability electronic message forwarding. When an electronic message is communicated to a first server, a copy of the electronic message is maintained at a second server. The electronic message is maintained on both servers until the electronic message is successfully communicated to a third server. After the message is delivered to the third server, the electronic message is removed from both the first server and the second server. If the first server fails to communicate the electronic message to the third server, the second server does so.

Abstract: A status of connectivity between servers of different sites (locations) is used to infer whether a network or a server failure has occurred such that data between the servers can be routed more efficiently reducing unnecessary network traffic due to duplicate messages. Servers may be grouped based on location or other characteristics and connectivity status determined based on the communication status of individual servers and their respective groups.

Abstract: A status of connectivity between servers of different sites (locations) is used to infer whether a network or a server failure has occurred such that data between the servers can be routed more efficiently reducing unnecessary network traffic due to duplicate messages. Servers may be grouped based on location or other characteristics and connectivity status determined based on the communication status of individual servers and their respective groups.

Abstract: Architecture for efficiently ensuring that data is stored to the desired destination datastore such as for replication processes. A copy of data (e.g., messages) sent to a datastore for storage is stored at an alternate location until a received signal indicates that the storage and replication was successful. As soon as the feedback signal is received, the copy is removed from the alternate location, and hence, improves input/output (I/O) and storage patterns. The feedback mechanism can also be used for monitoring the status of data transport associated with log shipping, for example, and taking the appropriate actions when storage (e.g., replication) is not being performed properly.

Abstract: A system provides high availability electronic message forwarding. When an electronic message is communicated to a first server, a copy of the electronic message is maintained at a second server. The electronic message is maintained on both servers until the electronic message is successfully communicated to a third server. After the message is delivered to the third server, the electronic message is removed from both the first server and the second server. If the first server fails to communicate the electronic message to the third server, the second server does so.