专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US6047331A Method and apparatus for automatic protection switching 失效
标题翻译：自动保护切换方法及装置
公开(公告)号：US6047331A
公开(公告)日：2000-04-04
申请号：US803169
申请日：1997-02-19
申请人： Muriel Medard , Steven G. Finn , Richard A. Barry , Robert G. Gallager
发明人： Muriel Medard , Steven G. Finn , Richard A. Barry , Robert G. Gallager
IPC分类号： H04L12/56 , H04L29/14 , G06F13/00
CPC分类号： H04L45/48 , H04L45/00 , H04L45/28 , H04L69/40
摘要： A method and apparatus for generating first and second tree topologies for any source node in a network which can be represented as a node or an edge redundant graph, such that any node in the graph remains connected to the source node via at least one tree even after the failure of a node or an edge. This technique provides a recovery mechanism upon detection of a failure in a network.
摘要翻译：一种用于为网络中的任何源节点生成可被表示为节点或边缘冗余图的第一和第二树拓扑的方法和装置，使得图中的任何节点仍然通过至少一棵树连接到源节点在节点或边缘发生故障之后。该技术在检测到网络中的故障时提供恢复机制。

2. 发明授权

US06728205B1 Method and apparatus for automatic protection switching 失效
标题翻译：自动保护切换方法及装置
公开(公告)号：US06728205B1
公开(公告)日：2004-04-27
申请号：US09018354
申请日：1998-02-04
申请人： Steven G. Finn , Muriel Medard , Richard A. Barry
发明人： Steven G. Finn , Muriel Medard , Richard A. Barry
IPC分类号： H04L1226
CPC分类号： H04L45/48 , H04L45/00 , H04L45/28 , H04L69/40
摘要： A Bi-directional Link Self-healing Network (BLSN) for implementing bi-directional link automatic protection switching (APS) for an arbitrary edge or node redundant network and a technique for implementing APS recovery in response to an edge or node failure in a network is described. The BLSN technique does not require permanent allocation of spare capacity for each connection and allows sharing of capacity among many network connections by allocating capacity for use only in the event of a failure. The described technique allows loopback protection to be performed over node or edge redundant networks and operates such that the remains connected after the failure of a node or an edge in the network. The technique makes use of connected directed subgraphs of the network. Also described are techniques for generating the directed subgraphs on node and edge redundant networks having an arbitrary network topology.
摘要翻译：用于实现任意边缘或节点冗余网络的双向链路自动保护倒换（APS）的双向链路自愈网络（BLSN）以及响应于网络边缘或节点故障实现APS恢复的技术被描述。 BLSN技术不需要为每个连接永久分配剩余容量，并且允许通过仅在发生故障时分配容量才能在许多网络连接之间共享容量。所描述的技术允许在节点或边缘冗余网络上执行环回保护，并且操作使得其在网络中的节点或边缘的故障之后保持连接。该技术利用网络的连接的定向子图。还描述了用于在具有任意网络拓扑的节点和边缘冗余网络上生成有向子图的技术。

3. 发明申请

US20150358973A1 Joint Use Of Multi-Packet Reception And Network Coding For Performance Improvement 有权
标题翻译：联合使用多分组接收和网络编码进行性能改进
公开(公告)号：US20150358973A1
公开(公告)日：2015-12-10
申请号：US13654953
申请日：2012-10-18
申请人： Linda M. Zeger , Jason M. Cloud , Muriel Medard
发明人： Linda M. Zeger , Jason M. Cloud , Muriel Medard
IPC分类号： H04W72/04 , H04B7/155 , H04W28/08 , H04W72/10
CPC分类号： H04L5/16 , H04B7/155 , H04L1/0057 , H04L1/0075 , H04L1/0076 , H04L63/0428 , H04L63/12 , H04W28/08 , H04W72/0466 , H04W72/0493 , H04W72/10 , H04W72/1263
摘要： Network coding and multiple packet reception (MPR) are used together in a wireless network. In at least one implementation, a novel medium access control (MAC) protocol is provided that enhances throughput in a wireless mesh network that uses network coding and MPR by providing fairness to information flows, rather than fairness to individual nodes.
摘要翻译：无线网络中一起使用网络编码和多分组接收（MPR）。在至少一个实现中，提供了一种新颖的介质访问控制（MAC）协议，其通过向信息流提供公平性而不是对各个节点的公平性来增强使用网络编码和MPR的无线网状网络中的吞吐量。

4. 发明授权

US09143274B2 Traffic backfilling via network coding in a multi-packet reception network 有权
标题翻译：通过多分组接收网络中的网络编码进行业务回填
公开(公告)号：US09143274B2
公开(公告)日：2015-09-22
申请号：US13654866
申请日：2012-10-18
申请人： Linda M. Zeger , Muriel Medard , Arman Rezaee
发明人： Linda M. Zeger , Muriel Medard , Arman Rezaee
IPC分类号： H04L5/16 , H04L1/00 , H04L29/06
CPC分类号： H04L5/16 , H04B7/155 , H04L1/0057 , H04L1/0075 , H04L1/0076 , H04L63/0428 , H04L63/12 , H04W28/08 , H04W72/0466 , H04W72/0493 , H04W72/10 , H04W72/1263
摘要： Network coding and multiple packet reception (MPR) are used together to improve message dissemination speed in a wireless network using half duplex communication. In at least one embodiment, MPR is used to initially distribute data packets from a number of source nodes in the network to the other nodes of the network. Network coding techniques may then be used to perform backfilling within the network to supply data packets to the source nodes that were originally missed due to the half duplex constraint.
摘要翻译：一起使用网络编码和多分组接收（MPR）来改善使用半双工通信的无线网络中的消息传播速度。在至少一个实施例中，MPR用于初始地将数据分组从网络中的多个源节点分发到网络的其他节点。然后网络编码技术可用于在网络内执行回填，以将数据分组提供给由于半双工约束而原先被忽略的源节点。

5. 发明授权

US08891593B1 Peaky binning relaying scheme for wideband/low signal-to-noise ratio (SNR) wireless communications 有权
标题翻译：用于宽带/低信噪比（SNR）无线通信的峰值合并中继方案
公开(公告)号：US08891593B1
公开(公告)日：2014-11-18
申请号：US13226221
申请日：2011-09-06
申请人： Nadia Fawaz , Muriel Medard
发明人： Nadia Fawaz , Muriel Medard
IPC分类号： H04B7/15 , H04L25/20
CPC分类号： H04B1/7163 , H04B7/15592
摘要： A method, apparatus and computer program product for a peaky binning Relaying Scheme for Wideband/Low Signal-To-Noise Ratio (SNR) Wireless Communications is presented. In a computer system having a source node (S), a relay node (R) and a destination node (D), the method includes transmitting by S a message (m), wherein a first subset of m (m1) is transmitted to R and wherein a second subset of m (m2) is transmitted to D. The method further includes decoding by R a bin index from the m1 and forwarding the bin index to D. Additionally the method includes receiving the bin index at D and decoding the bin index and receiving at D the m2 and decoding the m2. The method also includes determining by D the value of m from decoded values of the bin index and the m2.
摘要翻译：提出了一种用于宽带/低信噪比（SNR）无线通信的峰值合并中继方案的方法，装置和计算机程序产品。在具有源节点（S），中继节点（R）和目的地节点（D）的计算机系统中，该方法包括由S发送消息（m），其中m（m1）的第一子集被发送到 R，并且其中m（m2）的第二子集被发送到D.该方法还包括通过R从m1解码bin索引并将bin索引转发到D.另外该方法包括在D处接收bin索引并对 bin索引并在D处接收m2并解码m2。该方法还包括根据二进制索引和m2的解码值确定D的值。

6. 发明申请

US20140269505A1 Wireless Reliability Architecture And Methods Using Network Coding 有权
标题翻译：无线可靠性架构和使用网络编码的方法
公开(公告)号：US20140269505A1
公开(公告)日：2014-09-18
申请号：US14013330
申请日：2013-08-29
申请人： Muriel Medard , Xiaomeng Shi , Marie-Jose Montpetit , Surat Teerapittayanon , Kerim Fouli
发明人： Muriel Medard , Xiaomeng Shi , Marie-Jose Montpetit , Surat Teerapittayanon , Kerim Fouli
IPC分类号： H04W28/04 , H04W40/00
CPC分类号： H04W4/06 , H04L1/0011 , H04L1/0077 , H04W28/04 , H04W40/00
摘要： Network-coding-enabled reliability architectures and techniques are provided that are capable of enhancing data transfer reliability and efficiency in next generation wireless networks. In some embodiments, the techniques and architectures utilize a flexible thread-based coding approach to implement network coding. The techniques and architectures may also, or alternatively, utilize systematic intra-session random linear network coding as a packet erasure code to support reliable data transfer.
摘要翻译：提供了支持网络编码的可靠性架构和技术，能够增强下一代无线网络中的数据传输可靠性和效率。在一些实施例中，技术和架构利用基于线程的灵活编码方法实现网络编码。技术和架构还可以或者可选地利用系统的会话内随机线性网络编码作为分组擦除代码来支持可靠的数据传输。

7. 发明授权

US08279781B2 Random linear network coding for time division duplexing 有权
标题翻译：用于时分双工的随机线性网络编码
公开(公告)号：US08279781B2
公开(公告)日：2012-10-02
申请号：US12549725
申请日：2009-08-28
申请人： Daniel E. Lucani , Milica Stojanovic , Muriel Medard
发明人： Daniel E. Lucani , Milica Stojanovic , Muriel Medard
IPC分类号： H04B1/56 , H04L5/16 , H04L12/66
CPC分类号： H04L1/1671 , H04L1/0041 , H04L1/0052 , H04L2001/0097
摘要： A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. Provided herein is an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. It is shown that its performance is very close to that of a full-duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also described herein is the throughput performance of the novel system and technique along with a comparison to existing half-duplex Go-back-N and Selective Repeat ARQ schemes. Numerical results, obtained for different latencies, show that the novel system and technique described herein has similar performance to the Selective Repeat in most cases and considerable performance gain when latency and packet error probability is high.
摘要翻译：提出了一种用于时分双工通道的可靠通信的新的随机线性网络编码方案。该设置假定分组擦除信道，并且节点不能同时发送和接收信息。发送方在停止之前背靠背传送编码数据包，等待接收方确认（ACK）正确解码信息所需的自由度数（ACK）。这里提供了对该问题的分析，以示出在平均完成时间之前，在停止监听之前发送最佳数量的编码数据分组。该数量取决于延迟，分组擦除和ACK擦除的概率，以及接收机对数据进行解码所需的自由度的数量。该方案在完成固定数量数据包的传输的平均时间方面是最佳的。显示其性能非常接近于全双工系统，而传输不同数量的编码数据包可能会导致性能下降，特别是在延迟较高的情况下。这里还描述了新颖的系统和技术的吞吐量性能以及与现有的半双工Go-back-N和选择性重复ARQ方案的比较。对于不同的延迟获得的数值结果表明，在大多数情况下，本文描述的新颖系统和技术具有与选择性重复相似的性能，并且当等待时间和分组错误概率高时具有相当的性能增益。

8. 发明申请

US20120218891A1 METHOD AND APPARATUS PROVIDING NETWORK CODING BASED FLOW CONTROL 有权
标题翻译：提供基于网络编码的流量控制的方法和装置
公开(公告)号：US20120218891A1
公开(公告)日：2012-08-30
申请号：US13404533
申请日：2012-02-24
申请人： Jay Kumar Sundararajan , Devavrat Shah , Muriel Medard , Michael Mitzenmacher , Joao Barros , Szymon Jakubczak
发明人： Jay Kumar Sundararajan , Devavrat Shah , Muriel Medard , Michael Mitzenmacher , Joao Barros , Szymon Jakubczak
IPC分类号： H04L12/26 , H04L12/56
CPC分类号： H04L47/27 , H04L47/12 , H04L47/15 , H04L47/193 , H04L47/22 , H04L47/283
摘要： A method, apparatus and computer program product for providing network based flow control is presented. A linear combination of packets to transmit from a transmit queue is determined. The linear combination of packets is transmitted across a network using a sliding window protocol. An acknowledgement (ACK) is generated, wherein a packet is acknowledged when a receiving node receives the linear combination of packets and determines which packet of the linear combination of packets has been newly seen.
摘要翻译：提出了一种用于提供基于网络的流量控制的方法，装置和计算机程序产品。确定从发送队列发送的分组的线性组合。数据包的线性组合通过使用滑动窗口协议的网络传输。产生确认（ACK），其中当接收节点接收到分组的线性组合时确认分组，并确定已经新看到分组的线性组合的分组。

9. 发明申请

US20120096124A1 RANDOM LINEAR CODING APPROACH TO DISTRIBUTED DATA STORAGE 有权
标题翻译：分布式数据存储的随机线性编码方法
公开(公告)号：US20120096124A1
公开(公告)日：2012-04-19
申请号：US13267764
申请日：2011-10-06
申请人： Muriel Medard , Supratim Deb , Ralf Koetter
发明人： Muriel Medard , Supratim Deb , Ralf Koetter
IPC分类号： G06F15/16
CPC分类号： H04L67/1095 , G06F17/30209 , H04L67/104
摘要： A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.
摘要翻译：提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。文件被分成多个部分。对于每个对等体（对等体意味着具有有限存储空间的存储位置），确定对等体可以存储的编码的数量。每个编码片段通过采用整个文件的所有片段的随机线性组合来确定。为每个编码块存储关联码矢量。通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。当矩阵的维数等于文件的数量时，使用矩阵中的代码向量的集合来恢复文件。

10. 发明授权

US08046426B2 Random linear coding approach to distributed data storage 有权
标题翻译：随机线性编码方法分布式数据存储
公开(公告)号：US08046426B2
公开(公告)日：2011-10-25
申请号：US11026550
申请日：2004-12-30
申请人： Muriel Medard , Supratim Deb , Ralf Koetter
发明人： Muriel Medard , Supratim Deb , Ralf Koetter
IPC分类号： G06F15/16
CPC分类号： H04L67/1095 , G06F17/30209 , H04L67/104
摘要： A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.
摘要翻译：提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。文件被分成多个部分。对于每个对等体（对等体意味着具有有限存储空间的存储位置），确定对等体可以存储的编码的数量。每个编码片段通过采用整个文件的所有片段的随机线性组合来确定。为每个编码块存储关联码矢量。通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。当矩阵的维数等于文件的数量时，使用矩阵中的代码向量的集合来恢复文件。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式