Abstract: A method and system for managing remote file system requests between client and server redirectors where a set of data request packets may be aggregated and/or ordered at a server based on hint information from a client.

Abstract: A system and method for pre-fetching data uses a combination of heuristics to determine likely next data retrieval operations and an evaluation of available resources for executing speculative data operations. When local resources, such as cache memory for storing speculative command results is not available, the compound operation request may not be sent. When resources on a server-side system are insufficient, only the primary command of a compound operation request may be processed and speculative command requests may be rejected. Both local computing resources and network resources may be evaluated when determining whether to build or process a compound operations request.

Abstract: A method of metering bandwidth allocation on a server using credits is disclosed. The method may receive a request for data from a client, respond to the request for data and determining if the request for data for the client exceeds a current data allocation credit limit for the client. Using the round trip time, the method may calculate a connection throughput for a client and may increase the current data allocation credit limit for the client if the server has resources to spare, the client is actively using the current pipeline depth allowed and network connection latency and bandwidth indicate a deeper pipeline is necessary for saturation. The method may decrease the current data allocation credit limit for the client if the server does not have resources to spare.

Abstract: A solution provides an efficient process for a user to complete operations within a file server system. A user's future requests, such as reading or writing files, are predicted based on previous operations. An effective amount of a file server's resources are allocated to accommodate the predicted future requests, thereby reducing the amount of required system time for performing operations corresponding to a file server memory.

Abstract: An opportunistic directory cache and method of usage reduce the number of calls between a client and server for file information, reducing the wastage of network resources and server resources. The expirable directory cache can be refreshed any time an appropriate directory enumeration call is made to the server, and is capable of being partially rather than completely invalidated in response to an indication that the file information of a file listed in the cache has or will change. If the affected file is identifiable, the entry in the cache for that file is invalidated, i.e. it is no longer useful for serving file information. If the affected file is not identifiable, then a first character projection of the file name is invalidated in the cache. In this manner, the directory cache is maintained with minimum resources and is persisted to the greatest extent possible, increasing its likelihood of usefulness.

Abstract: A method and system for managing remote file system requests between client and server redirectors where a set of data request packets may be aggregated and/or ordered at a server based on hint information from a client.

Abstract: A method of metering bandwidth allocation on a server using credits is disclosed. The method may receive a request for data from a client, respond to the request for data and determining if the request for data for the client exceeds a current data allocation credit limit for the client. Using the round trip time, the method may calculate a connection throughput for a client and may increase the current data allocation credit limit for the client if the server has resources to spare, the client is actively using the current pipeline depth allowed and network connection latency and bandwidth indicate a deeper pipeline is necessary for saturation. The method may decrease the current data allocation credit limit for the client if the server does not have resources to spare.

Abstract: A system and method for pre-fetching data uses a combination of heuristics to determine likely next data retrieval operations and an evaluation of available resources for executing speculative data operations. When local resources, such as cache memory for storing speculative command results is not available, the compound operation request may not be sent. When resources on a server-side system are insufficient, only the primary command of a compound operation request may be processed and speculative command requests may be rejected. Both local computing resources and network resources may be evaluated when determining whether to build or process a compound operations request.

Abstract: An opportunistic directory cache and method of usage reduce the number of calls between a client and server for file information, reducing the wastage of network resources and server resources. The expirable directory cache can be refreshed any time an appropriate directory enumeration call is made to the server, and is capable of being partially rather than completely invalidated in response to an indication that the file information of a file listed in the cache has or will change. If the affected file is identifiable, the entry in the cache for that file is invalidated, i.e. it is no longer useful for serving file information. If the affected file is not identifiable, then a first character projection of the file name is invalidated in the cache. In this manner, the directory cache is maintained with minimum resources and is persisted to the greatest extent possible, increasing its likelihood of usefulness.

Abstract: An opportunistic directory cache and method of usage reduce the number of calls between a client and server for file information, reducing the wastage of network resources and server resources. The expirable directory cache can be refreshed any time an appropriate directory enumeration call is made to the server, and is capable of being partially rather than completely invalidated in response to an indication that the file information of a file listed in the cache has or will change. If the affected file is identifiable, the entry in the cache for that file is invalidated, i.e. it is no longer useful for serving file information. If the affected file is not identifiable, then a first character projection of the file name is invalidated in the cache. In this manner, the directory cache is maintained with minimum resources and is persisted to the greatest extent possible, increasing its likelihood of usefulness.

Abstract: An opportunistic directory cache and method of usage reduce the number of calls between a client and server for file information, reducing the wastage of network resources and server resources. The expirable directory cache can be refreshed any time an appropriate directory enumeration call is made to the server, and is capable of being partially rather than completely invalidated in response to an indication that the file information of a file listed in the cache has or will change. If the affected file is identifiable, the entry in the cache for that file is invalidated, i.e. it is no longer useful for serving file information. If the affected file is not identifiable, then a first character projection of the file name is invalidated in the cache. In this manner, the directory cache is maintained with minimum resources and is persisted to the greatest extent possible, increasing its likelihood of usefulness.