Abstract: A method implemented by a network element (NE) configured as a coordinated content coding using caches (c4) coordinator, the method comprising receiving, via a receiver of the NE, a first request from a first remote NE requesting a first file, receiving, via the receiver, a second request from a second remote NE requesting a second file, aggregating, via a processor of the NE, the first request and the second request according to first cache content information of the first remote NE and second cache content information of the second remote NE to produce an aggregated request, and sending, via a transmitter of the NE, the aggregated request to a content server to request a single common delivery of the first file and the second file with coded caching.

Abstract: A method for reducing response times in an information-centric network includes receiving an indication from an ingress node of a content object entering a network, the content object associated with a new delivery flow through the network. An egress node in the network for the content object and a size of the content object are identified. A backlog and bandwidth for the new delivery flow is determined based in part on the size of the content object. Backlogs and bandwidths for existing delivery flows in the network are determined. A set of candidate paths in the network for the new delivery flow from the ingress node to the egress node is determined. For each candidate path, a total response time is estimated for completion of all delivery flows for each candidate path based on the backlog and bandwidth. The candidate path having the lowest total response time is selected for the new delivery flow.

Abstract: An embodiment method for virtual machine file injection includes receiving a request for a first image having an operating system and a first set of injected files for a virtual machine. The first set of injected files is compared with second sets of injected files in second images stored on a non-transitory computer readable medium. In response to the first set and second set of injected files not exactly matching, a nearest non-complete candidate image and third files are transmitted, with the third files being files from the first set of injected files that are not in the second set of injected files of the nearest non-complete candidate image.

Abstract: A network element, comprising a memory that comprises a pending interest table, a receiver operably coupled to the memory and configured to receive an extended interest message in an information centric network, a processor operably coupled to the receiver and memory and configured to determine a desired content according to the extended interest message, determine a prescribed quality of service (QoS) level requested for delivering the desired content to a client, record a path state in the memory, record a return route in the pending interest table of the memory, and determine a next location in the information centric network to which the extended interest message is to be sent, and a transmitter operably coupled to the processor and configured to transmit the extended interest message to the next location in the information centric network.

Abstract: Content is retrieved in a network by first requesting a manifest from a manifest server by a network controller in response to a query from a client node. The manifest is an extensible description of content to be requested. The network controller may modify the manifest to include network information pertinent to the content, such as its location, by adding an appendix including changes and additions to the manifest. The modified manifest is provided to the client node. Based on information in the modified manifest, the client node sends a request for the associated content. The network controller allocates resources and path selection for retrieval of the content. The network controller provides the retrieved content to the client node. If the network controller caches the retrieved content, the manifest is updated with the local cache information and provided to the manifest server to update its records.

Abstract: An apparatus is configured to perform a method for adaptive video streaming. The method includes determining a link quality or throughput in at least one of: a first link from a server to an intermediate node or a second link from the intermediate node to a client device. The method also includes, based on the determined link quality or throughput, estimating a link quality in a future time period for at least one of: the first link or the second link. The method further includes determining a schedule for downloading video segments from the server to a cache associated with the intermediate node, the schedule determined based on the estimated link quality in the future time period. In addition, the method includes downloading video segments according to the schedule from the server to the cache during the future time period.

Abstract: System and method embodiments for exchanging information between a first and second content router enable the content routers to synchronize their caches with a minimal exchange of information. In an embodiment, the method includes creating a hash of contents of a cache in the first content router using a joint hash function shared with the second content router, encoding the hash of contents of the cache in the first content router with distributed source coding, and transmitting the encoded hash to the second content router.

Abstract: A method implemented in a network element (NE) configured to operate in an information centric network (ICN), comprising receiving a plurality of test traffic flows, wherein the test traffic flows are copies of a number of traffic flows received in a forwarding plane of the ICN during a defined interval; emulating the ICN at a state determined at an arrival time of the test traffic flows to the NE and defined based on a plurality of active traffic flows in the ICN; measuring a first impact of a plurality of first candidate paths for a first test traffic flow from the test traffic flows in the emulated ICN to the active traffic flows; selecting one of the first candidate paths based on the first impact measurement; measuring a second impact of a plurality of second candidate paths for a second test traffic flow from the test traffic flows in the emulated ICN to active traffic flows and the selected first candidate test path; selecting one of the second candidate paths based on the second impact measurement; an

Abstract: A method for reducing response times in an information-centric network includes receiving an indication from an ingress node of a content object entering a network, the content object associated with a new delivery flow through the network. An egress node in the network for the content object and a size of the content object are identified. A backlog and bandwidth for the new delivery flow is determined based in part on the size of the content object. Backlogs and bandwidths for existing delivery flows in the network are determined. A set of candidate paths in the network for the new delivery flow from the ingress node to the egress node is determined. For each candidate path, a total response time is estimated for completion of all delivery flows for each candidate path based on the backlog and bandwidth. The candidate path having the lowest total response time is selected for the new delivery flow.

Abstract: A content controller monitors current network capacity usage and ongoing streaming data requests. Based on the collected information, the content controller assigns a data segment prefetching task to a data storage (e.g., a cache) of the network. One or several caches can be used to prefetch one or more data segments, depending on the network conditions and the speed with which a data store can retrieve the data over the network. The task assignment is performed for a given period of time, which is defined as a round. Periodically, the controller uses information collected from previous rounds, such as the history of streaming data requests and bandwidth usage, to determine the data segments to be prefetched by data stores in the next round.

Abstract: An embodiment method for virtual machine file injection includes receiving a request for a first image having an operating system and a first set of injected files for a virtual machine. The first set of injected files is compared with second sets of injected files in second images stored on a non-transitory computer readable medium. In response to the first set and second set of injected files not exactly matching, a nearest non-complete candidate image and third files are transmitted, with the third files being files from the first set of injected files that are not in the second set of injected files of the nearest non-complete candidate image.

Abstract: A network node, comprising a data store comprising a content object, wherein the content object comprises multiple content chunks, a receiver configured to receive a request from a requesting network node for at least one chunk of the content object, a transmitter configured to transmit data, and a processor coupled to the receiver, the transmitter, and the data store, wherein the processor is configured to encode the content using the multiple content chunks and to instruct the transmitter to transmit the encoded content and an encoding indicator to the requesting network node, wherein the encoding indicator provides the requesting network node with an encoding mechanism that the requesting network node uses to decode the encoded content in the payload into the multiple content chunks after the requesting network node receives a number of packets comprising the encoded content equal to the number of content chunks that comprise the content object.

Abstract: A method and apparatus is disclosed herein for a resource allocation protocol. In one embodiment, the apparatus comprises a resource allocation engine to allocate physical resources to primary and redundant virtual infrastructures, wherein, when the resource allocation engine allocates virtual infrastructures, physical resources of redundant virtual infrastructures are shared across multiple primary virtual infrastructures.

Abstract: A network element (NE) comprising a receiver configured to receive a content request message from a client node via a network, wherein the content request message comprises an identifier of a data object, a memory configured to store a content routing table comprising local routing entries for popular data objects, and a content indicator indicating less popular data objects that are not associated with the local routing entries, a processor coupled to the memory and configured to check the content routing table for an entry associated with the requested data object, and check the content indicator for a match between the requested data object and the less popular data objects when the content routing table does not comprise the entry, and a transmitter coupled to the processor and configured to send a route request message to a network controller when the content indicator check returns a positive match.

Abstract: A method of adaptive video streaming implemented in a caching element operating in an information-centric network. The method comprises receiving a request for a media presentation description (MPD) for video content, obtaining the requested MPD, inserting a description of video content stored in the caching element into the MPD, and transmitting the MPD to a client requesting the MPD.

Abstract: A method and apparatus is disclosed herein for a resource allocation protocol. In one embodiment, the apparatus comprises a resource allocation engine to allocate physical resources to primary and redundant virtual infrastructures, wherein, when the resource allocation engine allocates virtual infrastructures, physical resources of redundant virtual infrastructures are shared across multiple primary virtual infrastructures.

Abstract: A method implemented by a network node coupled to a network, the method comprising inserting a location hint in a request for a content, wherein the location hint specifies one or more network locations that are known by the network node to hold at least part of the content, sending the request to the network, wherein the request comprises a content name that describes the content, and receiving a data message corresponding to the request from the network, wherein the data message comprises at least a portion of the content.

Abstract: A method implemented by a network controller, the method comprising obtaining metadata of a content, wherein the content is requested by a client device, allocating one or more network resources to the content based on the metadata of the content, and sending a message identifying the allocated network resources to a switch to direct the content to be served to the client device, wherein the switch is controlled by the network controller and configured to forward the content to the client device using the allocated network resources.

Abstract: System and method embodiments for exchanging information between a first and second content router enable the content routers to synchronize their caches with a minimal exchange of information. In an embodiment, the method includes creating a hash of contents of a cache in the first content router using a joint hash function shared with the second content router, encoding the hash of contents of the cache in the first content router with distributed source coding, and transmitting the encoded hash to the second content router.

Abstract: A method and apparatus is disclosed herein for scalable routing with greedy embedding. In one embodiment, the method comprises storing log(n) coordinates in a routing table, where n is the number of nodes in a network, and further wherein the log(n) coordinates are generated by constructing a greedy embedding that embeds a graph topology depicting connections between n nodes of a network into a geometric space so as to use greedy forwarding by generating a spanning tree out of a connection graph representing the connections between the n nodes of the network, decomposing the tree into at most n branches, assigning a set of geometric coordinates to vertices in the tree in an n-dimensional space, and projecting the set of geometric coordinates onto a k-dimensional space, where k is less than n, to create the log(n) coordinates; and routing packets via nodes of the network using the log(n) coordinates in the routing table.