Abstract: A framework for joint computation, caching, and request forwarding in data-centric computing-based networks comprises a virtual control plane, which operates on request counters for computations and data, and an actual plane, which handles computation requests, data requests, data objects and computation results in the physical network. A throughput optimal policy, implemented in the virtual plane, provides a basis for adaptive and distributed computation, caching, and request forwarding in the actual plane. The framework provides superior performance in terms of request satisfaction delay as compared with several baseline policies over multiple network topologies.

Abstract: A framework for joint computation, caching, and request forwarding in data-centric computing-based networks comprises a virtual control plane, which operates on request counters for computations and data, and an actual plane, which handles computation requests, data requests, data objects and computation results in the physical network. A throughput optimal policy, implemented in the virtual plane, provides a basis for adaptive and distributed computation, caching, and request forwarding in the actual plane. The framework provides superior performance in terms of request satisfaction delay as compared with several baseline policies over multiple network topologies.

Abstract: A framework for joint computation, caching, and request forwarding in data-centric computing-based networks comprises a virtual control plane, which operates on request counters for computations and data, and an actual plane, which handles computation requests, data requests, data objects and computation results in the physical network. A throughput optimal policy, implemented in the virtual plane, provides a basis for adaptive and distributed computation, caching, and request forwarding in the actual plane. The framework provides superior performance in terms of request satisfaction delay as compared with several baseline policies over multiple network topologies.

Abstract: The invention relates to a computer-implemented method, a corresponding a computer program product and a corresponding apparatus for distributing cached content in a network, the computer-implemented method comprising: collecting statistics regarding requests made and paths taken by the requests from source nodes to server nodes via intermediate nodes, the source nodes, intermediate nodes, and server nodes interconnected by edges having queues with respective queue sizes associated therewith, the requests including indications of content items to be retrieved; storing the content items at the server nodes; caching, by the intermediate nodes, the content items up to a caching capacity; and performing caching decisions that determine which of the content items are to be cached at which of the intermediate nodes, based upon costs that are monotonic, non-decreasing functions of the sizes of the queues.

Abstract: Embodiments include a unified framework for minimizing congestion-dependent network cost by jointly optimizing forwarding and caching strategies that account for link congestion between neighboring nodes. As caching variables are integer-constrained, the resulting optimization problem is a non-deterministic polynomial time (NP)-hard problem. Embodiments relax the optimization problem, where caching variables are real-valued. Embodiments include optimality conditions for the relaxed problem. Embodiments include an adaptive and distributed joint forwarding and caching method, based on a conditional gradient method. Embodiments elegantly yield feasible routing variables and integer caching variables at each iteration, and can be implemented in a distributed manner with low complexity and overhead. Over a wide range of network topologies, simulation results show that embodiments have significantly better delay performance in the low to moderate request rate regions.

Abstract: Embodiments solve a problem of minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. Embodiments solve an equivalent caching gain maximization problem, and consider both source routing and hop-by-hop routing settings. The respective offline problems are non-deterministic polynomial time (NP)-hard. Nevertheless, embodiments show that there exist polynomial time approximation methods producing solutions within a constant approximation from the optimal. Embodiments herein include distributed, adaptive networks, computer methods, systems, and computer program products that provide guarantees of routing cost reduction. Simulation is performed over a broad array of different topologies. Embodiments reduce routing costs by several orders of magnitude compared to existing approaches, including existing approaches optimizing caching under fixed routing.

Abstract: The invention relates to a computer-implemented method, a corresponding a computer program product and a corresponding apparatus for distributing cached content in a network, the computer-implemented method comprising: collecting statistics regarding requests made and paths taken by the requests from source nodes to server nodes via intermediate nodes, the source nodes, intermediate nodes, and server nodes interconnected by edges having queues with respective queue sizes associated therewith, the requests including indications of content items to be retrieved; storing the content items at the server nodes; caching, by the intermediate nodes, the content items up to a caching capacity; and performing caching decisions that determine which of the content items are to be cached at which of the intermediate nodes, based upon costs that are monotonic, non-decreasing functions of the sizes of the queues.

Abstract: A framework for joint computation, caching, and request forwarding in data-centric computing-based networks comprises a virtual control plane, which operates on request counters for computations and data, and an actual plane, which handles computation requests, data requests, data objects and computation results in the physical network. A throughput optimal policy, implemented in the virtual plane, provides a basis for adaptive and distributed computation, caching, and request forwarding in the actual plane. The framework provides superior performance in terms of request satisfaction delay as compared with several baseline policies over multiple network topologies.

Abstract: Embodiments include a unified framework for minimizing congestion-dependent network cost by jointly optimizing forwarding and caching strategies that account for link congestion between neighboring nodes. As caching variables are integer-constrained, the resulting optimization problem is a non-deterministic polynomial time (NP)-hard problem. Embodiments relax the optimization problem, where caching variables are real-valued. Embodiments include optimality conditions for the relaxed problem. Embodiments include an adaptive and distributed joint forwarding and caching method, based on a conditional gradient method. Embodiments elegantly yield feasible routing variables and integer caching variables at each iteration, and can be implemented in a distributed manner with low complexity and overhead. Over a wide range of network topologies, simulation results show that embodiments have significantly better delay performance in the low to moderate request rate regions.

Abstract: A system and method for joint dynamic interest request forwarding and dynamic cache placement and eviction and provided within the context of the Named Data Networking (NDN) architecture. The system and method employ a virtual control plane that operates on the user demand rate for data objects in the network, and an actual plane that handles Interest Packets and Data Packets. Distributed algorithms within the virtual plane achieve network load balancing through dynamic forwarding and caching, thereby maximizing the user demand rate that the NDN network can satisfy. A method of congestion control is also provided to achieve optimal network fairness using the VIP framework.

Abstract: Embodiments solve a problem of minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. Embodiments solve an equivalent caching gain maximization problem, and consider both source routing and hop-by-hop routing settings. The respective offline problems are non-deterministic polynomial time (NP)-hard. Nevertheless, embodiments show that there exist polynomial time approximation methods producing solutions within a constant approximation from the optimal. Embodiments herein include distributed, adaptive networks, computer methods, systems, and computer program products that provide guarantees of routing cost reduction. Simulation is performed over a broad array of different topologies. Embodiments reduce routing costs by several orders of magnitude compared to existing approaches, including existing approaches optimizing caching under fixed routing.

Abstract: A system and method for joint dynamic interest request forwarding and dynamic cache placement and eviction and provided within the context of the Named Data Networking (NDN) architecture. The system and method employ a virtual control plane that operates on the user demand rate for data objects in the network, and an actual plane that handles Interest Packets and Data Packets. Distributed algorithms within the virtual plane achieve network load balancing through dynamic forwarding and caching, thereby maximizing the user demand rate that the NDN network can satisfy. A method of congestion control is also provided to achieve optimal network fairness using the VIP framework.

Abstract: A system and method for joint dynamic interest request forwarding and dynamic cache placement and eviction and provided within the context of the Named Data Networking (NDN) architecture. The system and method employ a virtual control plane that operates on the user demand rate for data objects in the network, and an actual plane that handles Interest Packets and Data Packets. Distributed algorithms within the virtual plane achieve network load balancing through dynamic forwarding and caching, thereby maximizing the user demand rate that the NDN network can satisfy. A method of congestion control is also provided to achieve optimal network fairness using the VIP framework.

Abstract: Method and apparatus are disclosed for deinterlacing of an interlaced video frame sequence using interpolation estimations, such as spatial and temporal interpolations. Interpolations requiring a less accurate estimation of missing pixel values in the frames being deinterlaced, such that an interpolation may be performed with a minimum of error, are performed before interpolations which require a more accurate estimation of missing pixel values for performing an interpolation, such that estimates of missing pixel values are obtained with a minimum of error. Interpolation estimations are weighted in combination for computing approximations of missing pixel values in accordance with the errors associated with the respective interpolations.