Patents by Inventor Daniel N. Bauer

Daniel N. Bauer 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: 9137180
    Abstract: A method for transmitting data between a sender queue of a sender intermediate layer of a protocol stack and a receiver queue of a receiver intermediate layer of the protocol stack. The method includes receiving a data message from a sender messaging layer. The method also includes tagging the data message with a unique identifier. The method further includes writing the data message as a data window in the sender queue of the sender intermediate layer. The method additionally includes transmitting a front data window of the sender queue of the sender intermediate layer to the receiver queue of the receiver intermediate layer. The method also includes receiving a single receipt-acknowledgement message after a receiver transport layer of the protocol stack has received all of the front data window. The method further includes receiving a commit-acknowledgement message.
    Type: Grant
    Filed: February 19, 2015
    Date of Patent: September 15, 2015
    Assignee: International Business Machines Corporation
    Inventors: Daniel N Bauer, Luis Garces-Erice, John G Rooney, Paolo Scotton
  • Publication number: 20150163176
    Abstract: A method for transmitting data between a sender queue of a sender intermediate layer of a protocol stack and a receiver queue of a receiver intermediate layer of the protocol stack. The method includes receiving a data message from a sender messaging layer. The method also includes tagging the data message with a unique identifier. The method further includes writing the data message as a data window in the sender queue of the sender intermediate layer. The method additionally includes transmitting a front data window of the sender queue of the sender intermediate layer to the receiver queue of the receiver intermediate layer. The method also includes receiving a single receipt-acknowledgement message after a receiver transport layer of the protocol stack has received all of the front data window. The method further includes receiving a commit-acknowledgement message.
    Type: Application
    Filed: February 19, 2015
    Publication date: June 11, 2015
    Inventors: Daniel N Bauer, Luis Garces-Erice, John G. Rooney, Paolo Scotton
  • Patent number: 8997115
    Abstract: A method for transmitting data between a sender queue of a sender intermediate layer of a protocol stack and a receiver queue of a receiver intermediate layer of the protocol stack implemented with a sliding window protocol. The method includes receiving a data message or a collection of data messages from a sender messaging layer; tagging the data message or the collection of data messages with a unique identifier; writing the data message or the collection of data messages tagged with the unique identifier as a data window in the sender queue; transmitting a front data window of the sender queue to the receiver queue; receiving a single receipt-acknowledgement message after the receiver transport layer has received all of the front data window; and receiving a commit-acknowledgement message after the receiver messaging layer has read from the receiver intermediate layer all of the front data window.
    Type: Grant
    Filed: August 15, 2008
    Date of Patent: March 31, 2015
    Assignee: International Business Machines Corporation
    Inventors: Daniel N. Bauer, Luis Garces-Erice, John G. Rooney, Paolo Scotton
  • Patent number: 8402466
    Abstract: Embodiments of the invention provide a method, system and computer program product for scheduling tasks in a computer system. In an embodiment, the method comprises receiving a multitude of sets of tasks, and placing the tasks in one or more task queues. The tasks are taken from the one or more task queues and placed in a priority queue according to a first rule. The tasks in the priority queue are assigned to a multitude of working threads according to a second rule based, in part, on share values given to the tasks. In an embodiment, the tasks of each of the sets are placed in a respective one task queue; and all of the tasks in the priority queue from each of the task queues, are assigned as a group to one of the working threads.
    Type: Grant
    Filed: February 17, 2009
    Date of Patent: March 19, 2013
    Assignee: International Business Machines Corporation
    Inventors: Daniel N. Bauer, Kristijan Dragicevic, Luis Garcés-Erice
  • Patent number: 8370454
    Abstract: There are introduced ways for retrieving or depositing a replica of an electronic document in a computer network. After having selected at least one replica number, a given function is applied. The function requires as input the replica number and a document identifier. The function returns as a result at least one entity identifier, each entity identifier representing an entity in the network that might provide the replica. In a next step, a document related request is addressed to at least one of the identified entities.
    Type: Grant
    Filed: May 7, 2004
    Date of Patent: February 5, 2013
    Assignee: International Business Machines Corporation
    Inventors: Daniel N. Bauer, Paul T. Hurley, Marcel Waldvogel
  • Patent number: 8139483
    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.
    Type: Grant
    Filed: May 22, 2008
    Date of Patent: March 20, 2012
    Assignee: International Business Machines Corporation
    Inventors: Daniel N. Bauer, John G. Rooney, Paolo Scotton, Marcel Waldvogel
  • Publication number: 20100211696
    Abstract: Embodiments of the invention provide a method, system, and computer program product for selecting a server as a selected server for performing a specified function in a distributed computing system. In one embodiment, the method comprises identifying a group of servers in the system; and choosing as the selected server the server that has been in the system the longest. In one embodiment, each of the servers in the group has a respective contention period, during which the server sends a contention message, and the selected server is chosen using these contention messages. The servers in the group may have imperfect clock synchronization. In this case, the contention periods of the servers is kept greater than the maximum difference between the server clocks. The invention may be used to select a name server, or to select a server for another service.
    Type: Application
    Filed: February 17, 2009
    Publication date: August 19, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Daniel N. Bauer, Luis Garces-Erice, Urs Hunkeler
  • Publication number: 20100211954
    Abstract: Embodiments of the invention provide a method, system and computer program product for scheduling tasks in a computer system. In an embodiment, the method comprises receiving a multitude of sets of tasks, and placing the tasks in one or more task queues. The tasks are taken from the one or more task queues and placed in a priority queue according to a first rule. The tasks in the priority queue are assigned to a multitude of working threads according to a second rule based, in part, on share values given to the tasks. In an embodiment, the tasks of each of the sets are placed in a respective one task queue; and all of the tasks in the priority queue from each of the task queues, are assigned as a group to one of the working threads.
    Type: Application
    Filed: February 17, 2009
    Publication date: August 19, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Daniel N. Bauer, Kristijan Dragicevic, Luis Garces-Erice
  • Publication number: 20100205427
    Abstract: A plurality of protocol stacks are deployed. Each of the protocol stacks includes a plurality of composable protocol modules, and each of the composable protocol modules implements common interfaces. It is detected that a first given one of a plurality of clients wishes to connect to a publication-subscription engine and it is determined whether the first given one of the plurality of clients is to be connected in a secure manner. Responsive to determining that the first given one of the plurality of clients is to be connected in the secure manner, an encrypted instance of a first appropriate one of the plurality of protocol stacks is instantiated to effectuate the secure connection. The first given one of the plurality of clients is authenticated and authorized.
    Type: Application
    Filed: February 12, 2009
    Publication date: August 12, 2010
    Applicant: International Business Machines Corporation
    Inventors: Daniel N. Bauer, Sean G. Rooney
  • Patent number: 7600033
    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.
    Type: Grant
    Filed: October 28, 2003
    Date of Patent: October 6, 2009
    Assignee: International Business Machines Corporation
    Inventors: Daniel N. Bauer, John G. Rooney, Paolo Scotton, Marcel Waldvogel
  • Publication number: 20090064177
    Abstract: The present invention relates to a method of delivering data from a sender application to at least one receiver application that are arranged in a protocol stack comprising: underlying the sender application a sender messaging layer and a sender transport layer, and underlying the receiver application, a receiver messaging layer and a receiver transport layer, wherein the sender transport layer and the receiver transport layer are coupled by way of a network layer, the method comprising the steps of: incorporating a sender intermediate layer between the sender messaging layer and the sender transport layer and a receiver intermediate layer between the receiver messaging layer and the receiver transport layer; configuring the interface characteristics of the intermediate layers to be the same as for their corresponding transport layers; creating a sender queue in a non-volatile data storage component of the sender intermediate layer and a receiver queue in a non-volatile data storage component of the receiver
    Type: Application
    Filed: August 15, 2008
    Publication date: March 5, 2009
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Daniel N. Bauer, Luis Garces-Erice, John G. Rooney, Paolo Scotton
  • Publication number: 20080259793
    Abstract: A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information.
    Type: Application
    Filed: May 22, 2008
    Publication date: October 23, 2008
    Inventors: Daniel N. Bauer, John G. Rooney, Paolo Scotton, Marcel Waldvogel