server transmits the mirror to the client
iv. the requesting client downloads and loads the mirror, listening to file transmission requests and sending a download request for initial applications to the server
v. after receiving the file request for initial applications from the requesting client, the server designates for the requesting client the transmitting clients which can provide the needed files according to the distribution information of the initial application file on the network;
vi. the requesting client sends file transmission requests to the transmitting clients and accomplishes file transmission
vii. after downloading the file, the requesting client sends an update message to the server notifying that a copy of the file has been saved
viii. after downloading the file, the application will be loaded by the requesting client if all requiring files are available;
ix. if all initial applications of a requesting client have already been loaded, then the booting procedure of the client is finished.
8. The client-booting method according to
9. The client-booting method according to
10. The client-booting method according to
11. The client-booting method according to
12. The self-organizing method for server clusters in the system based on the transparence computing, the system comprising clients and servers distributed randomly on computer networks, wherein the said client has no preinstalled OS, the said server stores all the OS kernel mirrors and initial applications for booting the client, all the servers on the same broadcast-reachable network belong to one server cluster, a server cluster consists of one master NC server MNCS and some slave NC servers, a client can only be served by a server in the cluster, and servers of the system self-organize themselves into server clusters according to the following steps:
Step I starting a process that is responsible for listening to messages from other servers
Step II if the server has not received any heart-beating signal for the time interval of Td, it affirms itself as the MNCS in the cluster, starting to broadcast the heart-beating signal to the network periodically and listening to service requests from clients, wherein Td is a timed value of the heart-beating period;
otherwise it affirms itself as a SNCS, and starts to listen to service requests from clients;
the SNCS sends a reflective signal to the MNCS when receiving a heart-beating signal;
Step III when receiving the first reflective signal from a SNCS, the MNCS adds it to the cluster;
the MNCS dynamically maintains the status information of the server cluster according to status information in the SNCS' reflective signal.
13. The self-organizing method according to
14. The self-organizing method according to
if the said MNCS has not received any reflective signal from a SNCS for a time interval of Td, it will try to contact the SNCS, and if failed after certain number of attempts, the MNCS removes the SNCS from the cluster;
if SNCS has not received any heart-beating signal for a time interval of Td, it will perform the following steps
Step 1 broadcasting a contesting signal.
Step 2 if any heart-beating signal broadcasted by the MNCS is received in a time period of Td, the processing is then ended;
Step 3 otherwise, if no contesting signal from other SNCS is received during the same period, it then upgrades itself as the MNCS, initiates the cluster status information with its own binding client status information, starts to broadcast heart-beating signal to the network, and ends the processing.
Step 4 if any contesting signal was received from other SNCS during the same period, it then makes a delay, and if any heart-beating signal is received during the delay, it confirms itself as a SNCS, and ends the processing, otherwise going to step 1.
15. The self-organizing method according to
if a MNCS A receives a collision indication signal from another MNCS B, then A compares the number of servers in its cluster with that of B's. If the A has servers no less than B does, A adds information of B's cluster into it