Patents by Inventor Richard Helliwell

Richard Helliwell 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: 20060031519
    Abstract: A method for controlling command message flow in a network including a server and a client. A command window, comprising a maximum number of command messages that may be outstanding at the server, is included in messages sent from the server to the client. The value of the command window at the server is modified in accordance with available server resources for receiving command messages. When there are insufficient resources at the server to process one of the command messages delivered to the server, then a pause message is sent to the client indicating which said command message cannot be received; indicia is stored that indicates the command message initially discarded; and subsequent said command messages delivered to the server are discarded until an initially discarded said command message is again delivered to the server.
    Type: Application
    Filed: April 30, 2004
    Publication date: February 9, 2006
    Inventors: Richard Helliwell, Richard Wrenn, Edward Gardner
  • Publication number: 20050243830
    Abstract: A system and method for determining route quality in a network in which multiple routes exist between a transmitting end-point and a receiving end-point. Initially, a routing sequence number is associated with each transmission sent on a route in the network, such that consecutive transmissions sent on one of the routes have consecutive routing sequence numbers. The routing sequence number for a first one of the routes is included in transmissions sent on a second one of the routes. The routing sequence number of the first route, received on the second route, is used as an indicator of the route quality of the first route, and this indicator is compared to an expected routing sequence number for the first route to determine a likelihood of whether the transmissions sent via the first route are either lost or delayed. The expected routing sequence number is normally incremented each time a transmission is received on the second route.
    Type: Application
    Filed: April 30, 2004
    Publication date: November 3, 2005
    Inventors: Richard Wrenn, Richard Helliwell, Edward Gardner
  • Publication number: 20050243816
    Abstract: A system for addressing end-points in a network wherein a transmission is sent between a source end-point and a destination end-point via a respective source port and a destination port connected by a fabric. A payload offset and buffer pool handle are included in a network header sent with the transmission. The buffer pool handle is used to determine a specific queue of pool buffers within the destination port. A pool buffer descriptor, describing a header buffer and a payload buffer each within the destination end-point, is dequeued from a queue indicated by the buffer pool handle. The payload offset in the network header is then decoded to locate a first number of bytes of data in the transmission to be transferred into the header buffer a second number of bytes of data to be transferred into the payload buffer.
    Type: Application
    Filed: April 30, 2004
    Publication date: November 3, 2005
    Inventors: Richard Wrenn, Richard Helliwell, Edward Gardner
  • Publication number: 20050243725
    Abstract: A system and method for selecting a route, from within the set of network routes between the source and destination end-points, for retransmission of information initially sent via a suspected failed route such that the selected route has a minimum number of network components in common with the suspected failed route. In one aspect, the routes between source and destination end-points are grouped into a route set and placed in order in a circular list by the destination end-point. When the source end-point deems it necessary to retransmit information sent via a suspected failed route, it selects the next acceptable route following the suspected failed route from the circular list. The circular list order is determined such that adjacent routes have few common network components.
    Type: Application
    Filed: April 30, 2004
    Publication date: November 3, 2005
    Inventors: Richard Wrenn, Richard Helliwell, Edward Gardner
  • Publication number: 20050243817
    Abstract: A system and method for message routing in a computer network. The present system establishes a routing layer between the network and transport layers in a network, for communicating routing information between end-points in the network. A route management connection for communicating route management information between two ports in the network is established between pseudo end-points in the network. A route and route set are established between end-points in the network, where the route set provides a relationship between two end-point incarnations that indicates the existence of at least one route between the end-points. A route set management connection is established between the end-points for managing connections that are established on the route set. A route between the end points is selected using a route in the route set, and an application connection is established between two applications running on respective end-points in the network, using the route set and the route set management connection.
    Type: Application
    Filed: April 30, 2004
    Publication date: November 3, 2005
    Inventors: Richard Wrenn, Richard Helliwell, Edward Gardner
  • Publication number: 20050021757
    Abstract: Generating unique identifiers (UUIDs) for software objects and other components in a network in which a large number of components may exist simultaneously and/or over a period of time. UUIDs generated by a particular product are divided into two sub-fields. One sub-field is stored in non-volatile memory, and incremented infrequently. The other sub-field is stored in volatile memory, that can be incremented frequently. During operation, the product creating the UUIDs generates new UUIDs by incrementing the field stored in volatile memory. When overflow of the volatile memory field occurs, the field stored in non-volatile memory is incremented. A block of non-volatile memory is initialized to all of a first logical state, and the bits therein are then sequentially cleared to generate a subsequent unique identifier.
    Type: Application
    Filed: April 15, 2004
    Publication date: January 27, 2005
    Inventor: Richard Helliwell