A machine-implemented method for use at a destination node for transferring data from a source node, the method comprising: establishing one or more connections with the source node; sending to the source node a request for a data stream, the request including control information to be applied at the source node, the control information including a number of degrees of freedom (DoFs) or frames to be transmitted across each of the one or more connections; and receiving one or more coded frames through the data stream over the one or more connections.
A machine-implemented method for use at a destination node for transferring data from a source node, the method comprising: establishing one or more connections with the source node; sending to the source node a request for a data stream, the request including control information to be applied at the source node, the control information including a number of degrees of freedom (DoFs) or frames to be transmitted across each of the one or more connections; and receiving one or more coded frames through the data stream over the one or more connections.
In some embodiments, a method comprises: transmitting first data units from a source node to a destination node over a first path; receiving information about the availability of one or more second paths between the source and destination nodes; determining a cost associated with each of the one or more second paths; allocating a first number of second data units to the first path and a second number of second data units to the one or more second paths based on the determined costs; and transmitting the second data units from the source node to the destination node over the first path and/or the one or more second paths according to the allocation, wherein the first data units, the second data units, or both the first and second data units comprise network coded data.
In some embodiments, a method comprises: transmitting first data units from a source node to a destination node over a first path; receiving information about the availability of one or more second paths between the source and destination nodes; determining a cost associated with each of the one or more second paths; allocating a first number of second data units to the first path and a second number of second data units to the one or more second paths based on the determined costs; and transmitting the second data units from the source node to the destination node over the first path and/or the one or more second paths according to the allocation, wherein the first data units, the second data units, or both the first and second data units comprise network coded data.
H04L 29/06 - Commande de la communication; Traitement de la communication caractérisés par un protocole
H04L 12/707 - Prévention ou récupération du défaut de routage, p.ex. reroutage, redondance de route "virtual router redundancy protocol" [VRRP] ou "hot standby router protocol" [HSRP] par redondance des chemins d’accès
H04W 76/15 - Établissement de connexions à liens multiples sans fil
Multipath coding systems, devices and methods are disclosed. In a multipath network, devices and methods generate at least one of a plurality of uncoded packets for transmission on a first path from a source node to a destination node as well as at least one coded packet based upon a set of uncoded packets for transmission on a second path from the source node to the destination node. The set of uncoded packets are formed, generated or otherwise provided from a next uncoded packet to be transmitted, a number (α) of previously transmitted uncoded packets, and a number (β) of uncoded packets that are to be transmitted after the next uncoded packet and α+β is greater than zero. The destination node operates to receive, and decode as needed, the uncoded and coded packets.
A network node having a receiver for receiving input packets, a local node memory where one or more parameters for coding are stored, an encoder for creating coded packets from the input packets using linear network coding, and a transmitter to transmit the coded packets. Each coefficient of the linear network coding is a parameter of the one or more parameters or a pre-determined function of the one or more parameters. A related method and a network are also presented.
H04L 12/931 - Architecture de matrice de commutation
H03M 13/00 - Codage, décodage ou conversion de code pour détecter ou corriger des erreursHypothèses de base sur la théorie du codageLimites de codageMéthodes d'évaluation de la probabilité d'erreurModèles de canauxSimulation ou test des codes
H04L 12/24 - Dispositions pour la maintenance ou la gestion
H04L 12/935 - Interfaces de commutation, p.ex. détails de port
7.
LINEAR NETWORK CODING WITH PRE-DETERMINED COEFFICIENT GENERATION THROUGH PARAMETER INITIALIZATION AND REUSE
A network node having a receiver for receiving input packets, a local node memory where one or more parameters for coding are stored, an encoder for creating coded packets from the input packets using linear network coding, and a transmitter to transmit the coded packets. Each coefficient of the linear network coding is a parameter of the one or more parameters or a pre-determined function of the one or more parameters. A related method and a network are also presented.
A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.
H04L 1/00 - Dispositions pour détecter ou empêcher les erreurs dans l'information reçue
H04L 1/16 - Dispositions pour détecter ou empêcher les erreurs dans l'information reçue en utilisant un canal de retour dans lesquelles le canal de retour transporte des signaux de contrôle, p. ex. répétition de signaux de demande
H04L 1/18 - Systèmes de répétition automatique, p. ex. systèmes Van Duuren
H04L 65/65 - Protocoles de diffusion en flux de paquets multimédias, p. ex. protocole de transport en temps réel [RTP] ou protocole de commande en temps réel [RTCP]
10.
System and technique for sliding window network coding-based packet generation
A method and apparatus decode packetized data in the presence of packet erasures using a finite sliding window technique. A decoder receives packets containing uncoded and coded symbols. When a packet with a coded symbol is received, the decoder determines whether a packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than a decoder sequence number, where the number w is fixed prior to encoding. When this is the case, the decoder decodes the coded symbol into one or more of the w input symbols using the coefficient vector. Decoding may use a forward error correcting (FEC) window within the finite sliding window. Decoding also may use a technique of Gaussian elimination to produce a “shifted” row echelon coefficient matrix.
Multipath coding systems, devices and methods are disclosed. In a multipath network, devices and methods generate at least one of a plurality of uncoded packets for transmission on a first path from a source node to a destination node as well as at least one coded packet based upon a set of uncoded packets for transmission on a second path from the source node to the destination node. The set of uncoded packets are formed, generated or otherwise provided from a next uncoded packet to be transmitted, a number (α) of previously transmitted uncoded packets, and a number (β) of uncoded packets that are to be transmitted after the next uncoded packet and α +β is greater than zero. The destination node operates to receive, and decode as needed, the uncoded and coded packets.
A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.
A method and apparatus decode packetized data in the presence of packet erasures using a finite sliding window technique. A decoder receives packets containing uncoded and coded symbols. When a packet with a coded symbol is received, the decoder determines whether a packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than a decoder sequence number, where the number w is fixed prior to encoding. When this is the case, the decoder decodes the coded symbol into one or more of the w input symbols using the coefficient vector. Decoding may use a forward error correcting (FEC) window within the finite sliding window. Decoding also may use a technique of Gaussian elimination to produce a "shifted" row echelon coefficient matrix.
Described herein is a method and system for wireless data transmission with network coding which limits encryption operations to a critical set of network coding coefficients in combination with multi-resolution and/or multi-description video coding. Such a method and system achieves hierarchical fidelity levels, robustness against wireless packet loss and efficient security by exploiting the algebraic structure of network coding.
H04N 21/647 - Signalisation de contrôle entre des éléments du réseau et serveur ou clientsProcédés réseau pour la distribution vidéo entre serveur et clients, p. ex. contrôle de la qualité du flux vidéo en éliminant des paquets, protection du contenu contre une modification non autorisée dans le réseau ou surveillance de la charge du réseau ou réalisation d'une passerelle entre deux réseaux différents, p. ex. entre réseau IP et réseau sans fil
H04N 21/6377 - Signaux de commande émis par le client et dirigés vers les éléments du serveur ou du réseau vers le serveur
H04N 21/61 - Structure physique de réseauTraitement de signal
H04N 21/2662 - Contrôle de la complexité du flux vidéo, p. ex. en mettant à l'échelle la résolution ou le débit binaire du flux vidéo en fonction des capacités du client
H04N 21/266 - Gestion de canal ou de contenu, p. ex. génération et gestion de clés et de messages de titres d'accès dans un système d'accès conditionnel, fusion d'un canal de monodiffusion de VOD dans un canal multidiffusion
H04N 21/2347 - Traitement de flux vidéo élémentaires, p. ex. raccordement de flux vidéo ou transformation de graphes de scènes du flux vidéo codé impliquant le cryptage de flux vidéo
H04N 21/2343 - Traitement de flux vidéo élémentaires, p. ex. raccordement de flux vidéo ou transformation de graphes de scènes du flux vidéo codé impliquant des opérations de reformatage de signaux vidéo pour la distribution ou la mise en conformité avec les requêtes des utilisateurs finaux ou les exigences des dispositifs des utilisateurs finaux
H04L 1/18 - Systèmes de répétition automatique, p. ex. systèmes Van Duuren
H04W 12/04 - Gestion des clés, p. ex. par architecture d’amorçage générique [GBA]
H04W 12/00 - Dispositions de sécuritéAuthentificationProtection de la confidentialité ou de l'anonymat
H04L 1/00 - Dispositions pour détecter ou empêcher les erreurs dans l'information reçue
A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.
A method, apparatus and computer program product providing improved communication performance through network coding is presented. Coded packets are formed at a source node, the coded packets comprising a combination of original packets at the source node. The coded packets are transmitted to at least one destination node using an unreliable protocol. A reconstruction is formed based on received coded packets at the destination node, wherein when a number of received coded packets are equal to the number of transmitted coded packets the forming a reconstruction comprises forming a complete reconstruction and wherein when the number of received coded packets is less than the number of transmitted coded packets the reconstruction comprises forming a best attempt at reconstruction.
A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.
H04L 12/28 - Réseaux de données à commutation caractérisés par la configuration des liaisons, p. ex. réseaux locaux [LAN Local Area Networks] ou réseaux étendus [WAN Wide Area Networks]
A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.
brevets
