Abstract: A set of edge servers in a content delivery network is selected to serve a set of users. Selection comprises constructing a trellis having a number of states at least equal to a number of edge servers in the edge-server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers. A fitness function is calculated based on network performance improvement and cost corresponding to each candidate edge server. A trellis-exploration algorithm is used to select the edge-server set by identifying a path through the trellis having optimal path metrics derived from the fitness function. The algorithm provides interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, a path is selected that corresponds to a best path metric that connects to a node in a previous state, wherein the best path metric comprises the fitness function.

Abstract: A network node in a distributed network comprises a surface immunoglobulin system configured to monitor other nodes in the distributed network and generate an alert upon detecting a suspicious activity; and a free-antibody system configured to push a free-antibody program to a requesting node petitioning to access the distributed network. The free-antibody program can comprise a software agent configured to communicatively couple to the surface immunoglobulin system while monitoring behavior of the requesting node. The free-antibody program reports detected malware and/or suspicious activity to the surface immunoglobulin system, which can enact countermeasures against the requesting node.

Abstract: A radio transceiver comprises a first baseband processor, a second baseband processor, and a radio transmitter coupled to the first and second baseband processors. The first baseband processor receives a radio channel allocation from a first network comprising a radio frequency reserved for communicating in the first network. The second baseband processor is configured to process baseband data for communicating in a second network. The radio transmitter is configured to employ the radio frequency for communication in the second network while the radio frequency is reserved in the first network.

Abstract: A node in a first wireless network requests a radio communication channel from a second wireless network. Upon receiving a channel assignment, nodes in the first network employ the assigned channel for communicating in a manner that is transparent to the second network. Communications via the second wireless network may initiate communications in the first wireless network, keep the assigned channel reserved, communicate network control messages for the first wireless network, transmit a decoy signal, and/or communicate a reference signal. Antenna array processing can prevent the first and second wireless networks from interfering with each other.

Abstract: An apparatus configured for selecting a plurality of edge-server sets, comprising: A metrics manager collects network topology information from edge servers and/or client devices. A request-routing mechanism determines a device network topology for each of a plurality of device types. For each device network topology, a device-specific edge-server set is selected. Device-specific data signals are distributed for storage on a corresponding device-specific edge-server set. A trellis-exploration algorithm can be used to determine each device-specific edge-server set.

Abstract: A set of edge servers in a content delivery network is selected to serve a set of users. Selection comprises constructing a trellis having a number of states at least equal to a number of edge servers in the edge-server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers. A fitness function is calculated based on network performance improvement and cost corresponding to each candidate edge server. A trellis-exploration algorithm is used to select the edge-server set by identifying a path through the trellis having optimal path metrics derived from the fitness function. The algorithm provides interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, a path is selected that corresponds to a best path metric that connects to a node in a previous state, wherein the best path metric comprises the fitness function.

Abstract: In a content delivery network, a metrics manager processes network topology information from channel measurements collected from at least one of a digi-node field and a client field, and distributes data signals to a selected edge-server set for storage and delivery to client devices. A parent server selects the edge-server set by employing an algorithm that constructs a trellis having a number of states at least equal to a number of edge servers in the edge-server set, wherein each state comprises a plurality of nodes, each node corresponding to one of a plurality of candidate edge servers. A trellis-exploration algorithm provides interconnects between each node of a first state to each of a plurality of nodes in a next state, and for each node in a state, selects a path corresponding to a best performance metric that connects to a node in a previous state, wherein each performance metric comprises the network topology information.

Abstract: In a wireless communication system, a secure communication link is provided by selecting a decoy data signal for transmission, generating a precoding matrix from a message to be sent; and multiplying the decoy data signal by the precoding matrix to produce a precoded signal. A clean version of the decoy data may be transmitted to an intended receiver. The receiver can distinguish between the information-bearing precoding and the natural random channel distortions of the transmission medium to decrypt the information, while an eavesdropper would find it difficult to distinguish between the natural channel distortions and information-bearing precoding in the signals it receives.

Abstract: Selecting an edge-server set in a wireless network comprises generating channel-quality measurements of wireless links between available nodes; determining a network topology state based on the measurements; calculating a performance metric for each candidate edge-server set; and selecting a candidate edge-server set based on the performance metric. An iterative process may be employed for selecting the best edge-server set. The iterative process may employ a trellis-exploration algorithm. A back-pressure routing algorithm may be used to calculate the performance metric. A server processes a request from a client residing on a wireless network by determining if another client on the wireless network has the requested object; determining if the requesting client can communicatively couple to the other client; and directing the request to the other client.

Abstract: In a wireless communication system, a secure communication link is provided by selecting a decoy data signal vector for transmission, generating a MIMO precoding matrix from a message to be sent; and multiplying the decoy data signal vector by the MIMO precoding matrix to construct a precoded signal vector. The MIMO precoding matrix produces information-bearing synthesized channel distortions in the transmitted signal. An undistorted version of the decoy data may be transmitted to an intended receiver. The receiver distinguishes between the synthesized information-bearing channel distortions and natural channel distortions to decrypt the information, while an eavesdropper would find it difficult to distinguish between natural and synthesized channel distortions in the signals it receives.

Abstract: A source node selects a plurality of transmitting nodes to cooperatively encode a set of original packets to transfer to a destination node. Encoding produces a plurality of coded packets and a corresponding code matrix of coefficients. The coded packets and the corresponding code matrix comprise a set of independent equations of independent variables in a system of linear equations, wherein the independent variables comprise the original packets. A destination node may select a set of receiving nodes to cooperatively receive the transmissions. The destination node collects the coded packets and code matrix from the receiving nodes, which provide a sufficient number of independent equations for decoding the original packets. Decoding comprises calculating a solution for the system of linear equations.

Abstract: A source node selects a plurality of transmitting nodes to cooperatively encode a set of original packets to transfer to a destination node. Encoding produces a plurality of coded packets and a corresponding code matrix of coefficients. The coded packets and the corresponding code matrix comprise a set of independent equations of independent variables in a system of linear equations, wherein the independent variables comprise the original packets. A destination node may select a set of receiving nodes to cooperatively receive the transmissions. The destination node collects the coded packets and code matrix from the receiving nodes, which provide a sufficient number of independent equations for decoding the original packets. Decoding comprises calculating a solution for the system of linear equations.

Abstract: A source node selects a plurality of original data components to transfer to at least one destination node. A plurality of transmitting nodes cooperatively encodes the original data components to generate a plurality of subspace coded components and a corresponding code matrix. Each of the transmitting nodes transmits a subset of the plurality of subspace coded components and corresponding code matrix, wherein at least one of the transmitting nodes has a rank that is insufficient for decoding the plurality of subspace coded components. A destination node may employ a plurality of receiving nodes to cooperatively receive a plurality of subspace coded components and their corresponding code vectors, wherein the rank of at least one of the receiving nodes is insufficient for decoding the coded components. The destination node builds up the dimension of the subspace spanned by code vectors it collects from the receiving nodes so it can decode the coded components.

Abstract: A node in a first wireless network requests a radio communication channel from a second wireless network. Upon receiving a channel assignment, nodes in the first network employ the assigned channel for communicating in a manner that is transparent to the second network. Communications via the second wireless network may initiate communications in the first wireless network, keep the assigned channel reserved, communicate network control messages for the first wireless network, transmit a decoy signal, and/or communicate a reference signal. Antenna array processing can prevent the first and second wireless networks from interfering with each other.

Abstract: A node in a first network requests a communication channel from a second network. Upon receiving a channel assignment, nodes in the first network employ the assigned channel for communicating in a manner that is transparent to the second network. A transmitting node selects a decoy data signal as a carrier signal, synthesizes data-bearing channel distortions; and distorts the carrier signal with the channel distortions prior to transmission. An undistorted version of the decoy data may be transmitted to an intended receiver. The receiver distinguishes between the synthesized data-bearing channel distortions and natural channel distortions to decrypt the data. In a MIMO system, the transmitter generates a MIMO precoding matrix from a message to be sent to the receiver and multiplies the decoy data signal vector with the MIMO precoding matrix.

Abstract: A node in a first network requests a communication channel from a second network. Upon receiving a channel assignment, nodes in the first network employ the assigned channel for communicating in a manner that is transparent to the second network. A transmitting node selects a decoy data signal as a carrier signal, synthesizes data-bearing channel distortions; and distorts the carrier signal with the channel distortions prior to transmission. An undistorted version of the decoy data may be transmitted to an intended receiver. The receiver distinguishes between the synthesized data-bearing channel distortions and natural channel distortions to decrypt the data. In a MIMO system, the transmitter generates a MIMO precoding matrix from a message to be sent to the receiver and multiplies the decoy data signal vector with the MIMO precoding matrix.

Abstract: A source node selects a plurality of original data components to transfer to at least one destination node. A plurality of transmitting nodes cooperatively encodes the original data components to generate a plurality of subspace coded components and a corresponding code matrix. Each of the transmitting nodes transmits a subset of the plurality of subspace coded components and corresponding code matrix, wherein at least one of the transmitting nodes has a rank that is insufficient for decoding the plurality of subspace coded components. A destination node may employ a plurality of receiving nodes to cooperatively receive a plurality of subspace coded components and their corresponding code vectors, wherein the rank of at least one of the receiving nodes is insufficient for decoding the coded components. The destination node builds up the dimension of the subspace spanned by code vectors it collects from the receiving nodes so it can decode the coded components.

Abstract: A source node selects a plurality of original data components to transfer to at least one destination node. A plurality of transmitting nodes cooperatively encodes the original data components to generate a plurality of subspace coded components and a corresponding code matrix. Each of the transmitting nodes transmits a subset of the plurality of subspace coded components and corresponding code matrix, wherein at least one of the transmitting nodes has a rank that is insufficient for decoding the plurality of subspace coded components. A destination node may employ a plurality of receiving nodes to cooperatively receive a plurality of subspace coded components and their corresponding code vectors, wherein the rank of at least one of the receiving nodes is insufficient for decoding the subspace coded components. The destination node builds up the dimension of the subspace spanned by code vectors it collects from the receiving nodes and then decodes the subspace coded components.

Abstract: A source node selects a plurality of transmitting nodes to cooperatively encode a set of original packets to transfer to a destination node. Encoding produces a plurality of coded packets and a corresponding code matrix of coefficients. The coded packets and the corresponding code matrix comprise a set of independent equations of independent variables in a system of linear equations, wherein the independent variables comprise the original packets. A destination node may select a set of receiving nodes to cooperatively receive the transmissions. The destination node collects the coded packets and code matrix from the receiving nodes, which provide a sufficient number of independent equations for decoding the original packets. Decoding comprises calculating a solution for the system of linear equations.

Abstract: A source node selects a plurality of transmitting nodes to cooperatively encode a set of original packets to transfer to a destination node. Encoding produces a plurality of coded packets and a corresponding code matrix of coefficients. The coded packets and the corresponding code matrix comprise a set of independent equations of independent variables in a system of linear equations, wherein the independent variables comprise the original packets. A destination node may select a set of receiving nodes to cooperatively receive the transmissions. The destination node collects the coded packets and code matrix from the receiving nodes, which provide a sufficient number of independent equations for decoding the original packets. Decoding comprises calculating a solution for the system of linear equations.