Patents by Inventor Soren Lassen
Soren Lassen 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: 9240810Abstract: A method for processing a chain reaction code includes first selecting a source symbol which is associated with an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.Type: GrantFiled: August 28, 2009Date of Patent: January 19, 2016Assignee: Digital Fountain, Inc.Inventors: Amin Shokrollahi, Soren Lassen, Richard Karp
-
Patent number: 9236976Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.Type: GrantFiled: May 17, 2010Date of Patent: January 12, 2016Assignee: Digital Fountain, Inc.Inventors: M. Amin Shokrollahi, Soren Lassen, Michael G. Luby
-
Publication number: 20140237090Abstract: A method includes: determining a maintenance update for a data service tier based on a service condition of a data service of a target host server; selecting a spare host server to perform the maintenance update; performing the maintenance update of the data service tier to the spare host server; activating the data service on the spare host server; and redirecting client request traffic to the spare host server.Type: ApplicationFiled: February 15, 2013Publication date: August 21, 2014Applicant: Facebook, Inc.Inventors: Soren Lassen, Guanghao Shen, Iain Becker
-
Patent number: 8495233Abstract: Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.Type: GrantFiled: February 7, 2012Date of Patent: July 23, 2013Assignee: Digital Fountain, Inc.Inventors: Soren Lassen, Gavin Horn, Jeffrey J. Persch, Michael G. Luby, Armin Haken
-
Patent number: 8458567Abstract: In a transport system, data is reliably transported from a sender to a receiver by organizing the data to be transported into data blocks, wherein each data block comprises a plurality of encoding units, transmitting encoding units of a first data block from the sender to the receiver, and detecting, at the sender, acknowledgments of receipt of encoding units by the receiver. At the sender, a probability that the receiver received sufficient encoding units of the first data block to recover the first data block at the receiver is detected and the probability is tested against a threshold probability to determine whether a predetermined test is met. Following the step of testing and prior to the sender receiving confirmation of recovery of the first data block at the receiver, when the predetermined test is met, transmitting encoding units of a second data block from the sender.Type: GrantFiled: October 31, 2008Date of Patent: June 4, 2013Assignee: Digital Fountain, Inc.Inventors: Michael Luby, Matt Doucleff, Avi Wigderson, Soren Lassen
-
Publication number: 20130114439Abstract: Network traffic is monitored and an optimal framing heuristic is automatically determined and applied. Framing heuristics specify different rules for framing network traffic. While a framing heuristic is applied to the network traffic, alternative framing heuristics are speculatively evaluated for the network traffic. The results of these evaluations are used to rank the framing heuristics. The framing heuristic with the best rank is selected for framing subsequent network traffic. Each client/server traffic flow may have a separate framing heuristic. The framing heuristics may be deterministic based on byte count and/or time or based on traffic characteristics that indicate a plausible point for framing to occur.Type: ApplicationFiled: June 7, 2012Publication date: May 9, 2013Applicant: Riverbed Technology, Inc.Inventors: David Tze-Si Wu, Soren Lassen, Kartik Subbana, Nitin Gupta, Vivasvat Keswani
-
Publication number: 20120136973Abstract: Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.Type: ApplicationFiled: February 7, 2012Publication date: May 31, 2012Applicant: DIGITAL FOUNTAIN, INC.Inventors: Soren Lassen, Gavin Horn, Jeffrey J. Persch, Michael G. Luby, Armin Haken
-
Patent number: 8122139Abstract: Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.Type: GrantFiled: February 12, 2009Date of Patent: February 21, 2012Assignee: QUALCOMM IncorporatedInventors: Soren Lassen, Gavin Horn, Jeffrey J. Persch, Armin Haken, Michael G. Luby
-
Publication number: 20110103519Abstract: A method for processing a chain reaction code includes first selecting a source symbol which is associated with an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.Type: ApplicationFiled: August 28, 2009Publication date: May 5, 2011Applicant: QUALCOMM IncorporatedInventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
-
Publication number: 20110019769Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.Type: ApplicationFiled: May 17, 2010Publication date: January 27, 2011Applicant: QUALCOMM IncorporatedInventors: Mohammad Amin Shokrollahi, Soren Lassen, Michael G. Luby
-
Patent number: 7720174Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.Type: GrantFiled: February 13, 2006Date of Patent: May 18, 2010Assignee: Digital Fountain, Inc.Inventors: M. Amin Shokrollahi, Soren Lassen, Michael Luby
-
Patent number: 7711068Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.Type: GrantFiled: August 20, 2007Date of Patent: May 4, 2010Assignee: Digital Fountain, Inc.Inventors: M. Amin Shokrollahi, Soren Lassen, Michael Luby
-
Patent number: 7633413Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.Type: GrantFiled: August 20, 2007Date of Patent: December 15, 2009Assignee: QUALCOMM IncorporatedInventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
-
Publication number: 20090210547Abstract: Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.Type: ApplicationFiled: February 12, 2009Publication date: August 20, 2009Applicant: Digital Fountain, Inc.Inventors: Soren Lassen, Gavin Horn, Jeffrey J. Persch, Armin Haken, Michael G. Luby
-
Publication number: 20090144601Abstract: In a transport system, data is reliably transported from a sender to a receiver by organizing the data to be transported into data blocks, wherein each data block comprises a plurality of encoding units, transmitting encoding units of a first data block from the sender to the receiver, and detecting, at the sender, acknowledgments of receipt of encoding units by the receiver. At the sender, a probability that the receiver received sufficient encoding units of the first data block to recover the first data block at the receiver is detected and the probability is tested against a threshold probability to determine whether a predetermined test is met. Following the step of testing and prior to the sender receiving confirmation of recovery of the first data block at the receiver, when the predetermined test is met, transmitting encoding units of a second data block from the sender.Type: ApplicationFiled: October 31, 2008Publication date: June 4, 2009Applicant: Digital Fountain, Inc.Inventors: Michael Luby, Matt Doucleff, Avi Wigderson, Soren Lassen
-
Patent number: 7512697Abstract: Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.Type: GrantFiled: September 26, 2005Date of Patent: March 31, 2009Assignee: Digital Fountain, Inc.Inventors: Soren Lassen, Gavin Horn, Jeffrey J. Persch, Armin Haken, Michael G. Luby
-
Publication number: 20080309525Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.Type: ApplicationFiled: August 20, 2007Publication date: December 18, 2008Applicant: Digital Fountain, Inc.Inventors: M. Amin Shokrollahi, Soren Lassen, Michael Luby
-
Patent number: 7447235Abstract: In a transport system, data is reliably transported from a sender to a receiver by organizing the data to be transported into data blocks, wherein each data block comprises a plurality of encoding units, transmitting encoding units of a first data block from the sender to the receiver, and detecting, at the sender, acknowledgments of receipt of encoding units by the receiver. At the sender, a probability that the receiver received sufficient encoding units of the first data block to recover the first data block at the receiver is detected and the probability is tested against a threshold probability to determine whether a predetermined test is met. Following the step of testing and prior to the sender receiving confirmation of recovery of the first data block at the receiver, when the predetermined test is met, transmitting encoding units of a second data block from the sender.Type: GrantFiled: October 8, 2004Date of Patent: November 4, 2008Assignee: Digital Fountain, Inc.Inventors: Michael Luby, Matt Doucleff, Avi Wigderson, Soren Lassen
-
Publication number: 20080169945Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.Type: ApplicationFiled: August 20, 2007Publication date: July 17, 2008Applicant: Digital Fountain, Inc.Inventors: M. Amin Shokrollahi, Richard Karp, Soren Lassen
-
Publication number: 20080086751Abstract: A media object is scheduled for transmission between a server and a client. The media object is partitioned into segments of blocks, wherein each block is a unit of media for which a client will wait to receive an entire block before playing out the block, and wherein each segment includes an integer number of blocks. One or more channels on which to serve each segment are determined, and a rate at which to serve each segment is determined. Additionally, a schedule pair for each channel is determined. The schedule pair includes a time at which the client may start receiving on the channel and a time at which the client may stop receiving on the channel.Type: ApplicationFiled: June 1, 2007Publication date: April 10, 2008Applicant: Digital Fountain, Inc.Inventors: Gavin Horn, Michael Luby, Jens Rasmussen, Per Knudsgaard, Soren Lassen