×

Method and computing system for transparence computing on the computer network

  • US 7,467,293 B2
  • Filed: 07/19/2005
  • Issued: 12/16/2008
  • Est. Priority Date: 11/12/2004
  • Status: Active Grant
First Claim
Patent Images

1. A self-organizing method for server clusters in a system based on transparence computing, the system comprising clients and servers distributed randomly on computer networks, wherein the clients are network computers, PDAs, home appliances or mobile terminals, wherein said client has no preinstalled OS, 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 network computer server (MNCS) and some slave network computer servers (SNCSs), a client can only be served by a server in the server 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 serversStep II if the server has not received any heart-beating signal for a 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;

    wherein;

    if the 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 the MNCS fails to contact the SNCS after a certain number of attempts, the MNCS removes the SNCS from the cluster;

    if the SNCS has not received any heart-beating signal for a time interval of Td, the SNCS 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, the SNCS 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, the SNCS then makes a delay, and if any heart-beating signal is received during the delay, the SNCS confirms itself as a SNCS, and ends the processing, otherwise going to step 1.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×