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: A computer-based real-time streaming system under packet erasures wherein created messages can be decoded within a fixed delay form their creation is presented. Various code construction methods and corresponding hardware implementation for different cases of erasure link models are also presented.

Abstract: Allocation of storage budget in a computer-based distributed storage system is described, where associated computer-based storage nodes have heterogeneous access probabilities. The problem is to allocate a given storage budget across the available computer-based nodes so as to store a unit-size data object (e.g. file) with a higher reliability (e.g. increased probability for the storage budget to be recovered). Efficient algorithms for optimizing over one or more classes of allocations are presented. A basic one-level symmetric allocation is presented, where the storage budget is spread evenly over an appropriately chosen subset of nodes. Furthermore, a two-level symmetric allocation is presented, where the budget is divided into two parts, each spread evenly over a different subset of computer-based storage nodes, such that the amount allocated to each node in the first subset is twice that of the second subset.

Abstract: A computer-based real-time streaming system under packet erasures wherein created messages can be decoded within a fixed delay form their creation is presented. Various code construction methods and corresponding hardware implementation for different cases of erasure link models are also presented.

Abstract: A computer-based real-time streaming system under packet erasures wherein created messages can be decoded within a fixed delay form their creation is presented. Various code construction methods and corresponding hardware implementation for different cases of erasure link models are also presented.

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: Allocation of storage budget in a computer-based distributed storage system is described, where associated computer-based storage nodes have heterogeneous access probabilities. The problem is to allocate a given storage budget across the available computer-based nodes so as to store a unit-size data object (e.g. file) with a higher reliability (e.g. increased probability for the storage budget to be recovered). Efficient algorithms for optimizing over one or more classes of allocations are presented. A basic one-level symmetric allocation is presented, where the storage budget is spread evenly over an appropriately chosen subset of nodes. Furthermore, a two-level symmetric allocation is presented, where the budget is divided into two parts, each spread evenly over a different subset of computer-based storage nodes, such that the amount allocated to each node in the first subset is twice that of the second subset.

Abstract: A computer-based real-time streaming system under packet erasures wherein created messages can be decoded within a fixed delay form their creation is presented. Various code construction methods and corresponding hardware implementation for different cases of erasure link models are also presented.

Abstract: An electrical resistive device in which an element composed of a conductive polymer is positioned in contact with the surface layer of one or more metal electrodes. The metal electrode contains a base layer which includes a first metal, an intermediate metal layer which includes a metal that is different from the first metal, and a surface layer which (i) includes a second metal, (ii) has a center line average roughness {overscore (Ra)} of at least 1.3, and (iii) has a reflection density Rd of at least 0.60. The conductive polymer composition preferably exhibits PTC behavior density requirements, which may be, for example, circuit protection devices or heaters, have improved thermal and electrical performance over devices prepared with electrodes which do not meet the center line average roughness and reflection density requirements.

Abstract: An electrical device (1) in which an element (7) composed of a conductive polymer is positioned in contact with the surface layer of one or more metal electrodes (3,5). The metal electrode contains a base layer (9) which comprises a first metal, an intermediate metal layer (15) which comprises a metal that is different from the first metal, and a surface layer (17) which (i) comprises a second metal, (ii) has a center line average roughness R.sub.a of at least 1.3, and (iii) has a reflection density R.sub.d of at least 0.60. The conductive polymer composition preferably exhibits PTC behavior. The electrical devices, which may be, for example, circuit protection devices or heaters, have improved thermal and electrical performance over devices prepared with electrodes which do not meet the center line average roughness and reflection density requirements.