US20010044850A1 - Method and apparatus for determining the order of streaming modules - Google Patents
Method and apparatus for determining the order of streaming modules Download PDFInfo
- Publication number
- US20010044850A1 US20010044850A1 US09/745,646 US74564600A US2001044850A1 US 20010044850 A1 US20010044850 A1 US 20010044850A1 US 74564600 A US74564600 A US 74564600A US 2001044850 A1 US2001044850 A1 US 2001044850A1
- Authority
- US
- United States
- Prior art keywords
- modules
- client
- module
- streaming
- application
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/445—Program loading or initiating
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/1066—Session management
- H04L65/1101—Session protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/61—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
- H04L65/612—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for unicast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/61—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
- H04L65/613—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for the control of the source by the destination
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/70—Media network packetisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/34—Network arrangements or protocols for supporting network services or applications involving the movement of software or configuration parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
Definitions
- the present invention is related to a method and system for streaming modules from a server to a client and, more particularly, to an improved method and system for predicting the order in which to stream the modules to the client.
- a client computers can communicate with a server to remotely access information stored at the server.
- the transfer of information between the server and client computer may be provided using standard protocols and software applications.
- a hypertext markup language (HTML) browser application at a client computer can communicate over the public Internet using TCP/IP and hypertext transfer protocols (HTTP) to receive web pages from a HTTP server.
- Web pages may include formatted text as well as multimedia elements, such as embedded graphics and sounds.
- the multimedia elements may be downloaded by the client and presented to a user by a browser application or a “plug in” browser component.
- Example browser applications include Netscape Navigator 4.0® and Microsoft Internet Explorer 4.0TM.
- Browser applications used at client computers can use plug-in software to receive audio and video information using a streaming data transmission protocol.
- a streaming protocol allows information to be presented by a client computer as it is being received. For example, full-motion video can be sent from a server to a client as a linear stream of frames. As each frame arrives at the client, it can be displayed to create a real-time full-motion video display. Audio and video streaming allows the client to present information without waiting for the entire stream to arrive at the client application. Audio and video streaming are provided by, for example, the RealAudio® and RealVideoTM applications from RealNetworks, Inc.
- Browser applications may also make use of executable software applets to enhance the appearance of HTML-based web pages.
- Applets are software programs that are sent from the server to the client in response to a request from the client.
- HTML-based web pages include HTTP commands that cause a browser application to request an applet from a server and to begin execution of the applet.
- the applet may thereafter interact with a user to gather and process data, may communicate data across a network, and may display results on a computer output device.
- Applets may be constructed from a programming language which executes in a run-time environment provided by the browser application at the client computer.
- Java® programming language allows Java applets to be stored at a web server and attached to web pages for execution by a Java interpreter.
- Java Applets may be formed from multiple Java Classes.
- Java Classes include executable Java code that can be downloaded from a server in response to a dynamically generated request to execute the class (a module execution request). If a Java Class is not available to a Java interpreter when an executing applet attempts to access functionality provided by the Class, the Java interpreter may dynamically retrieve the Class from a server.
- Other programming languages such as Microsoft Visual Basic® or Microsoft Visual C++®, may also be used to create applet-like software modules, such as Microsoft ActiveXTM controls.
- Downloadable applets can also be used to develop large and complex programs.
- a complex financial program may be constructed from a collection of applets.
- separate applets may be used to gather information from a user, compute payments, compute interest, and generate printed reports.
- program functions are required by a user, the applets associated with the required functions can be retrieved from the server.
- delays associated with retrieving is modules over a network likewise increase and may be unacceptable to end-users. Consequently, an improvement in the transmission of software modules between computers is desirable.
- the invention includes methods and systems for streaming data modules between a first and a second computer.
- the modules may be streamed regardless of the existence of a “natural” order among the modules.
- the disclosed streaming mechanism is not constrained to operate according to a linear data ordering. Instead, streamed data modules are selected using predetermined criteria that can be independent of the particular data content.
- the disclosed streaming mechanism can provide user-dependent streaming of software modules.
- a home banking application may include modules #1 through #5.
- a first banking application user may, based on the user's input choices at a menu screen, access the modules in the order 1-3-4-5 while a second user may access the modules in the order 2-4-1.
- the predetermined criteria used to determine a streaming sequence may detail each user's module usage pattern.
- Predetermined criteria associated with the application's users may indicate a preferred streaming sequence 1-3-4-5 when the first user is accessing the banking application but may indicate the preferred sequence 2-4-1 when the second user is accessing the application.
- the streamed sequence may therefore conform to a historical user-dependent access pattern.
- Other types of predetermined criteria may also be used.
- the disclosed streaming mechanism may also be use to stream non-executable data such as hypertext markup language data, binary graphics, and text.
- the invention features a computer-implemented method of transmitting modules from a first computer to a second computer.
- a module set is formed by selecting a sequence of modules from a collection of available modules.
- Each of the selected modules are associated with an application executing at the second computer.
- the selected modules may be transparently streamed from the first computer to the second computer.
- the selection of modules is made in accordance with predetermined selection criteria and is independent of the second computer's execution environment.
- a module may include non-executable data, such as hypertext markup language data, and/or program code.
- the selection criteria may be stored in a streaming control database.
- the streaming control database may include transition records associating weighted values with transitions between selected modules in the collection. Processing of transition record information, such as by using a path determination algorithm, may be used to determine the sequence of modules.
- the streaming control database may include list records each of which identifies a predetermined sequences of modules. Selection of modules may be made by selecting a list record. Selecting a sequence of modules may include sending data from the second computer to the first computer to identify each module in the sequence or to identify the status of the executing application. For example, data identifying the status may include a series of user input values.
- Implementations may also include one or more of the following features.
- Streaming of the module set may be interrupted, a second sequence determined, and streaming of the second sequence may occur.
- the streaming of the module set may be interrupted by a request for a particular module that is sent from the second computer to the first computer.
- a Java Applet may interrupt a stream of Java Classes by attempting to access a Java Class that has not already been streamed to the second computer.
- a sequence of modules may be streamed and stored at the second computer independent of the executing application. That is, the executing application need not initiate streaming and need not be aware of the streaming process.
- Streamed modules may be subsequently integrated with the application at the second computer by interconnecting logic in a streamed module with logic in the application.
- Implementations may also include one or more of the following features.
- the application may include an interrupt statement. Execution of the interrupt statement may transfer control to an executor program.
- the executor program functions in the manner of a program code debugger by responding to the interrupt statement and preventing the permanent cessation (termination) of the executing application process.
- the executor program may thereafter integrate logic in a streamed module with the application's logic by replacing the interrupt statement (generally, as part of a block of replacement logic) with replacement logic from the streamed module.
- the application may thereafter continue executing, generally by executing replacement logic that has been substituted for the interrupt statement.
- the application may also include a stub procedure that can be replaced by logic in a streamed module. Replacement of the stub procedure may be direct, such as by removing the stub procedure code and replacing it with logic from a streamed module, or replacement may be operative, such as by creating a link to logic in a streamed module.
- the invention features a computer program residing on a computer-readable medium.
- the computer program includes instructions for causing a computer to access a collection of modules associated with an application, to access a database storing module selection criteria, to form a module set by selecting a sequence of modules from the collection in accordance with the module selection criteria, and to transparently stream the module set to a second computer.
- Implementations of program may also include instructions for causing the computer to retrieve a first module from the collection and to send the first module to the second computer.
- the invention features a computer program residing on a computer-readable medium.
- the program includes instructions for causing a computer to execute an application, to transparently receive a module associated with the executing application, to store the received module independent of the executing application, and to integrate the received module with the executing application.
- the invention features a system for transferring information modules between computers.
- the system includes a first computer and a second computer.
- the first computer includes means for executing an application, means for receiving a sequence of modules associated with the application while the application is executing, and means for integrating a first module in the received sequence with the application.
- the second computer includes means for storing a collection of modules associated with the application, means for selecting a sequence of modules from the collection, and means for transferring the selected sequences from the first computer to the second computer.
- Implementations may include one or more of the following advantages. Delays experienced when downloading an applications, a code module, or a data modules can be can be reduced. Software and data modules can be predictively delivered to a client workstation according to a particular end user's requirements. The order in which modules are streamed from a server to a client can be dynamically determined. A collection of module delivery sequences can be associated with a particular application or user and the sequences can be dynamically updated. Module delivery sequences can be determined based on individual software usage patterns or stored statistic associated with module usage. Module streaming can be interrupted and altered during the execution of an application. Implementations may include additional or alternative advantages as will become clear from the description and claims that follow.
- the selection criterion can be stored in a streaming control database, which database can include transition records associating weighted values with transitions between selected modules. Weight values can be determined by a historical count of the number of times that modules were requested by all users. Alternatively, weight values for different subgroups of users can be determined by a historical count of the number of times that modules were requested by each subgroup.
- Path determination algorithms can be used to predict a sequence of modules to stream using weight values. In certain instances, sets of modules will always be streamed if one module in the set is streamed. In these instances, all modules in the set are grouped together and sent to the client as a batch. Path determination algorithms can also factor in the size of the various modules and the size of the cache memory at a client computer to maximize use of the client's cache memory.
- a user can self-select a specific module sequence for a given function to have streamed each time the user accesses the function.
- the user can also self-select a sequence of functions such that the modules supporting the various functions will be streamed in an order of the function sequence.
- Particular modules can also always be streamed to the client computer regardless of historical usage or user selection.
- certain modules can be “tagged” by application owners, and a record of the number of times a tagged module is requested at the client and possibly the time used at the client be created.
- FIG. 1 illustrates a computer network
- FIG. 2 illustrates computer software application modules
- FIG. 3 is a directed graph, according to the invention.
- FIG. 4 illustrates a server and a client, according to the invention
- FIGS. 5 A- 5 E illustrate application code components, according to the invention
- FIG. 6 shows sample edge weighting tables for the graph of FIG. 3
- FIGS. 7 and 8 are edge graph illustrations of a module-grouping procedure
- FIG. 9 is a sample table illustrating a user selected function and module streaming order.
- FIG. 10 is a sample table illustrating usage summaries for designated modules.
- a wide area network 100 is shown.
- a client computer 101 can communicate with a server computer 102 by sending data over links 103 and 104 to a data network 130 .
- the data network 130 may include multiple nodes 131 - 134 that can route data between the client 101 and the server 102 .
- the client computer 101 may transmit and receive data using the TCP/IP, HTTP, and other protocols. For example, the client 101 may use the HTTP protocol to request web pages from the server 102 .
- Web pages and multimedia data sent from the server 102 to the client 101 may have a natural linear sequence associated with them.
- the natural sequence of video data may be the linear order of video frames while the natural sequence of text may be the order in which pages of text are arranged in a document.
- Data having a natural linear sequence can be streamed from a server to a client to minimize download delays.
- subsequent items may be downloaded to the client computer.
- a user or client application requesting the streamed item will perceive a reduced downloading delay. For example, if the first page of a document is retrieved by a user, the second page can be downloaded while the first page is being read. If the user continues reading at the second page of the document, that page will then be available at the client, such as in a cache area on a hard disk drive, and can be read without additional downloading delay.
- Software execution may not follow a predictable natural linear order.
- Software may include jump statements, break statements, procedure calls, and other programming constructs that cause abrupt transfers of execution among sections of executing code.
- the execution path that is traversed during the processing of interrelated code modules (such as code segments, code classes, applets, procedures, and code libraries), will often be non-linear, user dependent, may change with each execution of the application program, and may change depending on the state of various data items.
- a natural order may be lacking, an advantageous order may be determined in which to stream modules. The order may be determined using criteria that is independent of the computer's internal architecture or internal operating system (execution environment) considerations.
- a software application 200 may include multiple modules “A” through “H.”
- Modules “A” through “H” may be Java Classes, C++ procedure libraries, or other code modules that can be stored at a server. Some of the modules “A” through “H” may also be stored at the client computer, such as in a hard disk drive cache or as part of a software library stored at the client computer.
- a first module such as module “A”
- module “A” may be downloaded from the server and its execution at the client 410 may begin.
- module “A” As module “A” is being processed, the programming statements contained therein may branch to, for example, module “E.” If Module “E” is not already resident at the client, the execution of module “A” can be suspended, module “E” can be retrieved from the server, and then the execution of module “E” code may begin. In such a scenario, a user will experience a module download delay associated with retrieving module “E” from the server.
- module “E” may be transparently streamed from a server to the client computer. Transparent streaming allows future module use to be predicted and modules to be downloaded while other interrelated modules “A” are executing.
- the execution order of application modules “A” through “H” may resemble a directed graph 300 rather than a linear sequence of modules. For example, as illustrated by the graph 300 , after module “A” is executed, execution can continue at module “B”, “D,” or “E.” After module “B” is executed, execution can continue at module “C” or “G.” The execution path may subsequently flow to additional modules and may return to earlier executed modules.
- the software architecture 400 includes a streaming server 401 having a database 403 of stored software modules.
- the streaming server 401 can transparently transmit a stream of software modules 405 over a communications link to a client computer 410 .
- the communication link may be an analog modem connection, a digital subscriber line connection, a local area network connection, or any other type of data connection between the server 401 and client 410 .
- a network connection is opened to transmit data between the streaming server 401 and the client computer 410 and is preferably held open rather then opened and closed each time a module is transmitted.
- the client computer 410 can have a caching mechanism for caching streamed modules separate from a browser's cache.
- Software at the client computer 410 can monitor user activity at the client and transmit certain information back to the streaming server 401 .
- modules are being executed at the client 410 .
- additional modules are sent from the server 401 to the client 410 .
- the order in which modules are streamed between the server and client may be altered based on the particular client computer 410 being served, based on the user of the client computer, and based on other dynamically determined factors.
- the server 401 can use streaming control information 402 to determine the order in which to stream modules from the server 401 to the client 410 .
- the streaming control information 402 can include, for example, a predicted execution flow between software modules such as that represented by the directed graph 300 .
- the client may send control data 415 to the server 401 to dynamically update and alter the order in which modules are streamed from the server 401 to the client 410 .
- Control data 415 may be used to request particular modules from the server 401 , to send data regarding the current execution state of the application program, to detail the current inventory of modules residing in the client's local storage 411 , and to report user input selections, program execution statistics, and other data derived regarding the client computer 410 and its executing software.
- the sequence of modules sent in the stream 405 from the server 401 to the client 410 can be determined using a streaming control file 402 .
- the streaming control file 402 includes data used by the server to predict modules that will be needed at the client 410 .
- the control file 402 may represent modules as nodes of a directed graph.
- the control file 402 may also represent possible execution transitions between the modules as vertices (“edges”) interconnecting the nodes.
- the streaming control file 402 may include a list of vertices represent possible transitions between modules.
- Table 1 list vertices representing all possible transitions between the modules “A” through “H” of graph 300 (FIG. 3).
- Each vertex in Table 1 includes a weight value indicating the relative likelihood that the particular transitions between modules will occur. In the example of Table 1, higher weight values indicate less likely transitions.
- the server 401 may apply a shortest-path graph traversal algorithm (also known as a “least cost” algorithm) to determine a desirable module streaming sequence based on the currently executing module.
- shortest-path algorithms may be found in Telecommunications Networks: Protocols, Modeling and Analysis, Mocha Schwartz, Addison Wesley, 1987, ⁇ 6.
- Table 1 shows the minimum path weight between module “A” and the remaining modules: TABLE 1 Shortest Paths from Application Module “A”: Shortest Path From To Weight Path A B 1 A-B C 2 A-B-C D 7 A-D E 3 A-E F 9 A-D-F G 4 A-B-G H 5 A-E-H
- the server 401 may determine that, during the execution of module “A”, the module streaming sequence “B,” “C,” “E,” “G,” “H, ”D, “F” is advantageous. If a particular module in a determined sequence is already present at the client 402 , as may have been reported by control data 415 , the server 401 may eliminate that module from the stream of modules 405 .
- the server may interrupt the delivery of the sequence “B,” “C,” “E,” “G,” “H,” “D,”F,” calculate a new sequence based on the now executing module, and resume streaming based on the newly calculated streaming sequence. For example, if execution transitions to module “B” from module “A,” control data 415 may be sent from the client 410 to the server 401 indicating that module “B” is the currently executing module. If module “B” is not already available at the client 410 , the server 401 will complete delivery of module “B” to the client and determine a new module streaming sequence.
- the minimum path weights between module “B” and other modules of the graph 300 can be determined, as shown in Table 2, below: TABLE 2 Shortest Paths from Module B Shortest Path From To Weight Path B C 1 B-C E 5 B-C-E G 3 B-G H 7 B-C-E-H
- the server 401 may determine that module streaming sequence “C,” “G,” “E,” and “H” is advantageous.
- a weighted graph 300 may be used wherein heavier weighted edges indicate a preferred path among modules represented in the graph.
- higher assigned weight values indicate preferred transitions between modules.
- edges (A,B), (A,D), and (A,E) are three possible transitions from module A. Since edge (A,B) has a higher weight value then edges (A,D) and (A,E) it is favored and therefore, given module “A” as a starting point, streaming of module “B” before modules “D” or “E” may be preferred.
- Edge weight values can be, for example, a historical count of the number of times that a particular module was requested by a client, the relative transmission time of the code module, or a value empirically determined by a system administrator and stored in a table 402 at the server 401 . Other edge weight calculation methods may also be used.
- edges in the graph 300 having higher weight values are favored.
- the following exemplary algorithm may be used to determine a module streaming sequence in a preferred-path implementation:
- Implementations may select alternative algorithms to calculate stream sets and the predictive streaming process can be dynamically updated should a user request a module that was not predicted and used to predict a new module sequence starting from the requested module.
- sample table 600 shows a graph edge table for users under the age of 18, and table 610 shows a graph edge table for users during non-business hours after 6 PM.
- Tables 600 and 610 can be stored in the streaming control file 402 , along with any other graph edge tables generated based on different subcategories of users.
- the user Prior to execution of an application by a user at a client, the user can be queried to enter relevant user demographics in order to determine which graph edge table in the streaming control file to use to determine the order of the modules to stream.
- the edge weight tables stored in the control file can be analyzed to identify sets of modules which, if one module in the set is streamed, then all modules in the set are streamed.
- weight edges in the weight edge table can be analyzed to identify sequences of modules with identical weight values. These modules can then be always streamed together as a batch rather than individually. In the graph edge implementation, this can be viewed as a merging of nodes which lie along a branchless path.
- a graph edge table 710 for graph 700 is shown with weight values generated by a historical usage count. Weight edges in the weight edge table are analyzed to identify sequences of modules with identical weight values. The weight value from module A to B is 1 , as is the weight value from module B to C. Since module B will never be streamed without being followed by module C, the nodes represented by modules B and C can be merged. Thus, rather than streaming modules B and C separately, if the path determination algorithm determines that module B should be streamed, then modules B and C are batched and sent together. Referring to FIG. 8, the resulting edge weight table 810 and graph 800 is shown.
- path determination algorithms can utilize the size of the cache memory at the client and the sizes of the modules as factors in determining which modules to stream, with the goal of the analysis to maximize use of the client's cache memory and minimizing streaming time.
- the size of the client cache can be transmitted to the streaming server at the beginning of each client-server interaction, such as the initiation of a streaming session.
- a path determination algorithm may determine that a first sequence of modules to stream, A-B-C-E-H, would occupy 80% of the client cache memory while a second sequence A-B-C-E-G, although less likely than path A-B-C-E-H, will occupy 95% of the cache memory if module G occupies 15% more of the cache memory more than module H.
- the sequence A-B-C-E-G can be streamed to the client to maximize the amount of cache memory occupied. Should the user later request module G after module E, the larger module G, which requires more time to stream than module H, is already present on the client. Should the user instead request module H after module E, the smaller size of module H will allow for faster on-demand streaming, and thus reduce the penalty of an incorrect streaming prediction.
- the sequence of streamed modules can also be user defined at an individual level.
- a table 900 uniquely associated with a particular user can be generated based on user selections which are used to identify the sequence of modules for each function in an application to be streamed based on a user's selections.
- table 900 is stored at the client and uploaded to the application server when the user accesses the server.
- table 900 can be stored in on the server, e.g., as a list record in the streaming control file
- the user-selected streaming order can be generated during an interactive dialog between the client and server. For example, in one embodiment, a user at the client is given the option to enter a “Select Streaming Order” mode during which the user is instructed to perform a particular sequence of selections for a function that the user considers typical of the way in which the user anticipates behaving each time the user performs that particular function. A particular sequence of selections can be made for the modules associated with each function in the streaming application. The user selections can be used as default streaming settings each time the user logs on and attempts to perform a particular function. For users who may use functions in a streaming application in an a-typical manner, and thus in a way which is difficult to predict, these selections allow for faster streaming application of the application.
- the server can utilize other methods to determine a subsequent streaming order, such as prediction algorithms based on historical usage patterns. Predictive algorithms, such as historical usage patterns, can also be used to select streaming orders for functions that do not have a personalized streaming order associated with them for the respective user.
- the user can select the order of the functions to be streamed. Referring to FIG. 9, the user has selected that the application functions be streamed in the order 2 , 1 , 3 , and 4 , based, for example., on the user's assessment of the sequence of functions they will use in the application. These selections can be stored in a suitable table 900 associated with the user.
- the server will begin streaming modules corresponding to Function 2 , in an order specified by the user, e.g., in Table 900 , (modules A, G, C, and B), or, if no custom order is specified, in a ordering in accordance with the predictive algorithms.
- the server can reset the streaming sequence and being streaming the module for function 3 in a sequence defined by the user (here sequence D, E, B, and M) or otherwise selected as appropriate.
- modules can always be streamed from the server to the client regardless of historical usage or user selection.
- modules are typically associated with functions which are required for the application or for certain functionality of the application. For example, if a user password is required to access function 3 shown in FIG. 9, a security module S that interacts with the user to obtain the user password will always be streamed prior to modules D, E, B, and M regardless of whether the user selects module S during the Select Streaming Order mode.
- the modules being streamed are particular HTML pages
- an informational title page containing information about ownership rights to the page contents can always be streamed to the client prior to the streaming of any other pages.
- a combination of the methods herein disclosed for determining the order of modules to stream may be utilized.
- path determination prediction algorithms may be utilized for functions that users have not self-selected a streaming order
- mandatory streaming of certain modules may be combined with user self-selected streaming orders.
- various methods can be balanced against each other to determine which is the most appropriate in a given situation. For example, the use of cache memory utilization and module size as streaming order determining factors can be balanced with the probabilities that the various paths will be traversed by the user. Even if a given sequence of modules provides full cache utilization at the client, if the streamed modules are highly unlikely to be used, cache utilization would not be an appropriate factor to wholly base streaming decisions. In contrast, if a high cache utilization sequence is only slightly less likely than an alternative sequence and the modules not in the cache-based sequence can be streamed quickly, then the cache utilization sequence could provide superior overall performance.
- the various prediction methods and factors can be used and combined using differing weights as appropriate.
- the weights to assign to each of the factors and predictive methods can vary and preferably can be dynamically adjusted in response to operating conditions and measures of prediction success rates to improve the overall streaming performance.
- streaming server software can record time and usage of specially tagged modules streamed to the clients by gathering data received from the client computers regarding use of the tagged modules, such as the number of times they are streamed to clients and, with the use of appropriate client-side software, the amount of time the tagged modules are actually used by the client.
- Such information can be used to determine the popularity of various modules to increase the accuracy of the predictive streaming process. The information can also be valuable to application owners in determining which functions are most useful to the users and which functions might be omitted in future version without substantial concern.
- the information gathered can be used on a per-client basis to bill users based in accordance with the specific modules used and the amount of time each module is used.
- a word processing program such as Microsoft Word
- the module corresponding to the spell check function could be tagged as “Spell Check”.
- a request total can be incremented.
- client-side software can be configured to recognize the tags and both record its receipt as well as determining the length of time each particular tagged module is used. This information can subsequently be communicated to the streaming sever.
- FIG. 10 shows a table 1000 which summarizes data gathered for various users over a given period for example several tagged modules in a word processing application. For each tag, the number of times the module was streamed to and requested at the client, and the length of time the module was used is recorded.
- an application 500 may include multiple code modules such as a main code module 501 and code libraries 510 and 515 .
- the main module 501 contains program code that is executed when the application is started.
- the code libraries 510 and 515 may contain header data 511 and 516 as well as executable procedures 512 - 514 and 517 - 519 that are directly or indirectly called from the main module 501 and other library procedures.
- the main code module 501 may contain a compiled C++ “main” procedure and the library modules 510 and 515 may be dynamic link libraries having compiled C++ object code procedures.
- Header data 511 and 516 may include symbolic names used by operating system link procedures to dynamically link libraries 510 and 515 with the main module 501 . Header data may also indicate the location of each procedure within the library.
- a calling procedure may access library procedures 512 - 514 , 517 - 519 by jumping to a predetermined location in the header 511 or 516 and from there, accessing additional code and/or data resulting in a subsequent jump to the start of the procedure.
- Data and procedures within an application's code modules and libraries may be many hundreds or thousands of bytes long. Prior to executing an application, a client may need to retrieve a lengthy set of modules and libraries. By reducing the size of the module and library set, the initial delay experienced prior to application execution can be reduced.
- code within subsections of the application's code modules can be removed and replaced by shortened streaming “stub” procedures. The replacement of application code with streaming stub procedures may reduce module size and associated transmission delay. For example, referring to FIGS.
- the code library 510 may include a header 511 that is 4 kilobytes (Kbytes) in length and procedures 512 - 514 that are, respectively, 32 Kbytes, 16 Kbytes, and 8 Kbytes.
- procedures code 512 - 514 may be removed from the library 510 and stored in a streaming code module database 403 at the server 401 (FIG. 4).
- the removed procedure code 512 - 514 may be replaced by “stub” procedures 522 - 524 resulting in reduced-size code library 530 that can be linked with application modules 501 and 515 in place of library 510 .
- Header data 511 of library 530 can include updated jump or link information allowing stub procedures 522 - 524 to act as link-time substitutes for procedures 512 - 514 .
- a server 401 may provide a streaming-enabled version of application 500 to a client 410 by sending main module 501 , library module 515 , “streamed” library 530 , and, in some implementations, a streaming support file 535 to the client 410 in response to a request for the application 500 .
- the streaming support file 535 may include procedures accessed by the stubs 522 - 524 to facilitate code streaming between the server 401 and client 410 .
- modules 501 , 515 , 530 and 535 can be linked and execution of the resulting application can begin.
- code modules stored in the database 403 can be streamed from the server 401 to the client 410 .
- Data may be included in the stream 403 to identify stub procedures 522 - 524 associated with the streamed code modules.
- the streamed modules are received at the client, they are integrated with the executing application.
- streamed code modules are integrated with the executing application by appending received modules to their corresponding library or code file.
- modules 512 - 514 are streamed from the server to the client, they are appended to the library file 530 thereby forming an augmented library file 540 .
- header data 511 or stub data 522 - 524 is updated so that the now-appended modules are accessible from a calling procedure. For example, referring to FIG.
- an additional “jump” may be added between each stub procedure 522 - 524 and its associated appended module 512 - 514 .
- header data 511 may be updated so that procedures 512 - 514 are accessible in place of stubs 522 - 524 .
- stubs 522 - 524 are replaced by procedure modules 512 - 514 as the modules are received from the server 401 .
- Stub replacement may require altering or rearranging the location of the remaining stubs or procedures within a code module or library as replacement code is received. Implementations may employ still other methods of integrating streamed code with executing applications and modules.
- removed code such as procedure code 512 - 514 which, in the example given, was replaced by stubs 522 - 524
- stub code 522 - 524 may access streaming functions in the streaming support library 535 to obtain the required procedure.
- the streaming support library 535 may send control data 415 to the server 401 to request the needed procedure.
- the server 401 can halt the current module stream 405 and send the requested module.
- procedures in the streaming support library 535 may be used to integrate the received module with the application and to continue with the execution of the requested module.
- the server may thereafter determine a new module stream based on the requested module or other control data 415 that was received from the client.
- Code modules may be reduced in size without the use of stub procedures.
- procedure code 512 - 514 may be removed from a code library 510 and stored in a database 403 . Header information 511 as well as data indicating the size and location of removed procedure code 512 - 514 may then be transmitted to a client 410 .
- the client 410 may construct a new library 550 by appending a series of interrupt statements in place of the removed procedure code 512 - 514 .
- the code library 550 is substituted for the library 510 and execution of the program 500 may begin.
- the removed procedure code 512 - 514 can be streamed to the client 410 and stored in a local database 411 . If the application 500 attempts to execute procedure code 512 - 514 it may instead execute one of the interrupt statement that have replaced procedure code 512 - 514 . The execution of the interrupt statement halts the execution of the program 500 and transfers control to a streaming executor program 416 .
- Executor 416 implements interface technology similar to that of a conventional run-time object code debugger thereby allowing the executor 416 to intercept and process the interrupt generated by the application 500 .
- data provided to the executor 416 as part of the client execution platform (operating system) interrupt handling functionality can be used to identify the module 550 in which the interrupt was executed and the address of the interrupt code within the module.
- the executor 416 determines whether procedure code 512 - 514 associated with the interrupt location has been received as part of the module stream 405 sent to the client. If the appropriate procedure code has been received, the executor 515 replaces the identified interrupt with the its corresponding code.
- procedures 512 - 514 may be segmented into 4 Kilobyte code modules that are streamed to the client 410 .
- the executor 416 intercepts the interrupt, determines an appropriate 4 Kilobyte code block that includes the interrupt statement, and replaces the determined code block with a received code module. If the appropriate code module has not yet been received, an explicit request may be sent from the client 410 to the server 401 to retrieve the code module prior to its insertion in the library 550 . The executor 416 may thereafter cause the application 500 to resume at the address of the encountered interrupt.
- Implementations may also stream entire modules or libraries.
- main code module 501 may be received from the server 401 and begin execution at the client 410 while code libraries 510 and 515 are streamed from the server 401 to the client 410 .
- Integration of streamed modules with executing modules may be provided by client 410 dynamic module linking facilities.
- delay import loading provided by Microsoft Visual C++ 6.0 may be used to integrate streamed modules 510 and 515 with executing modules 501 .
- Dynamic linking of streamed modules may be facilitated by storing the streamed modules on a local hard disk drive or other storage location accessible by client 410 link loading facilities.
- streaming is facilitated by altering client 410 operating system link facilities such that the link facility can send control data 415 to the server 401 to request a particular module if the module is has not already been streamed to the client 401 .
- streaming support 535 may be pre-provisioned by installing support procedures at the client 410 prior to the client's request for the application 500 .
- the streaming control file may include predetermined list of module streaming sequences.
- the streaming control file 402 may include a module streaming sequence list associated with a first user and a second module streaming sequence list associated with a second user.
- Control data 415 sent from the client 410 to the server 401 may identify the current user at the client 410 .
- the server may stream software modules in accordance with the user's associated streaming sequence list.
- User-based streaming data may be advantageous where a user's past behavior can be used to anticipate the order of modules to be accessed by that user.
- the weight of edges connecting nodes may be determined statically or dynamically and may be determined based on a collection of historical usage data. For example, in a programmer-controlled implementation, a software programmer estimate the likelihood that particular transitions between nodes will occur based on the programmer's knowledge of the software code and the expected application usage patterns. Alternatively, application profiling programs may be used to gather run-time execution data recording transitions between various applets, Classes or code modules and thereby determine the likelihood that particular transitions will occur. In a client-feedback implementation, control data 415 sent from the client 410 to the server 401 during module execution is used to build a statistical database of module usage and, based on that database, determine the module streaming order.
- streaming control data 402 may be located at the client 410 and control data 415 sent from the client 410 to the server 401 may be used to sequentially request a stream of modules from the server.
- a background process may send control data 415 to a server to request additional modules that can be buffered on a hard disk 411 at the client computer 410 .
- a client-controlled streaming implementation may used existing HTTP servers and HTTP protocols to send request from the client 410 to the server 401 and send software modules from the server 401 to the client 410 .
- streaming of software modules has been emphasized in the foregoing description, non-executable data, such as hypertext markup language, binary graphic files, and text, may be streamed as a collection of modules.
- Implementations may include a “handshaking” procedure whereby, at the start of application execution, control data 415 is sent between the server 401 and the client 410 .
- the handshaking data may include an inventory of application modules residing at the client and at the server. Such handshaking data allows both the client 410 and server 401 to determine their respective software module inventory and to optimize the stream of software modules based on that inventory information.
- a server or client can store data about a series of transitions between modules and calculate a new module stream based on a history of transitions. For example, referring to FIG. 3, if the module “G” was reached by the path A-B-G, then a server or client may determine that module “E” followed by “H” is to be streamed. On the other hand, if the module “G” was reached by the path A-B-C-G then the streaming sequence may include only the module “H.”
- the invention may be implemented in computer hardware, firmware, software, digital electronic circuitry or in combinations of them.
- Apparatus of the invention may be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor; and method steps of the invention may be performed by a programmable processor executing a program of instructions to perform functions of the invention by operating on input data and generating output.
- the invention may advantageously be implemented in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device.
- Each computer program may be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language may be a compiled or interpreted language.
- Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory.
- Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM disks. Any of the foregoing may be supplemented by, or incorporated in, specially-designed ASICs (application-specific integrated circuits).
- semiconductor memory devices such as EPROM, EEPROM, and flash memory devices
- magnetic disks such as internal hard disks and removable disks
- magneto-optical disks magneto-optical disks
- CD-ROM disks CD-ROM disks
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Information Transfer Between Computers (AREA)
Abstract
A method for determining an order in which to stream modules of an application from a server to a client, where the application uses modules in an execution-time dependent order, employs a predictive model to determine which module transitions are most likely to occur in the future in view of the clients present state in the application and then stream the modules to the client in the determined order. Different sets of transition weights can be used for clients falling into different categories, such as time of application use and age of the user at the client. Additional factors which can be used to select the order to stream the modules include cache utilization at the client and customized streaming orders specified by the user.
Description
- This application claims the benefit under 35 U.S.C. §119 of U.S. Provisional Application Ser. No. 60/177,736 entitled “Method and Apparatus for Determining Order of Streaming Modules”, filed on Jan. 21, 2000, the entire contents of which is hereby expressly incorporated by reference. The application is also a continuation-in part of U.S. patent application Ser. No. 09/120,575 entitled “Streaming Modules” and filed on Jul. 22, 1998.
- The present invention is related to a method and system for streaming modules from a server to a client and, more particularly, to an improved method and system for predicting the order in which to stream the modules to the client.
- In a client-server environment, a client computers can communicate with a server to remotely access information stored at the server. The transfer of information between the server and client computer may be provided using standard protocols and software applications. For example, a hypertext markup language (HTML) browser application at a client computer can communicate over the public Internet using TCP/IP and hypertext transfer protocols (HTTP) to receive web pages from a HTTP server. Web pages may include formatted text as well as multimedia elements, such as embedded graphics and sounds. The multimedia elements may be downloaded by the client and presented to a user by a browser application or a “plug in” browser component. Example browser applications include Netscape Navigator 4.0® and Microsoft Internet Explorer 4.0™.
- Browser applications used at client computers can use plug-in software to receive audio and video information using a streaming data transmission protocol. A streaming protocol allows information to be presented by a client computer as it is being received. For example, full-motion video can be sent from a server to a client as a linear stream of frames. As each frame arrives at the client, it can be displayed to create a real-time full-motion video display. Audio and video streaming allows the client to present information without waiting for the entire stream to arrive at the client application. Audio and video streaming are provided by, for example, the RealAudio® and RealVideo™ applications from RealNetworks, Inc.
- Browser applications may also make use of executable software applets to enhance the appearance of HTML-based web pages. Applets are software programs that are sent from the server to the client in response to a request from the client. In a typical applet use, HTML-based web pages include HTTP commands that cause a browser application to request an applet from a server and to begin execution of the applet. The applet may thereafter interact with a user to gather and process data, may communicate data across a network, and may display results on a computer output device. Applets may be constructed from a programming language which executes in a run-time environment provided by the browser application at the client computer. For example, the Java® programming language from Sun Microsystems, Inc., allows Java applets to be stored at a web server and attached to web pages for execution by a Java interpreter. Java Applets, may be formed from multiple Java Classes. Java Classes include executable Java code that can be downloaded from a server in response to a dynamically generated request to execute the class (a module execution request). If a Java Class is not available to a Java interpreter when an executing applet attempts to access functionality provided by the Class, the Java interpreter may dynamically retrieve the Class from a server. Other programming languages, such as Microsoft Visual Basic® or Microsoft Visual C++®, may also be used to create applet-like software modules, such as Microsoft ActiveX™ controls.
- Downloadable applets can also be used to develop large and complex programs. For example, a complex financial program may be constructed from a collection of applets. In such a financial program, separate applets may be used to gather information from a user, compute payments, compute interest, and generate printed reports. As particular program functions are required by a user, the applets associated with the required functions can be retrieved from the server. However, as the size of a software application increases, delays associated with retrieving is modules over a network likewise increase and may be unacceptable to end-users. Consequently, an improvement in the transmission of software modules between computers is desirable.
- The invention includes methods and systems for streaming data modules between a first and a second computer. The modules may be streamed regardless of the existence of a “natural” order among the modules. For example, unlike streaming applications that rely on a natural linear ordering of data to determine the data stream contents, the disclosed streaming mechanism is not constrained to operate according to a linear data ordering. Instead, streamed data modules are selected using predetermined criteria that can be independent of the particular data content.
- In an exemplary application, the disclosed streaming mechanism can provide user-dependent streaming of software modules. For example, a home banking application may include
modules # 1 through #5. A first banking application user may, based on the user's input choices at a menu screen, access the modules in the order 1-3-4-5 while a second user may access the modules in the order 2-4-1. For such a banking application, the predetermined criteria used to determine a streaming sequence may detail each user's module usage pattern. Predetermined criteria associated with the application's users may indicate a preferred streaming sequence 1-3-4-5 when the first user is accessing the banking application but may indicate the preferred sequence 2-4-1 when the second user is accessing the application. The streamed sequence may therefore conform to a historical user-dependent access pattern. Other types of predetermined criteria may also be used. The disclosed streaming mechanism may also be use to stream non-executable data such as hypertext markup language data, binary graphics, and text. - In general, in one aspect, the invention features a computer-implemented method of transmitting modules from a first computer to a second computer. At the first computer, a module set is formed by selecting a sequence of modules from a collection of available modules. Each of the selected modules are associated with an application executing at the second computer. The selected modules may be transparently streamed from the first computer to the second computer. The selection of modules is made in accordance with predetermined selection criteria and is independent of the second computer's execution environment.
- Implementations of the invention may include one or more of the following features. A module may include non-executable data, such as hypertext markup language data, and/or program code. The selection criteria may be stored in a streaming control database. The streaming control database may include transition records associating weighted values with transitions between selected modules in the collection. Processing of transition record information, such as by using a path determination algorithm, may be used to determine the sequence of modules. The streaming control database may include list records each of which identifies a predetermined sequences of modules. Selection of modules may be made by selecting a list record. Selecting a sequence of modules may include sending data from the second computer to the first computer to identify each module in the sequence or to identify the status of the executing application. For example, data identifying the status may include a series of user input values.
- Implementations may also include one or more of the following features. Streaming of the module set may be interrupted, a second sequence determined, and streaming of the second sequence may occur. The streaming of the module set may be interrupted by a request for a particular module that is sent from the second computer to the first computer. For example, a Java Applet may interrupt a stream of Java Classes by attempting to access a Java Class that has not already been streamed to the second computer. A sequence of modules may be streamed and stored at the second computer independent of the executing application. That is, the executing application need not initiate streaming and need not be aware of the streaming process. Streamed modules may be subsequently integrated with the application at the second computer by interconnecting logic in a streamed module with logic in the application.
- Implementations may also include one or more of the following features. The application may include an interrupt statement. Execution of the interrupt statement may transfer control to an executor program. The executor program functions in the manner of a program code debugger by responding to the interrupt statement and preventing the permanent cessation (termination) of the executing application process. The executor program may thereafter integrate logic in a streamed module with the application's logic by replacing the interrupt statement (generally, as part of a block of replacement logic) with replacement logic from the streamed module. The application may thereafter continue executing, generally by executing replacement logic that has been substituted for the interrupt statement. The application may also include a stub procedure that can be replaced by logic in a streamed module. Replacement of the stub procedure may be direct, such as by removing the stub procedure code and replacing it with logic from a streamed module, or replacement may be operative, such as by creating a link to logic in a streamed module.
- In general, in another aspect, the invention features a computer program residing on a computer-readable medium. The computer program includes instructions for causing a computer to access a collection of modules associated with an application, to access a database storing module selection criteria, to form a module set by selecting a sequence of modules from the collection in accordance with the module selection criteria, and to transparently stream the module set to a second computer. Implementations of program may also include instructions for causing the computer to retrieve a first module from the collection and to send the first module to the second computer.
- In general, in another aspect, the invention features a computer program residing on a computer-readable medium. The program includes instructions for causing a computer to execute an application, to transparently receive a module associated with the executing application, to store the received module independent of the executing application, and to integrate the received module with the executing application.
- In general, in another aspect, the invention features a system for transferring information modules between computers. The system includes a first computer and a second computer. The first computer includes means for executing an application, means for receiving a sequence of modules associated with the application while the application is executing, and means for integrating a first module in the received sequence with the application. The second computer includes means for storing a collection of modules associated with the application, means for selecting a sequence of modules from the collection, and means for transferring the selected sequences from the first computer to the second computer.
- Implementations may include one or more of the following advantages. Delays experienced when downloading an applications, a code module, or a data modules can be can be reduced. Software and data modules can be predictively delivered to a client workstation according to a particular end user's requirements. The order in which modules are streamed from a server to a client can be dynamically determined. A collection of module delivery sequences can be associated with a particular application or user and the sequences can be dynamically updated. Module delivery sequences can be determined based on individual software usage patterns or stored statistic associated with module usage. Module streaming can be interrupted and altered during the execution of an application. Implementations may include additional or alternative advantages as will become clear from the description and claims that follow.
- Various techniques can be used to select the particular order in which the modules should be streamed to a given client. The selection criterion can be stored in a streaming control database, which database can include transition records associating weighted values with transitions between selected modules. Weight values can be determined by a historical count of the number of times that modules were requested by all users. Alternatively, weight values for different subgroups of users can be determined by a historical count of the number of times that modules were requested by each subgroup.
- Path determination algorithms can be used to predict a sequence of modules to stream using weight values. In certain instances, sets of modules will always be streamed if one module in the set is streamed. In these instances, all modules in the set are grouped together and sent to the client as a batch. Path determination algorithms can also factor in the size of the various modules and the size of the cache memory at a client computer to maximize use of the client's cache memory.
- In addition to the use of path determination algorithms to determine module sequences, a user can self-select a specific module sequence for a given function to have streamed each time the user accesses the function. The user can also self-select a sequence of functions such that the modules supporting the various functions will be streamed in an order of the function sequence. Particular modules can also always be streamed to the client computer regardless of historical usage or user selection. Further, certain modules can be “tagged” by application owners, and a record of the number of times a tagged module is requested at the client and possibly the time used at the client be created.
- The foregoing and other features of the present invention will be more readily apparent from the following detailed description and drawings of illustrative embodiments of the invention in which:
- FIG. 1 illustrates a computer network;
- FIG. 2 illustrates computer software application modules;
- FIG. 3 is a directed graph, according to the invention;
- FIG. 4 illustrates a server and a client, according to the invention;
- FIGS.5A-5E illustrate application code components, according to the invention;
- FIG. 6 shows sample edge weighting tables for the graph of FIG. 3;
- FIGS. 7 and 8 are edge graph illustrations of a module-grouping procedure;
- FIG. 9 is a sample table illustrating a user selected function and module streaming order; and
- FIG. 10 is a sample table illustrating usage summaries for designated modules.
- Referring to FIG. 1, a
wide area network 100 is shown. In thenetwork 100, aclient computer 101 can communicate with aserver computer 102 by sending data overlinks 103 and 104 to adata network 130. Thedata network 130 may include multiple nodes 131-134 that can route data between theclient 101 and theserver 102. Theclient computer 101 may transmit and receive data using the TCP/IP, HTTP, and other protocols. For example, theclient 101 may use the HTTP protocol to request web pages from theserver 102. - Web pages and multimedia data sent from the
server 102 to theclient 101 may have a natural linear sequence associated with them. The natural sequence of video data may be the linear order of video frames while the natural sequence of text may be the order in which pages of text are arranged in a document. Data having a natural linear sequence can be streamed from a server to a client to minimize download delays. In a streaming system, while earlier items in a linear sequence are being processed and/or displayed, subsequent items may be downloaded to the client computer. When processing and/or display of an item is complete, processing or display of a fully received “streamed” item may quickly begin. Since receipt of a streamed item is fully or partially complete when the item is requested, a user or client application requesting the streamed item will perceive a reduced downloading delay. For example, if the first page of a document is retrieved by a user, the second page can be downloaded while the first page is being read. If the user continues reading at the second page of the document, that page will then be available at the client, such as in a cache area on a hard disk drive, and can be read without additional downloading delay. - Software execution may not follow a predictable natural linear order. Software may include jump statements, break statements, procedure calls, and other programming constructs that cause abrupt transfers of execution among sections of executing code. The execution path that is traversed during the processing of interrelated code modules (such as code segments, code classes, applets, procedures, and code libraries), will often be non-linear, user dependent, may change with each execution of the application program, and may change depending on the state of various data items. Although a natural order may be lacking, an advantageous order may be determined in which to stream modules. The order may be determined using criteria that is independent of the computer's internal architecture or internal operating system (execution environment) considerations.
- Referring to FIG. 2, a
software application 200 may include multiple modules “A” through “H.” Modules “A” through “H” may be Java Classes, C++ procedure libraries, or other code modules that can be stored at a server. Some of the modules “A” through “H” may also be stored at the client computer, such as in a hard disk drive cache or as part of a software library stored at the client computer. When a client computer begins execution of theapplication 200, a first module, such as module “A,” may be downloaded from the server and its execution at theclient 410 may begin. As module “A” is being processed, the programming statements contained therein may branch to, for example, module “E.” If Module “E” is not already resident at the client, the execution of module “A” can be suspended, module “E” can be retrieved from the server, and then the execution of module “E” code may begin. In such a scenario, a user will experience a module download delay associated with retrieving module “E” from the server. - To minimize module download delays experienced by a user, module “E” may be transparently streamed from a server to the client computer. Transparent streaming allows future module use to be predicted and modules to be downloaded while other interrelated modules “A” are executing. Referring to FIG. 3, the execution order of application modules “A” through “H” may resemble a directed
graph 300 rather than a linear sequence of modules. For example, as illustrated by thegraph 300, after module “A” is executed, execution can continue at module “B”, “D,” or “E.” After module “B” is executed, execution can continue at module “C” or “G.” The execution path may subsequently flow to additional modules and may return to earlier executed modules. - Turning to FIG. 4, an
exemplary software architecture 400 providing transparent streaming is shown. Thesoftware architecture 400 includes astreaming server 401 having adatabase 403 of stored software modules. The streamingserver 401 can transparently transmit a stream ofsoftware modules 405 over a communications link to aclient computer 410. The communication link may be an analog modem connection, a digital subscriber line connection, a local area network connection, or any other type of data connection between theserver 401 andclient 410. - During streaming of the modules, a network connection is opened to transmit data between the streaming
server 401 and theclient computer 410 and is preferably held open rather then opened and closed each time a module is transmitted. Theclient computer 410 can have a caching mechanism for caching streamed modules separate from a browser's cache. Software at theclient computer 410 can monitor user activity at the client and transmit certain information back to thestreaming server 401. - As particular software modules are being executed at the
client 410, additional modules are sent from theserver 401 to theclient 410. In a dynamic streaming implementation, the order in which modules are streamed between the server and client may be altered based on theparticular client computer 410 being served, based on the user of the client computer, and based on other dynamically determined factors. - The
server 401 can usestreaming control information 402 to determine the order in which to stream modules from theserver 401 to theclient 410. Thestreaming control information 402 can include, for example, a predicted execution flow between software modules such as that represented by the directedgraph 300. As downloaded modules are executed by theclient 410, the client may sendcontrol data 415 to theserver 401 to dynamically update and alter the order in which modules are streamed from theserver 401 to theclient 410.Control data 415 may be used to request particular modules from theserver 401, to send data regarding the current execution state of the application program, to detail the current inventory of modules residing in the client'slocal storage 411, and to report user input selections, program execution statistics, and other data derived regarding theclient computer 410 and its executing software. - The sequence of modules sent in the
stream 405 from theserver 401 to theclient 410 can be determined using astreaming control file 402. Thestreaming control file 402 includes data used by the server to predict modules that will be needed at theclient 410. In a graph-based implementation, thecontrol file 402 may represent modules as nodes of a directed graph. Thecontrol file 402 may also represent possible execution transitions between the modules as vertices (“edges”) interconnecting the nodes. - Referring to in the weighted graph implementation, the
streaming control file 402 may include a list of vertices represent possible transitions between modules. For example, Table 1 list vertices representing all possible transitions between the modules “A” through “H” of graph 300 (FIG. 3). Each vertex in Table 1 includes a weight value indicating the relative likelihood that the particular transitions between modules will occur. In the example of Table 1, higher weight values indicate less likely transitions. - The
server 401 may apply a shortest-path graph traversal algorithm (also known as a “least cost” algorithm) to determine a desirable module streaming sequence based on the currently executing module. Example shortest-path algorithms may be found in Telecommunications Networks: Protocols, Modeling and Analysis, Mocha Schwartz, Addison Wesley, 1987, §6. For example, the following table 1 shows the minimum path weight between module “A” and the remaining modules:TABLE 1 Shortest Paths from Application Module “A”: Shortest Path From To Weight Path A B 1 A-B C 2 A-B-C D 7 A-D E 3 A-E F 9 A-D-F G 4 A-B-G H 5 A-E-H - Based on the weight values shown, the
server 401 may determine that, during the execution of module “A”, the module streaming sequence “B,” “C,” “E,” “G,” “H, ”D, “F” is advantageous. If a particular module in a determined sequence is already present at theclient 402, as may have been reported bycontrol data 415, theserver 401 may eliminate that module from the stream ofmodules 405. If, during the transmission of the sequence “B,” “C,” “E,” “G,” “H,” “D,” F, execution of module “A” completes and execution of another module begins, the server may interrupt the delivery of the sequence “B,” “C,” “E,” “G,” “H,” “D,”“F,” calculate a new sequence based on the now executing module, and resume streaming based on the newly calculated streaming sequence. For example, if execution transitions to module “B” from module “A,”control data 415 may be sent from theclient 410 to theserver 401 indicating that module “B” is the currently executing module. If module “B” is not already available at theclient 410, theserver 401 will complete delivery of module “B” to the client and determine a new module streaming sequence. - By applying a shortest-path routing algorithm to the edges of Table310 in FIG. 3 based on module “B” as the starting point, the minimum path weights between module “B” and other modules of the
graph 300 can be determined, as shown in Table 2, below:TABLE 2 Shortest Paths from Module B Shortest Path From To Weight Path B C 1 B-C E 5 B-C-E G 3 B-G H 7 B-C-E-H - Based on the shortest path weights shown in Table 2, the
server 401 may determine that module streaming sequence “C,” “G,” “E,” and “H” is advantageous. - Other algorithms may also be used to determine a module streaming sequence. For example, a
weighted graph 300 may be used wherein heavier weighted edges indicate a preferred path among modules represented in the graph. In Table 3, higher assigned weight values indicate preferred transitions between modules. For example, edges (A,B), (A,D), and (A,E) are three possible transitions from module A. Since edge (A,B) has a higher weight value then edges (A,D) and (A,E) it is favored and therefore, given module “A” as a starting point, streaming of module “B” before modules “D” or “E” may be preferred. Edge weight values can be, for example, a historical count of the number of times that a particular module was requested by a client, the relative transmission time of the code module, or a value empirically determined by a system administrator and stored in a table 402 at theserver 401. Other edge weight calculation methods may also be used.TABLE 3 Preferred Path Table Edge Weight (A, B) 100 (A, D) 15 (A, E) 35 (B, C) 100 (B, G) 35 (C, E) 50 (C, G) 20 (D, F) 50 (E, H) 50 (F, H) 100 (G, E) 35 (G, H) 25 - In an preferred-path (heavy weighted edge first) implementation, edges in the
graph 300 having higher weight values are favored. The following exemplary algorithm may be used to determine a module streaming sequence in a preferred-path implementation: - 1: Create two empty ordered sets:
- i) A candidate set storing pairs (S,W) wherein “S” is a node identifier and “W” is a weight of an edge that may be traversed to reach node “S.”
- ii) A stream set to store a determined stream of code modules.
- 2: Let Si be the starting node.
- 3: Append the node Si to the Stream Set and remove any pair (Si, W) from the candidate set.
- 4: For each node Sj that may be reached from node Si by an edge (Si, Sj) having weight Wj:
{ If Sj is not a member of the stream set then add the pair (Sj, Wj) to the candidate set. If Sj appears in more than one pair in the candidate set, remove all but the greatest-weight (Sj, W) pair from the candidate set. } - 5: If the Candidate set is not empty
- Select the greatest weight pair (Sk,Wk) from the candidate set.
- Let Si=Sk
- For example, as shown in Table 4, below, starting at node “A” and applying the foregoing algorithm the edges of Table 3 produces the stream set {A, B, C, E, H, G, D, F}:
TABLE 4 Calculation of Stream Set Iteration {Stream Set}/{Candidate Set} 1 {A}/{(B, 100) (D, 15) (E, 35)} 2 {A, B}/{(D, 15) (E, 35) (C, 100) (G, 35)} 3 {A, B, C}/{(D, 15) (E, 35) (G, 35)} 4 {A, B, C, E}/{(D, 15) (G, 35) (H, 50)} 5 {A, B, C, E, H}/{(D, 15) (G, 35)} 6 {A, B, C, E, H, G}/{(D, 15)} 7 {A, B, C, E, H, G, D}/{(F, 50)} 8 {A, B, C, E, H, G, D, F}/{} - Implementations may select alternative algorithms to calculate stream sets and the predictive streaming process can be dynamically updated should a user request a module that was not predicted and used to predict a new module sequence starting from the requested module.
- Rather than use one table based on the historical count for all users to determine the weight value for each particular transition, multiple tables can be created based upon historical usage of different subcategories of users. In the preferred embodiment, tables are created based upon user age and time of usage. Depending on the application the modules are associated with, in alternative embodiments other subcategories of users can be used, such as user income, sex, etc. Referring to FIG. 6, sample table600 shows a graph edge table for users under the age of 18, and table 610 shows a graph edge table for users during non-business hours after 6 PM. Tables 600 and 610 can be stored in the
streaming control file 402, along with any other graph edge tables generated based on different subcategories of users. Prior to execution of an application by a user at a client, the user can be queried to enter relevant user demographics in order to determine which graph edge table in the streaming control file to use to determine the order of the modules to stream. - According to a further aspect of the invention, the edge weight tables stored in the control file can be analyzed to identify sets of modules which, if one module in the set is streamed, then all modules in the set are streamed. In particular, weight edges in the weight edge table can be analyzed to identify sequences of modules with identical weight values. These modules can then be always streamed together as a batch rather than individually. In the graph edge implementation, this can be viewed as a merging of nodes which lie along a branchless path.
- Referring to FIG. 7, a graph edge table710 for
graph 700 is shown with weight values generated by a historical usage count. Weight edges in the weight edge table are analyzed to identify sequences of modules with identical weight values. The weight value from module A to B is 1, as is the weight value from module B to C. Since module B will never be streamed without being followed by module C, the nodes represented by modules B and C can be merged. Thus, rather than streaming modules B and C separately, if the path determination algorithm determines that module B should be streamed, then modules B and C are batched and sent together. Referring to FIG. 8, the resulting edge weight table 810 andgraph 800 is shown. - In addition to the weight edge values, path determination algorithms can utilize the size of the cache memory at the client and the sizes of the modules as factors in determining which modules to stream, with the goal of the analysis to maximize use of the client's cache memory and minimizing streaming time. The size of the client cache can be transmitted to the streaming server at the beginning of each client-server interaction, such as the initiation of a streaming session.
- For example, a path determination algorithm may determine that a first sequence of modules to stream, A-B-C-E-H, would occupy 80% of the client cache memory while a second sequence A-B-C-E-G, although less likely than path A-B-C-E-H, will occupy 95% of the cache memory if module G occupies 15% more of the cache memory more than module H. The sequence A-B-C-E-G can be streamed to the client to maximize the amount of cache memory occupied. Should the user later request module G after module E, the larger module G, which requires more time to stream than module H, is already present on the client. Should the user instead request module H after module E, the smaller size of module H will allow for faster on-demand streaming, and thus reduce the penalty of an incorrect streaming prediction.
- In addition to using predictive algorithms based on historical usage patterns, the sequence of streamed modules can also be user defined at an individual level. Referring to FIG. 9, a table900 uniquely associated with a particular user can be generated based on user selections which are used to identify the sequence of modules for each function in an application to be streamed based on a user's selections. In the preferred embodiment, table 900 is stored at the client and uploaded to the application server when the user accesses the server. In an alternative embodiment, table 900 can be stored in on the server, e.g., as a list record in the streaming control file
- The user-selected streaming order can be generated during an interactive dialog between the client and server. For example, in one embodiment, a user at the client is given the option to enter a “Select Streaming Order” mode during which the user is instructed to perform a particular sequence of selections for a function that the user considers typical of the way in which the user anticipates behaving each time the user performs that particular function. A particular sequence of selections can be made for the modules associated with each function in the streaming application. The user selections can be used as default streaming settings each time the user logs on and attempts to perform a particular function. For users who may use functions in a streaming application in an a-typical manner, and thus in a way which is difficult to predict, these selections allow for faster streaming application of the application.
- Even if a user has selected a preferred streaming order, if the user deviates from the default selected streaming order, the server can utilize other methods to determine a subsequent streaming order, such as prediction algorithms based on historical usage patterns. Predictive algorithms, such as historical usage patterns, can also be used to select streaming orders for functions that do not have a personalized streaming order associated with them for the respective user.
- In addition to selecting the sequence of modules for each function, or alternatively, the user can select the order of the functions to be streamed. Referring to FIG. 9, the user has selected that the application functions be streamed in the
order Function 2, in an order specified by the user, e.g., in Table 900, (modules A, G, C, and B), or, if no custom order is specified, in a ordering in accordance with the predictive algorithms. Should the user deviate from the default function order, for example, by selectingfunction 3 afterfunction 2, the server can reset the streaming sequence and being streaming the module forfunction 3 in a sequence defined by the user (here sequence D, E, B, and M) or otherwise selected as appropriate. - According to a further aspect of the invention, particular modules can always be streamed from the server to the client regardless of historical usage or user selection. Such modules are typically associated with functions which are required for the application or for certain functionality of the application. For example, if a user password is required to access
function 3 shown in FIG. 9, a security module S that interacts with the user to obtain the user password will always be streamed prior to modules D, E, B, and M regardless of whether the user selects module S during the Select Streaming Order mode. In another example, when the modules being streamed are particular HTML pages, an informational title page containing information about ownership rights to the page contents can always be streamed to the client prior to the streaming of any other pages. - Depending on the particular user and modules being streamed, a combination of the methods herein disclosed for determining the order of modules to stream may be utilized. For example, path determination prediction algorithms may be utilized for functions that users have not self-selected a streaming order As another example, mandatory streaming of certain modules may be combined with user self-selected streaming orders. Similarly, various methods can be balanced against each other to determine which is the most appropriate in a given situation. For example, the use of cache memory utilization and module size as streaming order determining factors can be balanced with the probabilities that the various paths will be traversed by the user. Even if a given sequence of modules provides full cache utilization at the client, if the streamed modules are highly unlikely to be used, cache utilization would not be an appropriate factor to wholly base streaming decisions. In contrast, if a high cache utilization sequence is only slightly less likely than an alternative sequence and the modules not in the cache-based sequence can be streamed quickly, then the cache utilization sequence could provide superior overall performance.
- A multitude of combinations are possible, offering versatile functionality at both the client and server. The various prediction methods and factors can be used and combined using differing weights as appropriate. The weights to assign to each of the factors and predictive methods can vary and preferably can be dynamically adjusted in response to operating conditions and measures of prediction success rates to improve the overall streaming performance.
- According to yet a further aspect of the invention, streaming server software can record time and usage of specially tagged modules streamed to the clients by gathering data received from the client computers regarding use of the tagged modules, such as the number of times they are streamed to clients and, with the use of appropriate client-side software, the amount of time the tagged modules are actually used by the client. Such information can be used to determine the popularity of various modules to increase the accuracy of the predictive streaming process. The information can also be valuable to application owners in determining which functions are most useful to the users and which functions might be omitted in future version without substantial concern. In addition, in the preferred embodiment, the information gathered can be used on a per-client basis to bill users based in accordance with the specific modules used and the amount of time each module is used.
- For example, a word processing program, such as Microsoft Word, is comprised of many different modules. The module corresponding to the spell check function could be tagged as “Spell Check”. When the tagged module is streamed to a client or specifically requested, a request total can be incremented. In addition, client-side software can be configured to recognize the tags and both record its receipt as well as determining the length of time each particular tagged module is used. This information can subsequently be communicated to the streaming sever. FIG. 10, for example, shows a table1000 which summarizes data gathered for various users over a given period for example several tagged modules in a word processing application. For each tag, the number of times the module was streamed to and requested at the client, and the length of time the module was used is recorded.
- In the discussion above, streaming of applications was discussed with respect to streaming a sequence of separate application modules. Application streaming can also be used to stream subsections of an application or module. For example, subsections of compiled applications, such as applications written in C, C++, Fortran, Pascal, or Assembly language may be streamed from a
server 401 to aclient 410. Referring to FIG. 5A, anapplication 500 may include multiple code modules such as amain code module 501 andcode libraries main module 501 contains program code that is executed when the application is started. Thecode libraries header data main module 501 and other library procedures. - In a Microsoft Windows 95/Microsoft Visual C++ implementation, the
main code module 501 may contain a compiled C++ “main” procedure and thelibrary modules Header data libraries main module 501. Header data may also indicate the location of each procedure within the library. In a jump table implementation, a calling procedure may access library procedures 512-514, 517-519 by jumping to a predetermined location in theheader - Data and procedures within an application's code modules and libraries may be many hundreds or thousands of bytes long. Prior to executing an application, a client may need to retrieve a lengthy set of modules and libraries. By reducing the size of the module and library set, the initial delay experienced prior to application execution can be reduced. In a streaming implementation of
application 500, code within subsections of the application's code modules can be removed and replaced by shortened streaming “stub” procedures. The replacement of application code with streaming stub procedures may reduce module size and associated transmission delay. For example, referring to FIGS. 5A and 5B, thecode library 510 may include aheader 511 that is 4 kilobytes (Kbytes) in length and procedures 512-514 that are, respectively, 32 Kbytes, 16 Kbytes, and 8 Kbytes. Referring to FIGS. 5B and 5C, to reduce the size of thelibrary 510, procedures code 512-514 may be removed from thelibrary 510 and stored in a streamingcode module database 403 at the server 401 (FIG. 4). The removed procedure code 512-514 may be replaced by “stub” procedures 522-524 resulting in reduced-size code library 530 that can be linked withapplication modules library 510.Header data 511 oflibrary 530 can include updated jump or link information allowing stub procedures 522-524 to act as link-time substitutes for procedures 512-514. - A
server 401 may provide a streaming-enabled version ofapplication 500 to aclient 410 by sendingmain module 501,library module 515, “streamed”library 530, and, in some implementations, astreaming support file 535 to theclient 410 in response to a request for theapplication 500. Thestreaming support file 535 may include procedures accessed by the stubs 522-524 to facilitate code streaming between theserver 401 andclient 410. At theclient 410,modules main module 501 and various called procedures are executed at theclient 410, code modules stored in thedatabase 403 can be streamed from theserver 401 to theclient 410. Data may be included in thestream 403 to identify stub procedures 522-524 associated with the streamed code modules. As the streamed modules are received at the client, they are integrated with the executing application. - In an appended module implementation, streamed code modules are integrated with the executing application by appending received modules to their corresponding library or code file. For example, referring to FIGS. 5C and 5D, as modules512-514 are streamed from the server to the client, they are appended to the
library file 530 thereby forming anaugmented library file 540. As the modules 512-514 are streamed from theserver 401 and appended to thefile 530,header data 511 or stub data 522-524 is updated so that the now-appended modules are accessible from a calling procedure. For example, referring to FIG. 5D, an additional “jump” may be added between each stub procedure 522-524 and its associated appended module 512-514. Alternatively,header data 511 may be updated so that procedures 512-514 are accessible in place of stubs 522-524. In a stub-replacement implementation, stubs 522-524 are replaced by procedure modules 512-514 as the modules are received from theserver 401. Stub replacement may require altering or rearranging the location of the remaining stubs or procedures within a code module or library as replacement code is received. Implementations may employ still other methods of integrating streamed code with executing applications and modules. - In some scenarios, removed code, such as procedure code512-514 which, in the example given, was replaced by stubs 522-524, may be required (called by another procedure) before it is streamed from the
server 401 and integrated with themodule 530. In such a case, stub code 522-524 may access streaming functions in thestreaming support library 535 to obtain the required procedure. To do so, thestreaming support library 535 may sendcontrol data 415 to theserver 401 to request the needed procedure. In response, theserver 401 can halt thecurrent module stream 405 and send the requested module. Upon receipt of the requested module, procedures in thestreaming support library 535 may be used to integrate the received module with the application and to continue with the execution of the requested module. The server may thereafter determine a new module stream based on the requested module orother control data 415 that was received from the client. - Code modules may be reduced in size without the use of stub procedures. For example, referring again to FIGS. 4, 5A,5B, and 5E, in a interrupt driven implementation, procedure code 512-514 may be removed from a
code library 510 and stored in adatabase 403.Header information 511 as well as data indicating the size and location of removed procedure code 512-514 may then be transmitted to aclient 410. Theclient 410 may construct anew library 550 by appending a series of interrupt statements in place of the removed procedure code 512-514. When theapplication 500 is executed, thecode library 550 is substituted for thelibrary 510 and execution of theprogram 500 may begin. As theprogram 500 executes, the removed procedure code 512-514 can be streamed to theclient 410 and stored in alocal database 411. If theapplication 500 attempts to execute procedure code 512-514 it may instead execute one of the interrupt statement that have replaced procedure code 512-514. The execution of the interrupt statement halts the execution of theprogram 500 and transfers control to astreaming executor program 416. -
Executor 416 implements interface technology similar to that of a conventional run-time object code debugger thereby allowing theexecutor 416 to intercept and process the interrupt generated by theapplication 500. When the interrupt is intercepted by theexecutor 416, data provided to theexecutor 416 as part of the client execution platform (operating system) interrupt handling functionality can be used to identify themodule 550 in which the interrupt was executed and the address of the interrupt code within the module. Theexecutor 416 then determines whether procedure code 512-514 associated with the interrupt location has been received as part of themodule stream 405 sent to the client. If the appropriate procedure code has been received, theexecutor 515 replaces the identified interrupt with the its corresponding code. For example, procedures 512-514 may be segmented into 4 Kilobyte code modules that are streamed to theclient 410. When an interrupt statement is executed by theapplication 500, theexecutor 416 intercepts the interrupt, determines an appropriate 4 Kilobyte code block that includes the interrupt statement, and replaces the determined code block with a received code module. If the appropriate code module has not yet been received, an explicit request may be sent from theclient 410 to theserver 401 to retrieve the code module prior to its insertion in thelibrary 550. Theexecutor 416 may thereafter cause theapplication 500 to resume at the address of the encountered interrupt. - Implementations may also stream entire modules or libraries. For example,
main code module 501 may be received from theserver 401 and begin execution at theclient 410 whilecode libraries server 401 to theclient 410. Integration of streamed modules with executing modules may be provided byclient 410 dynamic module linking facilities. For example, delay import loading provided by Microsoft Visual C++ 6.0 may be used to integrate streamedmodules modules 501. Dynamic linking of streamed modules may be facilitated by storing the streamed modules on a local hard disk drive or other storage location accessible byclient 410 link loading facilities. In an exemplary implementation, streaming is facilitated by alteringclient 410 operating system link facilities such that the link facility can sendcontrol data 415 to theserver 401 to request a particular module if the module is has not already been streamed to theclient 401. - In a protected-memory computer system, direct manipulation of executing application code and data may be restricted. In such systems, a “kernel” level processes or procedure may be required to support integration of streamed modules with executing application. In such a case, streaming
support 535 may be pre-provisioned by installing support procedures at theclient 410 prior to the client's request for theapplication 500. - Other methods of determining stream sets may be used. In a list-based implementation, the streaming control file may include predetermined list of module streaming sequences. For example, the
streaming control file 402 may include a module streaming sequence list associated with a first user and a second module streaming sequence list associated with a second user.Control data 415 sent from theclient 410 to theserver 401 may identify the current user at theclient 410. Once the user has been identified to the server, the server may stream software modules in accordance with the user's associated streaming sequence list. User-based streaming data may be advantageous where a user's past behavior can be used to anticipate the order of modules to be accessed by that user. - In graph-based streaming control file implementations, the weight of edges connecting nodes may be determined statically or dynamically and may be determined based on a collection of historical usage data. For example, in a programmer-controlled implementation, a software programmer estimate the likelihood that particular transitions between nodes will occur based on the programmer's knowledge of the software code and the expected application usage patterns. Alternatively, application profiling programs may be used to gather run-time execution data recording transitions between various applets, Classes or code modules and thereby determine the likelihood that particular transitions will occur. In a client-feedback implementation,
control data 415 sent from theclient 410 to theserver 401 during module execution is used to build a statistical database of module usage and, based on that database, determine the module streaming order. - In a client-controlled streaming implementation, streaming
control data 402 may be located at theclient 410 andcontrol data 415 sent from theclient 410 to theserver 401 may be used to sequentially request a stream of modules from the server. For example, while theclient computer 410 is executing a first module, a background process may sendcontrol data 415 to a server to request additional modules that can be buffered on ahard disk 411 at theclient computer 410. A client-controlled streaming implementation may used existing HTTP servers and HTTP protocols to send request from theclient 410 to theserver 401 and send software modules from theserver 401 to theclient 410. Furthermore, although streaming of software modules has been emphasized in the foregoing description, non-executable data, such as hypertext markup language, binary graphic files, and text, may be streamed as a collection of modules. - Implementations may include a “handshaking” procedure whereby, at the start of application execution,
control data 415 is sent between theserver 401 and theclient 410. The handshaking data may include an inventory of application modules residing at the client and at the server. Such handshaking data allows both theclient 410 andserver 401 to determine their respective software module inventory and to optimize the stream of software modules based on that inventory information. - In a history-dependent implementation, a server or client can store data about a series of transitions between modules and calculate a new module stream based on a history of transitions. For example, referring to FIG. 3, if the module “G” was reached by the path A-B-G, then a server or client may determine that module “E” followed by “H” is to be streamed. On the other hand, if the module “G” was reached by the path A-B-C-G then the streaming sequence may include only the module “H.”
- The invention may be implemented in computer hardware, firmware, software, digital electronic circuitry or in combinations of them. Apparatus of the invention may be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor; and method steps of the invention may be performed by a programmable processor executing a program of instructions to perform functions of the invention by operating on input data and generating output.
- The invention may advantageously be implemented in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program may be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language may be a compiled or interpreted language. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory.
- Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM disks. Any of the foregoing may be supplemented by, or incorporated in, specially-designed ASICs (application-specific integrated circuits).
- While the present invention has been described with reference to the preferred embodiment therein, variations in form and implementation can be made without departing from the spirit and scope of the invention.
Claims (20)
1. A method for determining an order in which to stream modules of an application from a server to a client configured to execute the application concurrently with module streaming, the application utilizing the modules in an execution-time dependent order, the method comprising the steps of:
identifying potential execution transitions between modules;
associating at least one weighted value with each transition indicating a likelihood relative to other transitions that the particular transitions between modules will occur;
upon notice that the client is executing a particular module, determining a subsequent order of utilization of the modules by the application at the client with reference to the weighted values associated with identified transitions from the particular module; and
indicating that modules should be streamed to the client in the determined order.
2. The method of , wherein:
claim 1
a plurality of weighted values are associated with each transition, each weight being further associated with a respective category; and
the weighted values used during the determining step are selected in accordance with a specified category.
3. The method of , wherein the respective categories comprise user age and time of usage.
claim 2
4. The method of , further comprising the steps of:
claim 1
identifying a sequence of module transitions having the same weighted transition values; and
grouping the modules in the identified sequence of module transitions into a batch;
wherein, when the determined order includes a particular module in the batch should be streamed, the step of indicating comprises indicating that all module in the batch should be streamed to the client.
5. The method of , wherein the determining step comprises determining the subsequent order of utilization of the modules with further reference to a projected client cache utilization and a cost to stream particular modules.
claim 1
6. The method of , wherein the cost comprises a module size.
claim 5
7. A method for determining an order in which to stream modules of an application from a server to a client executing the application concurrently with module streaming, the application utilizing the modules in an execution-time dependent order and comprising a plurality of functions, each function having at least one associated module, the method comprising the steps of:
receiving from a user a customized streaming order for modules associated with a specific function;
receiving notice that the user is executing a particular function;
if the particular function has an associated customized streaming order for the user, indicating that modules associated with the particular function should be streamed to the client in the selected streaming order;
otherwise, determining an alternative order of utilization of modules in the particular function; and
indicating that modules should be streamed to the client in the determined order.
8. The method of , wherein the step of determining comprises predicting an order of usage of the modules in the particular function.
claim 7
9. The method of , wherein the step of predicting an order is performed with use of a set of predefined weighted transition values between modules in the function.
claim 8
10. The method of , wherein the step of determining comprises selecting a set of modules to maximize cache utilization at the client.
claim 7
11. The method of , further comprising the steps of:
claim 7
receiving from a user a customized function streaming sequence; and
indicating that modules should be streamed to the client in accordance with the customized function streaming sequence.
12. A system for streaming modules of an application from a server to a client executing the application concurrently with module streaming, the application utilizing the modules in an execution-time dependent order, the system comprising:
a streaming sever connectable to a client via a network;
a streaming code module database having the application module stored therein;
a streaming control file database having a predictive data stored therein, the predictive data comprising potential execution transitions between modules and at least one weighted value with each transition indicating a likelihood relative to other transitions that the particular transitions between modules will occur;
the streaming server being configured to:
receive an indication from the client that the application is in a given state;
determine an order of module utilization by the application at the client with reference to weighted values associated with model transitions for the application when in the given state; and
stream modules the client in the determined order.
13. The system of , wherein:
claim 12
a plurality of weighted values are associated with each transition, each weight being further associated with a respective category;
the streaming server being further configured to select weighted values for use during order determination in accordance with a specified category for the client.
14. The system of , wherein the respective categories comprise user age and time of usage.
claim 13
15. The system of , wherein the streaming server is further configured to:
claim 12
identify a sequence of module transitions having the same weighted transition values;
group the modules in the identified sequence of module transitions into a batch; and
stream the grouped modules to the client in a batch.
16. The system of , wherein the streaming server is further configured to:
claim 12
project client cache utilization in response to client receipt of particular sets of modules; and
determine an order of module utilization by the application at the client with further reference to the client cache utilization projections.
17. The system of , wherein the streaming server is further configured to:
claim 12
receive from a user a customized streaming order specifying at least one of a sequence of functions and a sequence of modules for a specific function and; and
determine an order of module utilization by the application at the client with further reference to the customized streaming order.
18. A computer program residing on a computer readable medium for configuring a computer to determine an order in which to stream modules of an application from the computer to a client executing the application concurrently with module streaming, the application utilizing the modules in an execution-time dependent order, the computer program comprising computer code to configure the computer to:
upon notice that the client is executing a particular module, determine a subsequent order of utilization of the modules by the application at the client with reference to predefined weighted transition values for potential execution transitions between modules by the application, the transition values indicating a likelihood relative to other transitions that the particular transition between modules will occur; and
indicating that modules should be streamed to the client in the determined order.
19. The computer program product of , wherein a plurality of weighted values are associated with each transition, each weight being further associated with a respective category, the computer program further comprising code to configure the computer to selected weighted values to use in accordance with a specified category.
claim 18
20. The computer program product of , the computer program further comprising code to:
claim 18
project client cache utilization in response to receipt by the client of a specific set of modules; and
determine a subsequent order of utilization of the modules by the application at the client with further reference to the project client cache utilization.
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/745,646 US20010044850A1 (en) | 1998-07-22 | 2000-12-22 | Method and apparatus for determining the order of streaming modules |
AU2001229575A AU2001229575A1 (en) | 2000-01-21 | 2001-01-17 | Method and apparatus for determining the order of streaming modules |
PCT/US2001/001596 WO2001053940A2 (en) | 2000-01-21 | 2001-01-17 | Method and apparatus for determining the order of streaming modules |
US10/354,947 US7606924B2 (en) | 1998-07-22 | 2003-01-30 | Method and apparatus for determining the order of streaming modules |
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/120,575 US6311221B1 (en) | 1998-07-22 | 1998-07-22 | Streaming modules |
US17773600P | 2000-01-21 | 2000-01-21 | |
US09/745,646 US20010044850A1 (en) | 1998-07-22 | 2000-12-22 | Method and apparatus for determining the order of streaming modules |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/120,575 Continuation-In-Part US6311221B1 (en) | 1998-07-22 | 1998-07-22 | Streaming modules |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/354,947 Continuation US7606924B2 (en) | 1998-07-22 | 2003-01-30 | Method and apparatus for determining the order of streaming modules |
Publications (1)
Publication Number | Publication Date |
---|---|
US20010044850A1 true US20010044850A1 (en) | 2001-11-22 |
Family
ID=26873592
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/745,646 Abandoned US20010044850A1 (en) | 1998-07-22 | 2000-12-22 | Method and apparatus for determining the order of streaming modules |
US10/354,947 Expired - Fee Related US7606924B2 (en) | 1998-07-22 | 2003-01-30 | Method and apparatus for determining the order of streaming modules |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/354,947 Expired - Fee Related US7606924B2 (en) | 1998-07-22 | 2003-01-30 | Method and apparatus for determining the order of streaming modules |
Country Status (3)
Country | Link |
---|---|
US (2) | US20010044850A1 (en) |
AU (1) | AU2001229575A1 (en) |
WO (1) | WO2001053940A2 (en) |
Cited By (85)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020042833A1 (en) * | 1998-07-22 | 2002-04-11 | Danny Hendler | Streaming of archive files |
US20020091763A1 (en) * | 2000-11-06 | 2002-07-11 | Shah Lacky Vasant | Client-side performance optimization system for streamed applications |
US20030009488A1 (en) * | 2001-05-22 | 2003-01-09 | Reuters America, Inc | System and method of accelerating delivery of dynamic web pages over a network |
US20030009538A1 (en) * | 2000-11-06 | 2003-01-09 | Shah Lacky Vasant | Network caching system for streamed applications |
US20030056112A1 (en) * | 1997-06-16 | 2003-03-20 | Jeffrey Vinson | Method and apparatus to allow remotely located computer programs and/or data to be accessed on a local computer in a secure, time-limited manner, with persistent caching |
US20030221112A1 (en) * | 2001-12-12 | 2003-11-27 | Ellis Richard Donald | Method and system for granting access to system and content |
EP1483663A1 (en) * | 2001-12-12 | 2004-12-08 | Valve Corporation | Method and system for preloading resources |
US20050094791A1 (en) * | 2003-10-31 | 2005-05-05 | Clark Edward A. | Data stream association with call through employment of identifier within message associated with the call |
US6918113B2 (en) | 2000-11-06 | 2005-07-12 | Endeavors Technology, Inc. | Client installation and execution system for streamed applications |
US6983315B1 (en) | 2000-01-18 | 2006-01-03 | Wrq, Inc. | Applet embedded cross-platform caching |
US20060047946A1 (en) * | 2004-07-09 | 2006-03-02 | Keith Robert O Jr | Distributed operating system management |
US20060070029A1 (en) * | 2004-09-30 | 2006-03-30 | Citrix Systems, Inc. | Method and apparatus for providing file-type associations to multiple applications |
US20060074989A1 (en) * | 2004-09-30 | 2006-04-06 | Laborczfalvi Lee G | Method and apparatus for virtualizing object names |
US20060075381A1 (en) * | 2004-09-30 | 2006-04-06 | Citrix Systems, Inc. | Method and apparatus for isolating execution of software applications |
US20060106770A1 (en) * | 2004-10-22 | 2006-05-18 | Vries Jeffrey D | System and method for predictive streaming |
US7051315B2 (en) | 2000-09-26 | 2006-05-23 | Appstream, Inc. | Network streaming of multi-application program code |
US7062567B2 (en) | 2000-11-06 | 2006-06-13 | Endeavors Technology, Inc. | Intelligent network streaming and execution system for conventionally coded applications |
US20060136389A1 (en) * | 2004-12-22 | 2006-06-22 | Cover Clay H | System and method for invocation of streaming application |
US20060224545A1 (en) * | 2005-03-04 | 2006-10-05 | Keith Robert O Jr | Computer hardware and software diagnostic and report system |
US20060224544A1 (en) * | 2005-03-04 | 2006-10-05 | Keith Robert O Jr | Pre-install compliance system |
US7197570B2 (en) | 1998-07-22 | 2007-03-27 | Appstream Inc. | System and method to send predicted application streamlets to a client device |
US20070083620A1 (en) * | 2005-10-07 | 2007-04-12 | Pedersen Bradley J | Methods for selecting between a predetermined number of execution methods for an application program |
WO2007066993A1 (en) * | 2005-12-08 | 2007-06-14 | Electronics And Telecommunications Research Institute | Method and apparatus for providing software by functional units in a software streaming system |
US20070254742A1 (en) * | 2005-06-06 | 2007-11-01 | Digital Interactive Streams, Inc. | Gaming on demand system and methodology |
US20070274315A1 (en) * | 2006-05-24 | 2007-11-29 | Keith Robert O | System for and method of securing a network utilizing credentials |
US20080256178A1 (en) * | 2005-12-08 | 2008-10-16 | Electronics And Telecommunications Research Instit | Method and Apparatus for Providing Software by Functional Units in a Software Streaming System |
US20090119644A1 (en) * | 2007-11-07 | 2009-05-07 | Endeavors Technologies, Inc. | Deriving component statistics for a stream enabled application |
US7673227B2 (en) | 2000-06-21 | 2010-03-02 | Microsoft Corporation | User interface for integrated spreadsheets and word processing tables |
US7673228B2 (en) | 2005-03-30 | 2010-03-02 | Microsoft Corporation | Data-driven actions for network forms |
US7676843B1 (en) | 2004-05-27 | 2010-03-09 | Microsoft Corporation | Executing applications at appropriate trust levels |
US7689929B2 (en) | 2000-06-21 | 2010-03-30 | Microsoft Corporation | Methods and systems of providing information to computer users |
US7692636B2 (en) | 2004-09-30 | 2010-04-06 | Microsoft Corporation | Systems and methods for handwriting to a screen |
US7712022B2 (en) | 2004-11-15 | 2010-05-04 | Microsoft Corporation | Mutually exclusive options in electronic forms |
US7721190B2 (en) | 2004-11-16 | 2010-05-18 | Microsoft Corporation | Methods and systems for server side form processing |
US7725834B2 (en) | 2005-03-04 | 2010-05-25 | Microsoft Corporation | Designer-created aspect for an electronic form template |
US7735057B2 (en) | 2003-05-16 | 2010-06-08 | Symantec Corporation | Method and apparatus for packaging and streaming installation software |
US7743063B2 (en) * | 2000-06-21 | 2010-06-22 | Microsoft Corporation | Methods and systems for delivering software via a network |
US7779034B2 (en) | 2005-10-07 | 2010-08-17 | Citrix Systems, Inc. | Method and system for accessing a remote file in a directory structure associated with an application program executing locally |
US7818677B2 (en) | 2000-06-21 | 2010-10-19 | Microsoft Corporation | Single window navigation methods and systems |
US20100268842A1 (en) * | 2007-12-18 | 2010-10-21 | Electronics And Telecommunications Research Institute | System and method for providing streaming-based portable application |
US7865477B2 (en) | 2003-03-28 | 2011-01-04 | Microsoft Corporation | System and method for real-time validation of structured data files |
US7900134B2 (en) | 2000-06-21 | 2011-03-01 | Microsoft Corporation | Authoring arbitrary XML documents using DHTML and XSLT |
US7908339B2 (en) | 2004-06-03 | 2011-03-15 | Maxsp Corporation | Transaction based virtual file system optimized for high-latency network connections |
US7913159B2 (en) | 2003-03-28 | 2011-03-22 | Microsoft Corporation | System and method for real-time validation of structured data files |
US7925621B2 (en) | 2003-03-24 | 2011-04-12 | Microsoft Corporation | Installing a solution |
US7937651B2 (en) | 2005-01-14 | 2011-05-03 | Microsoft Corporation | Structural editing operations for network forms |
US7971139B2 (en) | 2003-08-06 | 2011-06-28 | Microsoft Corporation | Correlation, association, or correspondence of electronic forms |
US7979856B2 (en) | 2000-06-21 | 2011-07-12 | Microsoft Corporation | Network-based software extensions |
US8001459B2 (en) | 2005-12-05 | 2011-08-16 | Microsoft Corporation | Enabling electronic documents for limited-capability computing devices |
US8010515B2 (en) | 2005-04-15 | 2011-08-30 | Microsoft Corporation | Query to an electronic form |
US8024523B2 (en) | 2007-11-07 | 2011-09-20 | Endeavors Technologies, Inc. | Opportunistic block transmission with time constraints |
US8090797B2 (en) | 2009-05-02 | 2012-01-03 | Citrix Systems, Inc. | Methods and systems for launching applications into existing isolation environments |
US8095940B2 (en) | 2005-09-19 | 2012-01-10 | Citrix Systems, Inc. | Method and system for locating and accessing resources |
US8095679B1 (en) * | 2008-03-19 | 2012-01-10 | Symantec Corporation | Predictive transmission of content for application streaming and network file systems |
US8117559B2 (en) | 2004-09-30 | 2012-02-14 | Citrix Systems, Inc. | Method and apparatus for virtualizing window information |
US8117552B2 (en) | 2003-03-24 | 2012-02-14 | Microsoft Corporation | Incrementally designing electronic forms and hierarchical schemas |
US8131825B2 (en) | 2005-10-07 | 2012-03-06 | Citrix Systems, Inc. | Method and a system for responding locally to requests for file metadata associated with files stored remotely |
US8171483B2 (en) | 2007-10-20 | 2012-05-01 | Citrix Systems, Inc. | Method and system for communicating between isolation environments |
US8171479B2 (en) | 2004-09-30 | 2012-05-01 | Citrix Systems, Inc. | Method and apparatus for providing an aggregate view of enumerated system resources from various isolation layers |
US8200975B2 (en) | 2005-06-29 | 2012-06-12 | Microsoft Corporation | Digital signatures for network forms |
US8234238B2 (en) | 2005-03-04 | 2012-07-31 | Maxsp Corporation | Computer hardware and software diagnostic and report system |
US8261345B2 (en) | 2006-10-23 | 2012-09-04 | Endeavors Technologies, Inc. | Rule-based application access management |
US8359591B2 (en) | 2004-11-13 | 2013-01-22 | Streamtheory, Inc. | Streaming from a media device |
US8422833B2 (en) | 2007-10-26 | 2013-04-16 | Maxsp Corporation | Method of and system for enhanced data storage |
US8487879B2 (en) | 2004-10-29 | 2013-07-16 | Microsoft Corporation | Systems and methods for interacting with a computer through handwriting to a screen |
US8589323B2 (en) | 2005-03-04 | 2013-11-19 | Maxsp Corporation | Computer hardware and software diagnostic and report system incorporating an expert system and agents |
US20140115096A1 (en) * | 2012-10-23 | 2014-04-24 | Microsoft Corporation | Recommending content based on content access tracking |
WO2014066413A1 (en) * | 2012-10-23 | 2014-05-01 | Microsoft Corporation | Multiple buffering orders for digital content item |
CN103841429A (en) * | 2012-11-27 | 2014-06-04 | 国际商业机器公司 | Non-chronological buffering of segments of media file |
US8812613B2 (en) | 2004-06-03 | 2014-08-19 | Maxsp Corporation | Virtual application manager |
US8819072B1 (en) | 2004-02-02 | 2014-08-26 | Microsoft Corporation | Promoting data from structured data files |
US8831995B2 (en) | 2000-11-06 | 2014-09-09 | Numecent Holdings, Inc. | Optimized server for streamed applications |
US20140304364A1 (en) * | 2013-04-05 | 2014-10-09 | Clear Channel Management Services, Inc. | Segmented WANcasting |
US8892993B2 (en) | 2003-08-01 | 2014-11-18 | Microsoft Corporation | Translation file |
US8898319B2 (en) | 2006-05-24 | 2014-11-25 | Maxsp Corporation | Applications and services as a bundle |
US8918729B2 (en) | 2003-03-24 | 2014-12-23 | Microsoft Corporation | Designing electronic forms |
US8977764B1 (en) | 2008-02-28 | 2015-03-10 | Symantec Corporation | Profiling application usage from application streaming |
CN104838627A (en) * | 2012-10-23 | 2015-08-12 | 微软技术许可有限责任公司 | Buffer ordering based on content access tracking |
US9357031B2 (en) | 2004-06-03 | 2016-05-31 | Microsoft Technology Licensing, Llc | Applications as a service |
US9448858B2 (en) | 2007-10-26 | 2016-09-20 | Microsoft Technology Licensing, Llc | Environment manager |
US9645900B2 (en) | 2006-12-21 | 2017-05-09 | Microsoft Technology Licensing, Llc | Warm standby appliance |
US9716609B2 (en) | 2005-03-23 | 2017-07-25 | Numecent Holdings, Inc. | System and method for tracking changes to files in streaming applications |
US10318260B2 (en) * | 2010-08-06 | 2019-06-11 | Cornami, Inc. | Method and apparatus for a compiler and related components for stream-based computations for a general-purpose, multiple-core system |
US10547522B2 (en) * | 2017-11-27 | 2020-01-28 | International Business Machines Corporation | Pre-starting services based on traversal of a directed graph during execution of an application |
US20220066834A1 (en) * | 2020-09-01 | 2022-03-03 | Qualcomm Incorporated | Memory-bound scheduling |
Families Citing this family (42)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6574618B2 (en) * | 1998-07-22 | 2003-06-03 | Appstream, Inc. | Method and system for executing network streamed application |
JP2001357312A (en) * | 1999-11-24 | 2001-12-26 | Sega Corp | Information processor, file server, method and system for charging management, and recording medium with program recorded |
US6389467B1 (en) | 2000-01-24 | 2002-05-14 | Friskit, Inc. | Streaming media search and continuous playback system of media resources located by multiple network addresses |
JP4033619B2 (en) * | 2000-05-26 | 2008-01-16 | シャープ株式会社 | Server device |
GB2380581A (en) * | 2000-07-11 | 2003-04-09 | Launch Media Inc | Online playback system with community bias |
US20080313282A1 (en) | 2002-09-10 | 2008-12-18 | Warila Bruce W | User interface, operating system and architecture |
EP1515233A3 (en) * | 2003-08-06 | 2007-03-14 | Matsushita Electric Industrial Co., Ltd. | Method, server and client for reducing processing time in synchronous communication in a client-server distributed system |
US7533370B2 (en) * | 2003-10-28 | 2009-05-12 | Exent Technologies, Ltd. | Security features in on-line and off-line delivery of applications |
US20060048136A1 (en) * | 2004-08-25 | 2006-03-02 | Vries Jeff D | Interception-based resource detection system |
KR100587532B1 (en) * | 2004-12-07 | 2006-06-08 | 한국전자통신연구원 | Apparatus and method for fabricating software application for streaming service and system and method for offering software streaming services with network fault tolerance |
US20060218165A1 (en) * | 2005-03-23 | 2006-09-28 | Vries Jeffrey De | Explicit overlay integration rules |
US7953879B1 (en) * | 2006-01-31 | 2011-05-31 | Symantec Operating Corporation | System and method for assigning symbolic names to data streams |
KR100942695B1 (en) * | 2006-12-04 | 2010-02-16 | 한국전자통신연구원 | Client system and method for managing a software version thereof |
GB2446832A (en) * | 2007-02-23 | 2008-08-27 | Quantel Ltd | A file server system |
TWI339522B (en) * | 2007-02-27 | 2011-03-21 | Nat Univ Tsing Hua | Generation method of remote objects with network streaming ability and system thereof |
US8341612B2 (en) * | 2007-05-16 | 2012-12-25 | International Business Machines Corporation | Method and apparatus for run-time statistics dependent program execution using source-coding |
US7986702B1 (en) * | 2007-11-29 | 2011-07-26 | Bigband Networks Inc. | Method and system for streaming multimedia transmissions |
US7792934B2 (en) * | 2008-01-02 | 2010-09-07 | Citrix Systems International Gmbh | Loading of server-stored user profile data |
US8799494B1 (en) * | 2008-02-04 | 2014-08-05 | Symantec Corporation | Application streaming proactive failover |
US8584120B2 (en) * | 2009-11-23 | 2013-11-12 | Julian Michael Urbach | Stream-based software application delivery and launching system |
US8473431B1 (en) | 2010-05-14 | 2013-06-25 | Google Inc. | Predictive analytic modeling platform |
US8438122B1 (en) | 2010-05-14 | 2013-05-07 | Google Inc. | Predictive analytic modeling platform |
US8521664B1 (en) | 2010-05-14 | 2013-08-27 | Google Inc. | Predictive analytical model matching |
US8495625B1 (en) | 2010-07-27 | 2013-07-23 | Symantec Corporation | Method and system for creation of streamed files on-demand |
US9043782B2 (en) * | 2010-12-28 | 2015-05-26 | Microsoft Technology Licensing, Llc | Predictive software streaming |
US8533222B2 (en) | 2011-01-26 | 2013-09-10 | Google Inc. | Updateable predictive analytical modeling |
US8595154B2 (en) | 2011-01-26 | 2013-11-26 | Google Inc. | Dynamic predictive modeling platform |
US10114660B2 (en) | 2011-02-22 | 2018-10-30 | Julian Michael Urbach | Software application delivery and launching system |
US8533224B2 (en) | 2011-05-04 | 2013-09-10 | Google Inc. | Assessing accuracy of trained predictive models |
US8229864B1 (en) | 2011-05-06 | 2012-07-24 | Google Inc. | Predictive model application programming interface |
US8209274B1 (en) | 2011-05-09 | 2012-06-26 | Google Inc. | Predictive model importation |
US8364613B1 (en) | 2011-07-14 | 2013-01-29 | Google Inc. | Hosting predictive models |
US8443013B1 (en) | 2011-07-29 | 2013-05-14 | Google Inc. | Predictive analytical modeling for databases |
US8694540B1 (en) | 2011-09-01 | 2014-04-08 | Google Inc. | Predictive analytical model selection |
US8370279B1 (en) | 2011-09-29 | 2013-02-05 | Google Inc. | Normalization of predictive model scores |
US8938745B2 (en) * | 2011-11-08 | 2015-01-20 | Sap Se | Systems and methods for providing modular applications |
DE102015118522A1 (en) * | 2015-10-29 | 2017-05-04 | Dacs Laboratories Gmbh | Method and device for accelerated execution of applications |
US20170286122A1 (en) * | 2016-04-01 | 2017-10-05 | Intel Corporation | Instruction, Circuits, and Logic for Graph Analytics Acceleration |
US9965255B2 (en) | 2016-07-14 | 2018-05-08 | International Business Machines Corporation | Code origination data management for code assembly |
US10175952B2 (en) | 2016-07-14 | 2019-01-08 | International Business Machines Corporation | Code origination data management for host placement |
US9996583B1 (en) * | 2017-05-25 | 2018-06-12 | Semmle Limited | Differential recursive evaluation of recursive aggregates |
US11693579B2 (en) | 2021-03-09 | 2023-07-04 | International Business Machines Corporation | Value-based replication of streaming data |
Family Cites Families (121)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5163131A (en) | 1989-09-08 | 1992-11-10 | Auspex Systems, Inc. | Parallel i/o network file server architecture |
US5495610A (en) * | 1989-11-30 | 1996-02-27 | Seer Technologies, Inc. | Software distribution system to build and distribute a software release |
US5237460A (en) | 1990-12-14 | 1993-08-17 | Ceram, Inc. | Storage of compressed data on random access storage devices |
JP2521016B2 (en) * | 1991-12-31 | 1996-07-31 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Multimedia data processing system |
US5555388A (en) | 1992-08-20 | 1996-09-10 | Borland International, Inc. | Multi-user system and methods providing improved file management by reading |
US5394534A (en) | 1992-09-11 | 1995-02-28 | International Business Machines Corporation | Data compression/decompression and storage of compressed and uncompressed data on a same removable data storage medium |
WO1994025913A2 (en) | 1993-04-30 | 1994-11-10 | Novadigm, Inc. | Method and apparatus for enterprise desktop management |
US5504886A (en) | 1993-07-02 | 1996-04-02 | International Business Machines Corporation | System and method for applying user supplied relation definitions to application files for a relational database |
US6101495A (en) | 1994-11-16 | 2000-08-08 | Hitachi, Ltd. | Method of executing partition operations in a parallel database system |
US6813769B1 (en) * | 1997-10-28 | 2004-11-02 | Microsoft Corporation | Server application components with control over state duration |
US5742806A (en) | 1994-01-31 | 1998-04-21 | Sun Microsystems, Inc. | Apparatus and method for decomposing database queries for database management system including multiprocessor digital data processing system |
AU2471995A (en) | 1994-05-05 | 1995-11-29 | Catapult Entertainment, Inc. | Network architecture for real-time video games |
US5581706A (en) | 1994-06-30 | 1996-12-03 | Rca Thomson Licensing Corporation | Method forming an audio/video interactive data signal |
US5712976A (en) | 1994-09-08 | 1998-01-27 | International Business Machines Corporation | Video data streamer for simultaneously conveying same one or different ones of data blocks stored in storage node to each of plurality of communication nodes |
US5668948A (en) * | 1994-09-08 | 1997-09-16 | International Business Machines Corporation | Media streamer with control node enabling same isochronous streams to appear simultaneously at output ports or different streams to appear simultaneously at output ports |
US5708796A (en) | 1994-11-18 | 1998-01-13 | Lucent Technologies Inc. | Method of retrieving continuous and non-continuous media data from a file system |
DE69515838T2 (en) | 1995-01-30 | 2000-10-12 | International Business Machines Corp., Armonk | Priority-controlled transmission of multimedia data streams via a telecommunication line |
JP3865775B2 (en) | 1995-04-11 | 2007-01-10 | キネテック インコーポレイテッド | Data identification in data processing systems |
US5802292A (en) * | 1995-04-28 | 1998-09-01 | Digital Equipment Corporation | Method for predictive prefetching of information over a communications network |
US5835749A (en) | 1995-05-05 | 1998-11-10 | Apple Computer, Inc. | Method and apparatus for providing dynamically linked libraries |
US6044382A (en) | 1995-05-19 | 2000-03-28 | Cyber Fone Technologies, Inc. | Data transaction assembly server |
US6199082B1 (en) | 1995-07-17 | 2001-03-06 | Microsoft Corporation | Method for delivering separate design and content in a multimedia publishing system |
US5956509A (en) | 1995-08-18 | 1999-09-21 | Microsoft Corporation | System and method for performing remote requests with an on-line service network |
JP3751664B2 (en) * | 1995-10-05 | 2006-03-01 | 富士通株式会社 | Software registration system and method |
US6047323A (en) | 1995-10-19 | 2000-04-04 | Hewlett-Packard Company | Creation and migration of distributed streams in clusters of networked computers |
US5761477A (en) | 1995-12-04 | 1998-06-02 | Microsoft Corporation | Methods for safe and efficient implementations of virtual machines |
US5765164A (en) | 1995-12-21 | 1998-06-09 | Intel Corporation | Apparatus and method for management of discontinuous segments of multiple audio, video, and data streams |
US6088524A (en) | 1995-12-27 | 2000-07-11 | Lucent Technologies, Inc. | Method and apparatus for optimizing database queries involving aggregation predicates |
CA2166254C (en) | 1995-12-28 | 2000-02-01 | Robert James Blainey | Improving memory layout based on connectivity considerations |
US5752005A (en) * | 1996-01-22 | 1998-05-12 | Microtest, Inc. | Foreign file system establishing method which uses a native file system virtual device driver |
WO1997027553A1 (en) | 1996-01-29 | 1997-07-31 | Futuretense, Inc. | Distributed electronic publishing system |
US6199095B1 (en) | 1996-01-29 | 2001-03-06 | Compaq Computer Corporation | System and method for achieving object method transparency in a multi-code execution environment |
US6058387A (en) | 1996-01-30 | 2000-05-02 | The University Of Chicago | Dynamic information architecture system and method |
US5754774A (en) | 1996-02-15 | 1998-05-19 | International Business Machine Corp. | Client/server communication system |
US5925100A (en) * | 1996-03-21 | 1999-07-20 | Sybase, Inc. | Client/server system with methods for prefetching and managing semantic objects based on object-based prefetch primitive present in client's executing application |
US5764235A (en) | 1996-03-25 | 1998-06-09 | Insight Development Corporation | Computer implemented method and system for transmitting graphical images from server to client at user selectable resolution |
US5768528A (en) | 1996-05-24 | 1998-06-16 | V-Cast, Inc. | Client-server system for delivery of online information |
US6173327B1 (en) * | 1996-07-11 | 2001-01-09 | Jeroen De Borst | Object-oriented method and apparatus for information delivery |
US5742768A (en) | 1996-07-16 | 1998-04-21 | Silicon Graphics, Inc. | System and method for providing and displaying a web page having an embedded menu |
US5809247A (en) * | 1996-07-22 | 1998-09-15 | Intel Corporation | Method and apparatus for guided touring of internet/intranet websites |
US5919247A (en) | 1996-07-24 | 1999-07-06 | Marimba, Inc. | Method for the distribution of code and data updates |
US5958051A (en) | 1996-11-27 | 1999-09-28 | Sun Microsystems, Inc. | Implementing digital signatures for data streams and data archives |
US5894479A (en) | 1996-12-10 | 1999-04-13 | Intel Corporation | Providing address resolution information for self registration of clients on power-up or dial-in |
US5864870A (en) | 1996-12-18 | 1999-01-26 | Unisys Corp. | Method for storing/retrieving files of various formats in an object database using a virtual multimedia file system |
US5911776A (en) | 1996-12-18 | 1999-06-15 | Unisys Corporation | Automatic format conversion system and publishing methodology for multi-user network |
US5987513A (en) | 1997-02-19 | 1999-11-16 | Wipro Limited | Network management using browser-based technology |
US6139197A (en) | 1997-03-04 | 2000-10-31 | Seeitfirst.Com | Method and system automatically forwarding snapshots created from a compressed digital video stream |
US6128653A (en) | 1997-03-17 | 2000-10-03 | Microsoft Corporation | Method and apparatus for communication media commands and media data using the HTTP protocol |
US6412004B1 (en) | 1997-03-27 | 2002-06-25 | Microsoft Corporation | Metaserver for a multimedia distribution network |
US5978788A (en) | 1997-04-14 | 1999-11-02 | International Business Machines Corporation | System and method for generating multi-representations of a data cube |
JPH10301874A (en) * | 1997-04-22 | 1998-11-13 | Internatl Business Mach Corp <Ibm> | Remote operation method, server remotely operated from terminal through network and storage medium storing html file |
US5946697A (en) | 1997-04-22 | 1999-08-31 | Microsoft Corporation | Rapid transfer of HTML files |
US5892915A (en) | 1997-04-25 | 1999-04-06 | Emc Corporation | System having client sending edit commands to server during transmission of continuous media from one clip in play list for editing the play list |
US5878223A (en) | 1997-05-07 | 1999-03-02 | International Business Machines Corporation | System and method for predictive caching of information pages |
US5974129A (en) | 1997-05-21 | 1999-10-26 | Lucent Technologies Inc. | Distributed virtual cache method for use in a database query control system |
US6453334B1 (en) * | 1997-06-16 | 2002-09-17 | Streamtheory, Inc. | Method and apparatus to allow remotely located computer programs and/or data to be accessed on a local computer in a secure, time-limited manner, with persistent caching |
US5933644A (en) | 1997-06-18 | 1999-08-03 | Sun Microsystems, Inc. | Method and apparatus for conflict-based block reordering |
US6604144B1 (en) * | 1997-06-30 | 2003-08-05 | Microsoft Corporation | Data format for multimedia object storage, retrieval and transfer |
US6065046A (en) * | 1997-07-29 | 2000-05-16 | Catharon Productions, Inc. | Computerized system and associated method of optimally controlled storage and transfer of computer programs on a computer network |
US6173291B1 (en) | 1997-09-26 | 2001-01-09 | Powerquest Corporation | Method and apparatus for recovering data from damaged or corrupted file storage media |
US6574661B1 (en) | 1997-09-26 | 2003-06-03 | Mci Communications Corporation | Integrated proxy interface for web based telecommunication toll-free network management using a network manager for downloading a call routing tree to client |
US6085193A (en) | 1997-09-29 | 2000-07-04 | International Business Machines Corporation | Method and system for dynamically prefetching information via a server hierarchy |
US6163805A (en) | 1997-10-07 | 2000-12-19 | Hewlett-Packard Company | Distributed automated testing system |
US6009410A (en) | 1997-10-16 | 1999-12-28 | At&T Corporation | Method and system for presenting customized advertising to a user on the world wide web |
US6631425B1 (en) * | 1997-10-28 | 2003-10-07 | Microsoft Corporation | Just-in-time activation and as-soon-as-possible deactivation or server application components |
US6393526B1 (en) | 1997-10-28 | 2002-05-21 | Cache Plan, Inc. | Shared cache parsing and pre-fetch |
US6122628A (en) | 1997-10-31 | 2000-09-19 | International Business Machines Corporation | Multidimensional data clustering and dimension reduction for indexing and searching |
US5966702A (en) | 1997-10-31 | 1999-10-12 | Sun Microsystems, Inc. | Method and apparatus for pre-processing and packaging class files |
US6009429A (en) * | 1997-11-13 | 1999-12-28 | International Business Machines Corporation | HTML guided web tour |
US6029045A (en) | 1997-12-09 | 2000-02-22 | Cogent Technology, Inc. | System and method for inserting local content into programming content |
US6073129A (en) | 1997-12-29 | 2000-06-06 | Bull Hn Information Systems Inc. | Method and apparatus for improving the performance of a database management system through a central cache mechanism |
US6044403A (en) | 1997-12-31 | 2000-03-28 | At&T Corp | Network server platform for internet, JAVA server and video application server |
US6195622B1 (en) * | 1998-01-15 | 2001-02-27 | Microsoft Corporation | Methods and apparatus for building attribute transition probability models for use in pre-fetching resources |
US6085226A (en) * | 1998-01-15 | 2000-07-04 | Microsoft Corporation | Method and apparatus for utility-directed prefetching of web pages into local cache using continual computation and user models |
US6023726A (en) | 1998-01-20 | 2000-02-08 | Netscape Communications Corporation | User configurable prefetch control system for enabling client to prefetch documents from a network server |
US6493434B1 (en) | 1998-02-24 | 2002-12-10 | At&T Corp. | Update of web audio messages via audio user interface |
US6959318B1 (en) * | 1998-03-06 | 2005-10-25 | Intel Corporation | Method of proxy-assisted predictive pre-fetching with transcoding |
US6173287B1 (en) | 1998-03-11 | 2001-01-09 | Digital Equipment Corporation | Technique for ranking multimedia annotations of interest |
US6205481B1 (en) | 1998-03-17 | 2001-03-20 | Infolibria, Inc. | Protocol for distributing fresh content among networked cache servers |
US6006265A (en) | 1998-04-02 | 1999-12-21 | Hotv, Inc. | Hyperlinks resolution at and by a special network server in order to enable diverse sophisticated hyperlinking upon a digital network |
US6148340A (en) | 1998-04-30 | 2000-11-14 | International Business Machines Corporation | Method and system for differencing container files |
US6256635B1 (en) * | 1998-05-08 | 2001-07-03 | Apple Computer, Inc. | Method and apparatus for configuring a computer using scripting |
US6102287A (en) | 1998-05-15 | 2000-08-15 | International Business Machines Corporation | Method and apparatus for providing product survey information in an electronic payment system |
US6572662B2 (en) * | 1998-05-15 | 2003-06-03 | International Business Machines Corporation | Dynamic customized web tours |
US6253289B1 (en) * | 1998-05-29 | 2001-06-26 | Compaq Computer Corporation | Maximizing sequential read streams while minimizing the impact on cache and other applications |
US6381742B2 (en) | 1998-06-19 | 2002-04-30 | Microsoft Corporation | Software package management |
US6256623B1 (en) | 1998-06-22 | 2001-07-03 | Microsoft Corporation | Network search access construct for accessing web-based search services |
US6119082A (en) | 1998-07-13 | 2000-09-12 | Lockheed Martin Corporation | Speech coding system and method including harmonic generator having an adaptive phase off-setter |
US6108703A (en) | 1998-07-14 | 2000-08-22 | Massachusetts Institute Of Technology | Global hosting system |
US6484311B2 (en) | 1998-07-15 | 2002-11-19 | Microsoft Corporation | Coalescing properties, methods and events |
US6311221B1 (en) | 1998-07-22 | 2001-10-30 | Appstream Inc. | Streaming modules |
US6357042B2 (en) | 1998-09-16 | 2002-03-12 | Anand Srinivasan | Method and apparatus for multiplexing separately-authored metadata for insertion into a video data stream |
US6230184B1 (en) | 1998-10-19 | 2001-05-08 | Sun Microsystems, Inc. | Method and apparatus for automatically optimizing execution of a computer program |
US6374402B1 (en) | 1998-11-16 | 2002-04-16 | Into Networks, Inc. | Method and apparatus for installation abstraction in a secure content delivery system |
US6170008B1 (en) | 1998-12-07 | 2001-01-02 | Mediaone Group, Inc. | On-the-fly trivial file transfer protocol |
US6453354B1 (en) | 1999-03-03 | 2002-09-17 | Emc Corporation | File server system using connection-oriented protocol and sharing data sets among data movers |
US6499060B1 (en) | 1999-03-12 | 2002-12-24 | Microsoft Corporation | Media coding for loss recovery with remotely predicted data units |
US6272598B1 (en) | 1999-03-22 | 2001-08-07 | Hewlett-Packard Company | Web cache performance by applying different replacement policies to the web cache |
US6425125B1 (en) | 1999-03-30 | 2002-07-23 | Microsoft Corporation | System and method for upgrading client software |
US6408294B1 (en) | 1999-03-31 | 2002-06-18 | Verizon Laboratories Inc. | Common term optimization |
US6789252B1 (en) * | 1999-04-15 | 2004-09-07 | Miles D. Burke | Building business objects and business software applications using dynamic object definitions of ingrediential objects |
US6421777B1 (en) | 1999-04-26 | 2002-07-16 | International Business Machines Corporation | Method and apparatus for managing boot images in a distributed data processing system |
US6466980B1 (en) | 1999-06-17 | 2002-10-15 | International Business Machines Corporation | System and method for capacity shaping in an internet environment |
US6463508B1 (en) | 1999-07-19 | 2002-10-08 | International Business Machines Corporation | Method and apparatus for caching a media stream |
US6523027B1 (en) | 1999-07-30 | 2003-02-18 | Accenture Llp | Interfacing servers in a Java based e-commerce architecture |
US6282711B1 (en) | 1999-08-10 | 2001-08-28 | Hewlett-Packard Company | Method for more efficiently installing software components from a remote server source |
US6370573B1 (en) | 1999-08-31 | 2002-04-09 | Accenture Llp | System, method and article of manufacture for managing an environment of a development architecture framework |
US6427149B1 (en) | 1999-09-09 | 2002-07-30 | Herman Rodriguez | Remote access of archived compressed data files |
US6438630B1 (en) | 1999-10-06 | 2002-08-20 | Sun Microsystems, Inc. | Scheduling storage accesses for multiple continuous media streams |
US6546554B1 (en) * | 2000-01-21 | 2003-04-08 | Sun Microsystems, Inc. | Browser-independent and automatic apparatus and method for receiving, installing and launching applications from a browser on a client computer |
US7517551B2 (en) * | 2000-05-12 | 2009-04-14 | Semiconductor Energy Laboratory Co., Ltd. | Method of manufacturing a light-emitting device |
US6535894B1 (en) | 2000-06-01 | 2003-03-18 | Sun Microsystems, Inc. | Apparatus and method for incremental updating of archive files |
US20020087883A1 (en) * | 2000-11-06 | 2002-07-04 | Curt Wohlgemuth | Anti-piracy system for remotely served computer applications |
US20020083183A1 (en) * | 2000-11-06 | 2002-06-27 | Sanjay Pujare | Conventionally coded application conversion system for streamed delivery and execution |
US6918113B2 (en) * | 2000-11-06 | 2005-07-12 | Endeavors Technology, Inc. | Client installation and execution system for streamed applications |
US7062567B2 (en) * | 2000-11-06 | 2006-06-13 | Endeavors Technology, Inc. | Intelligent network streaming and execution system for conventionally coded applications |
US6959320B2 (en) * | 2000-11-06 | 2005-10-25 | Endeavors Technology, Inc. | Client-side performance optimization system for streamed applications |
US8831995B2 (en) * | 2000-11-06 | 2014-09-09 | Numecent Holdings, Inc. | Optimized server for streamed applications |
KR100408758B1 (en) * | 2003-01-22 | 2003-12-11 | Nexon Co Ltd | Method for controlling user application program |
US7735057B2 (en) * | 2003-05-16 | 2010-06-08 | Symantec Corporation | Method and apparatus for packaging and streaming installation software |
US9124653B2 (en) * | 2004-09-03 | 2015-09-01 | Symantec Corporation | Method and apparatus for allowing sharing of streamable applications |
-
2000
- 2000-12-22 US US09/745,646 patent/US20010044850A1/en not_active Abandoned
-
2001
- 2001-01-17 AU AU2001229575A patent/AU2001229575A1/en not_active Abandoned
- 2001-01-17 WO PCT/US2001/001596 patent/WO2001053940A2/en active Application Filing
-
2003
- 2003-01-30 US US10/354,947 patent/US7606924B2/en not_active Expired - Fee Related
Cited By (179)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9094480B2 (en) | 1997-06-16 | 2015-07-28 | Numecent Holdings, Inc. | Software streaming system and method |
US20030056112A1 (en) * | 1997-06-16 | 2003-03-20 | Jeffrey Vinson | Method and apparatus to allow remotely located computer programs and/or data to be accessed on a local computer in a secure, time-limited manner, with persistent caching |
US8509230B2 (en) | 1997-06-16 | 2013-08-13 | Numecent Holdings, Inc. | Software streaming system and method |
US7096253B2 (en) | 1997-06-16 | 2006-08-22 | Stream Theory, Inc. | Method and apparatus for streaming software |
US7197570B2 (en) | 1998-07-22 | 2007-03-27 | Appstream Inc. | System and method to send predicted application streamlets to a client device |
US20020042833A1 (en) * | 1998-07-22 | 2002-04-11 | Danny Hendler | Streaming of archive files |
US6983315B1 (en) | 2000-01-18 | 2006-01-03 | Wrq, Inc. | Applet embedded cross-platform caching |
US8918487B2 (en) | 2000-01-18 | 2014-12-23 | Novell, Inc. | Applet embedded cross-platform caching |
US8332489B2 (en) | 2000-01-18 | 2012-12-11 | Attachmate Corporation | Applet embedded cross-platform caching |
US20060047772A1 (en) * | 2000-01-18 | 2006-03-02 | Wrq, Inc. | Applet embedded cross-platform caching |
US7673227B2 (en) | 2000-06-21 | 2010-03-02 | Microsoft Corporation | User interface for integrated spreadsheets and word processing tables |
US7689929B2 (en) | 2000-06-21 | 2010-03-30 | Microsoft Corporation | Methods and systems of providing information to computer users |
US7818677B2 (en) | 2000-06-21 | 2010-10-19 | Microsoft Corporation | Single window navigation methods and systems |
US7779027B2 (en) | 2000-06-21 | 2010-08-17 | Microsoft Corporation | Methods, systems, architectures and data structures for delivering software via a network |
US7900134B2 (en) | 2000-06-21 | 2011-03-01 | Microsoft Corporation | Authoring arbitrary XML documents using DHTML and XSLT |
US7743063B2 (en) * | 2000-06-21 | 2010-06-22 | Microsoft Corporation | Methods and systems for delivering software via a network |
US7979856B2 (en) | 2000-06-21 | 2011-07-12 | Microsoft Corporation | Network-based software extensions |
US8074217B2 (en) | 2000-06-21 | 2011-12-06 | Microsoft Corporation | Methods and systems for delivering software |
US7051315B2 (en) | 2000-09-26 | 2006-05-23 | Appstream, Inc. | Network streaming of multi-application program code |
US6959320B2 (en) | 2000-11-06 | 2005-10-25 | Endeavors Technology, Inc. | Client-side performance optimization system for streamed applications |
US7062567B2 (en) | 2000-11-06 | 2006-06-13 | Endeavors Technology, Inc. | Intelligent network streaming and execution system for conventionally coded applications |
US8831995B2 (en) | 2000-11-06 | 2014-09-09 | Numecent Holdings, Inc. | Optimized server for streamed applications |
US9130953B2 (en) | 2000-11-06 | 2015-09-08 | Numecent Holdings, Inc. | Intelligent network streaming and execution system for conventionally coded applications |
US20030009538A1 (en) * | 2000-11-06 | 2003-01-09 | Shah Lacky Vasant | Network caching system for streamed applications |
US7043524B2 (en) | 2000-11-06 | 2006-05-09 | Omnishift Technologies, Inc. | Network caching system for streamed applications |
US20020091763A1 (en) * | 2000-11-06 | 2002-07-11 | Shah Lacky Vasant | Client-side performance optimization system for streamed applications |
US9654548B2 (en) | 2000-11-06 | 2017-05-16 | Numecent Holdings, Inc. | Intelligent network streaming and execution system for conventionally coded applications |
US6918113B2 (en) | 2000-11-06 | 2005-07-12 | Endeavors Technology, Inc. | Client installation and execution system for streamed applications |
US8438298B2 (en) | 2001-02-14 | 2013-05-07 | Endeavors Technologies, Inc. | Intelligent network streaming and execution system for conventionally coded applications |
US8893249B2 (en) | 2001-02-14 | 2014-11-18 | Numecent Holdings, Inc. | Intelligent network streaming and execution system for conventionally coded applications |
US20030009488A1 (en) * | 2001-05-22 | 2003-01-09 | Reuters America, Inc | System and method of accelerating delivery of dynamic web pages over a network |
US7376653B2 (en) * | 2001-05-22 | 2008-05-20 | Reuters America, Inc. | Creating dynamic web pages at a client browser |
EP1483663A4 (en) * | 2001-12-12 | 2008-04-16 | Valve Corp | Method and system for preloading resources |
US8108687B2 (en) | 2001-12-12 | 2012-01-31 | Valve Corporation | Method and system for granting access to system and content |
US8661557B2 (en) | 2001-12-12 | 2014-02-25 | Valve Corporation | Method and system for granting access to system and content |
US7895261B2 (en) | 2001-12-12 | 2011-02-22 | Valve Corporation | Method and system for preloading resources |
US8539038B2 (en) | 2001-12-12 | 2013-09-17 | Valve Corporation | Method and system for preloading resources |
US20110145362A1 (en) * | 2001-12-12 | 2011-06-16 | Valve Llc | Method and system for preloading resources |
EP1483663A1 (en) * | 2001-12-12 | 2004-12-08 | Valve Corporation | Method and system for preloading resources |
US20030221112A1 (en) * | 2001-12-12 | 2003-11-27 | Ellis Richard Donald | Method and system for granting access to system and content |
US8918729B2 (en) | 2003-03-24 | 2014-12-23 | Microsoft Corporation | Designing electronic forms |
US8117552B2 (en) | 2003-03-24 | 2012-02-14 | Microsoft Corporation | Incrementally designing electronic forms and hierarchical schemas |
US7925621B2 (en) | 2003-03-24 | 2011-04-12 | Microsoft Corporation | Installing a solution |
US7913159B2 (en) | 2003-03-28 | 2011-03-22 | Microsoft Corporation | System and method for real-time validation of structured data files |
US9229917B2 (en) | 2003-03-28 | 2016-01-05 | Microsoft Technology Licensing, Llc | Electronic form user interfaces |
US7865477B2 (en) | 2003-03-28 | 2011-01-04 | Microsoft Corporation | System and method for real-time validation of structured data files |
US7735057B2 (en) | 2003-05-16 | 2010-06-08 | Symantec Corporation | Method and apparatus for packaging and streaming installation software |
US8892993B2 (en) | 2003-08-01 | 2014-11-18 | Microsoft Corporation | Translation file |
US9239821B2 (en) | 2003-08-01 | 2016-01-19 | Microsoft Technology Licensing, Llc | Translation file |
US8429522B2 (en) | 2003-08-06 | 2013-04-23 | Microsoft Corporation | Correlation, association, or correspondence of electronic forms |
US9268760B2 (en) | 2003-08-06 | 2016-02-23 | Microsoft Technology Licensing, Llc | Correlation, association, or correspondence of electronic forms |
US7971139B2 (en) | 2003-08-06 | 2011-06-28 | Microsoft Corporation | Correlation, association, or correspondence of electronic forms |
US7558871B2 (en) * | 2003-10-31 | 2009-07-07 | Alcatel-Lucent Usa Inc. | Data stream association with call through employment of identifier within message associated with the call |
US20050094791A1 (en) * | 2003-10-31 | 2005-05-05 | Clark Edward A. | Data stream association with call through employment of identifier within message associated with the call |
US8819072B1 (en) | 2004-02-02 | 2014-08-26 | Microsoft Corporation | Promoting data from structured data files |
US7774620B1 (en) | 2004-05-27 | 2010-08-10 | Microsoft Corporation | Executing applications at appropriate trust levels |
US7676843B1 (en) | 2004-05-27 | 2010-03-09 | Microsoft Corporation | Executing applications at appropriate trust levels |
US8812613B2 (en) | 2004-06-03 | 2014-08-19 | Maxsp Corporation | Virtual application manager |
US9357031B2 (en) | 2004-06-03 | 2016-05-31 | Microsoft Technology Licensing, Llc | Applications as a service |
US9569194B2 (en) | 2004-06-03 | 2017-02-14 | Microsoft Technology Licensing, Llc | Virtual application manager |
US7908339B2 (en) | 2004-06-03 | 2011-03-15 | Maxsp Corporation | Transaction based virtual file system optimized for high-latency network connections |
US20100125770A1 (en) * | 2004-07-09 | 2010-05-20 | Maxsp Corporation | Distributed operating system management |
US7664834B2 (en) | 2004-07-09 | 2010-02-16 | Maxsp Corporation | Distributed operating system management |
US20060047946A1 (en) * | 2004-07-09 | 2006-03-02 | Keith Robert O Jr | Distributed operating system management |
US8352964B2 (en) | 2004-09-30 | 2013-01-08 | Citrix Systems, Inc. | Method and apparatus for moving processes between isolation environments |
US8302101B2 (en) | 2004-09-30 | 2012-10-30 | Citrix Systems, Inc. | Methods and systems for accessing, by application programs, resources provided by an operating system |
US7853947B2 (en) | 2004-09-30 | 2010-12-14 | Citrix Systems, Inc. | System for virtualizing access to named system objects using rule action associated with request |
US7680758B2 (en) | 2004-09-30 | 2010-03-16 | Citrix Systems, Inc. | Method and apparatus for isolating execution of software applications |
US20060070029A1 (en) * | 2004-09-30 | 2006-03-30 | Citrix Systems, Inc. | Method and apparatus for providing file-type associations to multiple applications |
US20060074989A1 (en) * | 2004-09-30 | 2006-04-06 | Laborczfalvi Lee G | Method and apparatus for virtualizing object names |
US20060075381A1 (en) * | 2004-09-30 | 2006-04-06 | Citrix Systems, Inc. | Method and apparatus for isolating execution of software applications |
US8042120B2 (en) | 2004-09-30 | 2011-10-18 | Citrix Systems, Inc. | Method and apparatus for moving processes between isolation environments |
US7692636B2 (en) | 2004-09-30 | 2010-04-06 | Microsoft Corporation | Systems and methods for handwriting to a screen |
US7676813B2 (en) | 2004-09-30 | 2010-03-09 | Citrix Systems, Inc. | Method and system for accessing resources |
US8171479B2 (en) | 2004-09-30 | 2012-05-01 | Citrix Systems, Inc. | Method and apparatus for providing an aggregate view of enumerated system resources from various isolation layers |
US8132176B2 (en) | 2004-09-30 | 2012-03-06 | Citrix Systems, Inc. | Method for accessing, by application programs, resources residing inside an application isolation scope |
US7752600B2 (en) | 2004-09-30 | 2010-07-06 | Citrix Systems, Inc. | Method and apparatus for providing file-type associations to multiple applications |
US8117559B2 (en) | 2004-09-30 | 2012-02-14 | Citrix Systems, Inc. | Method and apparatus for virtualizing window information |
US20070067255A1 (en) * | 2004-09-30 | 2007-03-22 | Bissett Nicholas A | Method and system for accessing resources |
US20060106770A1 (en) * | 2004-10-22 | 2006-05-18 | Vries Jeffrey D | System and method for predictive streaming |
US8487879B2 (en) | 2004-10-29 | 2013-07-16 | Microsoft Corporation | Systems and methods for interacting with a computer through handwriting to a screen |
US8949820B2 (en) | 2004-11-13 | 2015-02-03 | Numecent Holdings, Inc. | Streaming from a media device |
US8359591B2 (en) | 2004-11-13 | 2013-01-22 | Streamtheory, Inc. | Streaming from a media device |
US7712022B2 (en) | 2004-11-15 | 2010-05-04 | Microsoft Corporation | Mutually exclusive options in electronic forms |
US7721190B2 (en) | 2004-11-16 | 2010-05-18 | Microsoft Corporation | Methods and systems for server side form processing |
US20060136389A1 (en) * | 2004-12-22 | 2006-06-22 | Cover Clay H | System and method for invocation of streaming application |
US7937651B2 (en) | 2005-01-14 | 2011-05-03 | Microsoft Corporation | Structural editing operations for network forms |
US20060224545A1 (en) * | 2005-03-04 | 2006-10-05 | Keith Robert O Jr | Computer hardware and software diagnostic and report system |
US8589323B2 (en) | 2005-03-04 | 2013-11-19 | Maxsp Corporation | Computer hardware and software diagnostic and report system incorporating an expert system and agents |
US7624086B2 (en) | 2005-03-04 | 2009-11-24 | Maxsp Corporation | Pre-install compliance system |
US8234238B2 (en) | 2005-03-04 | 2012-07-31 | Maxsp Corporation | Computer hardware and software diagnostic and report system |
US7512584B2 (en) | 2005-03-04 | 2009-03-31 | Maxsp Corporation | Computer hardware and software diagnostic and report system |
US7725834B2 (en) | 2005-03-04 | 2010-05-25 | Microsoft Corporation | Designer-created aspect for an electronic form template |
US20060224544A1 (en) * | 2005-03-04 | 2006-10-05 | Keith Robert O Jr | Pre-install compliance system |
US9716609B2 (en) | 2005-03-23 | 2017-07-25 | Numecent Holdings, Inc. | System and method for tracking changes to files in streaming applications |
US9300752B2 (en) | 2005-03-23 | 2016-03-29 | Numecent Holdings, Inc. | Opportunistic block transmission with time constraints |
US8527706B2 (en) | 2005-03-23 | 2013-09-03 | Numecent Holdings, Inc. | Opportunistic block transmission with time constraints |
US8898391B2 (en) | 2005-03-23 | 2014-11-25 | Numecent Holdings, Inc. | Opportunistic block transmission with time constraints |
US11121928B2 (en) | 2005-03-23 | 2021-09-14 | Numecent Holdings, Inc. | Opportunistic block transmission with time constraints |
US10587473B2 (en) | 2005-03-23 | 2020-03-10 | Numecent Holdings, Inc. | Opportunistic block transmission with time constraints |
US9781007B2 (en) | 2005-03-23 | 2017-10-03 | Numecent Holdings, Inc. | Opportunistic block transmission with time constraints |
US7673228B2 (en) | 2005-03-30 | 2010-03-02 | Microsoft Corporation | Data-driven actions for network forms |
US8010515B2 (en) | 2005-04-15 | 2011-08-30 | Microsoft Corporation | Query to an electronic form |
US20070254742A1 (en) * | 2005-06-06 | 2007-11-01 | Digital Interactive Streams, Inc. | Gaming on demand system and methodology |
US8200975B2 (en) | 2005-06-29 | 2012-06-12 | Microsoft Corporation | Digital signatures for network forms |
US8095940B2 (en) | 2005-09-19 | 2012-01-10 | Citrix Systems, Inc. | Method and system for locating and accessing resources |
US7779034B2 (en) | 2005-10-07 | 2010-08-17 | Citrix Systems, Inc. | Method and system for accessing a remote file in a directory structure associated with an application program executing locally |
US8131825B2 (en) | 2005-10-07 | 2012-03-06 | Citrix Systems, Inc. | Method and a system for responding locally to requests for file metadata associated with files stored remotely |
US20070083620A1 (en) * | 2005-10-07 | 2007-04-12 | Pedersen Bradley J | Methods for selecting between a predetermined number of execution methods for an application program |
US8001459B2 (en) | 2005-12-05 | 2011-08-16 | Microsoft Corporation | Enabling electronic documents for limited-capability computing devices |
US9210234B2 (en) | 2005-12-05 | 2015-12-08 | Microsoft Technology Licensing, Llc | Enabling electronic documents for limited-capability computing devices |
WO2007066993A1 (en) * | 2005-12-08 | 2007-06-14 | Electronics And Telecommunications Research Institute | Method and apparatus for providing software by functional units in a software streaming system |
US20080256178A1 (en) * | 2005-12-08 | 2008-10-16 | Electronics And Telecommunications Research Instit | Method and Apparatus for Providing Software by Functional Units in a Software Streaming System |
US8811396B2 (en) | 2006-05-24 | 2014-08-19 | Maxsp Corporation | System for and method of securing a network utilizing credentials |
US9584480B2 (en) | 2006-05-24 | 2017-02-28 | Microsoft Technology Licensing, Llc | System for and method of securing a network utilizing credentials |
US9160735B2 (en) | 2006-05-24 | 2015-10-13 | Microsoft Technology Licensing, Llc | System for and method of securing a network utilizing credentials |
US8898319B2 (en) | 2006-05-24 | 2014-11-25 | Maxsp Corporation | Applications and services as a bundle |
US9893961B2 (en) | 2006-05-24 | 2018-02-13 | Microsoft Technology Licensing, Llc | Applications and services as a bundle |
US10511495B2 (en) | 2006-05-24 | 2019-12-17 | Microsoft Technology Licensing, Llc | Applications and services as a bundle |
US9906418B2 (en) | 2006-05-24 | 2018-02-27 | Microsoft Technology Licensing, Llc | Applications and services as a bundle |
US20070274315A1 (en) * | 2006-05-24 | 2007-11-29 | Keith Robert O | System for and method of securing a network utilizing credentials |
US8782778B2 (en) | 2006-10-23 | 2014-07-15 | Numecent Holdings, Inc. | Rule-based application access management |
US8261345B2 (en) | 2006-10-23 | 2012-09-04 | Endeavors Technologies, Inc. | Rule-based application access management |
US9380063B2 (en) | 2006-10-23 | 2016-06-28 | Numecent Holdings, Inc. | Rule-based application access management |
US9054963B2 (en) | 2006-10-23 | 2015-06-09 | Numecent Holdings, Inc. | Rule-based application access management |
US9054962B2 (en) | 2006-10-23 | 2015-06-09 | Numecent Holdings, Inc. | Rule-based application access management |
US9571501B2 (en) | 2006-10-23 | 2017-02-14 | Numecent Holdings, Inc. | Rule-based application access management |
US12081548B2 (en) | 2006-10-23 | 2024-09-03 | Numecent Holdings, Inc. | Rule-based application access management |
US10356100B2 (en) | 2006-10-23 | 2019-07-16 | Numecent Holdings, Inc. | Rule-based application access management |
US10057268B2 (en) | 2006-10-23 | 2018-08-21 | Numecent Holdings, Inc. | Rule-based application access management |
US9699194B2 (en) | 2006-10-23 | 2017-07-04 | Numecent Holdings, Inc. | Rule-based application access management |
US9825957B2 (en) | 2006-10-23 | 2017-11-21 | Numecent Holdings, Inc. | Rule-based application access management |
US11451548B2 (en) | 2006-10-23 | 2022-09-20 | Numecent Holdings, Inc | Rule-based application access management |
US8752128B2 (en) | 2006-10-23 | 2014-06-10 | Numecent Holdings, Inc. | Rule-based application access management |
US9645900B2 (en) | 2006-12-21 | 2017-05-09 | Microsoft Technology Licensing, Llc | Warm standby appliance |
US8171483B2 (en) | 2007-10-20 | 2012-05-01 | Citrix Systems, Inc. | Method and system for communicating between isolation environments |
US9009721B2 (en) | 2007-10-20 | 2015-04-14 | Citrix Systems, Inc. | Method and system for communicating between isolation environments |
US9009720B2 (en) | 2007-10-20 | 2015-04-14 | Citrix Systems, Inc. | Method and system for communicating between isolation environments |
US9021494B2 (en) | 2007-10-20 | 2015-04-28 | Citrix Systems, Inc. | Method and system for communicating between isolation environments |
US9448858B2 (en) | 2007-10-26 | 2016-09-20 | Microsoft Technology Licensing, Llc | Environment manager |
US8422833B2 (en) | 2007-10-26 | 2013-04-16 | Maxsp Corporation | Method of and system for enhanced data storage |
US9092374B2 (en) | 2007-10-26 | 2015-07-28 | Maxsp Corporation | Method of and system for enhanced data storage |
US10445210B2 (en) | 2007-11-07 | 2019-10-15 | Numecent Holdings, Inc. | Deriving component statistics for a stream enabled application |
US11119884B2 (en) | 2007-11-07 | 2021-09-14 | Numecent Holdings, Inc. | Deriving component statistics for a stream enabled application |
US8892738B2 (en) * | 2007-11-07 | 2014-11-18 | Numecent Holdings, Inc. | Deriving component statistics for a stream enabled application |
US8024523B2 (en) | 2007-11-07 | 2011-09-20 | Endeavors Technologies, Inc. | Opportunistic block transmission with time constraints |
US11740992B2 (en) | 2007-11-07 | 2023-08-29 | Numecent Holdings, Inc. | Deriving component statistics for a stream enabled application |
US9436578B2 (en) | 2007-11-07 | 2016-09-06 | Numecent Holdings, Inc. | Deriving component statistics for a stream enabled application |
US20090119644A1 (en) * | 2007-11-07 | 2009-05-07 | Endeavors Technologies, Inc. | Deriving component statistics for a stream enabled application |
US8661197B2 (en) | 2007-11-07 | 2014-02-25 | Numecent Holdings, Inc. | Opportunistic block transmission with time constraints |
US8583816B2 (en) * | 2007-12-18 | 2013-11-12 | Electronics And Telecommunications Research Institute | System for providing streaming-based portable application under selective conditions |
US20100268842A1 (en) * | 2007-12-18 | 2010-10-21 | Electronics And Telecommunications Research Institute | System and method for providing streaming-based portable application |
US8977764B1 (en) | 2008-02-28 | 2015-03-10 | Symantec Corporation | Profiling application usage from application streaming |
US8095679B1 (en) * | 2008-03-19 | 2012-01-10 | Symantec Corporation | Predictive transmission of content for application streaming and network file systems |
US8326943B2 (en) | 2009-05-02 | 2012-12-04 | Citrix Systems, Inc. | Methods and systems for launching applications into existing isolation environments |
US8090797B2 (en) | 2009-05-02 | 2012-01-03 | Citrix Systems, Inc. | Methods and systems for launching applications into existing isolation environments |
US10318260B2 (en) * | 2010-08-06 | 2019-06-11 | Cornami, Inc. | Method and apparatus for a compiler and related components for stream-based computations for a general-purpose, multiple-core system |
US9300742B2 (en) | 2012-10-23 | 2016-03-29 | Microsoft Technology Licensing, Inc. | Buffer ordering based on content access tracking |
EP2912820B1 (en) * | 2012-10-23 | 2018-09-12 | Microsoft Technology Licensing, LLC | Buffer ordering based on content access tracking |
CN104823424A (en) * | 2012-10-23 | 2015-08-05 | 微软技术许可有限责任公司 | Recommending content based on content access tracking |
CN104838627A (en) * | 2012-10-23 | 2015-08-12 | 微软技术许可有限责任公司 | Buffer ordering based on content access tracking |
CN104919449A (en) * | 2012-10-23 | 2015-09-16 | 微软技术许可有限责任公司 | Multiple buffering orders for digital content item |
WO2014066413A1 (en) * | 2012-10-23 | 2014-05-01 | Microsoft Corporation | Multiple buffering orders for digital content item |
US9258353B2 (en) | 2012-10-23 | 2016-02-09 | Microsoft Technology Licensing, Llc | Multiple buffering orders for digital content item |
US20140115096A1 (en) * | 2012-10-23 | 2014-04-24 | Microsoft Corporation | Recommending content based on content access tracking |
US10454983B2 (en) | 2012-11-27 | 2019-10-22 | International Business Machines Corporation | Non-chronological buffering of segments of a media file |
CN103841429A (en) * | 2012-11-27 | 2014-06-04 | 国际商业机器公司 | Non-chronological buffering of segments of media file |
US11206296B2 (en) | 2012-11-27 | 2021-12-21 | International Business Machines Corporation | Non-chronological buffering of segments of a media file |
US10841352B2 (en) | 2012-11-27 | 2020-11-17 | International Business Machines Corporation | Non-chronological buffering of segments of a media file |
US10986151B2 (en) | 2012-11-27 | 2021-04-20 | International Business Machines Corporation | Non-chronological buffering of segments of a media file |
US11146920B2 (en) | 2013-04-05 | 2021-10-12 | Iheartmedia Management Services, Inc. | Segmented WANcasting |
US20140304364A1 (en) * | 2013-04-05 | 2014-10-09 | Clear Channel Management Services, Inc. | Segmented WANcasting |
US10462613B2 (en) | 2013-04-05 | 2019-10-29 | Iheartmedia Management Services, Inc. | Segmented WANcasting |
US9781576B2 (en) * | 2013-04-05 | 2017-10-03 | Iheartmedia Management Services, Inc. | Segmented WANcasting |
US12096312B2 (en) | 2013-04-05 | 2024-09-17 | iHeart Media Management Services, Inc. | Transferring content to other media stations |
US10887202B2 (en) | 2017-11-27 | 2021-01-05 | International Business Machines Corporation | Pre-starting services based on traversal of a directed graph during execution of an application |
US10547522B2 (en) * | 2017-11-27 | 2020-01-28 | International Business Machines Corporation | Pre-starting services based on traversal of a directed graph during execution of an application |
US20220066834A1 (en) * | 2020-09-01 | 2022-03-03 | Qualcomm Incorporated | Memory-bound scheduling |
US12086636B2 (en) * | 2020-09-01 | 2024-09-10 | Qualcomm Incorporated | Memory-bound scheduling |
Also Published As
Publication number | Publication date |
---|---|
US7606924B2 (en) | 2009-10-20 |
AU2001229575A1 (en) | 2001-07-31 |
WO2001053940A2 (en) | 2001-07-26 |
WO2001053940A3 (en) | 2002-03-28 |
US20030140160A1 (en) | 2003-07-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7606924B2 (en) | Method and apparatus for determining the order of streaming modules | |
US6311221B1 (en) | Streaming modules | |
US7197570B2 (en) | System and method to send predicted application streamlets to a client device | |
US6769019B2 (en) | Method of background downloading of information from a computer network | |
US6539429B2 (en) | Method and apparatus for transmitting and displaying information between a remote network and a local computer | |
US20020138640A1 (en) | Apparatus and method for improving the delivery of software applications and associated data in web-based systems | |
US5623656A (en) | Script-based data communication system and method utilizing state memory | |
US6574618B2 (en) | Method and system for executing network streamed application | |
US7895261B2 (en) | Method and system for preloading resources | |
US9508081B2 (en) | Method and system for monitoring an activity of a user | |
US7240162B2 (en) | System and method for predictive streaming | |
US6366947B1 (en) | System and method for accelerating network interaction | |
US5781909A (en) | Supervised satellite kiosk management system with combined local and remote data storage | |
US20020147840A1 (en) | Distributed link processing system for delivering application and multi-media content on the internet | |
WO2001020510A1 (en) | Method and apparatus for restructuring of personalized data for transmission from a data network to connected and portable network appliances | |
WO2000043919A1 (en) | Link presentation and data transfer | |
JP2011066916A (en) | Information processing method, storage device and recording medium | |
EP1242922A1 (en) | Method of background downloading of information from a computer network | |
WO2003069475A2 (en) | A plug-in api for modular network transaction processing | |
WO2003094478A1 (en) | A method and system for tracking accesses of websites by mobile communication units | |
IES20020173A2 (en) | A method and system for tracking accesses of websites by mobile communication units | |
IE20020174A1 (en) | A method and system for tracking accesses of websites by mobile communication units |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: APPSTREAM, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:RAZ, URI;VOLK, YEHUDA;REEL/FRAME:013388/0602;SIGNING DATES FROM 20010227 TO 20010306 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: SYMANTEC CORPORATION, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:APPSTREAM, INC.;REEL/FRAME:021434/0370 Effective date: 20080801 |