Patents by Inventor John D. Dunagan

John D. Dunagan 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: 20090100441
    Abstract: The application discloses a resource assignment system including recovery notification procedures or methods to notify an application or node of potentially lost resources. The recovery notification procedures or calls are invoked in response to a recovery notification registration function. In response to recovery notification registration, a recovery notification or call is generated to report lost resources.
    Type: Application
    Filed: December 18, 2007
    Publication date: April 16, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Alastair Wolman, Atul Adya, John D. Dunagan
  • Publication number: 20090100436
    Abstract: The application discloses a generic partitioning manager for partitioning resources across one or more owner nodes. In illustrated embodiments described, the partitioning manager interfaces with the one or more owner nodes through an owner library. A lookup node or application interfaces with the partitioning manager through the lookup library to lookup address or locations of the partitioned resources. In illustrated embodiments, resources are partitioned via the partitioning manager in response to lease request messages from an owner library. In illustrated embodiments, the lease grant message includes a complete list of the leases for the owner node.
    Type: Application
    Filed: December 18, 2007
    Publication date: April 16, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Atul Adya, Alastair Wolman, John D. Dunagan
  • Publication number: 20090083407
    Abstract: Technologies, systems, and methods for ordered message delivery that avoid message races or crisscrosses between communicating nodes. For example, if Node A sends message 3 towards Node B and, shortly thereafter, Node B sends message X to Node A, Node A would like to know whether or not message X reflects Node B's state after receiving message 3. If Node B received message 3 prior to sending message X, then proper state may be maintained between the nodes. But if messages 3 and X crisscrossed, or if message 3 was never properly received by Node B, then the state between the nodes may be corrupt. Technologies, systems, and methods are provided to avoid such corruption.
    Type: Application
    Filed: September 20, 2007
    Publication date: March 26, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Atul Adya, Alastair Wolman, John D. Dunagan
  • Patent number: 7379447
    Abstract: A system and method that increases the capacity of a wireless network using frequency diversity. A user switches between channels of a network using a single network interface card in such a manner that nodes desiring to communicate overlap while disjoint communications mostly do not overlap. A driver is inserted into a device's networking stack and controls the network interface card using a plurality of virtual wireless network adapters. Packets for a recipient are queued when the recipient is not accessible on the node's channel. In one embodiment where multiple nodes are switching in and out of channel, the method changes part of a nodes channel hopping schedule to ensure concurrent connectivity in a channel for at least a brief time period such that packets can be received/transmitted with desired nodes.
    Type: Grant
    Filed: September 23, 2004
    Date of Patent: May 27, 2008
    Assignee: Microsoft Corporation
    Inventors: John D. Dunagan, Paramvir Bahl, Ranveer Chandra