Patents by Inventor David Karger
David Karger 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: 8458259Abstract: The invention relates to an apparatus for responding to data requests made by a client. The apparatus includes an input receiving a first data request that includes a sequence of nodes corresponding to a sequence of servers. The apparatus also includes decision logic determining whether the data specified in the data request is available on a selected server, and if the data is not available determining a next node from the sequence of nodes. The apparatus also includes a mapper mapping a server to the next node, and an output requesting the data by transmitting a second data request to the server mapped to the next node.Type: GrantFiled: December 23, 2011Date of Patent: June 4, 2013Assignee: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Publication number: 20120124214Abstract: The invention relates to an apparatus for responding to data requests made by a client. The apparatus includes an input receiving a first data request that includes a sequence of nodes corresponding to a sequence of servers. The apparatus also includes decision logic determining whether the data specified in the data request is available on a selected server, and if the data is not available determining a next node from the sequence of nodes. The apparatus also includes a mapper mapping a server to the next node, and an output requesting the data by transmitting a second data request to the server mapped to the next node.Type: ApplicationFiled: December 23, 2011Publication date: May 17, 2012Applicant: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Patent number: 8103767Abstract: The invention relates to a method and apparatus for distributing a request to one of a plurality of resources. A request is mapped to a location in circular mapping space using a hash function. Each of the plurality of resources is mapped to a respective location or locations in the circular mapping space. The request is allocated to one of the resources based on the given request location and the resource location in the circular mapping space.Type: GrantFiled: January 16, 2009Date of Patent: January 24, 2012Assignee: Massachusetts Intitute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Patent number: 7706365Abstract: A network and a method for transmitting processes in a network are disclosed, where a randomized coding approach is provided. Network nodes transmit on each outgoing link a linear combination of incoming signals, specified by independently and randomly chosen code coefficients from a finite field. The approach allows robust, distributed transmission and compression of information in networks and is advantageous over routing-based approaches.Type: GrantFiled: November 17, 2004Date of Patent: April 27, 2010Assignees: California Institute of Technology, Massachusetts Institute of Technology, Board of Trustees of the University of IllinoisInventors: Michelle Effros, Tracey Ho, David Karger, Ralf Koetter, Muriel Medard
-
Publication number: 20090248874Abstract: The invention relates to a method and apparatus for distributing a request to one of a plurality of resources. A request is mapped to a location in mathematical mapping space. Each of the plurality of resources is mapped to a respective location or locations in the mathematical mapping space. The request is allocated to one of the resources based on a mathematical relationship between the request location and the resource location in the mathematical mapping space. An apparatus for distributing a request to one of a plurality of resources includes the plurality of resources and an input receiving a resource request. A mapper in communication with the input maps the request to a request location in a mathematical mapping space and maps each of the plurality of resources to at least one resource locations in the mathematical mapping space.Type: ApplicationFiled: January 16, 2009Publication date: October 1, 2009Applicant: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Patent number: 7580451Abstract: Methods, systems, devices, and computer program products for decoding of Walsh codewords are disclosed.Type: GrantFiled: October 5, 2006Date of Patent: August 25, 2009Assignee: Vanu, Inc.Inventors: Albert M. Chan, Jon Feldman, Raghavendra Madyastha, Piotr Indyk, David Karger
-
Patent number: 7500002Abstract: The invention relates to a method for requesting data from one of a plurality of actual servers. A virtual network of servers is generated in response to a data request. A first virtual server in the virtual network is chosen randomly, and a path generated from the first virtual server to a root virtual server. At least one virtual server on the path is mapped to a respective one of the plurality of actual servers and data is requested therefrom.Type: GrantFiled: November 7, 2005Date of Patent: March 3, 2009Assignee: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Publication number: 20080037615Abstract: Methods, systems, devices, and computer program products for decoding of Walsh codewords are disclosed.Type: ApplicationFiled: October 5, 2006Publication date: February 14, 2008Inventors: Albert M. Chan, Jon Feldman, Raghavendra Madyastha, Piotr Indyk, David Karger
-
Publication number: 20070288588Abstract: To serve content through a content delivery network (CDN), the CDN must have some information about the identity, characteristics and state of its target objects. Such additional information is provided in the form of object metadata, which according to the invention can be located in the request string itself, in the response headers from the origin server, in a metadata configuration file distributed to CDN servers, or in a per-customer metadata configuration file. CDN content servers execute a request identification and parsing process to locate object metadata and to handle the request in accordance therewith. Where different types of metadata exist for a particular object, metadata in a configuration file is overridden by metadata in a response header or request string, with metadata in the request string taking precedence.Type: ApplicationFiled: July 2, 2007Publication date: December 13, 2007Inventors: Joel Wein, John Kloninger, Mark Nottingham, David Karger, Philip Lisiecki
-
Publication number: 20070250560Abstract: To serve content through a content delivery network (CDN), the CDN must have some information about the identity, characteristics and state of its target objects. Such additional information is provided in the form of object metadata, which according to the invention can be located in the request string itself, in the response headers from the origin server, in a metadata configuration file distributed to CDN servers, or in a per-customer metadata configuration file. CDN content servers execute a request identification and parsing process to locate object metadata and to handle the request in accordance therewith. Where different types of metadata exist for a particular object, metadata in a configuration file is overridden by metadata in a response header or request string, with metadata in the request string taking precedence.Type: ApplicationFiled: June 27, 2007Publication date: October 25, 2007Applicant: AKAMAI TECHNOLOGIES, INC.Inventors: Joel Wein, John Kloninger, Mark Nottingham, David Karger, Philip Lisiecki
-
Publication number: 20060242299Abstract: The invention relates to a method and apparatus for distributing a request to one of a plurality of resources. A request is mapped to a location in mathematical mapping space. Each of the plurality of resources is mapped to a respective location or locations in the mathematical mapping space. The request is allocated to one of the resources based on a mathematical relationship between the request location and the resource location in the mathematical mapping space. An apparatus for distributing a request to one of a plurality of resources includes the plurality of resources and an input receiving a resource request. A mapper in communication with the input maps the request to a request location in a mathematical mapping space and maps each of the plurality of resources to at least one resource locations in the mathematical mapping space.Type: ApplicationFiled: November 7, 2005Publication date: October 26, 2006Applicant: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Patent number: 7127513Abstract: The invention relates to distributing a request to one a plurality of resources. A request is mapped to a location in mathematical mapping space. Each of the plurality of resources is mapped to a respective location or locations in the mathematical mapping space. The request is allocated to one of the resources based on a mathematical relationship between the request location and the resource location in the mathematical mapping space.Type: GrantFiled: April 16, 2003Date of Patent: October 24, 2006Assignee: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy
-
Patent number: 6963915Abstract: The invention relates to a method and apparatus for requesting data from one of a plurality of servers. A virtual network of nodes is generated in response to a data request. A first node on the virtual network of nodes is chosen randomly, and a path generated from the first node to the root on the virtual network. At least one node on the path is mapped to a respective one of the plurality of servers and data is requested from a server. The node may be mapped to the server using the method and apparatus for distributing a request to one of a plurality of resources of the present invention.Type: GrantFiled: June 3, 2002Date of Patent: November 8, 2005Assignee: Massachussetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Publication number: 20050152391Abstract: A network and a method for transmitting processes in a network are disclosed, where a randomized coding approach is provided. Network nodes transmit on each outgoing link a linear combination of incoming signals, specified by independently and randomly chosen code coefficients from a finite field. The approach allows robust, distributed transmission and compression of information in networks and is advantageous over routing-based approaches.Type: ApplicationFiled: November 17, 2004Publication date: July 14, 2005Inventors: Michelle Effros, Tracey Ho, David Karger, Ralf Koetter, Muriel Medard
-
Publication number: 20040083289Abstract: The invention relates to a method and apparatus for distributing a request to one of a plurality of resources. A request is mapped to a location in mathematical mapping space. Each of the plurality of resources is mapped to a respective location or locations in the mathematical mapping space. The request is allocated to one of the resources based on a mathematical relationship between the request location and the resource location in the mathematical mapping space. An apparatus for distributing a request to one of a plurality of resources includes the plurality of resources and an input receiving a resource request. A mapper in communication with the input maps the request to a request location in a mathematical mapping space and maps each of the plurality of resources to at least one resource locations in the mathematical mapping space.Type: ApplicationFiled: April 16, 2003Publication date: April 29, 2004Applicant: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thompson Leighton, Matthew Levine, Daniel Lewin, Rina Panograhy
-
Patent number: 6553420Abstract: The invention relates to a method and apparatus for requesting data from one of a plurality of servers. A virtual network of nodes is generated in response to a data request. A first node on the virtual network of nodes is chosen randomly, and a path generated from the first node to the root on the virtual network. At least one node on the path is mapped to a respective one of the plurality of servers and data is requested from a server. The node may be mapped to the server using the method and apparatus for distributing a request to one of a plurality of resources of the present invention.Type: GrantFiled: June 2, 1998Date of Patent: April 22, 2003Assignee: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy
-
Publication number: 20020156892Abstract: The invention relates to a method and apparatus for distributing a request to one of a plurality of resources. A request is mapped to a location in mathematical mapping space. Each of the plurality of resources is mapped to a respective location or locations in the mathematical mapping space. The request is allocated to one of the resources based on a mathematical relationship between the request location and the resource location in the mathematical mapping space. An apparatus for distributing a request to one of a plurality of resources includes the plurality of resources and an input receiving a resource request. A mapper in communication with the input maps the request to a request location in a mathematical mapping space and maps each of the plurality of resources to at least one resource locations in the mathematical mapping space.Type: ApplicationFiled: June 3, 2002Publication date: October 24, 2002Applicant: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, Thomas F. Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Patent number: 6430618Abstract: The invention relates to a method and apparatus for distributing a request to one of a plurality of resources. A request is mapped to a location in mathematical mapping space. Each of the plurality of resources is mapped to a respective location or locations in the mathematical mapping space. The request is allocated to one of the resources based on a mathematical relationship between the request location and the resource location in the mathematical mapping space. An apparatus for distributing a request to one of a plurality of resources includes the plurality of resources and an input receiving a resource request. A mapper in communication with the input maps the request to a request location in a mathematical mapping space and maps each of the plurality of resources to at least one resource locations in the mathematical mapping space.Type: GrantFiled: March 13, 1998Date of Patent: August 6, 2002Assignee: Massachusetts Institute of TechnologyInventors: David Karger, Eric Lehman, F. Thomson Leighton, Matthew Levine, Daniel Lewin, Rina Panagrahy
-
Patent number: 5442778Abstract: Scatter-Gather is a computer based document browsing method which operates in time proportional to a number of documents in a target corpus. The Scatter-Gather method includes: preparing an initial ordering of the corpus using, for example, an off-line computational method; determining a summary of the initial ordering of the corpus for interactive utility; and providing a further ordering of the corpus using, for example, an on-line non-deterministic method. The step of an off-line preparation of an initial ordering of a corpus is non-time-dependent, thus an accurate initial ordering is prepared. The step of determining a summary includes determining a summary for presentation to a user without scrolling on a CRT. The step of providing a further ordering includes truncated group average agglomerate clustering, merging disjointed document sets, center finding, assign-to-nearest and other refinement methods.Type: GrantFiled: November 12, 1991Date of Patent: August 15, 1995Assignee: Xerox CorporationInventors: Jan. O. Pedersen, David Karger, Douglass R. Cutting, John W. Tukey