Abstract:
System and method embodiments are provided for configuring a network to forward traffic from a first network zone to a second network zone. In an embodiment, a first zone controller of the first zone receives information indicating network capability. The information includes a plurality of parameters of a constraint function. The first network controller provisions a network node, e.g., at the second zone, to forward traffic from the first zone to the second zone in accordance with the received information. The information indicating network capability includes one or more variables relating to the constraint. The constraint relates to at least one current traffic level or at least one wireless link in the second zone.
Abstract:
Systems and methods reduce redundancy in a data representation. The data is divided into a plurality of data portions. The data portions are used to encode a plurality of compressed data portions, wherein the compressed data portions correspond to a subset of the data portions and comprise less redundant data than the subset of the data portions. The compressed data portions are also encoded in accordance with data in the remaining data portions. The compressed data portions are transmitted instead of the subset of the data portions with the remaining data portions according to a sequence of data portions. Each of the compressed data portions is transmitted upon receiving an acknowledgment message that indicates successful transmission of a previous data portion or compressed data portion in the sequence of data portions.
Abstract:
Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.
Abstract:
Hierarchical compression includes the contemporaneous implementation of link-layer and higher-layer compression on data flowing over a link. Hierarchical compression can be achieved by configuring network nodes positioned at the link-layer to recognize higher-layer compression symbols embedded in incoming data streams, and to adapt link-layer compression to compensate for those higher-layer compression symbols. One technique for adapting link-layer compression is to perform data chunking in-between higher-layer compression symbols. This may reduce the likelihood that higher-layer compression symbols will interfere with the network nodes ability to identify redundant data chunks at the link-layer. Another technique for adapting link-layer compression is to define the HASH algorithm in such a way that the hash of a data string renders the same hash value as the hash of the higher layer compression symbol corresponding to the data string.
Abstract:
Embodiments are provided for traffic scheduling based on user equipment (UE) in wireless networks. A location prediction-based network scheduler (NS) interfaces with a traffic engineering (TE) function to enable location-prediction-based routing for UE traffic. The NS obtains location prediction information for a UE for a next time window comprising a plurality of next time slots, and obtains available network resource prediction for the next time slots. The NS then determines, for each of the next time slots, a weight value as a priority parameter for forwarding data to the UE, in accordance with the location prediction information and the available network resource prediction. The result for the first time slot is then forwarded from the NS to the TE function, which optimizes, for the first time slot, the weight value with a route and data for forwarding the data to the UE.
Abstract:
Base stations (BSs) can remove inter-BS interference components from received uplink signals using downlink information communicated over a backhaul network. The downlink information is associated with downlink transmissions of neighboring base stations, and is used to remove the inter-BS interference in accordance with interference cancellation techniques, e.g., signal interference cancellation (SIC), etc. The downlink information includes information associated with downlink transmission of the interfering BSs, such as information bits (e.g., data), parity information, control information, modulation and coding scheme (MCS) parameters, forward error correction (FEC) parameters, and other information. Additionally, inter-BS interference can be suppressed using channel information of interference channels using interference suppression techniques, e.g., interference rejection combining (IRC), etc.
Abstract:
Historical decoding in accordance with signal interference cancellation (SIC) or joint processing may reduce the amount of data that is re-transported across a network following an unsuccessful attempt to decode a data transmission. In one example, historical decoding is performed in accordance with interference cancellation by communicating information related to interfering data (rather than information related to serving data) following a served receiver's unsuccessful attempt to decode an interference signal. The information related to the interfering data may be the information bits carried by the earlier interfering data transmission or parity information (e.g., forward error correction (FEC) bits, etc.) related to the earlier interfering data transmission.
Abstract:
Historical decoding can be performed in accordance with pilot signal retransmission or control information retransmission to reduce the amount network resources consumed during data recovery. In one example, historical decoding is achieved through retransmitting a sub-set of coded bits carried by an earlier transmission, which are compared with a corresponding portion of the original signal (stored in memory) to obtain improved channel state information (CSI) relating to that earlier transmission. In another example, historical decoding is achieved through communicating parity information related to a sub-set of the coded bits carried by an earlier transmission, which are used in accordance with a data aided CSI technique to obtain the improved CSI relating to that earlier transmission. In yet another example, historical decoding is achieved by re-transmitting control information carried by an earlier transmission, which is used to decode an original signal (stored in memory).
Abstract:
Blind detection of code rates for codes with incremental shortening involves determining a decoding code rate for decoding words that are based on codewords of a code that exhibits incremental shortening over a range of code rates. Incremental shortening is a code structure or coding property according to which different numbers of bits in encoding blocks that are to be encoded are set or frozen to a fixed value, to provide the range of code rates. This property enables blind detection of a decoding code rate, without explicit signaling or prior configuration of code rates between a transmitter and a receiver.
Abstract:
A method includes receiving, by a first device from a second device, a plurality of encoded messages on a plurality of transmission time intervals (TTIs), where the plurality of encoded messages are forward error correction (FEC) encoded, and where the FEC spans the plurality of encoded messages and decoding the plurality of encoded messages using FEC. The method also includes determining a plurality of decoding status messages in accordance with decoding the plurality of encoded messages and transmitting, by the first device to the second device, the plurality of decoding status messages less often than once every TTI.