Patents by Inventor Muriel Médard

Muriel Médard has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8526451
    Abstract: 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.
    Type: Grant
    Filed: February 24, 2012
    Date of Patent: September 3, 2013
    Assignees: President and Fellow of Harvard College, Universidade do Porto, Massachusetts Institute of Technology
    Inventors: Jay Kumar Sundararajan, Devavrat Shah, Muriel Medard, Michael Mitzenmacher, Joao Barros, Szymon Jakubczak
  • Patent number: 8482441
    Abstract: A functional compression scheme involves determining a minimal entropy coloring of a characteristic graph of a random variable. Various scenarios are disclosed where the determination of the minimal entropy coloring of a characteristic graph is easy and tractable.
    Type: Grant
    Filed: June 1, 2012
    Date of Patent: July 9, 2013
    Assignee: Massachusetts Institute of Technology
    Inventors: Muriel Médard, Soheil Feizi-Khankandi
  • Patent number: 8473998
    Abstract: A method, apparatus and computer program product for utilizing network coding for multi-resolution multicast is presented. A network source partitions source content into a base layer and one or more refinement layers. The network source receives a respective one or more push-back messages from one or more network destination receivers, the push-back messages identifying the one or more refinement layers suited for each one of the one or more network destination receivers. The network source computes a network code involving the base layer and the one or more refinement layers for at least one of the one or more network destination receivers, and transmits the network code to the one or more network destination receivers in accordance with the push-back messages.
    Type: Grant
    Filed: July 29, 2010
    Date of Patent: June 25, 2013
    Assignee: Massachusetts Institute of Technology
    Inventors: Daniel E. Lucani, Minji Kim, Fang Zhao, Xiaomeng Shi, Muriel Medard, Marie-Jose Montpetit
  • Patent number: 8451756
    Abstract: Subject matter disclosed herein relates to random linear network coding schemes for reliable communications for time division duplexing channels. In at least one embodiment, a transmitter node transmits M data packets through a half-duplex link using random linear network coding. The transmitter node transmits coded packets back-to-back through the link before stopping to wait for an acknowledgement (ACK) packet. An optimal number of coded packets Ni to be transmitted in a subsequent transmission may then be determined based, at least in part, on a number of degrees of freedom (DOFs) a receiving node needs to decode the M information packets from received coded packets.
    Type: Grant
    Filed: May 15, 2012
    Date of Patent: May 28, 2013
    Assignee: Massachusetts Institute of Technology
    Inventors: Daniel E. Lucani, Milica Stojanovic, Muriel Medard
  • Publication number: 20130114481
    Abstract: A coding approach for a robust and flexible network communication protocol is described. By using coding, it is possible to eliminate the need to track packet identities, and hence, it is possible to reduce coordination overhead associated with many conventional protocols. The method and system described herein takes advantage of multiple paths, interfaces, mediums, servers, and storage locations available in a network. The proposed protocol allows quick response to congestion by load balancing over different network resources. The method also enables soft vertical hand-overs across heterogeneous networks. In one embodiment, a media file is divided into chunks and transmitted using a transport protocol tailored to meet delay requirements of media streaming applications. Also described are different coding strategies for chunk delivery based upon an urgency level of each chunk.
    Type: Application
    Filed: November 8, 2011
    Publication date: May 9, 2013
    Applicant: Massachusetts Institute of Technology
    Inventors: Minji Kim, Muriel Medard, Ali Parandehgheibi
  • Publication number: 20130107764
    Abstract: 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.
    Type: Application
    Filed: October 18, 2012
    Publication date: May 2, 2013
    Inventors: Linda M. Zeger, Muriel Medard, Arman Rezaee
  • Patent number: 8375102
    Abstract: 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.
    Type: Grant
    Filed: October 6, 2011
    Date of Patent: February 12, 2013
    Assignee: Massachusetts Institute of Technology
    Inventors: Muriel Medard, Supratim Deb, Ralf Koetter
  • Patent number: 8352602
    Abstract: An access server generates a handshake with storage servers resulting in more rapid access to the stored data, for example, video data, by a user. The handshake also results in load balancing effects.
    Type: Grant
    Filed: June 30, 2010
    Date of Patent: January 8, 2013
    Assignee: Juniper Networks, Inc.
    Inventors: Muriel Medard, Mark Aikens, Louis M. Colon, Jr., James M. Hurley, Michael Kilian, Matthew McShane, Michael Warres, Robert W. Scheifler
  • Publication number: 20120307920
    Abstract: A functional compression scheme involves determining a minimal entropy coloring of a characteristic graph of a random variable. Various scenarios are disclosed where the determination of the minimal entropy coloring of a characteristic graph is easy and tractable.
    Type: Application
    Filed: June 1, 2012
    Publication date: December 6, 2012
    Applicant: Massachusetts Institute of Technology
    Inventors: Muriel Médard, Soheil Feizi-Khankandi
  • Patent number: 8279781
    Abstract: 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.
    Type: Grant
    Filed: August 28, 2009
    Date of Patent: October 2, 2012
    Assignee: Massachusetts Institute of Technology
    Inventors: Daniel E. Lucani, Milica Stojanovic, Muriel Medard
  • Publication number: 20120236763
    Abstract: Subject matter disclosed herein relates to random linear network coding schemes for reliable communications for time division duplexing channels. In at least one embodiment, a transmitter node transmits M data packets through a half-duplex link using random linear network coding. The transmitter node transmits coded packets back-to-back through the link before stopping to wait for an acknowledgement (ACK) packet. An optimal number of coded packets Ni to be transmitted in a subsequent transmission may then be determined based, at least in part, on a number of degrees of freedom (DOFs) a receiving node needs to decode the M information packets from received coded packets.
    Type: Application
    Filed: May 15, 2012
    Publication date: September 20, 2012
    Applicant: Massachusetts Institute of Technology
    Inventors: Daniel E. Lucani, Milica Stojanovic, Muriel Medard
  • Publication number: 20120218891
    Abstract: 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.
    Type: Application
    Filed: February 24, 2012
    Publication date: August 30, 2012
    Inventors: Jay Kumar Sundararajan, Devavrat Shah, Muriel Medard, Michael Mitzenmacher, Joao Barros, Szymon Jakubczak
  • Publication number: 20120096124
    Abstract: 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.
    Type: Application
    Filed: October 6, 2011
    Publication date: April 19, 2012
    Inventors: Muriel Medard, Supratim Deb, Ralf Koetter
  • Patent number: 8130776
    Abstract: 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.
    Type: Grant
    Filed: August 28, 2009
    Date of Patent: March 6, 2012
    Assignee: Massachusetts Institute of Technology
    Inventors: Jay Kumar Sundararajan, Devavrat Shah, Muriel Medard, Michael Mitzenmacher, Joao Barros, Szymon Jakubczak
  • Patent number: 8126235
    Abstract: In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided.
    Type: Grant
    Filed: April 6, 2009
    Date of Patent: February 28, 2012
    Assignee: Massachusetts Institute of Technology
    Inventors: Xiaomeng Shi, Muriel Medard, Ralf Koetter, Nuala Ann Koetter, legal representative, Desmond S. Lun
  • Patent number: 8102837
    Abstract: A method, apparatus and computer program product for providing rapid information dissemination using network coding is presented. A coded message including a payload and a code vector, is transmitted from a first node of the network to a second node of the network. The information thus stored can also be retrieved by collecting code vectors from at least one node and viewing the collected code vectors as a matrix. A determination is made regarding whether a dimension of the matrix is equal to a predefined number. When the dimension of the matrix equals the predefined number, the information is retrieved using the collection of code vectors in the matrix.
    Type: Grant
    Filed: December 30, 2004
    Date of Patent: January 24, 2012
    Assignee: Massachusetts Institute of Technology
    Inventors: Supratim Deb, Muriel Medard
  • Patent number: 8068426
    Abstract: A method, apparatus and computer program product for feedback-based online network coding is presented. In one embodiment, a transmitting node determines a linear combination of packets to transmit from a transmit queue. The transmitting node transmits the linear combination of packets. The transmitting node determines whether a packet can be removed from the transmit queue, wherein when a determination is made that a packet can be removed from the transmit queue then removing the packet from the transmit queue, and when a determination is made that a packet cannot be removed from the transmit queue then refraining from removing the packet from the transmit queue.
    Type: Grant
    Filed: May 29, 2009
    Date of Patent: November 29, 2011
    Assignee: Massachusetts Institute of Technology
    Inventors: Jay Kumar Sundararajan, Devavrat Shah, Muriel Medard, Parastoo Sadeghi
  • Patent number: 8046426
    Abstract: 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.
    Type: Grant
    Filed: December 30, 2004
    Date of Patent: October 25, 2011
    Assignee: Massachusetts Institute of Technology
    Inventors: Muriel Medard, Supratim Deb, Ralf Koetter
  • Publication number: 20110243324
    Abstract: Described herein is a method and system for hierarchical wireless video with network coding which limits encryption operations to a critical set of network coding coefficients in combination with multi-resolution 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.
    Type: Application
    Filed: March 25, 2011
    Publication date: October 6, 2011
    Inventors: Luisa Lima, Steluta Gheorghiu, Joao Barros, Muriel Medard, Alberto Lopez Toledo
  • Publication number: 20110131326
    Abstract: An access server generates a handshake with storage servers resulting in more rapid access to the stored data, for example, video data, by a user. The handshake also results in load balancing effects.
    Type: Application
    Filed: June 30, 2010
    Publication date: June 2, 2011
    Applicant: Blackwave, Inc.
    Inventors: Muriel Medard, Mark Aikens, Louis M. Colon, JR., James M. Hurley, Michael Kilian, Matthew McShane, Michael Warres, Robert W. Scheifler