This specification relates to digital data processing, and particularly to an automated system for updating software.
An online website or an enterprise application may have hundreds of servers deployed to process data and serve webpages to users. Each server can have many software applications installed on it. For each of these software applications, there may be updates that are periodically sent out by the software publishers. Some updates are security fixes and are critical in nature. Some updates are optional but are needed to keep the software updated such that when a security patch needs to be applied, it is applied to the latest version of the software. Updates from some software publishers have a better track record of installing smoothly while updates from other software publishers can cause servers to malfunction. It can be a challenge for a user to determine which software updates to actually install and which to not install.
In general, one innovative aspect of the subject matter described in this specification can be embodied in methods that include the actions of collecting information over one or more time periods regarding a software update history of a plurality of computing devices; training a mathematical model to predict whether a future software update will be applied to one of the one or more computing devices using the collected information, the collected information including the following for each of a plurality of software updates made available during the one or more time periods: an identification of software to which the update applies, whether the software update was installed on any of the computing devices, and, if so, whether the software installation was successful; receiving a prediction from the trained model that a new software update would be applied to a set of one or more of the computing devices; and responsive to the receiving, commanding the set of computing devices to install the new software update. Other embodiments of this aspect include corresponding systems, apparatus, and computer programs.
These and other aspects can optionally include one or more of the following features. Commanding the set of computing devices to install the software update, can further comprise: selecting a plurality of new software updates to install, the plurality of new software updates including the new software update and wherein at least one of the plurality of new software updates is not predicted to be installed according to the mathematical model; and commanding the set of computing devices to install the plurality of software updates in a prescribed order. A software update in the plurality of new software updates can have a higher order than other software updates in the prescribed order if the software update is predicted to be installed according to the mathematical model. Commanding the set of computing devices to install the software update, can further comprises: selecting a plurality of new software updates to install, the plurality of new software updates including the new software update; and commanding the set of computing devices to install the plurality of software updates in an order determined by one or more dependences among the plurality of new software updates. The dependencies can be learned based on user behavior regarding which software updates are installed by users before other software updates. The collected information can further include for each software update a version distance between the software update and currently installed software. The set of computing devices can include a plurality of computing devices which are located in one or more different geographic locations. The set of computing devices can include a plurality of computing devices and wherein commanding the set of computing devices to install the software update further comprises testing the new software update on one of the computing devices before installing the new software update on the other computing devices. The mathematical model can be trained based on an outcome of the testing.
Various implementations include a framework for (i) logging actions around software installation and usage in a network of computers; (ii) logging system administrator behavior when sent a notification for a software update; (iii) logging the installation of a software update/patch and ensuring system is functioning as before; (iv) taking into account all of these signals as training data, to create a mathematical model using machine learning; and (v) using the mathematical model to predict the probability of a software patch actually being installed by the administrator and using the prediction to decide whether or not to automatically install the software on the computer network. Further advantages include the ability to automatically test a software update before widely deploying it and the ability to specify or learn an order for multiple software updates to be installed.
The details of one or more embodiments of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the subject matter will become apparent from the description, the drawings, and the claims.
Like reference numbers and designations in the various drawings indicate like elements.
The information collected by the software monitors 102b, 104b, and 106b is sent at various times to a model trainer 108a software application which can execute on one or more computing devices 108. The model trainer 108a uses machine learning techniques to train a mathematical model to predict whether a given software update would be installed by a user on a given client based on past installation behavior for the client and other collected information. (Model training is discussed further below in reference to
By way of illustration,
The software identifier comprises the software application product name, product code or combination of these, for which a software update applies. The update version identifier is text or a number that identifies the version of the software update (e.g., “Version 1.2a”). The software and update version identifiers can be extracted by the software monitor 104b using text parsing techniques, for example, from a message sent by a software publisher or other party to a system administrator or other user of a client 104. The software and update version identifiers can also be obtained by parsing text of a software publisher web page or through an application program interface (API) made available by the software publisher or other system. Other ways of obtaining the identifiers are possible.
The critical update flag is set to “true” if the software publisher has indicated that the update is critical, such as an update to address a security flaw or fix a severe error in the software. This information can be obtained in the same way as the software and update version identifiers, for instance.
The installation flag indicates whether or not the software update was installed on the client 104. In some implementations, the software monitor 104b determines whether a software update was installed within a time period (e.g., 48 hours) following a time when the software update became available to the client. For example, the software monitor 104b can check a software installation directory on the file system (e.g., installed software 104a) of the client to determine whether the software update was installed. The installation flag is set to “true” if the software update was installed within the time period, otherwise the installation flag is set to “false”.
The success flag indicates whether or not an installed software update is functioning properly. In some implementations, the software update includes a test script (e.g., JAVASCRIPT) or a program that can be executed to determine whether the updated software is functioning properly. In further implementations, the software monitor 104b can determine whether updated software is functioning properly on the client 104 by monitoring usage of the updated software over time (e.g., 1-5 days) to detect crashes of the software or short usage times which are indicative of poorly functioning software. If the updated software is determined to be functioning properly, the success flag is set to “true”. Otherwise, the success flag is set to “false”.
Another piece of collected information is the version distance between the update version identifier and the version of the currently installed software (if any). In some implementations, a list of version identifiers for previously released software updates can be consulted to determine how many updates of the software were made available after a given version was installed on a client. If, for instance, there have been two software updates made available by a software publisher for given software since a version was last installed on the client 104, the version distance would be two. If there have been no intervening software updates to the software installed on the client 104 the version distance would be zero. Other ways of determining the version distance are possible.
The above collected information is sent in one or more communications labeled as “C” in
The some or all of the collected information in TABLES 1 and 2 is used by the model trainer 108a to train a mathematical model to predict whether one or more clients would install a given software update. The mathematical model can be implemented using supervised or semi-supervised machine learning techniques, for example. Supervised learning generates a function that maps inputs (e.g., information in TABLES 1 and 2) to desired outputs (e.g., a prediction as to whether a future update to the software would be installed on the client). In some implementations, one or more support vector machines (SVMs) can be used to create the model from training data based on the collected information described above. Other types of machine learning approaches are possible such as, for example, decision tree learning, association rule learning, artificial neural networks, genetic programming, inductive logic programming, clustering, Bayesian networks, and reinforcement learning. Some training data can be weighted based on detected patterns in the collected information. By way of illustration, a training signal that a system administrator always installs updates from a certain software publisher may override the critical update flag. Once the model is trained, the model trainer 108a provides the model in one or more communications labeled as “E” in
In various implementations, the predictor 110a can use the mathematical model to determine if a software update applies to multiple clients (e.g., clients 102, 104 and 106) and, if so, send update commands to each of the clients that are predicted to install the update. Alternatively, when multiple clients (e.g., clients 102, 104 and 106) are predicted to install a software update, the predictor 110a can select a subset of the clients (e.g., client 102) to install the software update on first in order to test the update before deploying it to the other clients (e.g., clients 104 and 106). This is illustrated in
In further implementations, if the predictor 110a determines that there are multiple software updates to install for one or more clients, the predictor 110a can specify an order in which the software updates should be installed. In some implementations, the order is determined based on learned or specified dependencies among the software updates being installed. For example, it might be the case that an operating system software update is always performed before any other software updates. Likewise, a software application that uses other software during its execution might require updates to the other software to take place before it is updated. Update dependences can be specified manually be users or learned over time by, for example, the software monitor which can learn the order that a user installs software updates and include this in the collected information sent to the model trainer 108a.
Although
Embodiments of the subject matter and the operations described in this specification can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions, encoded on computer storage medium for execution by, or to control the operation of, data processing apparatus. Alternatively or in addition, the program instructions can be encoded on an artificially-generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. A computer storage medium can be, or be included in, a computer-readable storage device, a computer-readable storage substrate, a random or serial access memory array or device, or a combination of one or more of them. Moreover, while a computer storage medium is not a propagated signal, a computer storage medium can be a source or destination of computer program instructions encoded in an artificially-generated propagated signal. The computer storage medium can also be, or be included in, one or more separate physical components or media (e.g., multiple CDs, disks, or other storage devices).
The operations described in this specification can be implemented as operations performed by a data processing apparatus on data stored on one or more computer-readable storage devices or received from other sources.
The term “data processing apparatus” encompasses all kinds of apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, a system on a chip, or multiple ones, or combinations, of the foregoing The apparatus can include special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit). The apparatus can also include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, a cross-platform runtime environment, a virtual machine, or a combination of one or more of them. The apparatus and execution environment can realize various different computing model infrastructures, such as web services, distributed computing and grid computing infrastructures.
A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language resource), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform actions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for performing actions in accordance with instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, a Global Positioning System (GPS) receiver, or a portable storage device (e.g., a universal serial bus (USB) flash drive), to name just a few. Devices suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
To provide for interaction with a user, embodiments of the subject matter described in this specification can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input. In addition, a computer can interact with a user by sending resources to and receiving resources from a device that is used by the user; for example, by sending web pages to a web browser on a user's client device in response to requests received from the web browser.
Embodiments of the subject matter described in this specification can be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), an inter-network (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks).
The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. In some embodiments, a server transmits data (e.g., an HTML page) to a client device (e.g., for purposes of displaying data to and receiving user input from a user interacting with the client device). Data generated at the client device (e.g., a result of the user interaction) can be received from the client device at the server.
While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular embodiments of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
Thus, particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous.
Under 35 U.S.C. §119, this application claims benefit of U.S. Provisional Application Ser. No. 61/453,463, filed Mar. 16, 2011, the entire contents of which are hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5463768 | Cuddihy | Oct 1995 | A |
5655081 | Bonnell | Aug 1997 | A |
5778444 | Langan | Jul 1998 | A |
5794224 | Yufik | Aug 1998 | A |
6148368 | DeKoning | Nov 2000 | A |
6178482 | Sollars | Jan 2001 | B1 |
6449671 | Patkar | Sep 2002 | B1 |
6477703 | Smith et al. | Nov 2002 | B1 |
6505211 | Dessloch | Jan 2003 | B1 |
6505248 | Casper | Jan 2003 | B1 |
6587866 | Modi | Jul 2003 | B1 |
6598179 | Chirashnya | Jul 2003 | B1 |
6643613 | McGee | Nov 2003 | B2 |
6829678 | Sawdon | Dec 2004 | B1 |
6891839 | Albert | May 2005 | B2 |
6898697 | Gao | May 2005 | B1 |
6996502 | De La Cruz | Feb 2006 | B2 |
7043455 | Cuomo | May 2006 | B1 |
7062718 | Kodosky | Jun 2006 | B2 |
7117243 | Peart | Oct 2006 | B2 |
7466703 | Arunachalam | Dec 2008 | B1 |
7478388 | Chen | Jan 2009 | B1 |
7500262 | Sanin | Mar 2009 | B1 |
7529836 | Bolen | May 2009 | B1 |
7584467 | Wickham et al. | Sep 2009 | B2 |
7596620 | Colton | Sep 2009 | B1 |
7650331 | Dean | Jan 2010 | B1 |
7653833 | Miller | Jan 2010 | B1 |
7761573 | Travostino | Jul 2010 | B2 |
7804862 | Olson | Sep 2010 | B1 |
7836285 | Giri | Nov 2010 | B2 |
8051414 | Stender et al. | Nov 2011 | B2 |
8065717 | Band | Nov 2011 | B2 |
8103771 | Tanaka | Jan 2012 | B2 |
8108903 | Norefors | Jan 2012 | B2 |
8146147 | Litvin | Mar 2012 | B2 |
8261295 | Risbood | Sep 2012 | B1 |
8276140 | Beda | Sep 2012 | B1 |
8296459 | Brandwine | Oct 2012 | B1 |
8407687 | Moshir et al. | Mar 2013 | B2 |
8423993 | Faus et al. | Apr 2013 | B2 |
8484353 | Johnson | Jul 2013 | B1 |
8504844 | Browning | Aug 2013 | B2 |
8533796 | Shenoy | Sep 2013 | B1 |
20020091902 | Hirofuji | Jul 2002 | A1 |
20020097747 | Kirkby | Jul 2002 | A1 |
20040139368 | Austen | Jul 2004 | A1 |
20040148484 | Watanabe | Jul 2004 | A1 |
20040210653 | Kanoor et al. | Oct 2004 | A1 |
20050010715 | Davies | Jan 2005 | A1 |
20050166011 | Burnett | Jul 2005 | A1 |
20050196030 | Schofield | Sep 2005 | A1 |
20050216659 | Ogawa | Sep 2005 | A1 |
20050237543 | Kikuchi | Oct 2005 | A1 |
20050257214 | Moshir et al. | Nov 2005 | A1 |
20050289499 | Ogawa | Dec 2005 | A1 |
20060026354 | Lesot | Feb 2006 | A1 |
20060048077 | Boyles | Mar 2006 | A1 |
20060048130 | Napier et al. | Mar 2006 | A1 |
20060059228 | Kasamsetty | Mar 2006 | A1 |
20060067236 | Gupta | Mar 2006 | A1 |
20060075199 | Kallahalla | Apr 2006 | A1 |
20060098618 | Bouffioux | May 2006 | A1 |
20060136676 | Park | Jun 2006 | A1 |
20060153099 | Feldman | Jul 2006 | A1 |
20060161753 | Aschoff | Jul 2006 | A1 |
20060271547 | Chen | Nov 2006 | A1 |
20070011361 | Okada | Jan 2007 | A1 |
20070112956 | Chapman | May 2007 | A1 |
20070118694 | Watanabe | May 2007 | A1 |
20070123276 | Parker | May 2007 | A1 |
20070177198 | Miyata | Aug 2007 | A1 |
20070199058 | Baumgart | Aug 2007 | A1 |
20070271604 | Webster | Nov 2007 | A1 |
20070280243 | Wray | Dec 2007 | A1 |
20080028389 | Genty et al. | Jan 2008 | A1 |
20080031324 | Hong | Feb 2008 | A1 |
20080086515 | Bai | Apr 2008 | A1 |
20080095176 | Ong | Apr 2008 | A1 |
20080107112 | Kuo | May 2008 | A1 |
20080205415 | Morales | Aug 2008 | A1 |
20080208681 | Hammad | Aug 2008 | A1 |
20080215796 | Lam | Sep 2008 | A1 |
20080222246 | Ebling | Sep 2008 | A1 |
20080222375 | Kotsovinos | Sep 2008 | A1 |
20080244030 | Leitheiser | Oct 2008 | A1 |
20080244471 | Killian | Oct 2008 | A1 |
20080250407 | Dadhia | Oct 2008 | A1 |
20080270704 | He | Oct 2008 | A1 |
20080304516 | Feng | Dec 2008 | A1 |
20080307258 | Challenger | Dec 2008 | A1 |
20090097657 | Scheidt | Apr 2009 | A1 |
20090150629 | Noguchi | Jun 2009 | A1 |
20090199177 | Edwards | Aug 2009 | A1 |
20090222815 | Dake | Sep 2009 | A1 |
20090241108 | Edwards | Sep 2009 | A1 |
20090249440 | Platt | Oct 2009 | A1 |
20090276771 | Nickolov | Nov 2009 | A1 |
20090300605 | Edwards | Dec 2009 | A1 |
20090310554 | Sun | Dec 2009 | A1 |
20100017859 | Kelly | Jan 2010 | A1 |
20100023582 | Pedersen | Jan 2010 | A1 |
20100046426 | Shenoy | Feb 2010 | A1 |
20100057913 | DeHaan | Mar 2010 | A1 |
20100071035 | Budko | Mar 2010 | A1 |
20100088335 | Mimatsu | Apr 2010 | A1 |
20100095000 | Kettler | Apr 2010 | A1 |
20100199089 | Vysogorets | Aug 2010 | A1 |
20100212004 | Fu | Aug 2010 | A1 |
20100217927 | Song | Aug 2010 | A1 |
20100235649 | Jeffries | Sep 2010 | A1 |
20100274984 | Inomata | Oct 2010 | A1 |
20100287548 | Zhou | Nov 2010 | A1 |
20100293285 | Oishi | Nov 2010 | A1 |
20100303241 | Breyel | Dec 2010 | A1 |
20110010483 | Liljeberg | Jan 2011 | A1 |
20110022812 | Van der Linden | Jan 2011 | A1 |
20110055361 | Dehaan | Mar 2011 | A1 |
20110078363 | Yeh | Mar 2011 | A1 |
20110153838 | Belkine | Jun 2011 | A1 |
20110191485 | Umbehocker | Aug 2011 | A1 |
20110191768 | Smith | Aug 2011 | A1 |
20110231280 | Farah | Sep 2011 | A1 |
20110258441 | Ashok | Oct 2011 | A1 |
20120060018 | Shinde | Mar 2012 | A1 |
20120063458 | Klink | Mar 2012 | A1 |
20120179796 | Nagaraj | Jul 2012 | A1 |
20120185688 | Thornton | Jul 2012 | A1 |
20120191912 | Kadatch | Jul 2012 | A1 |
20120215050 | Hu | Aug 2012 | A1 |
20120233678 | Pal | Sep 2012 | A1 |
20120233705 | Boysen | Sep 2012 | A1 |
20120240135 | Risbood | Sep 2012 | A1 |
20120246637 | Kreeger | Sep 2012 | A1 |
20120266159 | Risbood | Oct 2012 | A1 |
20130081014 | Kadatch | Mar 2013 | A1 |
20130227303 | Kadatch | Aug 2013 | A1 |
20130262405 | Kadatch | Oct 2013 | A1 |
Number | Date | Country |
---|---|---|
WO2011095516 | Aug 2011 | WO |
Entry |
---|
Moller, Jan, et al., “Internal Network Security”, Feb. 1, 2000-May 18, 2001, Retrieved from the Internet: <URL: http://www.daimi.au.dk/˜fwiffo/thesis/>, 183 pages. |
Primet, Pascale, et al.., “HIPCAL: State of the Art of OS and Network virtualization solutions for Grids”, Sep. 14, 2007, 38 pages. |
Abdull, AlastairIrvine, et al. “Generic Routing Encapsulation”, [online] [retrieved on Jan. 4, 2011]. Retrieved from the Internet: <URL: http:/ / creativecommons.org/licenses/by-sa/ 3. 0/>, 5 pages. |
Farinacci et al., “RFC 2784: Generic Routing Encapsulation (GRE)”, Mar. 2000, The Internet Society, 10 pages. |
Kent et al., “RFC 4301: Security Architecture for the Internet Protocol”, Dec. 2005, The Internet Society, 102 pages. |
Wikipedia, “Domain Name System”. [online] [Retrieved on Feb. 4, 2012]. Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Domain—Name—System>, 13 pages. |
Bucket Explorer. “What is my AWS Access and Secret Key.” [Retrieved Apr. 4, 2011]. Retrieved from the Internet <URL: http://www.bucketexplorer.com/documentation/amazon-s3-what-is-my-aws-access-and-secret-key.html>, 1 page. |
Hongkiat. “Amazon S3—The Beginner's Guide.” [Retrieved on Apr. 26, 2011]. Retrieved from the Internet <URL: http:// www.hongkiat.com/blog/amazon-s3-the-beginners-guide/>, 9 pages. |
Myerson, Judith. “Creating Applications with Amazon EC2 and S3.” O'ReillyOnLamp.com, May 13, 2008 [Retrieved on Apr. 26, 2011]. Retrieved from the Internet <URL: http://onlamp.com/pub/a/onlamp/2008/05/13/creating-applications-with-amazon-ec2-and-s3.html>, 8 pages. |
Wikipedia. “OAuth.” [online] [Retrieved on Jan. 20, 2011]. Retrieved from the Internet <URL: http://en.wikipedia.org/wiki/OAuth>, 3 pages. |
Gowalla. “API Documentation—Oauth.” [Retrieved on Apr. 26, 2011]. Retrieved from the Internet <URL: http://gowalla.com/api/docs/oauth>, 4 pages. |
Apache HTTP Server Version 2.0. “Log Files.” [Retrieved on Feb. 15, 2011]. Retrieved from the Internet <URL: http://httpd.apache.org/docs/2.0/logs.html>, 7 pages. |
Microsoft Support. “How to view and manage event logs in Event Viewer in Windows XP.” May 7, 2007, version 3.5 [Retrieved on Feb. 15, 2011]. Retrieved from the Internet <URL: http://support.microsoft.com/kb/308427>, 6 pages. |
MSDN. “Visual Basic Concepts, Visual Studio 6.0: Centralized Error Handling.” [Retrieved on Feb. 15, 2011]. Retrieved from the Internet <URL: http://msdn.microsoft.com/en-us/library/aa240795(d=printer, v=vs.60).aspx>, 4 pages. |
Laitinen, Aapo et al., Network Address Translation [Retrieved on Oct. 10, 2011] Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Networkpages—Address—and—Port—Translation>, 11 pages. |
Wikipedia., Anycast [Retrieved on Oct. 10, 2011] Retrieved from the Internet: URL<http://en.wikipedia.org/wiki/Anycast>, 5 pages. |
VMCI Overview [Retrieved on Jun. 8, 2011] Retrieved from the Internet: <URL: http://pubs.vmware.com/vmci-sdk/VMCI—intro.html>, 3 pages. |
VMware vSphere [Retrieved on Jun. 8, 2011] Retrieved from the Internet: <URL: http://www.vmware.com/products/vmotion/overview.html>, 2 pages. |
Travostino, Franco, et al., Seamless Live Migration of Virtual Machines over the MAN/WAN, 2006, Elsevier Future Generation Computer Systems 2006, 10 pages. |
VMCI Datagram API [Retrieved on Jun. 8, 2011], Retrieved from the Internet: <URL: http://pubs.vmware.com/vmci-sdk/datagram.html>, 1 page. |
VMCI Datagram—SendTo [Retrieved on Jun. 8, 2011], Retrieved from the Internet: <URL: http://pubs.vmware.com/vmcisdk/functions/VMCIDatagram—SendTo.html>, 1 page. |
VMCIDs—Lookup [Retrieved on Jun. 8, 2011], Retrieved from the Internet: <URL: http://pubs.vmware.com/vmci-sdk/functions/VMCIDs—Lookup.html>, 2 pages. |
Chen, Per M., et al., : “Maximizing Performance in a Striped Disk Array”, 17th Annual International Symposium on Computer Architecture (SIGARCH 1990), 18 pages. |
Sarhan, Nabil J., et al., “Caching and Scheduling in NAD-Based Multimedia Servers”; IEEE Computer Society, IEEE Transactions on Parallel and Distributed Systems, vol. 15, No. 10, Oct. 2004; pp. 921-933. |
Vazhkudai, Sudharshan S., et al.; “Constructing Collaborative Desktop Storage Caches for Large Scientific Datasets”; ACM Journal Name, vol. V, No. N, Jun. 2006, 34 pages. |
OMG, Deployment and Configuration of Component-based Distributed Applications Specification—Version 4.0, OMG, 2006, pp. 1-160. |
Cala et al., “Automatic Software Deployment in the Azure Cloud”, IFIP International Federation for Information Processing, 2010, pp. 1-14. |
RSA Laboratories, “PKCS #11 v2.20: Cryptographic Token Interface Standard,” Jun. 28, 2004, RSA Security Inc. (407 pages). |
Amazon Auto Scaling—Getting Started Guide—API Version Aug. 1, 2010. Amazon Web Services LLC, 2010, 20 pages. |
Amazon Auto Scaling—Developer Guide—API Version Aug. 1, 2010. Amazon Web Services LLC, 2011, 62 pages. |
Amazon CloudWatch—Developer Guide—API Version Aug. 1, 2010. Amazon Web Services LLC, 2010, 75 pages. |
Benincosa. “Ganglia and Nagios, Part 2: Monitor enterprise clusters with Nagios-Install Nagios to effectively monitor a data center; make Ganglia and Nagios work together,” 2009, 20 pages. |
‘Nagios’ [online]. “Monitoring Linux/Unix Machines,” 2011, [retrieved on Feb. 3, 2011]. Retrieved from the Internet: URL: <http://nagios.sourceforge.net/docs/3—0/monitoring-linux.html > 1 page. |
‘Nagios’ [online]. “Nagios Plugins,” 2011, [retrieved on Feb. 3, 2011]. Retrieved from the Internet: URL: <http://nagios.sourceforge.net/docs/3—0/plugins.html > 2 pages. |
‘Zabbix’ [online]. “Zabbix 1.8: The Ultimate Open Source Monitoring Solution,” 2001-2012, [retrieved on Feb. 3, 2011]. Retrieved from the Internet: URL: < http://www.zabbix.com/features.php.> 1 page. |
Amazon Elastic Compute Cloud, User Guide, API Version Mar. 1, 2012, pp. 97-103, downloaded from http://docs.amazonwebservices.com/AWSEC2/latest/UserGuide/AESDG-chapter-instancedata.html?r=4276 on Mar. 18, 2012. |
Paravirtualization, Wikipedia Article, downloaded from http://en.wikipedia.org/wiki/Paravirtualization on Mar. 18, 2012. |
Paravirtualized File Systems, Eric Van Hensbergen, downloaded from http://www.slideshare.net/ericvh/9p-on-kvm on Mar. 18, 2012. |
“IPsec”. Creativecommons.org [online]. Creative Commons Attribution-Share Alike 3.0 Unported. [retrieved on Jan. 14, 2011]. Retrieved from the Internet:<URL: http://creativecommons.org/licenses/by-sa13.0/>, pp. 1-8. |
“Generic Routing Encapsulation”. Creativecommons.org [online]. Creative Commons Attribution-Share Alike 3.0 Unported. [retrieved on Jan. 14, 2011]. Retrieved from the Internet:<URL: http://creativecommons.org/licenses/by-sa/3.0/>, pp. 1-5. |
Cloud Computing Course, Part 2: Amazon's EC2, Marcel Gagne, Jun. 13, 2011. Retrieved from the Internet: <URL: http://marcelgagne.com/content/cloud-computing-course-part-2-amazons-ec2>, 6 pages. |
How to: Getting Started With Amazon EC2, Paul Stamatiou, Apr. 5, 2008. Retrieved from the Internet: <URL:http//paulstamatiou.com/how-to-getting-started-with-amazon-ec2>, 25 pages. |
Uploading Personal ssh Keys to Amazon EC2, Eric Hammond, Oct. 14, 2010. Retrieved from the Internet: <URL: http://alestic.com/2010/10/ec2-ssh-keys>, 3 pages. |
Key Management in Cloud Datacenters, Security Stackexchange.com, Retrieved from the Internet on Nov. 18, 2011; Retrieved from: <URL: http://security.stackexchange.com/questions/2514/key-management-in-cloud-datacenters>, 2 pages. |
Managing Amazon EC2—SSH Login and Protecting Your Instances, Everyday's Findings, Monday, May 18, 2009, Retrieved from the Internet on Nov. 18, 2011; Retrieved from: <URL: http://blog.taggesell.de/index.php?/aarchives/73-Managing-Amazon-EC2., 6 pages. |
Using and Managing AWS—Part 6: SSH Key Pairs, Top WordPress, May 26, 2009, Retrieved from the Internet: <URL: http://clouddb.info/2009/05/26/using-and-managing-aws-part-6-ssh-key-pairs>, 5 pages. |
Hyun, Ahn Ji, Authorized Officer for Korean Intellectual Property Office, International Search Report and Written Opinion for PCT/US2012/021846, International Search Report completed May 25, 2012, 8 pages. |
Na, Lee Da, Authorized Officer for Korean Intellectual Property Office, International Search Report and Written Opinion for PCT/US2012/020954, International Search Report completed Aug. 23, 2012, 10 pages. |
Alpern, B., “The Jalapeno virtual machine,” IBM Systems Journal, Jan. 2000, vol. 39, Issue 1, pp. 211-238. |
Bok, Jin Yo, Authorized Officer for Korean Intellectual Property Office, International Search Report and Written Opinion for PCT/US2012/029210, International Search Report completed Oct. 10, 2012, 2 pages. |
Anonymous, Storage I/O Control Technical Overview and Consideration for Deployment VMware vSphere™ 4.1, Jan. 1, 2010, XP05504491, retrieved from the internet: URL: http://www.vmware.com/fled/pdf/techpaper/WMW-vSphere41-SIOC.pdf; [retrieved on Nov. 21, 2012], the entire document. |
Cabellos et al., LISPmob: Mobile Networking through LISP, Apr. 2, 2012, 8 pages. |
Steinmetz, Christ of, Authorized Office for European Patent Office, International Search Report and Written Opinion for PCT/US2013/034140, completed Jun. 25, 2013, 21 pages. |
Hehn, Eva, Authorized Office for European Patent Office, International Search Report and Written Opinion for PCT/US2013/027456, completed Jun. 24, 2013,11 pages. |
Eng, Lili, Australian Government, IP Australia, Examiner's First Report for 2012200562, dated Jun. 4, 2012, 2 pages. |
Wikipedia, “IPSec”, [online] [retrieved on Jan. 4, 2011]. Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/IPsec/>, 8 pages. |
Number | Date | Country | |
---|---|---|---|
61453463 | Mar 2011 | US |