Abstract: A Unified Content Delivery Network system (UCDN) system which is formed from a network of one or more inter-operable Peer networks. A hierarchical hybrid adaptive Secure Peer-Assisted Networking System (termed SPAN-AI),using a hierarchical AI driven approach under a unified secure content-addressable architecture which is based on five key SPAN-AI sub systems: unified naming; unified discovery; hybrid adaptive routing; scalable pubsub; and embedded security; all of said five key SPAN-AI sub systems securely integrated and jointly optimized via a hierarchical, pluggable AI framework, with an associated simulation, training, and development pipeline that embeds AI agents with varying degrees of awareness and optimization capabilities at peer, edge, or core or other network levels (hierarchies).

Abstract: Various example embodiments for supporting services within a distributed cloud network are configured to support capabilities for solving a cloud service distribution problem for a set of services to be deployed within a distributed cloud network in order to determine the placement of service functions of the services within the cloud network, the routing of service flows of the services through the appropriate service functions of the services within the cloud network, and the associated allocation of cloud and network resources that support the deployment and routing of the services within the cloud network. Various example embodiments for supporting services within a distributed cloud network are configured to support capabilities for solving a cloud service distribution problem for a set of services to be deployed within a distributed cloud network in a manner for reducing or even minimizing the overall cloud network cost in the distributed cloud network.

Abstract: Various example embodiments for supporting services within a distributed cloud network are configured to support capabilities for solving a cloud service distribution problem for a set of services to be deployed within a distributed cloud network in order to determine the placement of service functions of the services within the cloud network, the routing of service flows of the services through the appropriate service functions of the services within the cloud network, and the associated allocation of cloud and network resources that support the deployment and routing of the services within the cloud network. Various example embodiments for supporting services within a distributed cloud network are configured to support capabilities for solving a cloud service distribution problem for a set of services to be deployed within a distributed cloud network in a manner for reducing or even minimizing the overall cloud network cost in the distributed cloud network.

Abstract: Requests are received from destination devices for files of a plurality of data files, each of the requested files including at least one file-packet. A conflict graph is built using popularity information and a joint probability distribution of the plurality of date files. The conflict graph is colored. A coded multicast is computed using the colored conflict graph. A corresponding unicast refinement is computed using the colored conflict graph and the joint probability distribution of the plurality of data files. The coded multicast and the corresponding unicast is concatenated. The requested files are transmitted to respective destination devices of the plurality of destination devices.

Abstract: Various exemplary embodiments relate to a network node in a distributed dynamic cloud, the node including: a memory; and a processor configured to: observe a local queue backlog at the beginning of a timeslot, for each of a plurality of commodities; compute a processing utility weight for a first commodity based upon the local queue backlog of the first commodity, the local queue backlog of a second commodity, and a processing cost; where the second commodity may be the succeeding commodity in a service chain; compute an optimal commodity using the processing utility weights; wherein the optimal commodity is the commodity with the highest utility weight; assign the number of processing resource units allocated to the timeslot to zero when the processing utility weight of the optimal commodity is less than or equal to zero; and execute processing resource allocation and processing flow rate assignment decisions based upon the optimal commodity.

Abstract: Data files are transmitted by receiving requests from destination devices for the files and dividing the files into first and second subsets where the files of the second subset are associated with one file of the first subset. The files of the second subset are compressed using one of the files in the first subset as a reference. The compressed files are divided into packets. A portion of the compressed files of the second subset, and a portion of the files of the first subset is cached. Un-cached portions of respective files from the first subset are transmitted to destination devices that have requested these files, and un-cached portions of one particular file from the second subset, and un-cached portions of files in the first subset that are associated with the one particular file, are transmitted to respective destination devices that have requested the particular file from the second subset.

Abstract: A capability for determining a distribution of a cloud service within a cloud environment is presented. The distribution of the cloud service within the cloud environment may specify a placement of information objects and cloud service virtual functions of the cloud service within the cloud environment. The distribution of the cloud service within the cloud environment may be determined based on a graph-based representation of the cloud service in which nodes of the graph represent the information objects of the cloud service and edges between the nodes of the graph represent the cloud service virtual functions of the cloud service and based on a graph-based representation of the cloud environment in which nodes of the graph represent locations or elements of the cloud environment and edges between the nodes of the graph represent the interconnections between the locations or elements of the cloud environment.

Abstract: At least one example embodiment provides a method for transmitting data files in a network. The method may include receiving requests from destination devices for packets of the data files. The method may include constructing a conflict graph such that each packet requested by each destination device is represented by a distinct vertex in a plurality of vertices of the conflict graph. The method may include coloring the plurality of vertices of the conflict graph according to a coloring scheme. The method may include performing a first encoding operation on the requested packets based on the coloring to generate first encoded data. The method may include performing a second encoding operation on the first encoded data to generate second encoded data. The method may include sending the second encoded data.

Abstract: Various embodiments relate to a method and apparatus for performing dynamic computing network control where at each timeslot t, each node i is configured to observe a set of local queue backlogs where the local queue backlogs indicate the packet build-up of each commodity at node i and at its potential receivers (RXs), the method including steps of performing local transmission decisions, including computing, for each of commodity (d, m) and each receiving node j, a differential backlog weight, where d is a destination, m is a function, and j is an integer index indicating a specific receiving node, computing, for each transmission resource allocation choice, a metric value for each commodity, computing an optimal number of allocation resource units to allocate and an optimal commodity to transmit, transmitting the optimal commodity by allocating the allocation resource units when the metric value is greater than 0 and determining at least one of the potential RXs which will retain information associated with

Abstract: This disclosure generally discloses a service function virtualization capability configured to support virtualization of a service within a distributed cloud network. Various embodiments of the service function virtualization capability provide a set of fast approximation algorithms configured to solve the cloud service distribution problem in order to determine the placement of service functions of a service within a cloud network, the routing of service flows through the appropriate service functions of the service within the cloud network, and the associated allocation of cloud and network resources that satisfy client demands with reduced or even minimum overall cloud network cost in the distributed cloud network.

Abstract: In one aspect, a network element for a wireless Content Delivery Network is provided. The network element receives requests from receiver devices for a video segment over the wireless CDN, and computes a number of descriptors (representing quality) of the requested video segment, where the number of descriptors is determined for each receiver device based on channel conditions between the network element and the receiver devices. The network element clusters a set of descriptors for each receiver device into a minimum number of Generalized Independent Sets (GISs) based on the computed number of descriptors and the channel conditions between the network element and the receiver devices, and generates a multicast codeword encoding the clustered descriptors for each receiver device using the minimum number of GISs. The network element transmits the multicast codeword to each of the receiver devices in response to the received requests.

Abstract: Data files are transmitted by receiving requests from destination devices for the files and dividing the files into first and second subsets where the files of the second subset are associated with one file of the first subset. The files of the second subset are compressed using one of the files in the first subset as a reference. The compressed files are divided into packets. A portion of the compressed files of the second subset, and a portion of the files of the first subset is cached. Un-cached portions of respective files from the first subset are transmitted to destination devices that have requested these files, and un-cached portions of one particular file from the second subset, and un-cached portions of files in the first subset that are associated with the one particular file, are transmitted to respective destination devices that have requested the particular file from the second subset.

Abstract: Various exemplary embodiments relate to a network node in a distributed dynamic cloud, the node including: a memory; and a processor configured to: observe a local queue backlog at the beginning of a timeslot, for each of a plurality of commodities; compute a processing utility weight for a first commodity based upon the local queue backlog of the first commodity, the local queue backlog of a second commodity, and a processing cost; where the second commodity may be the succeeding commodity in a service chain; compute an optimal commodity using the processing utility weights; wherein the optimal commodity is the commodity with the highest utility weight; assign the number of processing resource units allocated to the timeslot to zero when the processing utility weight of the optimal commodity is less than or equal to zero; and execute processing resource allocation and processing flow rate assignment decisions based upon the optimal commodity.

Abstract: In one aspect, a network element for a wireless Content Delivery Network is provided. The network element receives requests from receiver devices for a video segment over the wireless CDN, and computes a number of descriptors (representing quality) of the requested video segment, where the number of descriptors is determined for each receiver device based on channel conditions between the network element and the receiver devices. The network element clusters a set of descriptors for each receiver device into a minimum number of Generalized Independent Sets (GISs) based on the computed number of descriptors and the channel conditions between the network element and the receiver devices, and generates a multicast codeword encoding the clustered descriptors for each receiver device using the minimum number of GISs. The network element transmits the multicast codeword to each of the receiver devices in response to the received requests.

Abstract: A method for caching in a network includes determining popularities for a plurality of data files based on requests for the plurality of data files. The method includes sending random packets of the plurality of data files to at least one destination based on the popularities. The method may include ranking the plurality of data files from a most popular data file to a least popular data file using the determined popularities. The method may include selecting, for each data file, a number of random packets based on the ranking, wherein the sending sends the selected number of random packets for each data file.

Abstract: According to at least one example embodiment, a method for transmitting data files in a network includes receiving requests from user devices for packets of the data files. The method includes constructing a conflict graph such that each packet requested by each user device is represented by a distinct vertex in a plurality of vertices of the conflict graph, the constructing being based on which of the plurality of vertices represent a same requested packet and which requested packets are stored in caches belonging to the user devices. The method includes coloring the plurality of vertices of the conflict graph to label the requested packets. The method includes combining the packets represented by vertices having a same color. The method includes sending the combined packets.

Abstract: A method for transmitting data files in a network includes receiving requests from destination devices for packets of the data files. The method includes constructing a conflict graph such that (i) each packet requested by each destination device is represented by a distinct vertex in a plurality of vertices of the conflict graph, (ii) the plurality of vertices are associated with the destination devices, and (iii) links are created between the plurality of vertices based on which of the plurality of vertices represent a same requested packet and which requested packets are stored in caches belonging to destination devices. The method includes assigning the plurality of vertices to groups based on the links. The method includes coloring the plurality of vertices based on the assigning. The method includes combining the packets represented by vertices having a same color. The method includes sending the combined packets.

Abstract: A method for transmitting data files in a network includes receiving requests from destination devices for packets of the data files. The method includes constructing a conflict graph such that each packet requested by each destination device is represented by a distinct vertex in a plurality of vertices of the conflict graph, the plurality of vertices being associated with the destination devices. The method includes assigning labels to the plurality of vertices. The method includes assigning levels to the plurality of vertices. The method includes ordering the plurality of vertices from vertices having a highest level to vertices having a lowest level. The method includes coloring the plurality of vertices based on the ordering. The method includes combining the packets represented by vertices in the plurality of vertices having a same color. The method includes sending the combined packets.

Abstract: At least one example embodiment provides a method for transmitting data files in a network. The method may include receiving requests from destination devices for packets of the data files. The method may include constructing a conflict graph such that each packet requested by each destination device is represented by a distinct vertex in a plurality of vertices of the conflict graph. The method may include coloring the plurality of vertices of the conflict graph according to a coloring scheme. The method may include performing a first encoding operation on the requested packets based on the coloring to generate first encoded data. The method may include performing a second encoding operation on the first encoded data to generate second encoded data. The method may include sending the second encoded data.

Abstract: A capability for determining a distribution of a cloud service within a cloud environment is presented. The distribution of the cloud service within the cloud environment may specify a placement of information objects and cloud service virtual functions of the cloud service within the cloud environment. The distribution of the cloud service within the cloud environment may be determined based on a graph-based representation of the cloud service in which nodes of the graph represent the information objects of the cloud service and edges between the nodes of the graph represent the cloud service virtual functions of the cloud service and based on a graph-based representation of the cloud environment in which nodes of the graph represent locations or elements of the cloud environment and edges between the nodes of the graph represent the interconnections between the locations or elements of the cloud environment.