Method and apparatus for client managed flow control on a limited memory computer system

• US 5,748,892 A
• Filed: 03/25/1996
• Issued: 05/05/1998
• Est. Priority Date: 03/25/1996
• Status: Expired due to Term

• Current Assignee: Citrix Systems, Inc. (Cloud Software Group)
• Original Assignee: Citrix Systems, Inc. (Cloud Software Group)
• Inventors: Richardson, John
• Primary Examiner(s): Trammell, James P.
• Assistant Examiner(s): DAM, TUAN QUANG
• Application Number:
  US08/621,848
• Time in Patent Office: 771 Days
• Field of Search: 395/200.01, 395/200.03, 395/200.04, 395/200.08, 395/200.09, 395/200.13, 395/200.31, 395/200.34, 395/200.43, 395/200.47 , 395/200.62, 395/200.53, 395/200.56, 395/200.55, 395/200.57, 395/200.61, 395/200.68, 395/200.69, 395/200.7, 395/200.75 , 395/200.33, 395/200.38, 395/200.59, 395/674, 395/675, 395/672, 395/670
• US Class Current: 709/200
• CPC Class Codes: G06F 9/5016 the resource being the memory
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A method and apparatus for controlling data flow on a network having a server and a non-blocking client node in which the client node may not drop requests received from the server. A process on the non-blocking client node allocates resources on the non-blocking client node and notifies the server of the allocated resources. The server then determines the resources on the non-blocking client node required to fulfill a request by an application on the server and whether sufficient resources are available on the non-blocking client node to fulfill the request by the application. If sufficient resources are available, the server then sends the request to the client node and if sufficient resources do not exist, the server waits until sufficient resources do exist to issue the request to the non-blocking client node.

Claims

1. A method for flow control on a network having a server and a non-blocking client node which may not drop requests, the method comprising the steps of:

allocating resources on said non-blocking client node by said non-blocking node;

notifying said server of said allocated resources by said non-blocking client node;

determining by said server the resources on said non-blocking client node required to fulfill a request made by an application executing on said server;

determining by said server whether sufficient resources are available on said non-blocking client node to fulfill said request of said application; and

sending said request of said application by said server to said non-blocking client node if sufficient resources are available on said non-blocking client node to fulfill said request.

2. The method for flow control of claim 1 further comprising the step of storing said notification of said allocated resources of said non-blocking client node on said server, wherein said notification comprises information relating to available allocated resources on said non-blocking client node.

3. The method for flow control of claim 2 further comprising the step of updating said notification information by said server in response to said requests from said application being sent to said non-blocking client node.

4. The method for flow control of claim 1 further comprising the steps of:

determining by said server whether said request is divisible, if sufficient available resources are not available on said non-blocking client node to fulfill said request;

dividing said request into subrequests if said request is divisible, the number of subrequests being chosen such that sufficient resources are available on said non-blocking client node to fulfill at least one said subrequest; and

sending said subrequest capable of being fulfilled by said resources on said non-blocking client node to said non-blocking client node by said server.

5. The method for flow control of claim 2 further comprising the steps of:

receiving by said server from said non-blocking client node replies to previous requests; and

updating said notification stored on said server node in response to said replies.

6. A network comprising:

a non-blocking client node comprising a plurality of resources, said non-blocking client node being unable to drop requests; and

a server node in communication with said non-blocking client node, said server node comprising;

an application process executing on said server node;

a flow control process executing on said server node wherein said flow control process determines if said non-blocking client node is able to receive and service a request; and

a memory comprising;

resource information corresponding to available resources located on said non-blocking client node.

7. The network of claim 6, wherein said server node sends requests from said application process to said non-blocking client node in response to resource information and updates said resource information in response to requests sent to and buffers receives from said non-blocking client node.