Patents by Inventor Atul Adya

Atul Adya 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).

  • Publication number: 20070226196
    Abstract: A data access architecture is provided that includes a mapping architecture for mapping data as may be used by an application to data as persisted in a database. The mapping architecture makes use of two types of mapping views—a query view that helps in translating queries and an update view that helps in translating updates. Incremental view maintenance can be used to translate data between the application and database.
    Type: Application
    Filed: March 16, 2007
    Publication date: September 27, 2007
    Applicant: Microsoft Corporation
    Inventors: Atul Adya, Jose A. Blakeley, Per-Ake Larson, Sergey Melnik
  • Patent number: 7272630
    Abstract: Potentially identical objects (e.g., files) are located across multiple computers based on stochastic partitioning of workload. For each of a plurality of objects stored on a plurality of computers in a network, a portion of object information corresponding to the object is selected. The object information can be generated in a variety of manners (e.g., based on hashing the object, based on characteristics of the object, and so forth). Any of a variety of portions of the object information can be used (e.g., the least significant bits of the object information). A stochastic partitioning process is then used to identify which of the plurality of computers to communicate the object information to for identification of potentially identical objects on the plurality of computers.
    Type: Grant
    Filed: November 18, 2004
    Date of Patent: September 18, 2007
    Assignee: Microsoft Corporation
    Inventors: John R. Douceur, Marvin M. Theimer, Atul Adya, William J. Bolosky
  • Patent number: 7245936
    Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel.
    Type: Grant
    Filed: December 13, 2004
    Date of Patent: July 17, 2007
    Assignee: Microsoft Corporation
    Inventors: Paramvir Bahl, Jitendra D. Padhey, Atul Adya
  • Publication number: 20070160002
    Abstract: An invention is disclosed whereby a wireless network node, equipped with two or more radio transceivers statically tuned to non-interfering frequency channels, can make decisions regarding which channel to use when communicating with a neighboring wireless node. A multi-radio unification protocol implemented in a wireless node coordinates the use of multiple wireless network interface cards and provides a virtual layer that hides the multiple physical network interfaces from higher layers of a node's network protocol stack. The invention is applicable to wireless networks generally, including those in which some nodes do not have multiple radios or do not recognize the multi-radio unification protocol. The invention makes possible simultaneous transmissions using available channels, thereby reducing interference and delay while increasing the overall capacity of the network.
    Type: Application
    Filed: February 23, 2007
    Publication date: July 12, 2007
    Applicant: Microsoft Corporation
    Inventors: Alastair Wolman, Atul Adya, Paramvir Bahl, Jitendra Padhye, Lidong Zhou
  • Patent number: 7240060
    Abstract: A serverless distributed file system manages the storage of files and directories using one or more directory groups. The directories may be managed using Byzantine-fault-tolerant groups, whereas files are managed without using Byzantine-fault-tolerant groups. Additionally, the file system may employ a hierarchical namespace to store files. Furthermore, the directory group may employ a plurality of locks to control access to objects (e.g., files and directories) in each directory.
    Type: Grant
    Filed: December 17, 2004
    Date of Patent: July 3, 2007
    Assignee: Microsoft Corporation
    Inventors: Atul Adya, William J. Bolosky, Gerald Cermak, John R. Douceur, Marvin M. Theimer, Roger P. Wattenhofer
  • Patent number: 7209740
    Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel.
    Type: Grant
    Filed: December 13, 2004
    Date of Patent: April 24, 2007
    Assignee: Microsoft Corporation
    Inventors: Paramvir Bahl, Atul Adya, Jitendra D. Padhye
  • Publication number: 20070081488
    Abstract: Methods are described for using collaboration of neighboring wireless devices to enable location of disconnected wireless devices and rogue wireless access points. A central server computes the locations of the neighboring clients and uses those locations to estimate the location of a disconnected client. These techniques may take advantage of the beaconing and probing mechanisms of IEEE 802.11 to ensure that connected clients do not pay unnecessary overheads for detecting disconnected clients. Methods are also described for detecting and locating rogue devices by collaboratively collecting information from neighboring devices and comparing the information to a database.
    Type: Application
    Filed: December 12, 2006
    Publication date: April 12, 2007
    Applicant: Microsoft Corporation
    Inventors: Atul Adya, Paramvir Bahl, Ranveer Chandra, Lili Qiu
  • Patent number: 7203463
    Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel.
    Type: Grant
    Filed: February 2, 2006
    Date of Patent: April 10, 2007
    Assignee: Microsoft Corporation
    Inventors: Paramvir Bahl, Atul Adya, Jitendra D. Padhye
  • Publication number: 20070076881
    Abstract: An exclusive encryption system is established using multiple computing devices. The exclusive encryption system allows for the exclusion of certain plaintext (e.g., by one of the computing devices) and ciphertext (e.g., by another of the computing devices) while at the same time maintaining the privacy created by the encryption (e.g., so the other computing device cannot see the plaintext). The exclusive encryption system may be implemented as part of a serverless distributed file system with directory entries (e.g., file names or folder names) being the plaintext, or alternatively as part of other systems.
    Type: Application
    Filed: December 16, 2005
    Publication date: April 5, 2007
    Applicant: Microsoft Corporation
    Inventors: John Douceur, Josh Benaloh, Gideon Yuval, Atul Adya
  • Publication number: 20060293079
    Abstract: Described herein is an implementation that reduces the battery consumption of an energy-constrained computing device that is capable of communicating over a wireless network. As conditions and circumstances warrant, the implementation selects one of multiple radios (e.g., two)—with each having a unique combination of characteristics (in terms of power-consumption, data-rate, range and/or frequency band of operation) for wireless communications to and from a wireless device. The implementation selects one radio to minimize power-consumption while maintaining effective wireless data communication. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.
    Type: Application
    Filed: August 28, 2006
    Publication date: December 28, 2006
    Applicant: Microsoft Corporation
    Inventors: Paramvir Bahl, Atul Adya, Alastair Wolman, Jitendra Padhye
  • Publication number: 20060271784
    Abstract: Efficient processing of time-bound messages is described herein. In an implementation, messages are classified either time-bounded messages or non-time-bounded messages. The time-bounded messages are then processed separately from the non-time-bound messages. Examples of time-bounded messages can include spam e-mails or other types or classes of e-mails subject to a retention policy, such that the are retained only for some set period of time. Metadata relating to the time-bound messages are compiled and stored separately from the messages, thereby enabling optimization of the metadata storage and processing apart from the messages. The time-bounded messages are accumulated before they are processed in bulk, thereby reducing the number if I/O operations consumed by the time-bound messages, and reducing the amount and cost of resources supporting the process of the time-bounded messages.
    Type: Application
    Filed: May 27, 2005
    Publication date: November 30, 2006
    Applicant: Microsoft Corporation
    Inventors: William Bolosky, Atul Adya, Ronnie Chaiken, Marcus Jager
  • Patent number: 7142855
    Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel.
    Type: Grant
    Filed: December 13, 2004
    Date of Patent: November 28, 2006
    Assignee: Microsoft Corporation
    Inventors: Paramvir Bahl, Atul Adya, Jitendra D. Pahhye
  • Publication number: 20060215624
    Abstract: Disclosed is a Neighbor Location Discovery Protocol (NLDP) that determines the relative locations of the nodes in a mesh network. In one embodiment, NLDP can be implemented for an ad-hoc wireless network where the nodes are equipped with directional antennas and are not able to use GPS. While NLDP relies on nodes having at least two RF transceivers, it offers significant advantages over previously proposed protocols that employ only one RF transceiver. In NLDP antenna hardware is simple, easy to implement, and readily available. Further, NLDP exploits the host node's ability to operate simultaneously over non-overlapping channels to quickly converge on the neighbor's location. NLDP is limited by the range of the control channel, which operates in a omni-directional fashion. However, by choosing a low frequency band, high power, and low data rate, the range of the control channel can be increased to match the range on the data channel.
    Type: Application
    Filed: March 28, 2005
    Publication date: September 28, 2006
    Applicant: Microsoft Corporation
    Inventors: Atul Adya, Paramvir Bahl, Jitendra Padhye, Alastair Wolman
  • Patent number: 7110783
    Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel.
    Type: Grant
    Filed: April 17, 2002
    Date of Patent: September 19, 2006
    Assignee: Microsoft Corporation
    Inventors: Paramvir Bahl, Atul Adya, Jitendra D. Padhye
  • Patent number: 7099689
    Abstract: Described herein is an implementation that reduces the battery consumption of an energy-constrained computing device that is capable of communicating over a wireless network. As conditions and circumstances warrant, the implementation selects one of multiple radios (e.g., two)—with each having a unique combination of characteristics (in terms of power-consumption, data-rate, range and/or frequency band of operation) for wireless communications to and from a wireless device. The implementation selects one radio to minimize power-consumption while maintaining effective wireless data communication. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.
    Type: Grant
    Filed: June 30, 2003
    Date of Patent: August 29, 2006
    Assignee: Microsoft Corporation
    Inventors: Paramvir Bahl, Atul Adya, Alastair Wolman, Jitendra D. Padhye
  • Publication number: 20060142033
    Abstract: An invention is disclosed whereby a wireless network node, equipped with two or more radio transceivers statically tuned to non-interfering frequency channels, can make decisions regarding which channel to use when communicating with a neighboring wireless node. A multi-radio unification protocol implemented in a wireless node coordinates the use of multiple wireless network interface cards and provides a virtual layer that hides the multiple physical network interfaces from higher layers of a node's network protocol stack. The invention is applicable to wireless networks generally, including those in which some nodes do not have multiple radios or do not recognize the multi-radio unification protocol. The invention makes possible simultaneous transmissions using available channels, thereby reducing interference and delay while increasing the overall capacity of the network.
    Type: Application
    Filed: February 24, 2006
    Publication date: June 29, 2006
    Applicant: Microsoft Corporation
    Inventors: Alastair Wolman, Atul Adya, Paramvir Bahl, Jitendra Padhye, Lidong Zhou
  • Publication number: 20060142035
    Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel.
    Type: Application
    Filed: February 2, 2006
    Publication date: June 29, 2006
    Applicant: Microsoft Corporation
    Inventors: Paramvir Bahl, Atul Adya, Jitendra Padhye
  • Patent number: 7065376
    Abstract: An invention is disclosed whereby a wireless network node, equipped with two or more radio transceivers statically tuned to non-interfering frequency channels, can make decisions regarding which channel to use when communicating with a neighboring wireless node. A multi-radio unification protocol implemented in a wireless node coordinates the use of multiple wireless network interface cards and provides a virtual layer that hides the multiple physical network interfaces from higher layers of a node's network protocol stack. The invention is applicable to wireless networks generally, including those in which some nodes do not have multiple radios or do not recognize the multi-radio unification protocol. The invention makes possible simultaneous transmissions using available channels, thereby reducing interference and delay while increasing the overall capacity of the network.
    Type: Grant
    Filed: November 26, 2003
    Date of Patent: June 20, 2006
    Assignee: Microsoft Corporation
    Inventors: Alastair Wolman, Atul Adya, Paramvir Bahl, Jitendra D. Padhye, Lidong Zhou
  • Patent number: 7062490
    Abstract: A serverless distributed file system manages the storage of files and directories using one or more directory groups. The directories may be managed using Byzantine-fault-tolerant groups, whereas files are managed without using Byzantine-fault-tolerant groups. Additionally, the file system may employ a hierarchical namespace to store files. Furthermore, the directory group may employ a plurality of locks to control access to objects (e.g., files and directories) in each directory.
    Type: Grant
    Filed: December 5, 2001
    Date of Patent: June 13, 2006
    Assignee: Microsoft Corporation
    Inventors: Atul Adya, William J. Bolosky, Gerald Cermak, John R. Douceur, Marvin M. Theimer, Roger P. Wattenhofer
  • Publication number: 20060107048
    Abstract: An exclusive encryption system is established using multiple computing devices. The exclusive encryption system allows for the exclusion of certain plaintext (e.g., by one of the computing devices) and ciphertext (e.g., by another of the computing devices) while at the same time maintaining the privacy created by the encryption (e.g., so the other computing device cannot see the plaintext). The exclusive encryption system may be implemented as part of a serverless distributed file system with directory entries (e.g., file names or folder names) being the plaintext, or alternatively as part of other systems.
    Type: Application
    Filed: December 19, 2005
    Publication date: May 18, 2006
    Applicant: Microsoft Corporation
    Inventors: John Douceur, Josh Benaloh, Gideon Yuval, Atul Adya