A network routing table includes destination addresses of destination applications hosted on peer nodes of a network. A primary processor registers a first destination application and a second destination application, where the first destination application is the same as the second destination application and both the first destination application and the second destination application have the same destination address. That processor also provides the peer nodes and a secondary processor with a copy of the table. When the first destination application is inactivated, all peer nodes and the secondary processor are provided with a copy of an updated routing table indicating inactivation of the first destination application and routing of the application message to the second destination application. A further application message addressed from any of the peer nodes to the destination address associated with the inactivated first destination application will be routed, via the updated routing table, to the second destination application having the same destination address as the inactivated first destination application. The secondary processor provides the copy of the routing table and the copy of the updated routing table in case of failure of the primary processor in response to a request from the querying peer node.

Systems and methods of the present invention for maintaining network data distribution are provided. Network data may be distributed in such as manner as to allow a network session to weather interrupted communications between host and clients without significant loss of data. Embodiments of the present invention provide for one or more clients to serve as backup host(s) for the network session. When the other clients transmit data to the host, they may also transmit the data to one or more backup hosts if there are any indications of interrupted communication.

A scheduling method includes: a server receiving a first request of a first peer (P2P) node; the first request containing service content; using position information on different network hierarchies of the first P2P node and the service content to determine at least one candidate P2P node for the first P2P node; the at least one candidate P2P node can provide a service for the first P2P node; the position information being position information generated on the basis of a network topology structure; using the at least one candidate P2P node to generate a candidate P2P node information list; P2P node information in the information list representing a transmission distance between the at least one candidate P2P node and the first P2P node; and returning the information list to the first P2P node. Further disclosed at the same time are a server, a first P2P node and a computer-readable storage medium.

A method, computer system, and a computer program product for deploying a plurality of microservices across a service infrastructure having a plurality of resources is provided. The present invention may include determining at least one dependency of the plurality of microservices. The present invention may include for each resource of the plurality of resources, determining an outage distribution descriptive of an availability of the resource with respect to time. The present invention may include based on the outage distribution associated with each resource and the at least one dependency of the plurality of microservices, determining a deployment configuration of the plurality of microservices across the resources of the service infrastructure.

The predictive overlay network architecture of the present invention improves the performance of applications distributing digital content among nodes of an underlying network such as the Internet by establishing and reconfiguring overlay network topologies over which associated content items are distributed. The present invention addresses not only frequently changing network congestion, but also interdependencies among nodes and links of prospective overlay network topologies. The present invention provides a prediction engine that monitors metrics and predicts the relay capacity of individual nodes and links (as well as demand of destination nodes) over time to reflect the extent to which the relaying of content among the nodes of an overlay network will be impacted by (current or future) underlying network congestion. The present invention further provides a topology selector that addresses node and link interdependencies while redistributing excess capacity to determine an overlay network topology that satisfies application-specific performance criteria.

Systems, computer program products, and methods are described herein for triggering resource channel mapping for dynamic authentication. The present invention is configured to receive, from a user input device, a request from a user to access resources via a first resource channel; retrieve information associated with the user; query a resource channel repository using the information associated with the user; retrieve, from the resource channel repository, information associated with a second resource channel based on at least the query, wherein the second resource channel is associated with the user; in response, automatically trigger a resource channel mapping engine; map, using the resource channel mapping engine, the second resource channel and the first resource channel; and in response, authorize the request to access the resources via the first resource channel.

The Distributed Software Defined Network (dSDN) disclosed herein is an end-to-end architecture that enables secure and flexible programmability across a network with full lifecycle management of services and infrastructure applications (fxDeviceApp). The dSDN also harmonizes application deployment across the network independent of the hardware vendor. As a result, the dSDN simplifies the network deployment lifecycle from concept to design to implementation to decommissioning.

A method for repairing multicast/broadcast content via peer to peer communications, which includes receiving at least a part of a file transmitted by a wireless multicast/broadcast service (WMBS) session via an access ndownetwork; exchanging, via a peer to peer network, completion messages between the UE device and peer UE devices upon completion of the WMBS session; identifying an amount of the file received at the UE device, and amounts of the file received at each of peer UE devices based on the exchanged completion messages; sending repair data to repair the file on each peer UE devices in response to identifying that the UE device received the entire file; and sending repair data via the peer to peer network, obtained from the access network, in response to identifying that the UE device received less than the entire file and more of the file than each of the group of peer UE devices.

A processing service of a provider network may protect media content from being tampered with when it is transmitted from the provider network/transcoder to untrusted networks (e.g., third-party networks/CDNs) and to a media player. The processing service (e.g., the transcoder) generates a public and a private key. The service uses the private key to digitally sign content portions (e.g., video frames) before distribution to untrusted CDNs. The provider network creates a manifest that includes the public key. To play the media content, the media player obtains a manifest that includes the public key (via a secure/trusted connection with the provider network). The media player may then obtain the media content from an untrusted edge server/CDN and validate it using the public key that was separately obtained from the manifest (to verify the content was not tampered with).

A system and method are provided of minimizing network bandwidth used from an external network by client peers in a local network. The method can include the operation of organizing a plurality of clients each having media streamlets and a client parent in a structure within the local network. Mapping information propagates through the structure. The mapping information represents local streamlet locations as stored by the plurality of clients. Another operation is retrieving a local streamlet from a client identified in the mapping information as having the local streamlet for the requesting client.