Intelligent network streaming and execution system for conventionally coded applications

BACKGROUND OF THE INVENTION

P-0001[0001] 1. Technical Field

P-0002[0002] The invention relates to the streaming of computer program object code across a network in a computer environment. More particularly, the invention relates to streaming and execution of existing applications across a network of servers streaming computer program object code and other related data to clients in a computer environment.

P-0003[0003] 2. Description of the Prior Art

P-0004[0004] Retail sales models of computer application programs are fairly straight forward. The consumer either purchases the application program from a retailer that is either a brick and mortar or an ecommerce entity. The product is delivered to the consumer in a shrink-wrap form.

P-0005[0005] The consumer installs the program from a floppy disk or a CD-ROM included in the packaging. A serial number is generally provided that must be entered at installation or the first time the program is run. Other approaches require that the CD-ROM be present whenever the program is run. However, CD-ROMs are easily copied using common CDR technology.

P-0006[0006] Another approach is for the consumer to effectuate the purchase through an ecommerce entity. The application program is downloaded in its entirety to the consumer across the Internet. The consumer is emailed a serial number that is required to run the program. The consumer enters the serial number at the time the program is installed or the first time the program is run.

P-0007[0007] Once the application program is installed on a machine, it resides on the machine, occupying precious hard disk space, until it is physically removed. The installer portion of the program can also be installed on a server along with the installation files. Users within an intranet can install the program from the server, across the network, onto their machines. The program is a full installation of the program and resides on the user's machine until it is manually removed.

P-0008[0008] Trial versions of programs are also available online that are a partial or full installation of the application program. The program executes normally for a preset time period. At the end of the time period, the consumer is told that he must purchase the program and execution is terminated. The drawback to this approach is that there is an easy way for the consumer to fool the program. The consumer simply uninstalls the program and then reinstalls it, thereby restarting the time period.

P-0009[0009] Additionally, piracy problems arise once the application program is resident on the consumer's computer. Serial numbers for programs are easily obtained across the Internet. Software companies lose billions of dollars a year in revenue because of this type of piracy.

P-0010[0010] The above approaches fail to adequately protect software companies' revenue stream. These approaches also require the consumer to install a program that resides indefinitely on the consumer's hard disk, occupying valuable space even though the consumer may use the program infrequently.

P-0011[0011] The enterprise arena allows Application Service Providers (ASP) to provide browser-based implementations such as Tarantella offered by Santa Cruz Operation, Inc. in Santa Cruz, Calif. and Metaframe offered by Citrix Systems Inc. of Fort Lauderdale, Fla. A remote application portal site allows the user to click on an application in his browser to execute the application. The application runs on the portal site and GUI interfaces such as display, keystrokes and mouse clicks are transferred over the wire. The access to the program is password protected. This approach allows the provider to create an audit trail and to track the use of an application program.

P-0012[0012] AppStream Inc. of Palo Alto, Calif. uses Java code streamlets to provide streaming applications to the user. The system partitions a Web application program into Java streamlets. Java streamlets are then streamed to the user's computer on an as-needed basis. The application runs on the user's computer, but is accessed through the user's network browser.

P-0013[0013] The drawback to the browser-based approaches is that the user is forced to work within his network browser, thereby adding another layer of complexity. The browser or Java program manages the application program's run-time environment. The user loses the experience that the software manufacturer had originally intended for its product including features such as application invocation based on file extension associations.

P-0014[0014] It would be advantageous to provide an intelligent network streaming and execution system for conventionally coded applications that allows portions of application programs to be reliably streamed from a server to a client while the application program is concurrently running on the client using the client's own file system. It would further be advantageous to provide an intelligent network streaming and execution system for conventionally coded applications that allows the streaming process to continue through server failures.

SUMMARY OF THE INVENTION

P-0015[0015] The invention provides an intelligent network streaming and execution system for conventionally coded applications. The system allows for segments of an application program to be streamed in a reliable, fault tolerant manner, from a server to a client while the application program is concurrently running on the client using the client's own file system. In addition, the invention provides a system that does not require that the application program be recompiled or recoded to be streamed.

P-0016[0016] The invention provides a system that partitions an application program into page segments by observing the manner in which the application program is conventionally installed. A minimal portion of the application program is installed on a client system. The user launches the application program in the same ways that applications on other client file systems are started. From the point of view of the client's operating system and from the point of view of the application itself, that application is located locally on the client.

P-0017[0017] An application program server streams the page segments to the client as the application program executes on the client. The client stores the page segments in a cache. Page segments are requested by the client from the application server whenever a page fault occurs from the cache on behalf of the application program.

P-0018[0018] The client prefetches page segments from the application server or the application server pushes additional page segments to the client based on the pattern of page segment requests for that particular application program.

P-0019[0019] The user subscribes and unsubscribes to application programs through a subscription server. Whenever the user accesses an application program, a securely encrypted access token is obtained from a license server. The license server checks with the subscription server to see if the user has a valid subscription to the application program. The access token is sent to the client if the subscription is valid. The application server begins streaming the requested page segments to the client when it receives a valid access token from the client.

P-0020[0020] The client performs server load balancing across a plurality of application servers. Server failover and server quality of service problems are handled by the client via observation and information provided by the server components. If the client observes a non-response or slow response condition from an application server or license server, it switches to another application or license server.

P-0021[0021] Other aspects and advantages of the invention will become apparent from the following detailed description in combination with the accompanying drawings, illustrating, by way of example, the principles of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

P-0022[0022]FIG. 1 is a block schematic diagram of a preferred embodiment of the invention showing components on the server that deal with users subscribing to and running applications according to the invention;

P-0023[0023]FIG. 2 is a block schematic diagram of a preferred embodiment of the invention showing the client components supporting application delivery and execution according to the invention;

P-0024[0024]FIG. 3 is a block schematic diagram of a preferred embodiment of the invention showing the components needed to install applications on the client according to the invention;

P-0025[0025]FIG. 4 is a block schematic diagram of the Builder that takes an existing application and extracts the Application File Pages for that application according to the invention;

P-0026[0026]FIG. 5<i>a </i>is a block schematic diagram illustrating how the Client Network Spoofer is used to handle mapping TCP interfaces to HTTP interfaces according to the invention;

P-0027[0027]FIG. 5<i>b </i>is a block schematic diagram illustrating how the Client Network Spoofer is used to handle mapping TCP interfaces to HTTP interfaces according to the invention;

P-0028[0028]FIG. 6<i>a </i>is a block schematic diagram showing several different components of the client software according to the invention;

P-0029[0029]FIG. 6<i>b </i>is a block schematic diagram showing the use of volatile and non-volatile storage of code and data in the client and server according to the invention;

P-0030[0030]FIG. 7<i>a </i>is a block schematic diagram showing one of two ways in which data may be compressed while in transit between the server and client according to the invention;

P-0031[0031]FIG. 7<i>b </i>is a block schematic diagram showing the other way in which data may be compressed while in transit between the server and client according to the invention;

P-0032[0032]FIG. 8 is a block schematic diagram showing an organization of the streaming client software according to the invention;

P-0033[0033]FIG. 9 is a block schematic diagram showing an alternative organization of the streaming client software according to the invention;

P-0034[0034]FIG. 10 is a block schematic diagram showing the application streaming software consisting of a streaming block driver according to the invention;

P-0035[0035]FIG. 11 is a block schematic diagram showing the application streaming software has been divided into a disk driver and a user mode client according to the invention;

P-0036[0036]FIG. 12 is a block schematic diagram showing the unencrypted and encrypted client caches according to the invention;

P-0037[0037]FIG. 13 is a block schematic diagram showing an application generating a sequence of code or data requests to the operating system according to the invention;

P-0038[0038]FIG. 14 is a block schematic diagram showing server-based prefetching according to the invention;

P-0039[0039]FIG. 15 is a block schematic diagram showing a client-to-client communication mechanism that allows local application customization to travel from one client machine to another without involving server communication according to the invention;

P-0040[0040]FIG. 16 is a block schematic diagram showing a client cache with extensions for supporting local file customization according to the invention;

P-0041[0041]FIG. 17 is a block schematic diagram showing aspects of a preferred embodiment of the invention related to load balancing and hardware fail over according to the invention;

P-0042[0042]FIG. 18 is a block schematic diagram showing the benefits to the use of compression in the streaming of Application File Pages according to the invention;

P-0043[0043]FIG. 19 is a block schematic diagram showing pre-compression of Application File Pages according to the invention;

P-0044[0044]FIG. 20 is a block schematic diagram showing multi-page compression of Application File Pages according to the invention;

P-0045[0045]FIG. 21 is a block schematic diagram showing profile-based prefetching according to the invention;

P-0046[0046]FIG. 22 is a block schematic diagram showing the use of tokens and a License Server according to the invention;

P-0047[0047]FIG. 23 is a block schematic diagram showing a flowchart for the Builder Install Monitor according to the invention;

P-0048[0048]FIG. 24 is a block schematic diagram showing a flowchart for the Builder Application Profiler according to the invention;

P-0049[0049]FIG. 25 is a block schematic diagram showing a flowchart for the Builder SAS Packager according to the invention;

P-0050[0050]FIG. 26<i>a </i>is a block schematic diagram showing versioning support according to the invention;

P-0051[0051]FIG. 26<i>b </i>is a block schematic diagram showing versioning support according to the invention;

P-0052[0052]FIG. 27 is a block schematic diagram showing a data flow diagram for the Streamed Application Set Builder according to the invention;

P-0053[0053]FIG. 28 is a block schematic diagram showing the Streamed Application Set format according to the invention;

P-0054[0054]FIG. 29 is a block schematic diagram showing an SAS client using a device driver paradigm according to the invention;

P-0055[0055]FIG. 30 is a block schematic diagram showing an SAS client using a file system paradigm according to the invention;

P-0056[0056]FIGS. 31<i>a </i>through <b>31</b><i>h </i>is a schematic diagram showing various components of the AppInstallBlock format according to the invention;

P-0057[0057]FIG. 32 is a block schematic diagram showing the Application Install Block lifecycle according to the invention;

P-0058[0058]FIG. 33 is a block schematic diagram showing peer caching according to the invention;

P-0059[0059]FIG. 34 is a block schematic diagram showing proxy caching according to the invention;

P-0060[0060]FIG. 35 is a block schematic diagram showing multicast within a LAN and a packet protocol according to the invention;

P-0061[0061]FIG. 36 is a block schematic diagram showing concurrent requests for application server pages, for the case when the page is first requested through the proxy according to the invention;

P-0062[0062]FIG. 37 is a block schematic diagram showing concurrent requests for application server pages, for the case when the page is first requested through the peer caching according to the invention;

P-0063[0063]FIG. 38 is a block schematic diagram showing concurrent requests for application server pages, for the case when the page is received only through peer caching according to the invention;

P-0064[0064]FIG. 39 is a block schematic diagram showing a client-server system using peer and proxy caching according to the invention;

P-0065[0065]FIG. 40 is a block schematic diagram showing a preferred embodiment of the invention preventing piracy of remotely served, locally executed applications according to the invention;

P-0066[0066]FIG. 41 is a block schematic diagram showing the filtering of accesses to remote application files according to the invention;

P-0067[0067]FIG. 42 is a block schematic diagram showing the filtering of accesses to remote files based on process code location according to the invention;

P-0068[0068]FIG. 43 is a block schematic diagram showing the filtering of accesses to remote files based on targeted file section according to the invention;

P-0069[0069]FIG. 44 is a block schematic diagram showing the filtering of accesses to remote files based on surmised purpose according to the invention; and

P-0070[0070]FIG. 45 is a block schematic diagram showing the filtering of accesses to remote files based on past access history according to the invention.

DETAILED DESCRIPTION OF THE INVENTION

P-0071[0071] The invention is embodied in an intelligent network streaming and execution system for conventionally coded applications in a computer environment. A system according to the invention allows for segments of an application program to be streamed in a reliable, fault tolerant manner, from a server to a client while the application program is concurrently running on the client using the client's own file system. In addition, the invention provides a system that does not require that the application program be recompiled or recoded to be streamed.

P-0072[0072] The invention provides a highly efficient and secure application delivery system in conjunction with the adaptively optimized execution of applications across a network such as the Internet, a corporate intranet, or a wide area network. This is done in such a way that existing applications do not need to be recompiled or recoded. Furthermore, the invention is a highly scalable, load-balancing, and fault-tolerant system.

P-0073[0073] When using the invention, an end-user requests applications that are resident on remote systems to be launched and run on the end-user's local system. The end-user's local system is called the client or client system, e.g., a desktop, laptop, palmtop, or information appliance. A remote system is a called a server or server system and is located within a collection of one or more servers called a server cluster.

P-0074[0074] From the point of view of the client system, the application appears to be installed locally on the client even though it was initially installed on a different computer system. The applications execute locally on the client system and not on the server system. To achieve this result, the application is converted into a form suitable for streaming over the network. The streaming-enabled form of an application is called the Streamed Application Set (SAS) and the conversion process is termed the SAS Builder. The conversion of an application into its SAS form typically takes place on a system different from either an end-user client system or an Application Service Provider Server Cluster. This system is called the SAS Conversion System or, simply, the conversion system.

P-0075[0075] Components of the invention are installed on the client system to support activities such as the installation, invocation, and execution of a SAS-based application. Other components of the invention are installed on the server system to support activities such as the verification of end user application subscription and license data and the transfer and execution of a SAS-based application on the client system. Some of the client and some of the server components run in the kernel-mode while other components run in the usual user-mode.

P-0076[0076] The term Application Service Provider (ASP) refers to an entity that uses the server components on one or more server systems, i.e., an ASP Server Cluster, to deliver applications to end-user client systems. Such an entity could be, for example, a software manufacturer, an e-commerce vendor that rents or leases software, or a service department within a company. The invention enables an ASP to deliver applications across a network, in a highly efficient and secure way; the applications are adaptively optimized for execution on an end-user's client system.

P-0077[0077] A number of techniques are employed to increase the overall performance of the delivery of an application and its subsequent execution by minimizing the effect of network latency and bandwidth. Among the techniques employed are: the SAS Builder identifies sequences of frequently accessed application pages and uses this information when generating a SAS; individual SAS pages and sequences of SAS pages are compressed and cached in an in-memory cache on the server system; various aspects of the applications are monitored during their actual use on a client and the resulting profiling data is used by the client to pre-fetch (pull) and by the server to send (push) additional pages which have a high likelihood of being used prior to their actual use; and SAS pages are cached locally on a client for their immediate use when an application is invoked.

P-0078[0078] Aggregate profile data for an application, obtained by combining the profile data from all the end-user client systems running the application, is used to increase the system performance as well. A number of additional caching techniques that improve both system scalability and performance are also employed. The above techniques are collectively referred to as collaborative caching.

P-0079[0079] In an embodiment of the invention, the SAS Builder consists of three phases: installation monitoring, execution profiling, and application stream packaging. In the final SAS Builder phase, the Application Stream Packager takes the information gathered by the Application Install Monitor and the Application Execution Profiler and creates the SAS form of the application, which consists of a Stream Enabled Application Pages File and a Stream Enabled Application Install Block.

P-0080[0080] The Stream Enabled Application Install Block is used to install a SAS-based application on a client system while selected portions of the Stream Enabled Application Pages File are streamed to a client to be run on the client system. The Stream Enabled Application Install Block is the first set of data to be streamed from the server to the client and contains, among other things, the information needed by the client system to prepare for the streaming and execution of the particular application. Individual and aggregate client dynamic profile data is merged into the existing Stream Enabled Application Install Block on the server to optimize subsequent streaming of the application.

P-0081[0081] The invention employs a Client Streaming File System that is used to manage specific application-related file accesses during the execution of an application. For example, there are certain shared library files, e.g., “foo.dll”, that need to be installed on the local file system, e.g., “c:\winnt\system32\foo.dll”, for the application to execute. Such file names get added to a “spoof database”. For the previous example, the spoof database would contain an entry saying that “c:\winnt\system32\foo.dll” is mapped to “z:\word\winnt\system32\foo.dll” where “z:” implies that this file is accessed by the Client Streaming File System. The Client Spoofer will then redirect all accesses to “c:\winnt\system32\foo.dll” to “z:\word\winnt\system32\foo.dll”. In this manner, the client system gets the effect of the file being on the local machine whereas in reality the file is streamed from the server. Several different classes of files can be treated in this way, e.g., specific application registry entries and application-based networking calls when such calls cross a firewall.

P-0082[0082] Lastly, the invention incorporates a number of software anti-piracy techniques directed at combating the piracy of applications of the type described herein that are delivered to the end-user over a network for execution on a client system. Among the anti-piracy techniques included are: client-side fine-grained filtering of file accesses directed at remotely served files; filtering of file accesses based on where the code for the process that originated the request is stored; identification of crucial portions of application files and filtering file access depending on the portions of the application targeted; filtering of file accesses based on the surmised purpose of the file access, as determined by examining the program stack or flags associated with the request; and filtering of file accesses based on the surmised purpose of the file access, as determined by examining a history of previous file accesses by the same process.

P-0083[0083] As mentioned above, the invention provides server and client technology for streaming application delivery and execution. The invention includes secure license-based streaming delivery of applications over Internet/extranets/intranets utilizing client-based execution with client caching and server-based file accesses by page.

P-0084[0084] 1. The Invention Provides Many Advantages Over the Present Approaches, Including:

P-0085[0085] Secure license-based streaming delivery over Internet/extranets/intranets:

P-0086[0086] reduces IT costs over client installation;

P-0087[0087] supports rental model of app delivery, which opens new markets and increases user convenience over purchase and client installation; and

P-0088[0088] enhances the opportunities to prevent software piracy over purchase and client installation.

P-0089[0089] Client-based execution with client caching:

P-0090[0090] increases typical application performance over server-based execution;

P-0091[0091] reduces network latency and bandwidth usage over non-cached client execution; and

P-0092[0092] allows existing applications to be run w/o rewrite/recompile/rebuild unlike other explicitly-distributed client/server application delivery approaches.

P-0093[0093] Server-based file accesses:

P-0094[0094] improve server-scaling over server-based execution;

P-0095[0095] allow transparent failover to another server whereas server-based execution does not;

P-0096[0096] make server load balancing easier than it is with server-based execution; and

P-0097[0097] allow increased flexibility in server platform selection over server-based execution.

P-0098[0098] Server-based file accesses by page:

P-0099[0099] reduce network latency over complete file downloads;

P-0100[0100] reduce network bandwidth overhead over complete file downloads; and

P-0101[0101] reduce client cache footprint over complete file downloads.

P-0102[0102] 2. Features of the Invention

P-0103[0103] A) Server Components Supporting Application Delivery and Execution.

P-0104[0104] i) referring to FIG. 1, the server components include:

P-0105[0105] a. Client/server network interface <b>110</b> that is common to the client <b>113</b> and the server. This is the communication mechanism through which the client and the server communicate.

P-0106[0106] b. The Subscription Server <b>105</b>—This is the server the client <b>113</b> connects to for subscribing and unsubscribing applications. This server then adds/deletes the subscription information to the Subscription Database <b>101</b> and also updates the License Database <b>102</b> with the information stating that the client <b>113</b> can/cannot run the subscribed information under the agreed upon licensing terms. This communication between the client <b>113</b> and the Subscription Server <b>105</b> happens over SSL that is an industry standard protocol for secure communication. The Subscription Server <b>105</b> is also contacted for updating any existing subscription information that is in the Subscription Database <b>101</b>.

P-0107[0107] c. The License Server <b>106</b>—This is the server the client <b>113</b> connects to for getting a license to run an application after the client has subscribed to the application. This server validates the user and his subscriptions by consulting the License Database <b>102</b>. If the client <b>113</b> does have a valid license, the License Server <b>106</b> sends an “Access token” to the client that is encrypted using an “encryption key” that the License Database <b>102</b> obtains from the Server Config Database <b>103</b>. The “Access token” contains information like the Application ID and an expiration time. Along with the “Access token,” the License Server <b>106</b> also sends a list of least loaded application servers that it obtains from the Server Config Database <b>103</b> and also the expiration time that was encoded in the “Access token”. The client <b>113</b> uses this expiration time to know when to ask for a new token. This communication between the client <b>113</b> and the License Server <b>106</b> happens over SSL.

P-0108[0108] d. The Application Server <b>107</b>—Once the client <b>113</b> obtains an “Access token” to run an application, it connects to the Application Server <b>107</b> and presents to it the “Access token” along with the request for the application bits. Note that the “Access token” is opaque to the client <b>113</b> since it does not have the key to decrypt it. The Application Server <b>107</b> validates the “Access token” by decrypting it using a “decryption key” obtained from the Server Config Database <b>103</b> and checking the content against a predefined value like for example the Application iD and also by making sure that the expiration time in the “Access token” has not elapsed. It then serves the appropriate bits to the client <b>113</b> to enable it to run the application. The encryption and decryption keys could be something like a private key/public key pair or a symmetric key or any other means of providing security. Note that the keys are uniform across all the servers within an ASP.

P-0109[0109] e. The Monitor Server <b>108</b>—It monitors the load in terms of percent of CPU utilization on the Application Servers <b>107</b> and the License Servers <b>106</b> on a periodic basis (for example—every minute) and adds that information to the Server Config Database <b>103</b>.

P-0110[0110] f. The Profile Server <b>109</b>—It receives profile information from the clients periodically. It adds this information to the Profile Database <b>104</b>. The Profile Server <b>109</b> based on the profile information from different clients updates the App Prefetch Page List section of the Stream App Install Blocks <b>112</b>.

P-0111[0111] ii) The data structures supporting the above server components include:

P-0112[0112] a. Subscription Database <b>101</b>—This is the database that stores the user information in terms of username, list of apps subscribed, password, billing information, address, group, admin. The username is the primary key. The admin field identifies if this user has admin privileges for the group he belongs to.

P-0113[0113] b. License Database <b>102</b>—This is the database that stores licensing information, i.e., which user can run what application and under which license. This database also keeps track of usage information, i.e., which user has used which application for how long and how many times. The information looks like:

P-0114[0114] Username, application, time of usage, number of times run

P-0115[0115] Username, application, licensing policy

P-0116[0116] Username, application, is app running, no of instances, time of start

P-0117[0117]  The username is the primary key. The licensing policy could be something simple like expiry date or something more complicated like number of instances simultaneously allowed within a group etc.

P-0118[0118] c. Server Config Database <b>103</b>—This database stores information about which server can run which application, what is the load on all the servers, what is the encryption “key” to be used by the servers and all other information that is needed by the servers. The information looks like:

P-0119[0119] Server IP address, App/Slim server, application list, current load

P-0120[0120] Encryption key, Decryption key

P-0121[0121]  The Server IP address is the primary key for the first table. The keys are common across all servers.

P-0122[0122] d. Profile Database <b>104</b>—This database stores the profile information received by the profile server from the clients periodically. The information looks like:

P-0123[0123] Application ID, File ID, Block ID number of hits

P-0124[0124]  The Application ID is the primary key.

P-0125[0125] e. Application File Pages <b>111</b>—This is the one of the outputs of the “builder” as explained below and is put on the Application Server <b>107</b> so that it can serve the appropriate bits to the client.

P-0126[0126] f. Stream App Install Blocks <b>112</b>—This is the other output of the “builder” and contains the information for successfully installing applications on the client for streaming applications.

P-0127[0127] B) Client Components Supporting Application Delivery &amp; Execution

P-0128[0128] i) With respect to FIGS. 1 and 2, these client components include:

P-0129[0129] a. Client/Server Network interface <b>202</b>—This is the same interface as explained above.

P-0130[0130] b. Client License Manager <b>205</b>—This component requests licenses (“Access tokens”) from the License Server <b>106</b> when the client wants to run applications. The License Server <b>106</b> sends an “Access token” to the client that can be used to run the applications by presenting it to the Application Server <b>107</b>. Along with the token, the License Server <b>106</b> also sends the expiry time of the token. The Client License Manager <b>205</b> renews the token just before the expiry period so that the client can continue running the application. When the application is complete, the Client License Manager <b>205</b> releases the token by sending a message to the License Server <b>106</b>. In addition, when a user has subscribed to an application, the Client License Manager <b>205</b> first checks to make sure that the application is installed on the machine the user is trying to run the application from and if not requests for the application installation. It does this using a list of Installed Apps that it maintains.

P-0131[0131] c. Client Cache Manager <b>207</b>—This component caches the application bits received from the Application Server <b>107</b> so that next time a request is made to the same bits, the request can be served by the cache instead of having to go to the Application Server <b>107</b>. The Client Cache Manager <b>207</b> has a limited amount of space on the disk of the client machine that it uses for the cache. When the space is fully occupied, the Client Cache Manager <b>207</b> uses a policy to replace existing portions of the cache. This policy can be something like LRU, FIFO, random etc. The Client Cache Manager <b>207</b> is responsible for getting the application bits requested by the Client Streaming File System <b>212</b>. If it does not have the bits cached, it gets them from the Application Server <b>107</b> through the network interface. However it also need to get the “Access token” from the Client License Manager <b>205</b> that it needs to send along with the request for the application bits. The Client Cache Manager <b>207</b> also updates the Prefetch History Info <b>209</b> with the requests it receives from the Client Streaming File System <b>212</b>.

P-0132[0132] d. Client Streaming File System <b>212</b>—This component serves all file system requests made by the application running on the client. The application makes calls like “read”, “write” etc. to files that need to be streamed. These requests lead to page faults in the operating system and the page faults are handled by the Client Streaming File System <b>212</b> that in turn asks the Client Cache Manager <b>207</b> for the appropriate bits. The Client Cache Manager <b>207</b> will send those bits from the cache if they exist there or forward the request to the Application Server <b>107</b> through the network interface to get the appropriate bits.

P-0133[0133] e. Client Prefetcher <b>208</b>—This component monitors the requests made by the client to the Application Server <b>107</b> and uses heuristics to make additional requests to the Application Server <b>107</b> so that the bits can be obtained from the Application Server <b>107</b> before the client machine makes the request for them. This is mainly to hide the latency between the client and the Application Server <b>107</b>. The history information of the requests is stored in the Prefetch History Info file <b>209</b>.

P-0134[0134] f. Client Profiler <b>203</b>—At specific time intervals, the client profiler sends the profile information, which is the Prefetch History Info to the prefetch server at the ASP that can then update the App Prefetch Page Lists for the different applications accordingly.

P-0135[0135] g. Client File Spoofer <b>211</b>—Certain files on the client need to be installed at specific locations on the client system. To be able to stream these files from the Application Server <b>107</b>, the Client Spoofer <b>211</b> intercepts all requests to these files made by a running application and redirects them to the Client Streaming File System <b>212</b> so that the bits can be streamed from the Application Server <b>107</b>.

P-0136[0136] h. Client Registry Spoofer <b>213</b>—Similar to files, certain registry entries need to be different when the application being streamed is running and since it is undesirable to overwrite the existing registry value, the read of the registry value is redirected to the Client Registry Spoofer <b>215</b> which returns the right value. However, this is optional as it is very likely that overwriting the existing registry value will make the system work just fine.

P-0137[0137] i. Client Network Spoofer <b>213</b>—Certain applications make networking calls through a protocol like TCP. To make these applications work across firewalls, these networking calls need to be redirected to the Client Network Spoofer <b>213</b> which can tunnel these requests through a protocol like HTTP that works through firewalls.

P-0138[0138] ii) The data structures needed to support the above client components include:

P-0139[0139] a. File Spoof Database <b>210</b>—The list of files the requests to which need to be redirected to the Client Streaming File System <b>212</b>. This information looks like (The source file name is the primary key) Source File Name, Target File Name

P-0140[0140] b. Registry Spoof Database <b>216</b>—List of registry entries and their corresponding values that need to be spoofed. Each entry looks like:

P-0141[0141] Registry entry, new value

P-0142[0142] c. Network Spoof Database <b>214</b>—Like of IP addresses, the networking connections to which need to be redirected to the Client Network Spoofer <b>213</b>. Each entry looks like (IP address is the primary key):

P-0143[0143] IP address, Port number, new IP address, new Port number

P-0144[0144] d. Client Stream Cache <b>206</b>—The on-disk cache that persistently stores application bits.

P-0145[0145] e. Known ASPs and Installed Apps <b>204</b>—The list of ASP servers (Application, License and Subscription) and also the list of applications that are installed on the client.

P-0146[0146] f. Prefetch History Info <b>209</b>—The history of the requests made to the cache. This consists of which blocks were requested from which file for which application and how many times each block was requested. It also consists of predecessor-successor information indicating which block got requested after a particular block was requested.

P-0147[0147] C) Client Application Installation

P-0148[0148] Referring to FIG. 3, the client application installation components include:

P-0149[0149] i) Client License Manager <b>303</b>—This is the same component explained above.

P-0150[0150] ii) Client Application Installer <b>305</b>—This component is invoked when the application needs to be installed. The Client Application Installer <b>305</b> sends a specific request to the Application Server <b>107</b> for getting the Stream App Install Block <b>301</b> for the particular application that needs to be installed. The Stream App Install Block <b>301</b> consists of the App Prefetch Page List <b>306</b>, Spoof Database <b>308</b>, <b>309</b>, <b>310</b>, and App Registry Info <b>307</b>. The Client Application Installer <b>305</b> then updates the various Spoof Databases <b>308</b>, <b>309</b>, <b>310</b> and the Registry <b>307</b> with this information. It also asks the Client Prefetcher <b>208</b> to start fetching pages in the App Prefetch Page List <b>306</b> from the Application Server <b>107</b>. These are the pages that are known to be needed by a majority of the users when they run this application.

P-0151[0151] D) Application Stream Builder Input/Output

P-0152[0152] With respect to FIG. 4, the Builder components include the following:

P-0153[0153] i) Application Install Monitor <b>403</b>—This component monitors the installation of an application <b>401</b> and figures out all the files that have been created during installation <b>402</b>, registry entries that were created and all the other changes made to the system during installation.

P-0154[0154] ii) Application Profiler <b>407</b>—After the application is installed, it is executed using a sample script. The Application Profiler <b>407</b> monitors the application execution <b>408</b> and figures out the application pages that got referenced during the execution.

P-0155[0155] iii) App Stream Packager <b>404</b>—The App Stream Packager <b>404</b> takes the information gathered by the Application Profiler <b>407</b> and the Application Install Monitor <b>403</b> and forms the Application File Pages <b>406</b> and the Stream App Install Block <b>405</b> from that information.

P-0156[0156] E) Network Spoofing For Client-Server Applications:

P-0157[0157] Referring to FIGS. 1, 4, <b>5</b><i>a</i>, <b>5</b><i>b</i>, and <b>6</b><i>a</i>, the component that does the Network Spoofing is the TCP to HTTP converter <b>503</b>, <b>507</b>. The basic idea is to take TCP packets and tunnel them through HTTP on one side and do exactly the opposite on the other. As far as the client <b>501</b> and the server <b>502</b> are concerned the communication is TCP and so existing applications that run with that assumption work unmodified. This is explained in more detail below.

P-0158[0158] On the client side, the user launches an application that resides on the Client Streaming File System. That application may be started in the same ways that applications on other client file systems may be started, e.g., opening a data file associated with the application or selecting the application from the Start/Programs menu in a Windows system. From the point of view of the client's operating system and from the point of view of the application itself, that application is located locally on the client.

P-0159[0159] Whenever a page fault occurs on behalf of any application file residing on the Client Streaming File System <b>604</b>, that file system requests the page from the Client Cache Manager <b>606</b>. The Client Cache Manager <b>606</b>, after ensuring via interaction with the Client License Manager <b>608</b> that the user's client system holds a license to run the application at the current time, checks the Client Stream Cache <b>611</b> and satisfies the page fault from that cache, if possible. If the page is not currently in the Client Stream Cache <b>611</b>, the Client Cache Manager <b>606</b> makes a request to the Client/Server Network Interface <b>505</b>, <b>609</b> to obtain that page from the Application File Pages stored on an Application Server <b>506</b>.

P-0160[0160] The Client Prefetcher <b>606</b> tracks all page requests passed to the Client Cache Manager <b>606</b>. Based on the pattern of those requests and on program locality or program history, the Client Prefetcher <b>606</b> asks the Client Cache Manager <b>606</b> to send additional requests to the Client/Server Network Interface <b>505</b>, <b>609</b> to obtain other pages from the Application File Pages stored on the Application Server <b>506</b>.

P-0161[0161] Files located on the Client Streaming File System <b>604</b> are typically identified by a particular prefix (like drive letter or pathname). However, some files whose names would normally imply that they reside locally are mapped to the Client Streaming File System <b>604</b>, in order to lower the invention's impact on the user's local configuration. For instance, there are certain shared library files (dll's) that need to be installed on the local file system (c:\winnt\system32\foo.dll). It is undesirable to add that file on the user's system. The file name gets added to a “spoof database” which contains an entry saying that c: \winnt\system32\foo.dll is mapped to z: \word\winnt\system32\foo.dll where z: implies that it is the Client Streaming File System. The Client Spoofer <b>603</b> will then redirect all accesses to c: \winnt\system32\foo.dll to z: \word\winnt\system32\foo.dll. In this manner the client system gets the effect of the file being on the local machine whereas in reality the file is streamed from the server.

P-0162[0162] In a similar fashion the Client Spoofer <b>603</b> may also be used to handle mapping TCP interfaces to HTTP interfaces. There are certain client-server applications (like ERP/CRM applications) that have a component running on a client and another component running on a database server, Web server etc. These components talk to each other through TCP connections. The client application will make TCP connections to the appropriate server (for this example, a database server) when the client piece of this application is being streamed on a user's machine.

P-0163[0163] The database server could be resident behind a firewall and the only way for the client and the server to communicate is through a protocol like HTTP that can pass through firewalls. To enable the client to communicate with the database server, the client's TCP requests need to be converted to HTTP and sent to the database server. Those requests can be converted back to TCP so that the database server can appropriately process the requests just before the requests reach the database server. The Client Spoofer's <b>603</b> responsibility in this case is to trap all TCP requests going to the database server and convert it into HTTP requests and take all HTTP requests coming from the database server and convert them into TCP packets. Note that the TCP to HTTP converters <b>505</b>, <b>507</b> convert TCP traffic to HTTP and vice versa by embedding TCP packets within the HTTP protocol and by extracting the TCP packets from the HTTP traffic. This is called tunneling.

P-0164[0164] When the Client License Manager <b>608</b> is asked about a client's status with respect to holding a license for a particular application and the license is not already being held, the Client License Manager <b>608</b> contacts the License Server <b>106</b> via the Client/Server Network Interface <b>609</b> and asks that the client machine be given the license. The License Server <b>106</b> checks the Subscription <b>101</b> and License <b>102</b> Databases and, if the user has the right to hold the license at the current time, it sends back an Access Token, which represents the right to use the license. This Access Token is renewed by the client on a periodic basis.

P-0165[0165] The user sets up and updates his information in the Subscription <b>101</b> and License <b>102</b> Databases via interacting with the Subscription Server <b>105</b>. Whenever a user changes his subscription information, the Subscription Server <b>105</b> signals the user's client system since the client's Known ASPs and Installed Apps information potentially needs updating. The client system also checks the Subscription <b>101</b> and License <b>102</b> Databases whenever the user logs into any of his client systems set up for Streaming Application Delivery and Execution. If the user's subscription list in the Subscription <b>101</b> and License <b>102</b> Databases list applications that have not been installed on the user's client system, the user is given the opportunity to choose to install those applications.

P-0166[0166] Whenever the user chooses to install an application, the Client License Manager <b>608</b> passes the request to the Client Application Installer <b>607</b> along with the name of the Stream App Install Block to be obtained from the Application Server <b>107</b>. The Client Application Installer <b>607</b> opens and reads that file (which engages the Client Streaming File System) and updates the Client system appropriately, including setting up the spoof database, downloading certain needed non-application-specific files, modifying the registry file, and optionally providing a list of applications pages to be prefetched to warm up the Client Stream Cache <b>611</b> with respect to the application.

P-0167[0167] The Application Stream Builder creates the Stream App Install Block <b>405</b> used to set up a client system for Streaming Application Delivery and Execution and it also creates the set of Application File Pages <b>406</b> sent to satisfy client requests by the Application Server <b>107</b>. The process that creates this information is offline and involves three components. The Application Install Monitor <b>403</b> watches a normal installation of the application and records various information including registry entries, required system configuration, file placement, and user options. The Application Profiler <b>407</b> watches a normal execution of the application and records referenced pages, which may be requested to pre-warm the client's cache on behalf of this application. The Application Stream Packager <b>404</b> takes information from the other two Builder components, plus some information it compiles with respect to the layout of the installed application and forms the App Install Block <b>405</b> and the set of Application File Pages <b>406</b>.

P-0168[0168] Server fail-over and server quality of service problems are handled by the client via observation and information provided by the server components. An ASP's Subscription Server provides a list of License Servers associated with that ASP to the client, when the user initiates/modifies his account or when the client software explicitly requests a new list. A License Server provides a list of Application Servers associated with an application to the client, whenever it sends the client an Access Token for the application.

P-0169[0169] Should the client observe apparent non-response or slow response from an Application Server, it switches to another Application Server in its list for the application in question. If none of the Application Servers in its list respond adequately, the client requests a new set for the application from a License Server. The strategy is similar in the case in which the client observes apparent non-response or slow response from a License Server; the client switches to another License Server in its list for the ASP in question. If none of the License Servers in its list responds adequately, the client requests a new set of License Servers from the ASP.

P-0170[0170] Server load balancing is handled by the server components in cooperation with the client. A server monitor component tracks the overall health and responsiveness of all servers. When a server is composing one of the server lists mentioned in the previous paragraph, it selects a set that is alive and relatively more lightly used than others. Client cooperation is marked by the client using the server lists provided by the servers in the expected way, and not unilaterally doing something unexpected, like continuing to use a server which does not appear in the most recent list provided.

P-0171[0171] Security issues associated with the server client relationship are considered in the invention. To ensure that the communication between servers and clients is private and that the servers in question are authorized via appropriate certification, an SSL layer is used. To ensure that the clients are licensed to use a requested application, user credentials (username+password) are presented to a License Server, which validates the user and his licensing status with respect to the application in question and issues an Access Token, and that Access Token is in turn presented to an Application Server, which verifies that the Token's validity before delivering the requested page. Protecting the application in question from piracy on the client's system is discussed in another section, below.

Client-Side Performance Optimization

P-0172[0172] This section focuses on client-specific portions of the invention. The invention may be applied to any operating system that provides a file system interface or block driver interface. A preferred embodiment of the invention is Windows 2000 compliant.

P-0173[0173] With respect to FIG. 6<i>a</i>, several different components of the client software are shown. Some components will typically run as part of the operating system kernel, and other portions will run in user mode.

P-0174[0174] The basis of the client side of the streamed application delivery and execution system is a mechanism for making applications appear as though they were installed on the client computer system without actually installing them.

P-0175[0175] Installed applications are stored in the file system of the client system as files organized in directories. In the state of the art, there are two types of file systems: local and network. Local file systems are stored entirely on media (disks) physically resident in the client machine. Network file systems are stored on a machine physically separate from the client, and all requests for data are satisfied by getting the data from the server. Network file systems are typically slower than local file systems. A traditional approach to use the better performance of a local file system is to install important applications on the local file system, thereby copying the entire application to the local disk. The disadvantages of this approach are numerous. Large applications may take a significant amount of time to download, especially across slower wide area networks. Upgrading applications is also more difficult, since each client machine must individually be upgraded.

P-0176[0176] The invention eliminates these two problems by providing a new type of file system: a streaming file system. The streaming file system allows applications to be run immediately by retrieving application file contents from the server as they are needed, not as the application is installed. This removes the download cost penalty of doing local installations of the application. The streaming file system also contains performance enhancements that make it superior to running applications directly from a network file system. The streaming file system caches file system contents on the local machine. File system accesses that hit in the cache are nearly as fast as those to a local file system. The streaming file system also has sophisticated information about application file access patterns. By using this knowledge, the streaming file system can request portions of application files from the server in advance of when they will actually be needed, thus further improving the performance of applications running on the application streaming file system.

P-0177[0177] In a preferred embodiment of the invention, the application streaming file system is implemented on the client using a file system driver and a helper application running in user mode. The file system driver receives all requests from the operating system for files belonging to the application streaming file system. The requests it handles are all of the standard file system requests that every file system must handle, including (but not limited to) opening and closing files, reading and writing files, renaming files, and deleting files. Each file has a unique identifier consisting of an application number, and a file number within that application. In one embodiment of the invention, the application number is 128 bits and the file number is 32 bits, resulting in a unique file ID that is 160 bits long. The file system driver is responsible for converting path names (such as “z:\program files\foo.exe”) into file IDs (this is described below). Once the file system driver has made this translation, it basically forwards the request to the user-mode program to handle.

P-0178[0178] The user-mode program is responsible for managing the cache of application file contents on the local file system and contacting the application streaming server for file contents that it cannot satisfy out of the local cache. For each file system request, such as read or open, the user-mode process will check to see if it has the requested information in the cache. If it does, it can copy the data from the cache and return it to the file system driver. If it does not, it contacts the application streaming server over the network and obtains the information it needs. To obtain the contents of the file, the user-mode process sends the file identifier for the file it is interested in reading along with an offset at which to read and the number of bytes to read. The application streaming server will send back the requested data.

P-0179[0179] The file system can be implemented using a fragmented functionality to facilitate development and debugging. All of the functionality of the user-mode component can be put into the file system driver itself without significantly changing the scope of the invention. Such an approach is believed to be preferred for a client running Windows <b>95</b> as the operating system.

P-0180[0180] Directories are specially formatted files. The file system driver reads these from the user mode process just like any other files with reads and writes. Along with a header containing information about the directory (such as how long it is), the directory contains one entry for each file that it contains. Each entry contains the name of the file and its file identifier. The file identifier is necessary so that the specified file can be opened, read, or written. Note that since directories are files, directories may recursively contain other directories. All files in an application streaming file system are eventual descendents of a special directory called the “root”. The root directory is used as the starting point for parsing file names.

P-0181[0181] Given a name like “z:/foo/bar/baz”, the file system driver must translate the path “z:/foo/bar/baz” into a file identifier that can be used to read the file from the application streaming service. First, the drive letter is stripped off, leaving “/foo/bar/baz”. The root directory will be searched for the first part of the path, in this case “foo”. If the file “foo” is found in the root directory, and the file “foo” is a directory, then “foo” will be searched for the next portion of the path, “bar”. The file system driver achieves this by using the file id for “foo” (found by searching the root directory) to open the file and read its contents. The entries inside “foo” are then searched for “bar”, and this process continues until the entire path is parsed, or an error occurs.

P-0182[0182] In the following examples and text, the root directory is local and private to the client. Each application that is installed will have its own special subdirectory in the root directory. This subdirectory will be the root of the application. Each application has its own root directory.

P-0183[0183] The invention's approach is much more efficient than other approaches like the standard NFS approach. In those cases, the client sends the entire path “/foo/bar/baz” is sent to the server and the server returns the file id for that file. Next time there is a request for “/foo/bar/baz2” again the entire path needs to be sent. In the approach described here, once the request for “bar” was made, the file ids for all files within bar are sent back including the ids for “baz” and “baz2” and hence “baz2” will already be known to client. This avoids communication between the client and the server.

P-0184[0184] In addition, this structure also allows applications to be easily updated. If certain code segments need to be updated, then the code segment listing in the application root directory is simply changed and the new code segment subdirectory added. This results in the new and correct code segment subdirectory being read when it is referenced. For example if a file by the name of “/foo/bar/baz3” needs to be added, the root directory is simply changed to point to a new version of “foo” and that new version of “foo” points to a new version of “bar” which contains “baz3” in addition to the files it already contained. However the rest of the system is unchanged.

P-0185[0185] Client Features

P-0186[0186] Referring to FIGS. 6<i>a </i>and <b>6</b><i>b</i>, a key aspect of the preferred embodiment of the invention is that application code and data are cached in the client's persistent storage <b>616</b>, <b>620</b>. This caching provides better performance for the client, as accessing code and data in the client's persistent storage <b>620</b> is typically much faster than accessing that data across a wide area network. This caching also reduces the load on the server, since the client need not retrieve code or data from the application server that it already has in its local persistent storage.

P-0187[0187] In order to run an application, its code and data must be present in the client system's volatile storage <b>619</b>. The client software maintains a cache of application code and data that normally reside in the client system's nonvolatile memory <b>620</b>. When the running application requires data that is not present in volatile storage <b>619</b>, the client streaming software <b>604</b> is asked for the necessary code or data. The client software first checks its cache <b>611</b>, <b>620</b> in nonvolatile storage for the requested code or data. If it is found there, the code or data are copied from the cache in nonvolatile storage <b>620</b> to volatile memory <b>619</b>. If the requested code or data are not found in the nonvolatile cache <b>611</b>, <b>620</b>, the client streaming software <b>604</b> will acquire the code or data from the server system via the client's network interface <b>621</b>, <b>622</b>.

P-0188[0188] Application code and data may be compressed <b>623</b>, <b>624</b> on the server to provide better client performance over slow networks. Network file systems typically do not compress the data they send, as they are optimized to operate over local area networks.

P-0189[0189]FIGS. 7<i>a </i>&amp; <b>7</b><i>b </i>demonstrate two ways in which data may be compressed while in transit between the server and client. With either mechanism, the client may request multiple pieces of code and data from multiple files at once. FIG. 7A illustrates the server <b>701</b> compressing the concatenation of A, B, C, and D <b>703</b> and sending this to the client <b>702</b>. FIG. 7B illustrates the server <b>706</b> separately compressing A, B, C, and D <b>708</b> and sending the concatenation of these compressed regions to the client <b>707</b>. In either case, the client <b>702</b>, <b>707</b> will decompress the blocks to retrieve the original contents A, B, C, and D <b>704</b>, <b>709</b> and these contents will be stored in the cache <b>705</b>, <b>710</b>.

P-0190[0190] The boxes marked “Compression” represent any method of making data more compact, including software algorithms and hardware. The boxes marked “Decompression” represent any method for expanding the compacted data, including software algorithms and hardware. The decompression algorithm used must correspond to the compression algorithm used.

P-0191[0191] The mechanism for streaming of application code and data may be a file system. Many network file systems exist. Some are used to provide access to applications, but such systems typically operate well over a local area network (LAN) but perform poorly over a wide area network (WAN). While this solution involves a file system driver as part of the client streaming software, it is more of an application delivery mechanism than an actual file system.

P-0192[0192] With respect to FIG. 8, application code and data are installed onto the file system <b>802</b>, <b>805</b>, <b>806</b>, <b>807</b> of a client machine, but they are executed from the volatile storage (main memory). This approach to streamed application delivery involves installing a special application streaming file system <b>803</b>, <b>804</b>. To the client machine, the streaming file system <b>803</b>, <b>804</b> appears to contain the installed application <b>801</b>. The application streaming file system <b>803</b> will receive all requests for code or data that are part of the application <b>801</b>. This file system <b>803</b> will satisfy requests for application code or data by retrieving it from its special cache stored in a native file system or by retrieving it directly from the streaming application server <b>802</b>. Code or data retrieved from the server <b>802</b> will be placed in the cache in case it is used again.

P-0193[0193] Referring to FIG. 9, an alternative organization of the streaming client software is shown. The client software is divided into the kernel-mode streaming file system driver <b>905</b> and a user-mode client <b>902</b>. Requests made to the streaming file system driver <b>905</b> are all directed to the user-mode client <b>902</b>, which handles the streams from the application streaming server <b>903</b> and sends the results back to the driver <b>905</b>. The advantage of this approach is that it is easier to develop and debug compared with the pure-kernel mode approach. The disadvantage is that the performance will be worse than that of a kernel-only approach.

P-0194[0194] As shown in FIGS. 10 and 11, the mechanism for streaming of application code and data may be a block driver <b>1004</b>, <b>1106</b>. This approach is an alternative to that represented by FIGS. 8 and 9.

P-0195[0195] With respect to FIG. 10, the application streaming software consists of a streaming block driver <b>1004</b>. This block driver <b>1004</b> provides the abstraction of a physical disk to a native file system <b>1003</b> already installed on the client operating system <b>1002</b>. The driver <b>1004</b> receives requests for physical block reads and writes, which it satisfies out of a cache on a standard file system <b>1003</b> that is backed by a physical disk drive <b>1006</b>, <b>1007</b>. Requests that cannot be satisfied by the cache go to the streaming application server <b>1005</b>, as before.

P-0196[0196] Referring to FIG. 11, the application streaming software has been divided into a disk driver <b>1106</b> and a user mode client <b>1102</b>. In a manner similar to that of FIG. 9, the disk driver <b>1106</b> sends all requests it gets to the user-mode client <b>1102</b>, which satisfies them out of the cache <b>1107</b>, <b>1108</b> or by going to the application streaming server <b>1103</b>.

P-0197[0197] The persistent cache may be encrypted with a key not permanently stored on the client to prevent unauthorized use or duplication of application code or data. Traditional network file systems do not protect against the unauthorized use or duplication of file system data.

P-0198[0198] With respect to FIG. 12, unencrypted and encrypted client caches. A, B, C, and D <b>1201</b> representing blocks of application code and data in their natural form are shown. E_k(X) represents the encryption of block X with key k <b>1202</b>. Any encryption algorithm may be used. The key k is sent to the client upon application startup, and it is not stored in the application's persistent storage.

P-0199[0199] Client-initiated prefetching of application code and data helps to improve interactive application performance. Traditional network file systems have no prefetching or simple locality based prefetching.

P-0200[0200] Referring to FIG. 13, the application <b>1301</b> generates a sequence of code or data requests <b>1302</b> to the operating system(OS) <b>1303</b>. The OS <b>1303</b> directs these <b>1304</b> to the client application streaming software <b>1305</b>. The client software <b>1305</b> will fetch the code or data <b>1306</b> for any requests that do not hit in the cache from the server <b>1307</b>, via the network. The client software <b>1305</b> inspects these requests and consults the contents of the cache <b>1309</b> as well as historic information about application fetching patterns <b>1308</b>. It will use this information to request additional blocks of code and data that it expects will be needed soon. This mechanism is referred to as “pull prefetching.”

P-0201[0201] Server-initiated prefetching of application code and data helps to improve interactive application performance. Traditional network file systems have no prefetching or simple locality based prefetching.

P-0202[0202] With respect to FIG. 14, the server-based prefetching is shown. As in FIG. 13, the client application streaming software <b>1405</b> makes requests for blocks <b>1407</b> from the application streaming server <b>1408</b>. The server <b>1408</b> examines the patterns of requests made by this client and selectively returns to the client additional blocks <b>1406</b> that the client did not request but is likely to need soon. This mechanism is referred to as “push prefetching.”

P-0203[0203] A client-to-client communication mechanism allows local application customization to travel from one client machine to another without involving server communication. Some operating systems have a mechanism for copying a user's configuration and setup to another machine. However, this mechanism typically doesn't work outside of a single organization's network, and usually will copy the entire environment, even if only the settings for a single application are desired.

P-0204[0204] Referring to FIG. 15, a client-to-client mechanism is demonstrated. When a user wishes to run an application on a second machine, but wishes to retain customizations made previously on the first, the client software will handle this by contacting the first machine to retrieve customized files and other customization data. Unmodified files will be retrieved as usual from the application streaming server.

P-0205[0205] Here, File <b>4</b> exists in three different versions. The server <b>1503</b> provides one version of this file <b>1506</b>, client 1 <b>1501</b> has a second version of this file <b>1504</b>, and client 2 <b>1502</b> has a third version <b>1505</b>. Files may be modified differently for each client. The clients may also contain files not present on the server or on other clients. File 5 <b>1507</b> is one such file; it exists only on client 1 <b>1501</b>. File 6 <b>1508</b> only exists on client 2 <b>1502</b>.

P-0206[0206] Local Customization

P-0207[0207] A local copy-on-write file system allows some applications to write configuration or initialization files where they want to without rewriting the application, and without disturbing the local customization of other clients. Installations of applications on file servers typically do not allow the installation directories of applications to be written, so additional reconfiguration or rewrites of applications are usually necessary to allow per-user customization of some settings.

P-0208[0208] With respect to FIG. 16, the cache <b>1602</b> with extensions for supporting local file customization is shown. Each block of data in the cache is marked as “clean” <b>1604</b> or “dirty” <b>1605</b>. Pages marked as dirty have been customized by the client <b>1609</b>, and cannot be removed from the cache <b>1602</b> without losing client customization. Pages marked as clean may be purged from the cache <b>1602</b>, as they can be retrieved again from the server <b>1603</b>. The index <b>1601</b> indicates which pages are clean and dirty. In FIG. 16, clean pages are white, and dirty pages are shaded. File 1 <b>1606</b> contains only clean pages, and thus may be entirely evicted from the cache <b>1602</b>. File 2 <b>1607</b> contains only dirty pages, and cannot be removed at all from the cache <b>1602</b>. File 3 <b>1608</b> contains some clean and some dirty pages <b>1602</b>. The clean pages of File 3 <b>1608</b> may be removed from the cache <b>1602</b>, while the dirty pages must remain.

P-0209[0209] Selective Write Protection

P-0210[0210] The client streaming software disallows modifications to certain application files. This provides several benefits, such as preventing virus infections and reducing the chance of accidental application corruption. Locally installed files are typically not protected in any way other than conventional backup. Application file servers may be protected against writing by client machines, but are not typically protected against viruses running on the server itself. Most client file systems allow files to be marked as read-only, but it is typically possible to change a file from read-only to read-write. The client application streaming software will not allow any data to be written to files that are marked as not modifiable. Attempts to mark the file as writeable will not be successful.

P-0211[0211] Error Detection and Correction

P-0212[0212] The client streaming software maintains checksums of application code and data and can repair damaged or deleted files by retrieving another copy from the application streaming server. Traditional application delivery mechanisms do not make any provisions for detecting or correcting corrupted application installs. The user typically detects a corrupt application, and the only solution is to completely reinstall the application. Corrupt application files are detected by the invention automatically, and replacement code or data are invisibly retrieved by the client streaming software without user intervention.

P-0213[0213] When a block of code or data is requested by the client operating system, the client application streaming software will compute the checksum of the data block before it is returned to the operating system. If this checksum does not match that stored in the cache, the client will invalidate the cache entry and retrieve a fresh copy of the page from the server.

P-0214[0214] File Identifiers

P-0215[0215] Applications may be patched or upgraded via a change in the root directory for that application. Application files that are not affected by the patch or upgrade need not be downloaded again. Most existing file systems do not cache files locally.

P-0216[0216] Each file has a unique identifier (number). Files that are changed or added in the upgrade are given new identifiers never before used for this application. Files that are unchanged keep the same number. Directories whose contents change are also considered changes. If any file changes, this will cause its parent to change, all the way up to the root directory.

P-0217[0217] Upgrade Mechanism

P-0218[0218] When the client is informed of an upgrade, it is told of the new root directory. It uses this new root directory to search for files in the application. When retrieving an old file that hasn't changed, it will find the old file identifier, which can be used for the existing files in the cache. In this way, files that do not change can be reused from the cache without downloading them again. For a file that has changed, when the file name is parsed, the client will find a new file number. Because this file number did not exist before the upgrade, the client will not have this file in the cache, and will stream the new file contents when the file is freshly accessed. This way it always gets the newest version of files that change.

P-0219[0219] The client application streaming software can be notified of application upgrades by the application streaming server. These upgrades can be marked as mandatory, in which case the client software will force the application to be upgraded.

P-0220[0220] The client will contact the application streaming server when it starts the application. At this time, the streaming application server can inform the client of any upgrades. If the upgrade is mandatory, the client will be informed, and it will automatically begin using the upgraded application by using the new root directory.

P-0221[0221] Multicast Technique

P-0222[0222] A broadcast or multicast medium may be used to efficiently distribute applications from one application streaming server to multiple application streaming clients. Traditional networked application delivery mechanisms usually involve installing application code and data on a central server and having client machines run the application from that server. The multicast mechanism allows a single server to broadcast or multicast the contents of an application to many machines simultaneously. The client machines will receive the application via the broadcast and save it in their local disk cache. The entire application can be distributed to a large number of client machines from a single server very efficiently.

P-0223[0223] The multicast network is any communication mechanism that has broadcast or multicast capability. Such media include television and radio broadcasts and IP multicasting on the Internet. Each client that is interested in a particular application may listen to the multicast media for code and data for that application. The code and data are stored in the cache for later use when the application is run.

P-0224[0224] These client techniques can be used to distribute data that changes rarely. Application delivery is the most appealing use for these techniques, but they could easily be adopted to distribute other types of slowly changing code and data, such as static databases.

Load Balancing and Fault Tolerance For Streamed Applications

P-0225[0225] This section focuses on load balancing (and thereby scalability) and hardware fail over. Throughout this discussion reference should be made to FIG. 17. Load balancing and fault tolerance are addressed in the invention by using a smart client and smart server combination. A preferred embodiment of the invention that implements these features includes three types of servers (described below): app servers; SLM servers; and an ASP Web server. These are organized as follows:

P-0226[0226] 1: ASP Web server <b>1703</b>—This is the Web server that the user goes to for subscribing to applications, creating accounts etc. Compared to the other two types of servers it is characterized by: lowest traffic, fewest number of them, &amp; least likely to go down.

P-0227[0227] 2: SLM Servers <b>1707</b>—subscription license manager servers—These keep track of which user has subscribed to what applications under what license etc. Compared to the other two types of servers it is characterized by: medium traffic, manageable number, and less likely to go down.

P-0228[0228] 3: App Servers <b>1710</b>—These are the servers to which the users go to for application pages. Compared to the other two types of servers it is characterized by: highest traffic, most number of them, most likely to go down either due to hardware failure or application re-configuration.

P-0229[0229] Server Lists

P-0230[0230] Clients <b>1704</b> subscribe and unsubscribe to applications via the ASP Web server <b>1703</b>. At that point, instead of getting a primary and a secondary server that can perform the job, the ASP Web server <b>1703</b> gives them a non-prioritized list of a large number of SLM servers <b>1706</b> that can do the job. When the application starts to run, each client contacts the SLM servers <b>1707</b>, <b>1708</b>, <b>1709</b> and receive its application server list <b>1705</b> that can serve the application in question and also receive the access tokens that can be used to validate themselves with the application servers <b>1710</b>-<b>1715</b>. All access tokens have an expiration time after which they need to be renewed.

P-0231[0231] Server Selection

P-0232[0232] Having gotten a server list for each type of server <b>1705</b>, <b>1706</b>, the client <b>1704</b> will decide which specific server to send its request to. In a basic implementation, a server is picked randomly from the list, which will distribute the client's load on the servers very close to evenly. An alternative preferred implementation will do as follows:

P-0233[0233] a) Clients will initially pick servers from the list randomly, but they will also keep track of the overall response time they get from each request; and

P-0234[0234] b) As each client learns about response times for each server, it can be more intelligent (rather than random) and pick the most responsive server. It is believed that the client is better suited at deciding which server is most responsive because it can keep track of the round trip response time.

P-0235[0235] Client-Side Hardware Fail Over

P-0236[0236] The server selection logic provides hardware failover in the following manner:

P-0237[0237] a) If a server does not respond, ie., times out, the client <b>1704</b> will pick another server from its list <b>1705</b>, <b>1706</b> and re-send the request. Since all the servers in the client's server list <b>1705</b>, <b>1706</b> are capable of processing the client's request, there are no questions of incompatibility.

P-0238[0238] b) If a SAS client <b>1704</b> gets a second time out, ie., two servers are down, it re-sends the request to multiple servers from its list <b>1705</b>, <b>1706</b> in parallel. This approach staggers the timeouts and reduces the overall delay in processing a request.

P-0239[0239] c) In case of a massive hardware failure, all servers in the client's list <b>1705</b>, <b>1706</b> may be down. At this point, the client will use the interfaces to refresh its server list. This is where the three tiers of servers become important:

P-0240[0240] 1) If the client <b>1704</b> want to refresh its App server list <b>1705</b>, it will contact an SLM server <b>1707</b>, <b>1709</b> in its list of SLM servers <b>1706</b>. Again, the same random (SLM) server selection order is utilized here. Most of the time, this request will be successful and the client will get an updated list of app servers.

P-0241[0241] 2) If for some reason all of the SLM servers <b>1707</b>, <b>1709</b> in the client's list <b>1706</b> are down, it will contact the ASP Web server <b>1703</b> to refresh its SLM server list <b>1706</b>.

P-0242[0242] This 3-tiered approach significantly reduces the impact of a single point of failure—the ASP Web server <b>1703</b>, effectively making it a fail over of a fail over.

P-0243[0243] Server Load Balancing

P-0244[0244] In a preferred embodiment of the invention, a server side monitor <b>1702</b> keeps track of the overall health and response times for each server request. The Monitor performs this task for all Application and SLM servers. It posts prioritized lists of SLM servers and app servers <b>1701</b> that can serve each of the apps in a database shared by the monitor <b>1702</b> and all servers. The monitors algorithm for prioritizing server lists is dominated by the server's response time for each client request. If any servers fail, the monitor <b>1702</b> informs the ASP <b>1703</b> and removes it from the server list <b>1701</b>. Note that the server lists <b>1705</b>, <b>1706</b> that the client <b>1704</b> maintains are subsets of lists the monitor <b>1702</b> maintains in a shared database <b>1701</b>.

P-0245[0245] Since all servers can access the shared database <b>1701</b>, they know how to ‘cut’ a list of servers to a client. For example, the client starts to run an SAS application or it wants to refresh its app server list: It will contact an SLM server and the SLM server will access the database <b>1701</b> and cut a list of servers that are most responsive (from the server's prospective).

P-0246[0246] In this scheme, the server monitor <b>1702</b> is keeping track of what it can track the best: how effectively servers are processing client requests (server's response time). It does not track the network propagation delays etc. that can significantly contribute to a client's observed response time.

P-0247[0247] ASP Managing Hardware Failovers

P-0248[0248] The foregoing approaches provide an opportunity for ASPs to better manage massive scale failures. Specifically, when an ASP <b>1703</b> realizes that massive numbers of servers are down, it can allocate additional resource on a temporary basis. The ASP <b>1703</b> can update the central database <b>1701</b> such that clients will receive only the list that the ASP <b>1703</b> knows to be up and running. This includes any temporary resources added to aid the situation. A particular advantage of this approach is that ASP <b>1703</b> doesn't need special actions, e.g., emails or phone support, to route clients over to these temporary resources; the transition happens automatically.

P-0249[0249] Handling Client Crashes and Client Evictions

P-0250[0250] To prevent the same user from running the same application from multiple machines, the SLM servers <b>1707</b>, <b>1708</b>, <b>1709</b> track what access tokens have been handed to what users. The SAS file system tracks the beginning and end of applications. The user's SAS client software asks for an access token from the SLM servers <b>1707</b>, <b>1708</b>, <b>1709</b> at the beginning of an application if it already does not have one and it releases the access token when the application ends. The SLM server makes sure that at a given point only one access token has been given to a particular user. In this manner, the user can run the application from multiple machines, but only from one at a particular time. However, if the user's machine crashes before the access token has been relinquished or if for some reason the ASP <b>1703</b> wants to evict a user, the access token granted to the user must be made invalid. To perform this, the SLM server gets the list of application servers <b>1705</b> that have been sent to the client <b>1704</b> for serving the application and sends a message to those application servers <b>1710</b>, <b>1711</b>, <b>1713</b>, <b>1714</b> to stop serving that particular access token. This list is always maintained in the database so that every SLM server can find out what list is held by the user's machine. The application servers before servicing any access token must check with this list to ensure that the access token has not become invalid. Once the access token expires, it can be removed from this list.

Server-Side Performance Optimization

P-0251[0251] This section describes approaches that can be taken to reduce client-side latency (the time between when an application page is needed and when it is obtained) and improve Application Server scalability (a measure of the number of servers required to support a given population of clients). The former directly affects the perceived performance of an application by an end user (for application features that are not present in the user's cache), while the latter directly affects the cost of providing application streaming services to a large number of users.

P-0252[0252] Application Server Operation

P-0253[0253] The basic purpose of the Application Server is to return Application File Pages over the network as requested by a client. The Application Server holds a group of Stream Application Sets from which it obtains the Application File Pages that match a client request. The Application Server is analogous to a typical network file system (which also returns file data), except it is optimized for delivery of Application file data, i.e., code or data that belong directly to the application, produced by the software provider, as opposed to general user file data (document files and other content produced by the users themselves). The primary differences between the Application Server and a typical network file system are:

P-0254[0254] 1. The restriction to handle only Application file data allows the Application Server to only service read requests, with writes being disallowed or handled on the client itself in a copy-on-write manner;

P-0255[0255] 2. Access checks occur at the application level, that is a client is given all-or-none access to files for a given software application;

P-0256[0256] 3. The Application Server is designed to operate across the Internet, as opposed to typical network file systems, which are optimized to run over LANs. This brings up additional requirements of handling server failures, maximizing network bandwidth and minimizing latency, and handling security; and

P-0257[0257] 4. The Application Server is application-aware, unlike typical network file systems, which treat all software application files the same as all other files. This allows the Application Server to use and collect per-application access profile information along with other statistics.

P-0258[0258] To service a client request, the Application Server software component keeps master copies of the full Application Stream Sets on locally accessible persistent storage. In main memory, the Application Server maintains a cache of commonly accessed Application File Pages. The primary steps taken by the Application Server to service a client request are:

P-0259[0259] 1. Receive and decode the client request;

P-0260[0260] 2. Validate the client's privilege to access the requested data, e.g., by means of a Kerberos-style ticket issued by a trusted security service;

P-0261[0261] 3. Look up the requested data in the main memory cache, and failing that, obtain it from the master copy on disk while placing it in the cache; and

P-0262[0262] 4. Return the File Pages to the client over the network.

P-0263[0263] The techniques used to reduce latency and improve server scalability (the main performance considerations) are described below.

P-0264[0264] Server Optimization Features

P-0265[0265] Read-Only File System For Application Files

P-0266[0266] Because virtually all application files (code and data) are never written to by users, virtually the entire population of users have identical copies of the application files. Thus a system intending to deliver the application files can distribute a single, fixed image across all servers. The read-only file system presented by the Application Server represents this sharing, and eliminates the complexities of replication management, e.g., coherency, that occur with traditional network file systems. This simplification enables the Application Servers to respond to requests more quickly, enables potential caching at intervening nodes or sharing of caches across clients in a peer-to-peer fashion, and facilitates fail over, since with the read-only file system the Application File Pages as identified by the client (by a set of unique numbers) will always globally refer to the same content in all cases.

P-0267[0267] Per-Page Compression

P-0268[0268] Overall latency observed by the client can be reduced under low-bandwidth conditions by compressing each Application File Page before sending it. Referring to FIG. 18, the benefits of the use of compression in the streaming of Application File Pages, is illustrated. The client <b>1801</b> and server <b>1802</b> timelines are shown for a typical transfer of data versus the same data sent in a compressed form. The client requests the data from the server <b>1803</b>. The server processes the request <b>1804</b> and begins sending the requested data. The timelines then diverge due to the ability to stream the compressed data <b>1805</b> faster than the uncompressed data <b>1806</b>.

P-0269[0269] With respect to FIG. 19, the invention's pre-compression of Application File Pages process is shown. The Builder generates the stream application sets <b>1901</b>, <b>1902</b> which are then pre-compressed by the Stream Application Set Post-Processor <b>1903</b>. The Stream Application Set Post-Processor <b>1903</b> stores the compressed application sets in the persistent storage device <b>1904</b>. Any client requests for data are serviced by the Application Server which sends the pre-compressed data to the requesting client <b>1905</b>. The reduction in size of the data transmitted over the network reduces the time to arrival (though at the cost of some processing time on the client to decompress the data). When the bandwidth is low relative to processing power, e.g., 256 kbps with a Pentium-III-600, this can reduce latency significantly.

P-0270[0270] Page-Set Compression

P-0271[0271] When pages are relatively small, matching the typical virtual memory page size of 4 kB, adaptive compression algorithms cannot deliver the same compression ratios that they can for larger blocks of data, e.g., 32 kB or larger. Referring to FIG. 20, when a client <b>2001</b> requests multiple Application File Pages at one time <b>2002</b>, the Application Server <b>2006</b> can concatenate all the requested pages and compress the entire set at once <b>2004</b>, thereby further reducing the latency the client will experience due to the improved compression ratio. If the pages have already been compressed <b>2003</b>, then the request is fulfilled from the cache <b>2007</b> where the compressed pages are stored. The server <b>2006</b> responds to the client's request through the transfer of the compressed pages <b>2005</b>.

P-0272[0272] Post-Processing of Stream Application Sets

P-0273[0273] The Application Server may want to perform some post processing of the raw Stream Application Sets in order to reduce its runtime-processing load, thereby improving its performance. One example is to pre-compress all Application File Pages contained in the Stream Application Sets, saving a great deal of otherwise repetitive processing time. Another possibility is to rearrange the format to suit the hardware and operating system features, or to reorder the pages to take advantage of access locality.

P-0274[0274] Static and Dynamic Profiling

P-0275[0275] With respect to FIG. 21, since the same application code is executed in conjunction with a particular Stream Application Set <b>2103</b> each time, there will be a high degree of temporal locality of referenced Application File Pages, e.g., when a certain feature is invoked, most if not all the same code and data is referenced each time to perform the operation. These access patterns can be collected into profiles <b>2108</b>, which can be shipped to the client <b>2106</b> to guide its prefetching (or to guide server-based <b>2105</b> prefetching), and they can be used to pre-package groups of Application File Pages <b>2103</b>, <b>2104</b> together and compress them offline as part of a post-processing step <b>2101</b>, <b>2102</b>, <b>2103</b>. The benefit of the latter is that a high compression ratio can be obtained to reduce client latency without the cost of runtime server processing load (though only limited groups of Application File Pages will be available, so requests which don't match the profile would get a superset of their request in terms of the pre-compressed groups of Application File Pages that are available).

P-0276[0276] Fast Server-Side Client Privilege Checks

P-0277[0277] Referring to FIG. 22, having to track individual user's credentials, i.e., which Applications they have privileges to access, can limit server scalability since ultimately the per-user data must be backed by a database, which can add latency to servicing of user requests and can become a central bottleneck. Instead, a separate License Server <b>2205</b> is used to offload per-user operations to grant privileges to access application data, and thereby allow the two types of servers <b>2205</b>, <b>2210</b> to scale independently. The License Server <b>2205</b> provides the client an Access Token (similar to a Kerberos ticket) that contains information about what application it represents rights for along with an expiration time. This simplifies the operations required by the Application Server <b>2210</b> to validate a client's privileges <b>2212</b>. The Application Server <b>2210</b> needs only to decrypt the Access Token (or a digest of it) via a secret key shared <b>2209</b> with the License Server <b>2205</b> (thus verifying the Token is valid), then checking the validity of its contents, e.g., application identifier, and testing the expiration time. Clients <b>2212</b> presenting Tokens for which all checks pass are granted access. The Application Server <b>2210</b> needs not track anything about individual users or their identities, thus not requiring any database operations. To reduce the cost of privilege checks further, the Application Server <b>2210</b> can keep a list of recently used Access Tokens for which the checks passed, and if a client passes in a matching Access Token, the server need only check the expiration time, with no further decryption processing required.

P-0278[0278] Connection Management

P-0279[0279] Before data is ever transferred from a client to a server, the network connection itself takes up one and a half network round trips. This latency can adversely impact client performance if it occurs for every client request. To avoid this, clients can use a protocol such as HTTP 1.1, which uses persistent connections, i.e., connections stay open for multiple requests, reducing the effective connection overhead. Since the client-side file system has no knowledge of the request patterns, it will simply keep the connection open as long as possible. However, because traffic from clients may be bursty, the Application Server may have more open connections than the operating system can support, many of them being temporarily idle. To manage this, the Application Server can aggressively close connections that have been idle for a period of time, thereby achieving a compromise between the client's latency needs and the Application Server's resource constraints. Traditional network file systems do not manage connections in this manner, as LAN latencies are not high enough to be of concern.

P-0280[0280] Application Server Memory Usage/Load Balancing

P-0281[0281] File servers are heavily dependent on main memory for fast access to file data (orders of magnitude faster than disk accesses). Traditional file servers manage their main memory as cache of file blocks, keeping the most commonly accessed ones. With the Application Server, the problem of managing main memory efficiently becomes more complicated due to there being multiple servers providing a shared set of applications. In this case, if each server managed its memory independently, and was symmetric with the others, then each server would only keep those file blocks most common to all clients, across all applications. This would cause the most common file blocks to be in the main memory of each and every Application server, and since each server would have roughly the same contents in memory, adding more servers won't improve scalability by much, since not much more data will be present in memory for fast access. For example, if there are application A (accessed 50% of the time), application B (accessed 40% of the time), and application C (accessed 10% of the time), and application A and B together consume more memory cache than a single Application Server has, and there are ten Application Servers, then none of the Application Servers will have many blocks from C in memory, penalizing that application, and doubling the number of servers will improve C's performance only minimally. This can be improved upon by making the Application Servers asymmetric, in that a central mechanism, e.g., system administrator, assigns individual Application Servers different Application Stream Sets to provide, in accordance with popularity of the various applications. Thus, in the above example, of the ten servers, five can be dedicated to provide A, four to B, and one to C, (any extra memory available for any application) making a much more effective use of the entire memory of the system to satisfy the actual needs of clients. This can be taken a step further by dynamically (and automatically) changing the assignments of the servers to match client accesses over time, as groups of users come and go during different time periods and as applications are added and removed from the system. This can be accomplished by having servers summarize their access patterns, send them to a central control server, which then can reassign servers as appropriate.

Conversion of Conventional Applications to Enable Streamed Delivery and Execution

P-0282[0282] The Streamed Application Set Builder is a software program. It is used to convert locally installable applications into a data set suitable for streaming over the network. The streaming-enabled data set is called the Streamed Application Set (SAS). This section describes the procedure used to convert locally installable applications into the SAS.

P-0283[0283] The application conversion procedure into the SAS consists of several phases. In the first phase, the Builder program monitors the installation process of a local installation of the desired application for conversion. The Builder monitors any changes to the system and records those changes in an intermediate data structure. After the application is installed locally, the Builder enters the second phase of the conversion. In the second phase, the Builder program invokes the installed application executable and obtains sequences of frequently accessed file blocks of this application. Both the Builder program and the client software use the sequence data to optimize the performance of the streaming process. Once the sequencing information is obtained, the Builder enters the final phase of the conversion. In this phase, the Builder gathers all data obtained from the first two phases and processes the data into the Streamed Application Set.

P-0284[0284] Detailed descriptions of the three phases of the Builder conversion process are described in the following sections. The three phases consist of installation monitoring (IM), application profiling (AP), and SAS packaging (SP). In most cases, the conversion process is general and applicable to all types of systems. In places where the conversion is OS dependent, the discussion is focused on the Microsoft Windows environment. Issues on conversion procedure for other OS environments are described in later sections.

P-0285[0285] Installation Monitoring (IM)

P-0286[0286] In the first phase of the conversion process, the Builder Installation Monitor (IM) component invokes the application installation program that installs the application locally. The IM observes all changes to the local computer during the installation. The changes may involve one or more of the following: changes to system or environment variables; and modifications, addition, or deletion of one or more files. The IM records all changes to the variables and files in a data structure to be sent to the Builder's Streamed Application Packaging component. In the following paragraphs, detailed description of the Installation Monitor is described for Microsoft Windows environment.

P-0287[0287] In Microsoft Windows system, the Installation Monitor (IM) component consists of a kernel-mode driver subcomponent and a user-mode subcomponent. The kernel-mode driver is hooked into the system registry and file system function interface calls. The hook into the registry function calls allows the IM to monitor system variable changes. The hook into the file system function calls enables the IM to observe file changes.

P-0288[0288] Installation Monitor Kernel-Mode subcomponent (IM-KM)

P-0289[0289] With respect to FIG. 23, the IM-KM subcomponent monitors two classes of information during an application installation: system registry modifications and file modifications. Different techniques are used for each of these classes.

P-0290[0290] To monitor system registry modifications <b>2314</b>, the IM-KM component replaces all kernel-mode API calls in the System Service Table that write to the system registry with new functions defined in the IM-KM subcomponent. When an installation program calls one of the API functions to write to the registry <b>2315</b>, the IM-KM function is called instead, which logs the modification data <b>2317</b> (including registry key path, value name and value data) and then forwards the call to the actual operating system defined function <b>2318</b>. The modification data is made available to the IM-UM subcomponent through a mechanism described below.

P-0291[0291] To monitor file modifications, a filter driver is attached to the file system's driver stack. Each time an installation program modifies a file on the system, a function is called in the IM-KM subcomponent, which logs the modification data (including file path and name) and makes it available to the IM-UM using a mechanism described below.

P-0292[0292] The mechanisms used for monitoring registry modifications and file modifications will capture modifications made by any of the processes currently active on the computer system. While the installation program is running, other processes that, for example, operate the desktop and service network connections may be running and may also modify files or registry data during the installation. This data must be removed from the modification data to avoid inclusion of modifications that are not part of the application installation. The IM-KM uses process monitoring to perform this filtering.

P-0293[0293] To do process monitoring, the IM-KM installs a process notification callback function that is called each time a process is created or destroyed by the operating system. Using this callback function, the operating system sends the created process ID as well as the process ID of the creator (or parent) process. The IM-KM uses this information, along with the process ID of the IM-UM, to create a list of all of the processes created during the application installation. The IM-KM uses the following algorithm to create this list:

P-0294[0294] 1. Before the installation program is launched by the IM-UM, the IM-UM passes its own process ID to the IM-KM. Since the IM-UM is launching the installation application, the IM-UM will be the ancestor (parent, grandparent, etc.) of any process (with one exception—the Installer Service described below) that modifies files or registry data as part of the application installation.

P-0295[0295] 2. When the installation is launched and begins the creating processes, the IM-KM process monitoring logic is notified by the operating system via the process notification callback function.

P-0296[0296] 3. If the creator (parent) process ID sent to the process notification callback function is already in the process list, the new process is included in the list.

P-0297[0297] When an application on the system modifies either the registry or files, and the IM-KM monitoring logic captures the modification data, but before making it available to the IM-UM, it first checks to see if the process that modified the registry or file is part of the process list. It is only made available to the IM-UM if it is in the process list.

P-0298[0298] It is possible that a process that is not a process ancestor of the IM-UM will make changes to the system as a proxy for the installation application. Using interprocess communication, an installation program may request than an Installer Service make changes to the machine. In order for the IM-KM to capture changes made by the Installer Service, the process monitoring logic includes a simple rule that also includes any registry or file changes that have been made by a process with the same name as the Installer Service process. On Windows <b>2000</b>, for example, the Installer Service is called “msi.exe”.

P-0299[0299] Installation Monitor User-Mode subcomponent (IM-UM)

P-0300[0300] The IM kernel-mode (IM-KM) driver subcomponent is controlled by the user-mode subcomponent (IM-UM). The IM-UM sends messages to the IM-KM to start <b>2305</b> and stop <b>2309</b> the monitoring process via standard I/O control messages known as IOCTLs. The message that starts the IM-KM also passes in the process ID of the IM-UM to facilitate process monitoring described in the IM-KM description.

P-0301[0301] When the installation program <b>2306</b> modifies the computer system, the IM-KM signals a named kernel event. The IM-UM listens for these events during the installation. When one of these events is signaled, the IM-UM calls the IM-KM using an IOCTL message. In response, the IM-KM packages data describing the modification and sends it to the IM-UM <b>2318</b>.

P-0302[0302] The IM-UM sorts this data and removes duplicates. Also, it parameterizes all local-system-specific registry keys, value names, and values. For example, an application will often store paths in the registry that allow it to find certain files at run-time. These path specifications must be replaced with parameters that can be recognized by the client installation software.

P-0303[0303] A user interface is provided for the IM-UM that allows an operator of the Builder to browse through the changes made to the machine and to edit the modification data before the data is packaged into an SAS.

P-0304[0304] Once the installation of an application is completed <b>2308</b>, the IM-UM forwards data structures representing the file and registry modifications to the Streamed Application Packager <b>2312</b>.

P-0305[0305] Monitoring Application Configuration

P-0306[0306] Using the techniques described above for monitoring file modifications and monitoring registry modifications, the builder can also monitor a running application that is being configured for a particular working environment. The data acquired by the IM-UM can be used to duplicate the same configuration on multiple machines, making it unnecessary for each user to configure his/her own application installation.

P-0307[0307] An example of this is a client server application for which the client will be streamed to the client computer system. Common configuration modifications can be captured by the IM and packed into the SAS. When the application is streamed to the client machine, it is already configured to attach to the server and begin operation.

P-0308[0308] Application Profiling (AP)

P-0309[0309] Referring to FIG. 24, in the second phase of the conversion process, the Builder's Application Profiler (AP) component invokes the application executable program that is installed during the first phase of the conversion process. Given a particular user input, the executable program file blocks are accessed in a particular sequence. The purpose of the AP is to capture the sequence data associated with some user inputs. This data is useful in several ways.

P-0310[0310] First of all, frequently used file blocks can be streamed to the client machine before other less used file blocks. A frequently used file block is cached locally on the client cache before the user starts using the streamed application for the first time. This has the effect of making the streamed application as responsive to the user as the locally installed application by hiding any long network latency and bandwidth problems.

P-0311[0311] Secondly, the frequently accessed files can be reordered in the directory to allow faster lookup of the file information. This optimization is useful for directories with large number of files. When the client machine looks up a frequently used file in a directory, it finds this file early in the directory search. In an application run with many directory queries, the performance gain is significant.

P-0312[0312] Finally, the association of a set of file blocks with a particular user input allows the client machine to request minimum amount of data needed to respond to that particular user command. The profile data association with a user command is sent from the server to the client machine in the AppInstallBlock during the ‘preparation’ of the client machine for streaming. When the user on a client machine invokes a particular command, the codes corresponding to this command are prefetched from the server.

P-0313[0313] The Application Profiler (AP) is not as tied to the system as the Installation Monitor (IM) but there are still some OS dependent issues. In the Windows system, the AP still has two subcomponents: kernel-mode (AP-KM) subcomponent and the user-mode (AP-UM) subcomponent. The AP-UM invokes the converting application executable. Then AP-UM starts the AP-KM <b>2403</b>, <b>2413</b> to track the sequences of file block accesses by the application <b>2414</b>. Finally when the application exits after the pre-specified amount of sequence data is gathered, the AP-UM retrieves the data from AP-KM <b>2406</b>, <b>2417</b> and forwards the data to the Streamed Application Packager <b>2411</b>.

P-0314[0314] Streamed Application Set Packaging (SP)

P-0315[0315] With respect to FIG. 25, in the final phase of the conversion process, the Builder's Streamed Application Set Packager (SP) component processes the data structure from IM and AP to create a data set suitable for streaming over the network. This converted data set is called the Streamed Application Set <b>2520</b> and is suitable for uploading to the Streamed Application Servers for subsequent downloading by the stream client. FIG. 23 shows the control flow of the SP module.

P-0316[0316] Each file included in a Streamed Application Set <b>2520</b> is assigned a file number that identifies it within the SAS.

P-0317[0317] The Streamed Application Set <b>2520</b> consists of the three sets of data from the Streamed Application Server's perspective. The three types of data are the Concatenation Application File (CAF) <b>2519</b>, <b>2515</b>, the Size Offset File Table (SOFT)<b>2518</b>, <b>2514</b>, <b>2507</b>, and the Root Versioning Table (RVT) <b>2518</b>, <b>2514</b>.

P-0318[0318] The CAF <b>2519</b>, <b>2515</b> consists of all the files and directories needed to stream to the client. The CAF can be further divided into two subsets: initialization data set and the runtime data set.

P-0319[0319] The initialization data set is the first set of data to be streamed from the server to the client. This data set contains the information captured by IM and AP needed by the client to prepare the client machine for streaming this particular application. This initialization data set is also called the AppInstallBlock (AIB) <b>2516</b>, <b>2512</b>. In addition to the data captured by the IM and AP modules, the SP is also responsible for merging any new dynamic profile data gathered from the client and the server. This data is merged into the existing AppInstallBlock to optimize subsequent streaming of the application <b>2506</b>. With the list of files obtained by the IM during application installation, the SP module separates the list of files into regular streamed files and the spoof files. The spoof files consists of those files not installed into standard application directory. This includes files installed into system directories and user specific directories. The detailed format description of the AppInstallBlock is described later.

P-0320[0320] The second part of the CAF consists of the runtime data set. This is the rest of the data that is streamed to the client once the client machine is initialized for this particular application. The runtime data consists of all the regular application files and the directories containing information about those application files. Detailed format description of the runtime data in the CAF section is described below. The SP appends every file recorded by IM into the CAF and generates all directories. Each directory contains list of file name, file number, and the metadata associated with the files in that particular directory <b>2517</b>, <b>2513</b>.

P-0321[0321] The SP is also responsible for generating the SOFT file <b>2518</b>, <b>2514</b>, <b>2507</b>. This is a table used to index into the CAF for determining the start and the end of a file. The server uses this information to quickly access the proper file within the directory for serving the proper file blocks to the client.

P-0322[0322] Finally, the SP creates the RVT file <b>2518</b>, <b>2514</b>. The Root Versioning Table contains a list of root file number and version number. This information is used to track minor application patches and upgrades. Each entry in the RVT corresponds to one patch level of the application with a corresponding new root directory. The SP generates new parent directories when any single file in that subdirectory tree is changed from the patched upgrade. The RVT is uploaded to the server and requested by the client at appropriate time for the most updated version of the application by a simple comparison of the client's Streamed Application root file number with the RVT table located on the server once the client is granted access authorization to retrieve the data.

P-0323[0323] With respect to FIGS. 26<i>a </i>and <b>26</b><i>b</i>, the internal representation of a simple SAS before and after a new file is added to a new version of an application is shown. The original CAF <b>2601</b> has the new files <b>2607</b> appended to it <b>2604</b> by the SP. The SOFT <b>2602</b> is correspondingly updated <b>2605</b> with the appropriate table entries <b>2608</b> to index the new files <b>2607</b> the CAF <b>2604</b>. Finally, the RVT <b>2603</b> is updated <b>2606</b> to reflect the new version <b>2609</b>.

P-0324[0324] Data Flow Description

P-0325[0325] The following list describes the data that is passed from one component to another. The numbers corresponds to the numbering in the Data Flow diagram of FIG. 27.

P-0326[0326] Install Monitor

P-0327[0327] 1. The full pathname of the installer program is queried from the user by the Builder program and is sent to the Install Monitor.

P-0328[0328] 2. The Install Monitor (IM) user-mode sends a read request to the OS to spawn a new process for installing the application on the local machine.

P-0329[0329] 3. The OS loads the application installer program into memory and run the application installer program. OS returns the process ID to the IM.

P-0330[0330] 4. The application program is started by the IM-UM.

P-0331[0331] 5. The application installer program sends read request to the OS to read the content of the CD.

P-0332[0332] 6. The CD media data files are read from the CD.

P-0333[0333] 7. The files are written to the appropriate location on the local hard-drive. <b>8</b>. IM kernel-mode captures all file read/write requests and all registry read/write requests by the application installer program.

P-0334[0334] 9. IM user-mode program starts the IM kernel-mode program and sends the request to start capturing all relevant file and registry data.

P-0335[0335] 10. IM kernel-mode program sends the list of all file modifications, additions, and deletions; and all registry modifications, additions, and deletions to the IM user-mode program.

P-0336[0336] 11. IM informs the SAS Builder UI that the installation monitoring has completed and display the file and registry data in a graphical user interface.

P-0337[0337] Application Profiler

P-0338[0338] 12. Builder UI invokes Application Profiling (AP) user-mode program by querying the user for the list of application executable names to be profiled. The AP user-mode also queries the user for division of file blocks into sections corresponding to the commands invoked by the user of the application being profiled.

P-0339[0339] 13. Application Profiler user-mode invokes each application executable in succession by spawning each program in a new process. The OS loads the application executable into memory, runs the application executable, and returns the process ID to the Application Profiler.

P-0340[0340] 14. During execution, the OS on behalf of the application, sends the request to the hard-drive controller to read the appropriate file blocks into memory as needed by the application.

P-0341[0341] 15. The hard-drive controller returns all file blocks requested by the Os.

P-0342[0342] 16. Every file access to load the application file blocks into memory is monitored by the Application Profiler (AP) kernel-mode program.

P-0343[0343] 17. The AP user-mode program informs the AP kernel-mode program to start monitoring relevant file accesses.

P-0344[0344] 18. Application Profiler kernel-mode returns the file access sequence and frequency information to the user-mode program.

P-0345[0345] 19. Application Profiler returns the processed profile information. This has two sections. The first section is used to identify the frequency of files accessed. The second section is used to list the file blocks for prefetch to the client. The file blocks can be further categorized into subsections according to the commands invoked by the user of the application.

P-0346[0346] SAS Packager

P-0347[0347] 20. The Streamed Application Packager receives files and registry changes from the Builder UI. It also receives the file access frequency and a list of file blocks from the Profiler. File numbers are assigned to each file.

P-0348[0348] 21. The Streamed Application Packager reads all the file data from the hard-drive that are copied there by the application installer.

P-0349[0349] 22. The Streamed Application Packager also reads the previous version of Streamed Application Set for support of minor patch upgrades.

P-0350[0350] 23. Finally, the new Streamed Application Set data is stored back to non-volatile storage.

P-0351[0351] 24. For new profile data gathered after the SAS has been created, the packager is invoked to update the AppInstallBlock in the SAS with the new profile information.

P-0352[0352] Mapping of Data Flow to Streamed Application Set (SAS)

P-0353[0353] Step 7: Data gathered from this step consist of the registry and file modification, addition, and deletion. The data are mapped to the AppInstallBlock's File Section, Add Registry Section, and Remove Registry Section.

P-0354[0354] Step 8 &amp; 19: File data are copied to the local hard-drive then concatenated into part of the CAF contents. Part of the data is identified as spoof or copied files and the file names and/or contents are added to the AppInstallBlock.

P-0355[0355] Step 15 &amp; 21: Part of the data gathered by the Profiler or gathered dynamically by the client is used in the AppInstallBlock as a prefetch hint to the client. Another part of the data is used to generate a more efficient SAS Directory content by ordering the files according the usage frequency.

P-0356[0356] Step 20: If the installation program was an upgrade, SAS Packager needs previous version of the Streamed Application Set data. Appropriate data from the previous version is combined with the new data to form the new Streamed Application Set.

P-0357[0357] Format of Streamed Application Set

P-0358[0358] Referring to FIG. 28, the format of the Streamed Application Set consists of three sections: Root Version Table (RVT) <b>2802</b>, Size Offset File Table (SOFT) <b>2803</b>, and Concatenation Application File (CAF) <b>2801</b>. The RVT section <b>2802</b> lists all versions of the root file numbers available in a Streamed Application Set. The SOFT <b>2803</b> section consists of the pointers into the CAF <b>2801</b> section for every file in the CAF <b>2801</b>. The CAF section <b>2801</b> contains the concatenation of all the files associated with the streamed application. The CAF section <b>2801</b> is made up of regular application files, SAS directory files <b>2805</b>, AppInstallBlock <b>2804</b>, and icon files. See below for detailed information on the content of the SAS file.

P-0359[0359] OS Dependent Format

P-0360[0360] The format of the Streamed Application Set is designed to be as portable as possible across all OS platforms. At the highest level, the format of CAF, SOFT, and RVT that make up the format of the Streamed Application Set are completely portable across any OS platforms. One piece of data structure that is OS dependent is located in the initialization data set called AppInstallBlock in the CAF. This data is dependent on the type of OS due to the differences in low-level system differences among different OS. For example, Microsoft Windows contains system environment variables called the Registry. The Registry has a particular tree format not found in other operating systems like UNIX or MacOS.

P-0361[0361] Another OS dependent piece of data is located in the SAS directory files in the CAF. The directory contains file metadata information specific to Windows files. For example on the UNIX platform, there does not exist a hidden flag. This platform specific information needs to be transmitted to the client to fool the streamed application into believing that the application data is located natively on the client machine with all the associated file metadata intact. If SAS is to be used to support streaming of UNIX or MacOS applications, file metadata specific to those systems will need to be recorded in the SAS directory.

P-0362[0362] Lastly, the format of the file names itself is OS dependent. Applications running on the Windows environment inherit the old MSDOS 8.3 file name format. To support this properly, the format of the SAS Directory file in CAF requires an additional 8.3 field to store this information. This field is not needed in other operating systems like UNIX or MacOS.

P-0363[0363] Device Driver Versus File System Paradigm

P-0364[0364] Referring to FIGS. 29 and 30, the SAS client Prototype is implemented using the ‘device driver’ paradigm. One of the advantages of the device driver approach is that the caching of the sector blocks is simpler. In the device driver approach, the client cache manager <b>2902</b> only needs to track sector numbers in its cache <b>2903</b>. In comparison with the ‘file system’ paradigm, more complex data structure are required by the client cache manager <b>3002</b> to track a subset of a file that is cached <b>3003</b> on a client machine. This makes the device driver paradigm easier to implement.

P-0365[0365] On the other hand, there are many drawbacks to the device driver paradigm. On the Windows system, the device driver approach has a problem supporting large numbers of applications. This is due to the phantom limitation on the number of assignable drive letters available in a Windows system (26 letters); and the fact that each application needs to be located on its own device. Note that having multiple applications on a device is possible, but then the server needs to maintain an exponential number of devices that support all possible combinations of applications. This is too costly to maintain on the server.

P-0366[0366] Another problem with the device driver approach is that the device driver operates at the disk sector level. This is a much lower level than operating at the file level in the file system approach. The device driver does not know anything about files. Thus, the device driver cannot easily interact with the file level issues. For example, spoofing files and interacting with the OS file cache is nearly impossible with the device driver approach. Both spoofing files and interacting with the OS buffer cache are needed to get higher performance. In addition, operating at the file system level lends to optimizing the file system to better suit this approach of running applications. For instance, typical file systems do logging and make multiple disk sector requests at a time. These are not needed in this approach and are actually detrimental to the performance. When operating at the device driver level, not much can be done about that. Also, operating at the file system level helps in optimizing the protocol between the client and the server.

P-0367[0367] Implementation in the Prototype

P-0368[0368] The prototype has been implemented and tested successfully on the Windows and Linux distributed system. The prototype is implemented using the device driver paradigm as described above. The exact procedure for streaming application data is described next.

P-0369[0369] First of all, the prototype server is started on either the Windows-based or Linux-based system. The server creates a large local file mimicking large local disk images. Once the disk images are prepared, it listens to TCP/IP ports for any disk sector read or write requests.

P-0370[0370] Implementation of SAS Builder

P-0371[0371] The SAS Builder has been implemented on the Windows-based platform. A preliminary Streamed Application Set file has been created for real-world applications like Adobe Photoshop. A simple extractor program has been developed to extract the SAS data on a pristine machine without the application installed locally. Once the extractor program is run on the SAS, the application runs as if it was installed locally on that machine. This process verifies the correctness of the SAS Building process.

Format of Streamed Application Set (SAS)

P-0372[0372] Functionality

P-0373[0373] The streamed application set (SAS), illustrated in FIG. 28, is a data set associated with an application suitable for streaming over the network. The SAS is generated by the SAS Builder program. The program converts locally installable applications into the SAS. This section describes the format of the SAS.

P-0374[0374] Note: Fields greater than a single byte are stored in little-endian format. The Stream Application Set (SAS) file size is limited to 2^ 64 bytes. The files in the CAF section are laid out in the same order as its corresponding entries in the SOFT table.

P-0375[0375] Data Type Definitions

P-0376[0376] The format of the SAS consists of four sections: header, Root Version Table (RVT), Size Offset File Table (SOFT), and Concatenation Application File (CAF) sections.

P-0377[0377] 1. Header Section

P-0378[0378] MagicNumber [4 bytes]: Magic number identifying the file content with the SAS.

P-0379[0379] ESSVersion [4 bytes]: Version number of the SAS file format.

P-0380[0380] AppID [16 bytes]: A unique application ID for this application. This field must match the AppID located in the AppInstallBlock. Window Guidgen API is used to create this identifier.

P-0381[0381] Flags [4 bytes]: Flags pertaining to SAS.

P-0382[0382] Reserved [32 bytes]: Reserved spaces for future.

P-0383[0383] RVToffset [8 bytes]: Byte offset into the start of the RVT section.

P-0384[0384] RVTsize [8 bytes]: Byte size of the RVT section.

P-0385[0385] SOFToffset [8 bytes]: Byte offset into the start of the SOFT section.

P-0386[0386] SOFTsize [8 bytes]: Byte size of the SOFT section.

P-0387[0387] CAFoffset [8 bytes]: Byte offset into the start of the CAF section.

P-0388[0388] CAFsize [8 bytes]: Byte size of the CAF section.

P-0389[0389] VendorNameIsAnsi [1 byte]: 0 if the vendor name is in Unicode format. 1 if the vendor name is in ANSI format.

P-0390[0390] VendorNameLength [4 bytes]: Byte length of the vendor name.

P-0391[0391] VendorName [X bytes]: Name of the software vendor who created this application. e.g., “Microsoft”. Null-terminated.

P-0392[0392] AppBaseNameIsAnsi [1 byte]: 0 if the vendor name is in Unicode format. 1 if the vendor name is in ANSI format.

P-0393[0393] AppBaseNameLength [4 bytes]: Byte length of the application base name.

P-0394[0394] AppBaseName [X bytes]: Base name of the application. e.g., “Word 2000”. Null-terminated.

P-0395[0395] MessageIsAnsi [1 byte]: 0 if the vendor name is in Unicode format. 1 if the vendor name is in ANSI format.

P-0396[0396] MessageLength [4 bytes]: Byte length of the message text. o Message [X bytes]: Message text. Null-terminated.

P-0397[0397] 2. Root Version Table (RVT) Section

P-0398[0398] The Root version entries are ordered in a decreasing value according to their file numbers. The Builder generates unique file numbers within each SAS in a monotonically increasing value. So larger root file numbers imply later versions of the same application. The latest root version is located at the top of the section to allow the SAS Server easy access to the data associated with the latest root version.

P-0399[0399] NumberEntries [4 bytes]: Number of patch versions contained in this SAS. The number indicates the number of entries in the Root Version Table (RVT).

P-0400[0400] Root Version structure: (variable number of entries)

P-0401[0401] VersionNumber [4 bytes]: Version number of the root directory.

P-0402[0402] FileNumber [4 bytes]: File number of the root directory.

P-0403[0403] VersionNamelsAnsi [1 byte]: 0 if the vendor name is in Unicode format. 1 if the vendor name is in ANSI format.

P-0404[0404] VersionNameLength [4 bytes]: Byte length of the version name

P-0405[0405] VersionName [X bytes]: Application version name. e.g., “SP 1”.

P-0406[0406] Metadata [32 bytes]: See SAS FS Directory for format of the metadata.

P-0407[0407] 3. Size Offset File Table (SOFT) Section

P-0408[0408] The SOFT table contains information to locate specific files in the CAF section. The entries are ordered according to the file number starting from 0 to NumberFiles-1. The start of the SOFT table is aligned to eight-byte boundaries for faster access.

P-0409[0409] SOFT entry structure: (variable number of entries)

P-0410[0410] Offset [8 bytes]: Byte offset into CAF of the start of this file.

P-0411[0411] Size [8 bytes]: Byte size of this file. The file is located from address Offset to Offset+Size.

P-0412[0412] 4. Concatenation Application File (CAF) Section

P-0413[0413] CAF is a concatenation of all file or directory data into a single data structure. Each piece of data can be a regular file, an AppInstallBlock, an SAS FS directory file, or an icon file.

P-0414[0414] a. Regular Files

P-0415[0415] FileData [X bytes]: Content of a regular file

P-0416[0416] b. AppInstallBlock (See AppInstallBlock Section For Detailed Format)

P-0417[0417] A simplified description of the AppInstallBlock is listed here. The exact detail of the individual fields in the AppInstallBlock are described later.

P-0418[0418] Header section [X bytes]: Header for AppInstallBlock containing information to identify this AppInstallBlock.

P-0419[0419] Files section [X bytes]: Section containing file to be copied or spoofed.

P-0420[0420] AddVariable section [X bytes]: Section containing system variables to be added.

P-0421[0421] RemoveVariable section [X bytes]: Section containing system variables to be removed.

P-0422[0422] Prefetch section [X bytes]: Section containing pointers to file blocks to be prefetched to the client.

P-0423[0423] Profile section [X bytes]: Section containing profile data.

P-0424[0424] Comment section [X bytes]: Section containing comments about AppInstallBlock.

P-0425[0425] Code section [X bytes]: Section containing application-specific code needed to prepare local machine for streaming this application

P-0426[0426] LicenseAgreement section [X bytes]: Section containing licensing agreement message.

P-0427[0427] c. SAS Directory

P-0428[0428] An SAS Directory contains information about the subdirectories and files located within this directory. This information is used to store metadata information related to the files associated with the streamed application. This data is used to fool the application into thinking that it is running locally on a machine when most of the data is resided elsewhere.

P-0429[0429] The SAS directory contains information about files in its directory. The information includes file number, names, and metadata associated with the files.

P-0430[0430] MagicNumber [4 bytes]: Magic number for SAS directory file.

P-0431[0431] ParentFileID [16+4 bytes]: AppID+FileNumber of the parent directory. AppID is set to 0 if the directory is the root.

P-0432[0432] SelfFileID [16+4 bytes]: AppID+FileNumber of this directory.

P-0433[0433] NumFiles [4 bytes]: Number of files in the directory.

P-0434[0434] Variable-Sized File Entry:

P-0435[0435] UsedFlag [1 byte]: 1 for used, 0 for unused.

P-0436[0436] ShortLen [1 byte]: Length of short file name.

P-0437[0437] LongLen [2 byte]: Length of long file name.

P-0438[0438] NameHash [4 bytes]: Hash value of the short file name for quick lookup without comparing whole string.

P-0439[0439] ShortName [24 bytes]: 8.3 short file name in Unicode. Not null-terminated.

P-0440[0440] FileID [16+4 bytes]: AppID+FileNumber of each file in this directory.

P-0441[0441] Metadata [32 bytes]: The metadata consists of file byte size (8 bytes), file creation time (8 bytes), file modified time (8 bytes), attribute flags (4 bytes), SAS flags (4 bytes). The bits of the attribute flags have the following meaning:

P-0442[0442] Bit <b>0</b>: Read-only—Set if file is read-only

P-0443[0443] Bit <b>1</b>: Hidden—Set if file is hidden from user

P-0444[0444] Bit <b>2</b>: Directory—Set if the file is an SAS Directory

P-0445[0445] Bit <b>3</b>: Archive—Set if the file is an archive

P-0446[0446] Bit <b>4</b>: Normal—Set if the file is normal

P-0447[0447] Bit <b>5</b>: System—Set if the file is a system file

P-0448[0448] Bit <b>6</b>: Temporary—Set if the file is temporary

P-0449[0449]  The bits of the SAS flags have the following meaning:

P-0450[0450] Bit <b>0</b>: ForceUpgrade—Used only on root file. Set if client is forced to upgrade to this particular version if the current root version on the client is older.

P-0451[0451] Bit <b>1</b>: RequireAccessToken—Set if file require access token before client can read it.

P-0452[0452] Bit <b>2</b>: Read-only—Set if the file is read-only

P-0453[0453] LongName [X bytes]: Long filename in Unicode format with null-termination character.

P-0454[0454] d. Icon Files

P-0455[0455] IconFileData [X bytes]: Content of an icon file.

Format of AppInstallBlock

P-0456[0456] Functionality

P-0457[0457] With respect to FIGS. 31<i>a</i>-<b>31</b><i>h</i>, the AppInstallBlock is a block of code and data associated with a particular application. This AppInstallBlock contains the information needed to by the SAS client to initialize the client machine before the streamed application is used for the first time. It also contains optional profiling data for increasing the runtime performance of that streamed application.

P-0458[0458] The AppInstallBlock is created offline by the SAS Builder program. First of all, the Builder monitors the installation process of a local version of the application installation program and records changes to the system. This includes any environment variables added or removed from the system <b>3103</b>, and any files added or modified in the system directories <b>3102</b>. Files added to the application specific directory is not recorded in the AppInstallBlock to reduce the amount of time needed to send the AppInstallBlock to the SAS client. Secondly, the Builder profiles the application to obtain the list of critical pages needed to run the application initially and an initial page reference sequence of the pages accessed during a sample run of the application. The AppInstallBlock contains an optional application-specific initialization code <b>3107</b>. This code is needed when the default initialization procedure is insufficient to setup the local machine environment for that particular application.

P-0459[0459] The AppInstallBlock and the runtime data are packaged into the SAS by the Builder and then uploaded to the application server. After the SAS client is subscribed to an application and before the application is run for the first time, the AppInstallBlock is sent by the server to the client. The SAS client invokes the default initialization procedure and the optional application-specific initialization code <b>3107</b>. Together, the default and the application-specific initialization procedure process the data in the AppInstallBlock to make the machine ready for streaming that particular application.

P-0460[0460] Data Type Definitions

P-0461[0461] The AppInstallBlock is divided into the following sections: header section <b>3101</b>, variable section <b>3103</b>, file section <b>3102</b>, profile section <b>3105</b>, prefetch section <b>3104</b>, comment section <b>3106</b>, and code section <b>3107</b>. The header section <b>3101</b> contains general information about the AppInstallBlock. The information includes the total byte size and an index table containing size and offset into other sections. In a Windows version, the variable section consists of two registry tree structures to specify the registry entries added or removed from the OS environment. The file section <b>3102</b> is a tree structure consisting of the files copied to C drive during the application installation. The profile section <b>3105</b> contains the initial set of block reference sequences during Builder profiling of the application. The prefetch section <b>3104</b> consists of a subset of profiled blocks used by the Builder as a hint to the SAS client to prefetch initially. The comment section <b>3106</b> is used to inform the SAS client user of any relevant information about the application installation. Finally, the code section <b>3107</b> contains an optional program tailored for any application-specific installation not covered by the default streamed application installation procedure. In Windows version, the code section contains a Windows DLL. The following is a detailed description of each fields of the AppInstallBlock.

P-0462[0462] Note: Little endian format is used for all the fields spanning more than 1 byte. Also, BlockNumber specifies blocks of 4K byte size.

P-0463[0463] 1. Header Section:

P-0464[0464] The header section <b>3103</b> contains the basic information about this AppInstallBlock. This includes the versioning information, application identification, and index into other sections of the file.

P-0465[0465] Core Header Structure:

P-0466[0466] AibVersion [4 bytes]: Magic number or appinstallBlock version number (which identifies the version of the appinstallBlock structure rather than the contents).

P-0467[0467] AppId [16 bytes]: this is an application identifier unique for each application. On Windows, this identifier is the GUID generated from the ‘guidgen’ program. AppId for Word on Win98 will be different from Word on WinNT if it turns out that Word binaries are different between NT and 98.

P-0468[0468] VersionNo [4 bytes]: Version number. This allows us to inform the client that the appInstallBlock has changed for a particular appId. This is useful for changes to the AppInstallBlock due to minor patch upgrades in the application.

P-0469[0469] ClientOSBitMap [4 bytes]: Client OS supported bitmap or ID: for Win2K, Win98, WinNT (and generally for other and multiple OSs).

P-0470[0470] ClientOSServicePack [4 bytes]: For optional storage of the service pack level of the OS for which this appInstallBlock has been created. Note that when this field is set, the multiple OS bits in the above field ClientOSBitMap are not used.

P-0471[0471] Flags [4 bytes]: Flags pertaining to AppInstallBlock

P-0472[0472] Bit <b>0</b>: Reboot—If set, the SAS client needs to reboot the machine after installing the AppInstallBlock on the client machine.

P-0473[0473] Bit <b>1</b>: Unicode—If set, the string characters are 2 bytes wide instead of 1 byte.

P-0474[0474] HeaderSize [2 bytes]: Total size in bytes of the header section.

P-0475[0475] Reserved [32 bytes]: Reserved spaces for future.

P-0476[0476] NumberOfSections [1 byte]: Number of sections in the index table. This determines the number of entries in the index table structure described below:

P-0477[0477] Index Table Structure: (Variable Number of Entries)

P-0478[0478] SectionType [1 bytes]: The type of data described in section. 0=file section, 1=variable section, 2=prefetch section, 3=profile section, 4=comment section, 5=code section.

P-0479[0479] SectionOffset [4 bytes]: The offset from the beginning of the file indicates the beginning of section.

P-0480[0480] SectionSize [4 bytes]: The size in bytes of section.

P-0481[0481] Variable Structure:

P-0482[0482] ApplicationNameIsAnsi [1 byte]: 1 if ansi, 0 if Unicode.

P-0483[0483] ApplicationNameLength [4 bytes]: Byte size of the application name

P-0484[0484] ApplicationName [X bytes]: Null terminating name of the application

P-0485[0485] 2. File Section:

P-0486[0486] The file section <b>3102</b> contains a subset of the list of files needed by the application to run properly. This section does not enumerate files located in the standard application program directory. It consists of information about files copied into an ‘unusual’ directory during the installation of an application. If the file content is small (typically less than 1 MB), the file is copied to the client machine. Otherwise, the file is relocated to the standard program directory suitable for streaming. The file section data is a list of trees stored in a contiguous sequence of address spaces according to the pre-order traversal of the trees. A node in the tree can correspond to one or more levels of directories. A parent-child node pair is combined into a single node if the parent node has only a single child. Parsing the tree from the root of the tree to a leaf node results in a fully legal Windows pathname including the drive letter. Each entry of the node in the tree consists of the following structure:

P-0487[0487] Directory Structure: (Variable Number of Entries)

P-0488[0488] Flags [4 byte]: Bit <b>0</b> is set if this entry is a directory

P-0489[0489] NumberOfChildren [2 bytes]: Number of nodes in this directory

P-0490[0490] DirectoryNameLength [4 bytes]: Length of the directory name

P-0491[0491] DirectoryName [X bytes]: Null terminating directory name

P-0492[0492] Leaf Structure: (Variable Number of Entries)

P-0493[0493] Flags [4 byte]: Bit <b>1</b> is set to 1 if this entry is a spoof or copied file name

P-0494[0494] FileVersion [8 bytes]: Version of the file GetFileVersionInfo( ) if the file is win32 file image. Need variable file version size returned by GetFileVersionInfoSize( ). Otherwise use file size or file modified time to compare which file is the later version.

P-0495[0495] FileNameLength [4 bytes]: Byte size of the file name

P-0496[0496] FileName [X bytes]: Null terminating file name

P-0497[0497] DataLength [4 bytes]: Byte size of the data. If spoof file, then data is the string of the spoof directory. If copied file, then data is the content of the file

P-0498[0498] Data [X bytes]: Either the spoof file name or the content of the copied file

P-0499[0499] 3. Add Variable and Remove Variable Sections:

P-0500[0500] The add and remove variable sections <b>3103</b> contain the system variable changes needed to run the application. In a Windows system, each section consists of several number of registry subtrees. Each tree is stored in a contiguous sequence of address spaces according to the pre-order traversal of the tree. A node in the tree can correspond to one or more levels of directory in the registry. A parent-child node pair is combined into a single node if the parent node has only a single child. Parsing the tree from the root of the tree to a leaf node results in a fully legal key name. The order of the trees is shown here.

P-0501[0501] a. Registry Subsection:

P-0502[0502] 1. “HKCR”: HKEY_CLASSES_ROOT

P-0503[0503] 2. “HKCU”: HKEY_CURRENT_USER

P-0504[0504] 3. “HKLM”: HKEY_LOCAL_MACHINE

P-0505[0505] 4. “HKUS”: HKEY_USERS

P-0506[0506] 5. “HKCC”: HKEY_CURRENT_CONFIG

P-0507[0507] Tree Structure: (5 Entries)

P-0508[0508] ExistFlag [1 byte]: Set to 1 if this tree exist, 0 otherwise.

P-0509[0509] Key or Value Structure entries [X bytes]: Serialization of the tree into variable number key or value structures described below.

P-0510[0510] Key Structure: (Variable Number of Entries)

P-0511[0511] KeyFlag [1 byte]: Set to 1 if this entry is a key or 0 if it's a value structure

P-0512[0512] NumberOfSubchild [4 bytes]: Number of subkeys and values in this key directory

P-0513[0513] KeyNameLength [4 bytes]: Byte size of the key name

P-0514[0514] KeyName [X bytes]: Null terminating key name Value Structure: (variable number of entries)

P-0515[0515] KeyFlag [1 byte]: Set to 1 if this entry is a key or 0 if it's a value structure

P-0516[0516] ValueType [4 byte]: Type of values from the Win32 API function RegQueryValueEx( ): REG_SZ, REG_BINARY, REG_DWORD, REG_LINK, REG_NONE, etc . . .

P-0517[0517] ValueNameLength [4 bytes]: Byte size of the value name

P-0518[0518] ValueName [X bytes]: Null terminating value name

P-0519[0519] ValueDataLength [4 bytes]: Byte size of the value data

P-0520[0520] ValueData [X bytes]: Value of the Data

P-0521[0521] In addition to registry changes, an installation in a Windows system may involve changes to the ini files. The following structure is used to communicate the ini file changes needed to be done on the SAS client machine. The ini entries are appended to the end of the variable section after the five registry trees are enumerated.

P-0522[0522] b. INI Subsection:

P-0523[0523] NumFiles [4 bytes]: Number of INI files modified.

P-0524[0524] File Structure: (Variable Number of Entries)

P-0525[0525] FileNameLength [4 bytes]: Byte length of the file name

P-0526[0526] FileName [X bytes]: Name of the INI file

P-0527[0527] NumSection [4 bytes]: Number of sections with the changes

P-0528[0528] Section Structure: (Variable Number of Entries)

P-0529[0529] SectionNameLength [4 bytes]: Byte length of the section name

P-0530[0530] SectionName [X bytes]: Section name of an INI file

P-0531[0531] NumValues [4 bytes]: Number of values in this section

P-0532[0532] Value Structure: (Variable Number of Entries)

P-0533[0533] ValueLength [4 bytes]: Byte length of the value data

P-0534[0534] ValueData [X bytes]: Content of the value data

P-0535[0535] 4. Prefetch Section:

P-0536[0536] The prefetch section <b>3104</b> contains a list of file blocks. The Builder profiler determines the set of file blocks critical for the initial run of the application. This data includes the code to start and terminate the application. It includes the file blocks containing frequently used commands. For example, opening and saving of documents are frequently used commands and should be prefetched if possible. Another type of block to include in the prefetch section are the blocks associated with frequently accessed directories and file metadata in this directory. The prefetch section is divided into two subsections. One part contains the critical blocks that are used during startup of the streamed application. The second part consists of the blocks accessed for common user operations like opening and saving of document. The format of the data is described below:

P-0537[0537] a. Critical Block Subsection:

P-0538[0538] NumCriticalBlocks [4 bytes]: Number of critical blocks.

P-0539[0539] Block Structure: (Variable Number of Entries)

P-0540[0540] FileNumber [4 bytes]: File Number of the file containing the block to prefetch

P-0541[0541] BlockNumber [4 bytes]: Block Number of the file block to prefetch

P-0542[0542] b. Common Block Subsection:

P-0543[0543] NumCommonBlocks [4 bytes]: Number of critical blocks.

P-0544[0544] Block Structure: (Variable Number of Entries)

P-0545[0545] FileNumber [4 bytes]: File Number of the file containing the block to prefetch

P-0546[0546] BlockNumber [4 bytes]: Block Number of the file block to prefetch

P-0547[0547] 5. Profile Section:

P-0548[0548] The profile section <b>3105</b> consists of a reference sequence of file blocks accessed by the application at runtime. Conceptually, the profile data is a two dimensional matrix. Each entry [row, column] of the matrix is the frequency, a block row is followed by a block column. In any realistic applications of fair size, this matrix is very large and sparse. The proper data structure must be selected to store this sparse matrix efficiently in required storage space and minimize the overhead in accessing this data structure access.

P-0549[0549] The section is constructed from two basic structures: row and column structures. Each row structure is followed by N column structures specified in the NumberColumns field. Note that this is an optional section. But with appropriate profile data, the SAS client prefetcher performance can be increased.

P-0550[0550] Row Structure: (Variable Number of Entries)

P-0551[0551] FileNumber [4 bytes]: File Number of the row block

P-0552[0552] BlockNumber [4 bytes]: Block Number of the row block

P-0553[0553] NumberColumns [4 bytes]: number of blocks that follows this block. This field determines the number of column structures following this field.

P-0554[0554] Column Structure: (Variable Number of Entries)

P-0555[0555] FileNumber [4 bytes]: File Number of the column block

P-0556[0556] BlockNumber [4 bytes]: Block Number of the column block

P-0557[0557] Frequency [4 bytes]: frequency the row block is followed by column block

P-0558[0558] 6. Comment Section:

P-0559[0559] The comment section <b>3106</b> is used by the Builder to describe this AppInstallBlock in more detail.

P-0560[0560] CommentLengthIsAnsi [1 byte]: 1 if string is ansi, 0 if Unicode format.

P-0561[0561] CommentLength [4 bytes]: Byte size of the comment string

P-0562[0562] Comment [X bytes]: Null terminating comment string

P-0563[0563] 7. Code Section:

P-0564[0564] The code section <b>3107</b> consists of the application-specific initialization code needed to run on the SAS client to setup the client machine for this particular application. This section may be empty if the default initialization procedure in the SAS client is able to setup the client machine without requiring any application-specific instructions. On the Windows system, the code is a DLL file containing two exported function calls: Install( ), Uninstall( ). The SAS client loads the DLL and invokes the appropriate function calls.

P-0565[0565] CodeLength [4 bytes]: Byte size of the code

P-0566[0566] Code [X bytes]: Binary file containing the application-specific initialization code. On Windows, this is just a DLL file.

P-0567[0567] 8. LicenseAgreement Section:

P-0568[0568] The Builder creates the license agreement section <b>3108</b>. The SAS client displays the license agreement text to the end-user before the application is started for the first time. The end-user must agree to all licensing agreement set by the software vendor in order to use the application.

P-0569[0569] LicenseTextIsAnsi [1 byte]: 1 if ansi, 0 if Unicode format.

P-0570[0570] LicenseTextLength [4 bytes]: Byte size of the license text

P-0571[0571] LicenseAgreement [X bytes]: Null terminating license agreement string

Client Installation and Execution of Streamed Applications

P-0572[0572] Summary

P-0573[0573] This section describes the process of installing and uninstalling streamed application on the client machine. With respect to FIG. 32, the lifecycle of the Application Install Block is shown. The Application Stream Builder <b>3202</b> takes original application files <b>3201</b> and produces a corresponding Application Install Block and Stream Application Set <b>3203</b>. These two files get installed onto the application servers <b>3206</b>. On the right side of the drawing, it shows how either the administrator or the user can subscribe to the application from either the client computer <b>3208</b> or an administration computer <b>3207</b>. Once the user logons onto the client computer <b>3208</b>, the license and the AIB <b>3203</b> are acquired from the license <b>3205</b> and application servers <b>3206</b>, respectively.

P-0574[0574] The following are features of a preferred embodiment of the invention:

P-0575[0575] 1. The streamed application installation process installs just the description of the application, not the total content of the application. After installing such description, the client system looks and feels similar to having installed the same app using a non-streamed method. This has the following benefits:

P-0576[0576] a. Takes a very small fraction of the time to install the application.

P-0577[0577] b. Takes a very small fraction of the disk space.

P-0578[0578] c. Client does not have to wait for the entire application to be downloaded. This is particularly important to users with slow network connections.

P-0579[0579]  The application description is subsequently un-installed without requiring deleting the total contents of the application. This has the benefit that it takes a very small fraction of the time to uninstall the application.

P-0580[0580] 2. Enhancing streamed application's performance by:

P-0581[0581] a. Copying small portions of application's code and data (pages) that are critical to performance.

P-0582[0582] b. Providing client with the initial profile data that can be used to perform pre-fetching.

P-0583[0583]  This has the following benefits:

P-0584[0584] 1. User experiences smooth and predictable application launch.

P-0585[0585] 2. Scalability of Application servers increases by reducing the number of client connections.

P-0586[0586] 3. An administrator can arrange applications to be installed automatically on client computers. Administrator can also arrange the installation on various client computers simultaneously without being physically present on each client computer. This has the following benefits:

P-0587[0587] a. Users are not burdened with the process of installing streamed applications.

P-0588[0588] b. Reduced administration expense.

P-0589[0589] Overview of Components Relevant to the Install Process

P-0590[0590] Subscription Server <b>3204</b>: allows users to create accounts &amp; to rent.

P-0591[0591] License Server <b>3205</b>: authenticates users &amp; determines licensing rights to applications.

P-0592[0592] Application Server <b>3206</b>: provides application bits to licensed users securely &amp; efficiently.

P-0593[0593] Application Install Manager—a component installed on the streaming client that is responsible for installing and uninstalling streamed applications.

P-0594[0594] Application Install Block (AIB) <b>3203</b>—a representation of what gets installed on the client machine when a streamed application is installed. It contains portions of the application that are responsible for registering the application with the client operating system and other data that enhances the execution of streamed application.

P-0595[0595] Application Stream Builder <b>3202</b>—preprocesses apps &amp; prepares files to be installed on Application Server and data, such as AIB, to be installed by Client Application Installer.

P-0596[0596] Stream Application Set <b>3203</b>—a method of representing the total content of the application in a format that is optimal for streaming.

P-0597[0597] Client Streaming File System—integrates client exec with paging from a special file system backed by remote network-accessed server-based store

P-0598[0598] Application Install Block (AIB)

P-0599[0599] Installing and un-installing a stream application requires an understanding of what AIB is and how it gets manipulated by the various components in the overall streaming system. AIB is physically represented as a data file with various different sections. Its contents include:

P-0600[0600] Streamed application name and identification number.

P-0601[0601] Software License Agreement.

P-0602[0602] Registry spoof set.

P-0603[0603] File spoof set.

P-0604[0604] Small number of application pages—initial cache contents.

P-0605[0605] Application Profile Data.

P-0606[0606] AIB Lifecycle

P-0607[0607] The following describes the AIB lifecycle:

P-0608[0608] 1. Using the process described in the section above concerning converting apps for stream delivery and subsequent execution, an application install block is created by the Application Stream Builder. Initially, there will be one AIB per application, however, as the application evolves via patches and service packs, new AIBs may need to be generated.

P-0609[0609] 2. Using a process described in the section above regarding server-side performance optimization, AIB will get hosted by the application servers.

P-0610[0610] 3. “Subscribing” the application by communicating with the subscription server. Subscribing to an application requires a valid account with the ASP. Either the user or an administrator acting on the user's behalf can subscribe the application. In addition, the application can be subscribed to from any computer on the Internet, not just the client machine where the application will be eventually installed. This allows an administrator to subscribe applications for a group of users without worrying about individual client machines.

P-0611[0611] 4. The client machine acquires the license for the application from the license server. If the application was subscribed from the client machine itself, this step will happen automatically after subscribing to the application. If the subscription happened from a different machine, e.g., the administrator's machine, this step will happen when the user logs on the client machine. As an acknowledgment of having a valid license, the license server gives the client an encrypted access token.

P-0612[0612] 5. Fetch the contents of AIB from the application server. This step is transparent and happens immediately after the preceding step. Since application server requires the client to possess a valid access token, it ensures that only subscribed and licensed users can install the streamed application.

P-0613[0613] 6. The Application Install Manager (AIM) performs the act of installing the application information, as specified by the AIB, on the client system.

P-0614[0614] Installing a Streamed Application

P-0615[0615] AIM downloads AIB from the application server and takes the necessary steps in installing the application description on the client system. It extracts pieces of information from AIB and sends messages to various other components (described later) to perform the installation. AIM also creates an Install-Log that can be used when un-installing the streamed application.

P-0616[0616] 1. Display a license agreement to the user and wait for the user to agree to it.

P-0617[0617] 2. Extract File Spoof Data and communicate that to the Client File Spoofer. The list of files being spoofed will be recorded in the Install-Log.

P-0618[0618] 3. Extract Registry Spoof Data and communicate that to the Client Registry Spoofer. The list of Registries being spoofed will be recorded in the Install-Log.

P-0619[0619] 4. Extract Initial Cache Content and communicate that to the Client Prefetch Unit.

P-0620[0620] 5. Extract Profile Data and communicate that to the Client Prefetch Unit.

P-0621[0621] 6. Save the Install-Log in persistent storage.

P-0622[0622] Un-Installing a Streamed Application

P-0623[0623] Un-installation process relies on the Install-Log to know what specific items to un-install. Following steps are performed when un-installing and application:

P-0624[0624] 1. Communicate with the Client Registry Spoofer to remove all registries being spoofed for the application being un-installed.

P-0625[0625] 2. Communicate with the Client File Spoofer to disable all files being spoofed for the application being un-installed.

P-0626[0626] 3. Communicate with the Client Prefetch Unit to remove all Profile Data for the application being un-installed.

P-0627[0627] 4. Communicate with the Client Cache Manager to remove all pages being cached for the application being un-installed.

P-0628[0628] 5. Delete the Install-Log.

P-0629[0629] Client File Spoofer

P-0630[0630] A file spoofer component is installed on the client machine and is responsible for redirecting file accesses from a local file system to the streaming file system. The spoofer operates on a file spoof database that is stored persistently on the client system; it contains a number of file maps with following format:

P-0631[0631] [Original path of a local file]←→[New path of a file on streaming drive]

P-0632[0632] Where “←→” indicates a bidirectional mapping between the two sides of the relationship shown.

P-0633[0633] When a streamed application is installed, the list of new files to spoof (found in AIB) is added to the file spoof database. Similarly, when a streamed application is un-installed, a list of files being spoofed for that application is removed from the file spoof database.

P-0634[0634] On clients running the Windows 2000 Operating System, the file spoofer is a kernel-mode driver and the spoof database is stored in the registry.

P-0635[0635] Client Registry Spoofer

P-0636[0636] The Registry Spoofer intercepts all registry calls being made on the client system and re-directs calls manipulating certain registries to an alternate path. Effectively, it is mapping the original registry to an alternate registry transparently. Similar to the client file spoofer, the registry spoofer operates on a registry spoof database consisting entries old/new registry paths. The database must be stored in persistent storage.

P-0637[0637] When a streamed application is installed, the list of new registries to spoof (found in AIB) is added to the registry spoof database. Upon un-installation of a streamed application, its list of spoofed registries is removed from the registry spoof database.

P-0638[0638] On clients running the Windows 2000 Operating System, the registry spoofer is a kernel-mode driver and the registry spoof database is stored in the registry.

P-0639[0639] Client Prefetch Unit

P-0640[0640] In a streaming system, it is often a problem that the initial invocation of the application takes a lot of time because the necessary application pages are not present on the client system when neeeded. A key aspect of the client install is that by using a client prefetch unit, a system in accordance with the present invention significantly reduces the performance hit associated with fetching. The Client Prefetch Unit performs two main tasks:

P-0641[0641] 1. Populate Initial Cache Content,

P-0642[0642] 2. Prefetch Application Pages.

P-0643[0643] Initial Cache Content

P-0644[0644] The Application Stream Builder determines the set of pages critical for the initial invocation and packages them as part of the AIB. These pages, also known as initial cache content, include:

P-0645[0645] Pages required to start and stop the application,

P-0646[0646] Contents of frequently accessed directories,

P-0647[0647] Application pages performing some of the most common operations within application. For example, if Microsoft Word is being streamed, these operations include: opening &amp; saving document files &amp; running a spell checker.

P-0648[0648] When the Stream Application is installed on the client, these pages are put into the client cache; later, when the streamed application is invoked, these pages will be present locally and network latency is avoided.

P-0649[0649] In preparing the Prefetch data, it is critical to manage the trade off of how many pages to put into AIB and what potential benefits it brings to the initial application launch. The more pages that are put into prefetch data, the smoother the initial application launch will be; however, since the AIB will get bigger (as a result of packing more pages in it), users will have to wait longer when installing the streamed application. In a preferred embodiment of the invention, the size of the AIB is limited to approximately 250 KB.

P-0650[0650] In an alternative embodiment of the invention the AIB initially includes only the page/file numbers and not the pages themselves. The client then goes through the page/file numbers and does paging requests to fetch the indicated pages from the server.

P-0651[0651] Prefetch Application Pages

P-0652[0652] When the streaming application executes, it will generate paging requests for pages that are not present in the client cache. The client cache manager must contact the application server and request the page in question. The invention takes advantage of this opportunity to also request additional pages that the application may need in the future. This not only reduces the number of connections to the application server, and overhead related to that, but also hides the latency of cache misses.

P-0653[0653] The application installation process plays a role in the pre-fetching by communicating the profile data present in the AIB to the Client Prefetch Unit when the application is installed. Upon un-installation, profile data for the particular application will be removed.

Caching of Streamed Application Pages Within the Network

P-0654[0654] Summary

P-0655[0655] This section describes how collaborative caching is employed to substantially improve the performance of a client server system in accordance with the other aspects of the present invention. Specifically, particular caching configurations and an intelligent way to combine these caching configurations are detailed.

P-0656[0656] Collaborative Caching Features:

P-0657[0657] Using another client's cache to get required pages/packets (Peer Caching)

P-0658[0658] Using an intermediate proxy or node to get required pages/packets (Proxy Caching)

P-0659[0659] Using a broadcasting or multicasting mechanism to make a request (Multicast)

P-0660[0660] Using a packet based protocol to send requested pages/packets rather than a stream based one. (Packet Protocol)

P-0661[0661] Using concurrency to request a page through all three means (Peer Caching or Proxy Caching or the actual server) to improve performance (Concurrent Requesting).

P-0662[0662] Using heuristical algorithms to use all three ways to get the required pages (Smart Requesting).

P-0663[0663] These features have the following advantages:

P-0664[0664] These ideas potentially improve the performance of the client, i.e., they reduce the time a client takes to download a page (Client Performance).

P-0665[0665] These ideas improve the scalability of the server because the server gets fewer requests, i.e., requests which are fulfilled by a peer or a proxy don't get sent to the server. (Server Scalability)

P-0666[0666] These allow a local caching mechanism without needing any kind of modification of local proxy nodes or routers or even the servers. The peer-to-peer caching is achieved solely through the co-operation of two clients. (Client Only Implementation)

P-0667[0667] These ideas allow a client to potentially operate “offline” i.e., when it is not getting any responses from the server (Offline Client Operation).

P-0668[0668] These ideas allow the existing network bandwidth to be used more effectively and potentially reduce the dependency of applications on higher bandwidth (Optimal Use of Bandwidth).

P-0669[0669] These ideas when used in an appropriate configuration allow each client to require a smaller local cache but without substantially sacrificing the performance that you get by local caching. An example is when each client “specializes” in caching pages of a certain kind, e.g., a certain application. (Smaller Local Cache).

P-0670[0670] These ideas involve new interrelationships—peer-to-peer communication for cache accesses; or new configurations—collaborative caching. The reason this is called collaborative is because a group of clients can collaborate in caching pages that each of them needs.

P-0671[0671] Aspects of Collaborative Caching

P-0672[0672] 1. Peer Caching:

P-0673[0673] A client X getting its pages from another client Y's local cache rather than its (X's) own or from the server seems to be a new idea. Major advantages: client performance, server scalability, client only implementation, offline client operation, optimal use of bandwidth, smaller local cache.

P-0674[0674] 2. Proxy Caching:

P-0675[0675] The client getting its pages from an intermediate proxy which either serves the page from the local cache or from another intermediate proxy or the remote server (if none of the intermediate proxies has the page) is unique, at a minimum, for the pages of a streamed application. Major advantages: client performance, server scalability, offline client operation (to some extent), optimal use of bandwidth, smaller local cache.

P-0676[0676] 3. Multicast:

P-0677[0677] Using multicasting (or selective broadcasting) considerably reduces peer-to-peer communication. For every cache request there is only one packet on the network and for every cache response there is potentially only one packet on the network in some configurations. This definitely helps reduce network congestion. Major advantages: client performance, server scalability, client only implementation, offline client operation, optimal use of bandwidth

P-0678[0678] 4. Packet Protocol:

P-0679[0679] Because only datagram packets are used to request or respond to cache pages this saves the overhead of opening stream-based connections such as a TCP connection or an HTTP connection. Major advantages: client performance, client only implementation, offline client operation, and optimal use of bandwidth.

P-0680[0680] 5. Concurrent Requesting:

P-0681[0681] If concurrent or intelligently staggered requests through all three means are issued to request a single page, the client will be able to receive the page through the fastest means possible for that particular situation. Major advantages: client performance, server scalability, offline client operation, and optimal use of bandwidth

P-0682[0682] 6. Smart Requesting:

P-0683[0683] An adaptive or “smart” algorithm can be used to further enhance the overall performance of the client-server system. In this algorithm, the client uses the data of how past requests were processed to “tune” new requests. For example, if the client's past requests were predominantly served by another client, i.e., Peer Caching worked, then for new page requests the client would first try to use Peer Caching, and wait some time before resorting to either Proxy Caching or direct server request. This wait time can again be calculated in an adaptive fashion. Major advantages: client performance, server scalability, client only implementation, offline client operation, and optimal use of bandwidth.

P-0684[0684] The concepts illustrated herein can be applied to many different problem areas. In all client-server implementations where a server is serving requests for static data, e.g., code pages of a streamed application or static HTML pages from a Website, the approaches taught herein can be applied to improve the overall client-server performance. Even if some of the protocols or configurations described in this document are not supported by the underlying network, it does not preclude the application of other ideas described herein that do not depend on such features. For example, if multicast (or selective broadcast) is not supported, ideas such as Concurrent Requesting or Smart Requesting can still be used with respect to multiple servers instead of the combination of a server, peer, and proxy. Also the use of words like Multicast does not restrict the application of these ideas to multicast based protocols. These ideas can be used in all those cases where a multicast like mechanism, i.e., selective broadcasting is available. Also note that the description of these ideas in the context of LAN or intranet environment does not restrict their application to such environments. The ideas described here are applicable to any environment where peers and proxies, because of their network proximity, offer significant performance advantages by using Peer Caching or Proxy Caching over a simple client-server network communication. In that respect, the term LAN or local area network should be understood to mean more generally as a collection of nodes that can communicate with each other faster than with a node outside of that collection. No geographical or physical locality is implied in the use of the term local area network or LAN.

P-0685[0685] Peer Caching

P-0686[0686] Referring to FIG. 33, how multiple peers collaborate in caching pages that are required by some or all of them is shown.

P-0687[0687] The main elements shown are:

P-0688[0688] Client 1 <b>3301</b> through Client 6 <b>3306</b> in an Ethernet LAN <b>3310</b>.

P-0689[0689] Router 1 and the local proxy serving as the Internet gateway <b>3307</b>. Note that it does not matter whether Router 1 and the proxy are one computer or two different ones.

P-0690[0690] Other routers from router 2 through router N <b>3308</b> that are needed to connect the LAN <b>3310</b> to the Internet <b>3311</b>.

P-0691[0691] A remote server <b>3309</b> (that is reachable only by going over the Internet <b>3311</b>) that is serving the pages that the above mentioned clients need.

P-0692[0692] A cloud that symbolizes the complexity of the Internet <b>3311</b> and potentially long paths taken by packets.

P-0693[0693] Client 2 <b>3302</b> needs a page that it does not find in its local cache. It then decides to use the mechanism of Peer Caching before attempting to get the page from the local proxy (or the actual server through the proxy). The actual sequence of events is as follows:

P-0694[0694] 1. Client 2 <b>3302</b> sends a request for the page it needs. This request is sent as a multicast packet to a predetermined multicast address and port combination. Lets call this multicast address and port combination as M.

P-0695[0695] 2. The multicast packet is received by all the clients that have joined the group M. In this case all six clients have joined the group M.

P-0696[0696] 3. Client 5 <b>3305</b> receives the request and it records the sender's, i.e., Client 2's <b>3302</b>, address and port combination. Let's assume this address and port combination is A. Client 5 <b>3305</b> processes the request and looks up the requested page in its own cache. It finds the page.

P-0697[0697] 4. Client 5 <b>3305</b> sends the page to address A (which belongs to Client 2 <b>3302</b>) as a packet.

P-0698[0698] 5. Client 2 <b>3302</b> receives the page it needs and hence does not need to request the server for the page.

P-0699[0699] Proxy Caching

P-0700[0700] With respect to FIG. 43, a transparent proxy and how clients use it to get pages is shown. Again the elements here are the same as in the previous figure:

P-0701[0701] Client 1 <b>3401</b> through Client 6 <b>3406</b> in an Ethernet LAN <b>3410</b>.

P-0702[0702] Router 1 and the local proxy serving as the Internet gateway <b>3407</b>. Note that it does not matter whether Router 1 and the proxy are one computer or two different ones.

P-0703[0703] Other routers from router 2 through router N <b>3408</b> that are needed to connect the LAN <b>3410</b> to the Internet <b>3411</b>.

P-0704[0704] A remote server <b>3409</b> (that is reachable only by going over the Internet <b>3411</b>) that is serving the pages that the above mentioned clients need.

P-0705[0705] A cloud that symbolizes the complexity of the Internet <b>3411</b> and potentially long paths taken by packets.

P-0706[0706] Assume Peer Caching is either not enabled or did not work for this case. When Client 2 <b>3402</b> needs a page, it makes a request to the proxy <b>3407</b>. The proxy <b>3407</b> finds the page in its local cache and returns it to Client 2 <b>3402</b>. Because of this, the request did not go to the remote server <b>3409</b> over the Internet <b>3411</b>.

P-0707[0707] Multicast and Packet Protocol within a LAN

P-0708[0708] Referring to FIG. 35, the role played by multicast and unicast packets in Peer Caching is shown. The example of the drawing “Peer Caching” is used to explain multicast. Here Client 2 <b>3502</b> has the IP address 10.0.0.2 and it opens port <b>3002</b> for sending and receiving packets. When Client 2 <b>3502</b> needs a page and wants to use Peer Caching to get it, it forms a request and sends it to the multicast address and port 239.0.0.1:2001. All the other clients in the LAN <b>3508</b> that support Peer Caching have already joined the group 239.0.0.1:2001 so they all receive this packet.

P-0709[0709] Client 5 <b>3505</b> receives this packet and it records the sender address (10.0.0.2:3002 in this case). It looks up the requested page and finds it in its local cache. It sends the page as a response packet to the address 10.0.0.2:3002.

P-0710[0710] Client 2 <b>3502</b> receives this response packet since it was waiting at this port after sending the original multicast request. After ensuring the validity of the response, it retrieves the page it needs.

P-0711[0711] Note that more than one client can respond to the original multicast request. However Client 2 <b>3502</b> can discard all the later responses, since it has already received the page it needed.

P-0712[0712] Concurrent Requesting—Proxy First

P-0713[0713] With respect to FIG. 36, one particular case of how Concurrent Requesting is used is shown. This is a timeline of events that take place in the client. When a client first needs a page, it does not know whether it is going to get any responses through Peer Caching or not. Hence it issues a request to the proxy (or the server through the proxy) as soon as it needs the page. Then it issues a request using the Peer Caching mechanism. If there is indeed a peer that can return the page requested, the peer presumably could return the page faster than the proxy or the server. If this happens, the client may decide to use Peer Caching mechanism before attempting to get the page from the proxy or the server. The timeline essentially describes the following sequence of events:

P-0714[0714] 1. At time t=0, a page p is needed by the client <b>3601</b>.

P-0715[0715] 2. The client looks up its local cache, and it doesn't find page p.

P-0716[0716] 3. At time t=T1, it decides to send a request to the proxy to get the page <b>3602</b>.

P-0717[0717] 4. After a delay of amount D_P<b>3603</b>, at time t=T2 it also sends a request for the page p through the mechanism of Peer Caching <b>3604</b>. Note that D_P<b>3603</b> can be zero, in which case T1=T2.

P-0718[0718] 5. At time t=T3, a response is received from another peer that contains the page p that this client needs <b>3606</b>. Thus the response time of the Peer Caching mechanism is R_P=T3−T2 <b>3605</b>.

P-0719[0719] 6. At time t=T4, a response from the proxy/server is received that contains the page p <b>3608</b>. Hence the response time of the proxy/server is R_S=T4−T1 <b>3607</b>.

P-0720[0720] Note that since, R_P<R_S, the client will increase the weighting for Peer Caching in all of its future queries. That means it will decrease D_P, and if D_Pis already zero, it will increase Ds (the delay before requesting proxy/server). On the other hand, if R_P>R_Sor if R_Pwere infinity, it will increase its weighting for proxy/server requesting. This is part of Smart Requesting that is explained elsewhere in this document.

P-0721[0721] Concurrent Requesting—Peer Caching First

P-0722[0722] Referring to FIG. 37, in contrast to the previous figure, the client has decided to use Peer Caching before requesting the proxy. So the sequence of events is as follows:

P-0723[0723] 1. At time t=0, a page p is needed by the client <b>3701</b>.

P-0724[0724] 2. The client looks up its local cache, and it doesn't find page p.

P-0725[0725] 3. At time t=T5, it decides to send a request for the page p through the mechanism of Peer Caching <b>3702</b>.

P-0726[0726] 4. After a delay of amount D_S<b>3703</b>, at time t=T6 it also sends a request for the page p to the proxy/server. Note that Ds can be zero, in which case T5=T6.

P-0727[0727] 5. At time t=T7, a response is received from another peer that contains the page p that this client needs <b>3706</b>. Thus the response time of the Peer Caching mechanism is R_P=T7−T5 <b>3705</b>.

P-0728[0728] 6. At time t=T8, a response from the proxy/server is received that contains the page p <b>3708</b>. Hence the response time of the proxy/server is R_S=T8−T6 <b>3707</b>.

P-0729[0729] As described in the previous drawing, the client increases the weighting of Peer Caching even more because it got a response through Peer Caching long before it got a response from the proxy/server. As a result of the increases weighting the delay D_Sis increased even more.

P-0730[0730] Concurrent Requesting—Peer Caching Only

P-0731[0731] With respect to FIG. 38, in contrast with FIG. 37, the client has increased D_S<b>3805</b> (the delay before requesting a proxy/server) so much, that if a page is received before the expiry of the delay D_S<b>3805</b>, the client does not even make a request to the proxy/server. The shaded area <b>3806</b> shows the events that do not take place because of this.

P-0732[0732] Client-Server System with Peer and Proxy Caching

P-0733[0733] Referring to FIG. 39, a system level drawing that gives a system context for all the other figures and discussion in this document is shown. This drawing illustrates all three ways in which a client gets its page requests fulfilled. Note that:

P-0734[0734] Client 2 <b>3902</b> gets its page request fulfilled through Peer Caching, i.e., multicast request.

P-0735[0735] Client 1 <b>3901</b> gets its page request fulfilled through Proxy Caching, i.e., the proxy <b>3907</b> finds the page in its cache and returns it.

P-0736[0736] Client 3 <b>3903</b> has to go to the server <b>3909</b> over the Internet <b>3908</b> to get its page request fulfilled.

P-0737[0737] Collaborative Caching Details

P-0738[0738] In a typical client-server model, caching could be used to improve the performance of clients and scalability of servers. This caching could be:

P-0739[0739] Local to the client where the client itself locally stores the pages it had received from the server in the past. Then the client would not need to request the proxy/server for any page that resides in the local cache as long as the locally cached page is “valid” from the server point of view.

P-0740[0740] On a proxy node that can be any node along the path taken by a packet that goes from the client to the server. The closer this proxy node is to the client the more improvement in the performance you get.

P-0741[0741] On a peer node, that is on another client. In this case, the two clients (the requesting client as well as the serving client) are on the same LAN or intranet, so that the travel time of a packet between the two nodes is considerably smaller as compared to the travel time of the packet from one of the clients to the server.

P-0742[0742] As far as caching is concerned, this section details the new ideas of Peer Caching and Proxy Caching. In addition, it also details the new ideas of Concurrent Requesting and Smart Requesting. The preferred approaches for implementing these ideas are also described here and these are Multicast and Packet Protocol.

P-0743[0743] The idea of Peer Caching is nothing but a client X taking advantage of the fact that a peer, e.g., say another client Y, on its LAN had, in the past, requested a page that X is going to request from its server. If the peer Y has that page cached locally on its machine, then X could theoretically get it much faster from Y than getting it from the server itself. If an efficient mechanism is provided for the two clients X and Y to collaborate on this kind of cache access, then that will offer many advantages such as: Client Performance, Server Scalability, Client Only Implementation, Offline Client Operation, Optimal Use of Bandwidth, Smaller Local Cache. Note that two clients were considered only as an example, the idea of Peer Caching is applicable to any number of peers on a LAN.

P-0744[0744] The idea of Multicast is to use the multicast protocol in the client making a Peer Caching request. Multicast can be briefly described as “selective broadcasting”—similar to radio. A radio transmitter transmits “information” on a chosen frequency, and any receiver (reachable by the transmitter, of course) can receive that information by tuning to that frequency. In the realm of multicast, the equivalent of a radio frequency is a multicast or class D IP address and port. Any node on the net can send datagram packets to a multicast IP address+port. Another node on the net can “join” that IP address+port (which is analogous to tuning to a radio frequency), and receive those packets. That node can also “leave” the IP address+port and thereby stop receiving multicast packets on that IP address+port.

P-0745[0745] Note that multicast is based on IP (Internet Protocol) and is vendor neutral. Also, it is typically available on the Ethernet LAN and, if routers supported it, it can also go beyond the LAN. If all the routers involved in a node's connection to the Internet backbone supported multicast routing, multicast packets theoretically could go to the whole Internet except the parts of the Internet that do not support multicast routing.

P-0746[0746] The use of multicast allows a client to not have to maintain a directory of peers that can serve its page requests. Also because of multicast there is only one packet per page request. Any peer that receives the request could potentially serve that request, so by using a multicast based request there are multiple potential servers created for a page request but only one physical packet on the network. This contributes substantially in reducing network bandwidth, but at the same time increasing peer accessibility to all the peers. When implemented properly, the packet traffic due to Peer Caching will be proportional to the number of clients on the network participating in Peer Caching.

P-0747[0747] An idea related to Multicast is Packet Protocol. Note that Multicast itself is a packet-based protocol as opposed to connection based. The idea of Peer Caching here is described using Multicast and Packet Protocol. The Peer Caching request is sent as a multicast request and the response from a peer to such a request is also sent as a packet (not necessarily a multicast packet). Sending packets is much faster than sending data through a connection-based protocol such as TCP/IP, although using packet-based protocol is not as reliable as using connection-based one. The lack of reliability in Packet Protocol is acceptable since Peer Caching is used only to improve overall performance of the Client-Server system rather than as a primary mechanism for a client to get its pages. The underlying assumption made here is that a client could always get its pages from the server, if Peer Caching or Proxy Caching does not work for any reason.

P-0748[0748] The ideas of Concurrent Requesting and Smart Requesting describe how Peer Caching, Proxy Caching and client-server access could be combined in an intelligent fashion to achieve optimal performance of the whole Client-Server system. As part of Concurrent Requesting, a client is always prepared to make concurrent requests to get the page it needs in the fastest way possible. Concurrent Requesting would require the use of objects such as threads or processes that would allow one to programmatically implement Concurrent Programming. This document assumes the use of threads to describe a possible and preferred way to implement Concurrent Requesting.

P-0749[0749] The idea of Smart Requesting includes using an adaptive algorithm to intelligently stagger or schedule requests so that a client, even while using Concurrent Requesting, would not unnecessarily attempt to get a page through more than one means. An example of this is when a client has consistently gotten its page requests fulfilled through Peer Caching in the past. It would come to depend on Peer Caching for future page requests more than the other possible means. On the other hand, if Peer Caching has not worked for that client for some time, it would schedule a proxy request before a Peer Caching request. Smart Requesting involves dynamically calculating the delays D_Pand D_Sbased how well Peer Caching and Proxy Caching has worked for the client. Please see FIGS. 36 through 38.

P-0750[0750] The following is an algorithmic description using pseudo-code of an illustrative embodiment.

P-0751[0751] startOurClient is a function that is invoked initially when the client is started. <tables id="TABLE-US-00001" num="1"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><thead><row><entry /></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry>void startOurClient() {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Initialize the global variable delay to appropriate value based on a</entry></row><row><entry /><entry>predfined policy. When delay is positive, it signifies the amount</entry></row><row><entry /><entry>of time to wait after Proxy Caching before Peer Caching is</entry></row><row><entry /><entry>attempted; and when delay is negative it signifies the amount</entry></row><row><entry /><entry>of time to wait after Peer Caching before Proxy Caching is</entry></row><row><entry /><entry>attempted. As an example:</entry></row><row><entry /><entry>delay = 50;</entry></row><row><entry /><entry>Start a thread for peer responses (i.e., Peer Caching server) with</entry></row><row><entry /><entry>thread function as peerServer;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry>getPage function</entry></row><row><entry>The function getPage is called by the client's application to get a page.</entry></row><row><entry>This function looks up the local cache and if the page is not found,</entry></row><row><entry>attempts to get the page from a peer or proxy/server using the</entry></row><row><entry>ideas of Concurrent Requesting and Smart Requesting.</entry></row><row><entry>void getPage(PageIdType pageId) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>if pageId present in the local cache then {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>retrieve it and return it to the caller;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>if (delay > 0) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>myDelay = delay;</entry></row><row><entry /><entry>Call requestProxy(pageId);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>else {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>myDelay = -delay;</entry></row><row><entry /><entry>Call requestPeer(pageId);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>Wait for gotPage event to be signaled for a maximum of myDelay</entry></row><row><entry /><entry>milliseconds;</entry></row><row><entry /><entry>If the page was obtained as indicated by gotPage being signaled {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>Modify delay appropriately i.e., if the page was obtained through</entry></row><row><entry /><entry>Proxy Caching increment delay else decrement it;</entry></row><row><entry /><entry>Return the page;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>if (delay > 0) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>Call requestPeer(pageId);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>else {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>Call requestProxy(pageId);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>Wait for the page to come through either methods;</entry></row><row><entry /><entry>Depending on how the page came (through Proxy Caching or Peer</entry></row><row><entry /><entry>Caching) increment or decrement delay;</entry></row><row><entry /><entry>Return the page;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry>requestProxy function</entry></row><row><entry>The function requestProxy sends a page request to the proxy and starts</entry></row><row><entry>a thread that waits for the page response (or times out). The function</entry></row><row><entry>proxyResponse is the thread function that waits for the response based</entry></row><row><entry>on the arguments passed to</entry></row><row><entry>t.</entry></row><row><entry>void requestProxy(pageId) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Send a page request for pageId to a predefined proxy/server as per the</entry></row><row><entry /><entry>proxy/server protocol;</entry></row><row><entry /><entry>Start a thread with the thread function proxyResponse that waits for</entry></row><row><entry /><entry>the response to the request - the function proxyResponse is passed</entry></row><row><entry /><entry>arguments: the socket X where it should wait and pageId.</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry>void proxyResponse(socket X, pageId) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Wait at the socket X for a response with a timeout of time TY;</entry></row><row><entry /><entry>If a response was received at socket X {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="42PT" align="left" /><colspec colname="1" colwidth="175PT" align="left" /><tbody valign="top"><row><entry /><entry>Uncompress the packet if necessary;</entry></row><row><entry /><entry>Validate the packet and ensure that this is a</entry></row><row><entry /><entry>valid response to the request and has the page requested</entry></row><row><entry /><entry>(i.e., match the pageId);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>else {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="42PT" align="left" /><colspec colname="1" colwidth="175PT" align="left" /><tbody valign="top"><row><entry /><entry>// this is time out: didn't receive any</entry></row><row><entry /><entry>// response in time TY</entry></row><row><entry /><entry>Set appropriate indicator to indicate time-out;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>Signal an event to signify completion of this thread;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry>requestPeer and peerResponse functions</entry></row><row><entry>The function requestPeer is similar to requestProxy except that it sends</entry></row><row><entry>a page request to peers and starts a thread that waits for the page</entry></row><row><entry>response (or times out). The function peerResponse is the thread</entry></row><row><entry>function that waits for the response based on the arguments passed to it.</entry></row><row><entry>Void requestPeer(pageId) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>Create a UDP socket X bound to port 3002;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Compose a packet that consists of:</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="42PT" align="left" /><colspec colname="1" colwidth="175PT" align="left" /><tbody valign="top"><row><entry /><entry>• a code indicating that this is a request for a page</entry></row><row><entry /><entry>• Some kind of an identifier that uniquely identifies</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="56PT" align="left" /><colspec colname="1" colwidth="161PT" align="left" /><tbody valign="top"><row><entry /><entry>the page wanted such as the URL</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="42PT" align="left" /><colspec colname="1" colwidth="175PT" align="left" /><tbody valign="top"><row><entry /><entry>• other info such as security information or access</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="56PT" align="left" /><colspec colname="1" colwidth="161PT" align="left" /><tbody valign="top"><row><entry /><entry>validators</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>Send this packet as a multicast packet to 239.0.0.1:2001</entry></row><row><entry /><entry>through the socket X created above;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Create a thread with the thread function peerResponse and</entry></row><row><entry /><entry>pass socket X and pageId as arguments to it;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry>Void peerResponse(socket X, pageId) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Wait at the socket X for a response with a timeout of time TX;</entry></row><row><entry /><entry>If a packet was received at socket X {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>Uncompress the packet if necessary;</entry></row><row><entry /><entry>Validate the packet and ensure that this is a</entry></row><row><entry /><entry>valid response to the request and has the page requested (i.e.,</entry></row><row><entry /><entry>match the pageId);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>else {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>// this is time out: didn't receive any</entry></row><row><entry /><entry>// response in time TX</entry></row><row><entry /><entry>Set appropriate indicator to indicate time-out;</entry></row><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Signal an event to signify completion of this thread;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry>peerServer function</entry></row><row><entry>The function peerServer described below serves page requests received</entry></row><row><entry>through Peer Caching as multicast packets. The function below describes</entry></row><row><entry>how this thread would work:</entry></row><row><entry>void peerServer() {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Create a multicast socket M bound to port 2001;</entry></row><row><entry /><entry>Have M “join” the IP address 239.0.0.1;</entry></row><row><entry /><entry>while (not asked to terminate) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>Wait at M for a multicast packet;</entry></row><row><entry /><entry>If a packet is received then {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>Store the source IP addr in S along with the source port number in B;</entry></row><row><entry /><entry>Validate the packet that it is a valid request for a page that can be</entry></row><row><entry /><entry>served (with valid security credentials);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="42PT" align="left" /><colspec colname="1" colwidth="175PT" align="left" /><tbody valign="top"><row><entry /><entry>Look up the page id in the local client cache;</entry></row><row><entry /><entry>If the page is found {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="56PT" align="left" /><colspec colname="1" colwidth="161PT" align="left" /><tbody valign="top"><row><entry /><entry>Compose a packet that contains the pageId of the</entry></row><row><entry /><entry>page as well as the page contents to send;</entry></row><row><entry /><entry>Optionally compress the packet before sending;</entry></row><row><entry /><entry>Send this packet to the IP address S at port B;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="42PT" align="left" /><colspec colname="1" colwidth="175PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="28PT" align="left" /><colspec colname="1" colwidth="189PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="OFFSET" colwidth="14PT" align="left" /><colspec colname="1" colwidth="203PT" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217PT" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>

Piracy Prevention For Streamed Applications

P-0752[0752] Summary

P-0753[0753] The details presented in this section describe new techniques of the invention that have been developed to combat software piracy of applications provided over networks, in situations where an ASP's clients' machines execute the software applications locally. The remote ASP server must make all the files that constitute an application available to any subscribed user, because it cannot predict with complete accuracy which files are needed at what point in time. Nor is there a reliable and secure method by which the server can be aware of certain information local to the client computer that could be useful at stopping piracy. The process may be a rogue process intent on pirating the data, or it may be a secure process run from an executable provided by the ASP.

P-0754[0754] Aspects of the Invention

P-0755[0755] 1. Client-side fine-grained filtering of file accesses directed at remotely served files, for anti-piracy purposes. Traditional network filesystems permit or deny file access at the server side, not the client side. Here, the server provides blanket access to a given user to all the files that the user may need during the execution of an application, and makes more intelligent decisions about which accesses to permit or deny.

P-0756[0756] 2. Filtering of file accesses based on where the code for the process that originated the request is stored. Traditional file systems permit or deny file access usually based on the credentials of a user account or process token, not on where the code for the process resides. Here, a filesystem may want to take into account whether the code for the originating process resides in secure remote location or an insecure local location.

P-0757[0757] 3. Identification of crucial portions of served files and filtering file accesses depending on the portion targeted. The smallest level of granularity that traditional file systems can operate on is at the level of files, not at the level of the sections contained in the files (for example, whether or not data from a code section or a resource section is requested).

P-0758[0758] 4. Filtering of file accesses based on the surmised purpose of the file access, as determined by examining the program stack or flags associated with the request. Traditional file systems do not attempt to determine why a file access was issued before permitting or denying the access, e.g., whether the purpose is to copy the data or page in the data as code for execution.

P-0759[0759] 5. Filtering of file accesses based on the surmised purpose of the file access, as determined by examining a history of previous file accesses by the same process. Traditional file systems do not keep around histories of which blocks a given requester had previously requested from a file. This history can be useful in seeing if the requests match a pattern that suggests a file copy is occurring as opposed to code execution.

P-0760[0760] Benefits of the Anti-Piracy Features of the Present Invention

P-0761[0761] This is an enabler technology that allows a programmer to build security into a certain type of application delivery system that would otherwise not be possible. Several companies are developing technology that allows an application to be served remotely, but executed locally. Current filesystems provide no way to protect the files that make up this application from being copied and thus pirated. The above techniques are tools that enable a filesystem to allow just those requests that will let the application run normally and block those that are the result of attempts to pirate the application's code or data. This provides a competitive advantage to those software providers who use this technology, because piracy results in lost revenue and, by preventing this, piracy they can prevent this loss.

P-0762[0762] The techniques described herein were developed for the purpose of preventing the piracy of computer software programs that are served from a remote server, but executed on a local client. However, they can be used by any computer software security solution that would benefit from the ability to filter file accesses with more flexibility than currently provided by most filesystems.

P-0763[0763] When a filesystem receives a request, it must decide whether or not the request should be granted or denied for security reasons. If the target file is local, the filesystem makes the decision by itself, and if the target file is remote, it must ask the server to handle the request for it. The above techniques are ways in which the filesystem can gather more information about the request than it would ordinarily have. It can then use that information to improve the quality of its decisions. Traditional approaches, such as granting a currently logged-in user access to certain files and directories that are marked with his credentials, are not flexible enough for many situations. As for remote files, the server has only a limited amount of information about the client machine. The filesystem at the client side can make grant/deny decisions based on local information before ever asking the server, in order to provide a more intelligent layer of security.

P-0764[0764] For example, it may be desirable to allow the user to execute these files, but not copy them. It may be desirable to grant access to only certain processes run by the user, but not others, because it is judged that some processes to be more secure or well-behaved than others. And it may be desirable to allow the user to access only certain sections of these files and from only certain processes for certain periods of time. The above techniques are tools that are added to a filesystem to give it these abilities.

P-0765[0765] Overview of the Anti-Piracy Features of the Present Invention

P-0766[0766] With respect to FIG. 40, preventing piracy of remotely served, locally executed applications is shown. This figure illustrates the problem of software piracy in an application delivery system, and how it can be stopped using the techniques described in this section. The client computer <b>4001</b> is connected to a server <b>4009</b> run by an ASP <b>4007</b>. The server <b>4009</b> provides access to application files <b>4008</b>, out of which the application executable is run by the client <b>4001</b> locally on his machine. (This is Process #1 <b>4002</b>). However, the user can attempt to access and copy the application files to local storage <b>4009</b> on his machine, and thus be able to run them without authorization or give them to another person. But since all requests directed at the remote files <b>4006</b> must first pass through the local network filesystem, this filesystem can be enhanced <b>4005</b> to deny all such requests that it thinks are the result of an attempt at piracy.

P-0767[0767] Referring to FIG. 41, the filtering of accesses to remote application files, illustrating New Technique #1, as described above is shown. (Note: the client computer represented here and in all subsequent figures is part of the same client-server system as in FIG. 40, but the server/ASP diagram has been omitted to save space.) A user <b>4102</b> who has been granted access to remotely served files <b>4106</b> representing an application is attempting to access these files. The local enhanced network filesystem <b>4103</b> is able to deny access to certain files <b>4105</b> and grant access to others <b>4104</b>, for the purpose of protecting critical parts of the application from piracy.

P-0768[0768] With respect to FIG. 42, the filtering of accesses to remote files based on process code location, illustrating New Technique #2, as described above, is shown. Here there are two processes on the client computer. Process #1 <b>4202</b> has been run from an executable file <b>4206</b> that is part of a remotely served application <b>4207</b>, and process #2 <b>4203</b> has been run from a local executable file <b>4204</b>. They are both attempting to access a remote data file <b>4206</b> that is part of the served application <b>4207</b>. The local enhanced network filesystem <b>4205</b> is denying Process #2 <b>4203</b> access and granting Process #1 <b>4202</b> access because Process #2's <b>4203</b> executable is stored locally, and thus is not secure, while Process #1's <b>4202</b> executable is provided by the server <b>4207</b>, and thus can be vouched for.

P-0769[0769] Referring to FIG. 43, the filtering of accesses to remote files based on targeted file section, illustrating New Technique #3, as described above, is shown. Here there is a single local process <b>4302</b> that is attempting to read from a remotely served executable file <b>4307</b>. The enhanced network filesystem <b>4304</b> is denying an attempt to read from the code section <b>4306</b> of the file <b>4307</b> while granting an attempt to read from a non-code section <b>4305</b> of the file <b>4307</b>. This is useful when access to some part of the file must be allowed, but access to other parts should be denied to prevent piracy of the entire file.

P-0770[0770] With respect to FIG. 44, the filtering of accesses to remote files based on surmised purpose, illustrating New Technique #4 as described above, is shown. Here, two attempts to read from the code section <b>4407</b> of a remote executable file <b>4408</b> are being made from a process <b>4402</b> that was run from this file <b>4408</b>. However, one request is denied because it originated <b>4406</b> from the process's code <b>4403</b> itself, while another is approved because it originated from code in the Virtual Memory Subsystem <b>4404</b>. This prevents even a rogue remote process from attempting to pirate its own code, while allowing legitimate requests for the code to be completed.

P-0771[0771] Referring to FIG. 45, the filtering of accesses to remote files based on past access history. illustrating New Technique #5 as described above, is shown. Here, two processes <b>4502</b>, <b>4503</b> run from a local executable <b>4504</b> are attempting to access a remote file <b>4508</b>. The enhanced network filesystem <b>4507</b> keeps around a history of previous file accesses by these processes <b>4505</b>, <b>4506</b>, which it consults to make decisions about permitting/denying further accesses. Process #1's <b>4502</b> access attempt is granted, while Process #2's <b>4503</b> is denied, because the filesystem <b>4507</b> detected a suspicious pattern in Process #2's <b>4503</b> previous access history <b>4506</b>.

P-0772[0772] Anti-Piracy Details of the Invention

P-0773[0773] Five anti-piracy embodiments are disclosed below that can be used by an ASP-installed network filesystem to combat piracy of remotely served applications. The ASP installs a software component on the client that is able to take advantage of local knowledge, e.g., which process on the client originated a request for data, and permit or deny requests for remote files before sending the requests to the server. That is, a network filesystem is installed on the local user's computer that manages access to these remote files. All input/output requests to these files must pass through this filesystem, and if the filesystem determines that a given request is suspicious in some way, it has the freedom to deny it.

P-0774[0774] Anti-Piracy Embodiment #1:

P-0775[0775] Client-side fine-grained filtering of file accesses directed at remotely served files, for anti-piracy purposes.

P-0776[0776] Referring again to FIG. 41, the approach of the first anti-piracy embodiment is that a software component <b>4102</b> executing locally on a client computer <b>4101</b> has available to it much more information about the state of this computer than does a server providing access to remote files. Thus, the server can filter access only on a much coarser level that can this client component. An ASP can take advantage of this by installing a network filesystem <b>4103</b> on the client computer that is designated to handle and forward all requests directed at files located on a given remote server. This filesystem <b>4103</b> examines each request, and either grants or denies it depending on whether the request is justifiable from a security perspective. It can use information such as the nature of the originating process, the history of previous access by the process, the section of the targeted file being requested, and so on, in order to make its decision.

P-0777[0777] The best way known of implementing this approach is to write a network redirector filesystem component <b>4103</b> for the operating system that the ASP's clients' machines will be running. This component will be installed, and will make visible to the system a path that represents the server on which the ASP's application files are stored. The local computer can now begin accessing these files, and the filesystem <b>4103</b> will be asked to handle requests for these files. On most operating systems, the filesystem <b>4103</b> will register dispatch routines to the system that handle common file operations such as open, read, write and close. When a local process <b>4102</b> makes a request of an ASP-served file, the OS calls one of these dispatch routines with the request. In the dispatch routine, the filesystem <b>4103</b> examines the request and decides whether to deny it or grant it. If granted, it will forward the request to the remote server and send back the response to the operating system.

P-0778[0778] Anti-Piracy Embodiment #2:

P-0779[0779] Filtering of file accesses based on where the code for the process that originated the request is stored.

P-0780[0780] Referring again to FIG. 42, when a filesystem <b>4205</b> receives a request for access to a given file, the request always originates from a given process on the computer. By determining where the executable file that the process was run from is located, the network filesystem <b>4205</b> can make a more informed decision about the security risk associated with granting the request. For example, if the executable file <b>4204</b> is located on the local computer <b>4202</b>, then it may contain any code whatsoever, code that may attempt to copy and store the contents of any remote files it can gain access to. The filesystem <b>4205</b> can reject requests from these processes as being too risky. However, if the executable file <b>4206</b> is being served by the ASP's remote server <b>4207</b>, then the process can assume to be well-behaved, since it is under the control of the ASP. The filesystem <b>4205</b> can grant accesses that come from these processes <b>4202</b> in confidence that the security risks are minimal.

P-0781[0781] The best way known of implementing this approach is to modify a network filesystem <b>4205</b> to determine the identity of the process that originated a relevant open, read, or write request for a remote file. On some OSes a unique process ID is embedded in the request, and on others, a system call can be made to get this ID. Then, this ID must be used to look up the pathname of the executable file from which the process was run. To do this, upon initialization the filesystem <b>4205</b> must have registered a callback that is invoked whenever a new process is created. When this callback is invoked, the pathname to the process executable and the new process ID are provided as arguments, data which the filesystem <b>4205</b> then stores in a data structure. This data structure is consulted while servicing a file request, in order to match the process ID that originated the request with the process's executable. Then the root of the pathname of that executable is extracted. The root uniquely identifies the storage device or remote server that provides the file. If the root specifies an ASP server that is known to be secure, as opposed to a local storage device that is insecure, then the request can be safely granted.

P-0782[0782] Anti-Piracy Embodiment #3:

P-0783[0783] Identification of crucial portions of served files and filtering file access depending on the portion targeted.

P-0784[0784] Referring again to FIG. 43, a served application usually consists of many files. In order to steal the application, a pirate would have to copy at least those files that store the code for the application's primary executable, and perhaps other files as well. This leads to the conclusion that some files are more important that others, and that some portions of some files are most important of all. Ordinarily, the best solution would be to deny access to the primary executable file and its associated executables in its entirety, but this is not usually possible. In order to initially run the application, the filesystem <b>4304</b> must grant unrestricted access to some portions of the primary executable. In order to prevent piracy, the filesystem <b>4304</b> can grant access selectively to just those portions that are needed. Additionally, the running application <b>4302</b> itself does not usually need to read its own code section, but does need to read other sections for purposes such as resource loading. Therefore, additional security can be introduced by denying access to the code sections <b>4306</b> of ASP-served executables <b>4307</b> even to those executables themselves.

P-0785[0785] To implement this, modify a network filesystem's <b>4304</b> open file dispatch routine to detect when a remotely served executable <b>4307</b> is being opened. When this is detected, the executable file <b>4307</b> is examined to determine the offset and length of its code section <b>4306</b>, and this information is stored in a data structure. On most OSes, executable files contain headers from which this information can be easily read. In the read and write dispatch routines, the network filesystem <b>4304</b> checks if the request is for a remote executable <b>4307</b>, and if so, the offset and length of the code section <b>4306</b> of this executable <b>4307</b> is read from the data structure in which it was previously stored. Then the offset and length of the request are checked to see if they intersect the code section <b>4306</b> of this executable <b>4307</b>. If so, the request can be denied.

P-0786[0786] Anti-Piracy Embodiment #4:

P-0787[0787] Filtering of file accesses based on the surmised purpose of the file access, as determined by examining the program stack or flags associated with the request.

P-0788[0788] Referring again to FIG. 44, the approach of the fourth embodiment is that identical requests from the same process for a remotely served file can be distinguished based on the reason the request was issued. For example, on a computer with a virtual memory subsystem <b>4404</b>, the VMS's own code will be invoked to page-in code for a process that attempts to execute code in pages that are not currently present. To do this, the VMS <b>4404</b> must issue a read request to the filesystem <b>4405</b> that handles the process' <b>4402</b> executable file <b>4408</b>. Since this request is not for any ulterior purpose, such as piracy, and is necessary for the application to execute, the request should be granted. If the filesystem <b>4405</b> gets the originating process ID for such requests, the process whose code is being paged in will be known. However, this same process ID will also be returned for requests that originate as a result of an attempt by the process itself to read its own code (perhaps for the purpose of piracy). Many applications have loopholes that allow the user to execute a macro, for example, that reads and writes arbitrary files. If the filesystem <b>4405</b> simply filters requests based on process IDs, it will mistakenly allow users to pirate remotely served applications, as long as they can send the necessary reads and writes from within the remote application itself.

P-0789[0789] However, even if the process IDs are the same for two apparently identical requests, there are ways the filesystem <b>4405</b> can distinguish them. There are two known ways to do this in a manner relevant to combating anti-piracy. The way to implement the first method is to have the filesystem <b>4405</b>, upon receiving a read request, check for the presence of the paging I/O flag that is supported by several operating systems. If this flag is not present, then the request did not come from the VMS <b>4404</b>, but from the process itself <b>4403</b>, and thus the request is risky and not apparently necessary for the application to run. If the flag is present though, the request almost certainly originated from the VMS <b>4404</b> for the purpose of reading in code to allow the process to execute. The request should be allowed.

P-0790[0790] Another way to make this same determination is to have the filesystem <b>4405</b> examine the program stack upon receiving a read request. In several operating systems, a process will attempt to execute code that resides in a virtual page regardless of whether the page is present or not. If the page is not present, a page fault occurs, and a structure is placed onto the stack that holds information about the processor's current state. Then the VMS <b>4404</b> gets control. The VMS <b>4404</b> then calls the read routine of the filesystem <b>4405</b> that handles the process's executable file to read this code into memory. The filesystem <b>4405</b> now reads backwards up the stack up to a certain point, searching for the presence of the structure that is placed on the stack as a result of a page fault. If such a structure is found, the execution pointer register stored in the structure is examined. If the pointer is a memory address within the boundary of the virtual memory page that is being paged in, then the filesystem <b>4405</b> knows the read request is legitimate.

P-0791[0791] Anti-Piracy Embodiment #5:

P-0792[0792] Filtering of file accesses based on the surmised purpose of the file access, as determined by examining a history of previous file accesses by the same process.

P-0793[0793] Referring again to FIG. 45, if one looks at the series of file requests that are typically made as a result of attempting to copy an executable file, as opposed to those made in the course of executing that file, one can see certain patterns. The copy pattern is usually a sequence of sequentially ordered read requests, while the execution pattern tends to jump around a lot (as the result of code branches into non-present pages). A filesystem can be enhanced to keep around a history of requests made by specific processes on remotely served files. Then, for every subsequent request to such a file, the history for the originating process can be examined to check for certain patterns. If a file-copy pattern is seen, then the pirate may be attempting to steal the file, and the request should be denied. If an execution type pattern is seen, then the user is simply trying to run the application, and the request should be granted.

P-0794[0794] To implement this, a filesystem <b>4507</b> will tell the operating system, via an operating system call, upon initialization, to call it back whenever a new process is created. When it is called back, the filesystem <b>4507</b> will create a new data structure for the process that will store file access histories <b>4505</b>, <b>4506</b>. Then, in its read-file dispatch routines, the filesystem <b>4507</b> will determine the process ID of the originating process, and examine the process's access history <b>4505</b>, <b>4506</b>. It will only examine entries in that history <b>4505</b>, <b>4506</b> that refer to the file currently being requested. It will then run a heuristic algorithm that tries to determine if the pattern of accesses more closely resembles an attempted file copy than code execution. An effective algorithm is to simply see if the past n read requests to this file have been sequential, where n is some constant. If so, then the request is denied. If not, then the request is granted. In either case, an entry is made to the filesystem's process access history <b>4505</b>, <b>4506</b> that records the file name, offset, and length of the request made by that process to this file.

Conclusion

P-0795[0795] Although the present invention has been described using particular illustrative embodiments, it will be understood that many variations in construction, arrangement and use are possible within the scope of this invention. Other embodiments may use different network protocols, different programming techniques, or different heuristics, in each component block of the invention. Specific examples of variations include:

P-0796[0796] The proxy used in Proxy Caching could be anywhere in the Internet along the network path between a Client and the Server; and

P-0797[0797] Concurrent Requesting and Smart Requesting can be implemented in hardware instead of software.

P-0798[0798] A number of insubstantial variations are possible in the implementation of anti-piracy features of the invention. For example, instead of modifying the filesystem proper to provide anti-piracy features, a network proxy component can be placed on the client computer to filter network requests made by a conventional local network filesystem. These requests generally correspond to requests for remote files made to the filesystem by a local process, and the type of filtering taught by the present invention can be performed on these requests. A filesystem filter component can also be written to implement these methods, instead of modifying the filesystem itself.

P-0799[0799] Although the invention is described herein with reference to the preferred embodiment, one skilled in the art will readily appreciate that other applications may be substituted for those set forth herein without departing from the spirit and scope of the present invention. Accordingly, the invention should only be limited by the claims included below.