Patent Grant
7260596
This application claims priority from UK patent application GB2354090 which is currently pending. Pending Japanese patent application JP2001147907 also claims priority form this UK patent application.
1. Field of the Invention
The invention relates to a computer network comprising a plurality of interconnected stations, more especially to the distribution of tasks between stations of a network in order to improve performance of the stations as viewed as a whole.
2. Description of the Prior Art
In a computer network, each station, node or terminal will have its own tasks to perform. It is also the case that, in use, there will wide fluctuations in usage across the stations. Because of this, various schemes have been developed to increase the performance of a station by utilising spare capacity in other stations of the network that may otherwise lie idle. The present invention relates to one such scheme.
According to a first aspect of the invention there is provided a station for a network apparatus comprising the station and a plurality of other stations, all interconnected by a communication link, the station comprising:
a network connection;
a self assessment module operable to determine a current status of the station, wherein the current status is a measure of the stations available resources;
a trust list that includes a station identifier for the or each other station which is designated as trusted to perform tasks for the station;
a broadcast unit operable to transmit service requests to the network connection and onto the network, the service requests being directed to the or each other station identified in the trust list and constituting a request to the or each other station to perform a task for the station; and
an answer unit operable to receive service requests from the network through the network connection and, in response thereto, to transmit to the network through the network connection an acceptance or refusal message in respect of the service request, the acceptance or refusal being decided having regard to the current status of the station, as determined by the self assessment module.
According to a second aspect of the invention there is provided a method of distributing tasks in a network comprising a plurality of stations, all interconnected by respective network connections to a communication link, the method comprising:
transmitting a service request by a first station to its network connection and onto the network, the service request being directed to a trusted sub-group of the stations and specifying a task to be performed; and
receiving the service request by a second station, that is one of the trusted sub-group of stations, through its network connection and, in response thereto, transmitting to the network through its network connection an acceptance or refusal message in respect of the service request, the acceptance or refusal being decided having regard to the current status of the second station, as determined by a self assessment of the second station; and
carrying out the task specified in the service request by the second station and returning a service result to the first station.
According to an embodiment of the invention there is provided a distributed artificial intelligence service provider (DAISP) for a station according to the first aspect of the invention. This will be beneficial for both broadcasters and service providers, since many if not most applications should be network based nowadays.
The basic idea of DAISP is to make use of all available computer power in a networked environment and not to affect local users' activities. Distribution should be done whenever and wherever needed in a straightforward, effective, and simple way.
The DAISP is a normal user level application. It does NOT require anything special from an existing operating system. In a Unix situation, it will run as long as the user has a valid account. In the Microsoft NT case, it will run on a normal NT workstation and it does not require special libraries apart from the Winsock.dll which is needed for networking under NT.
The DAISP architecture is not a client/server architecture. There is no central server for the service so that there is no single point failure in the system. It is a network where individuals serve others on a trust basis, and themselves if necessary. At some times, the stations work together to produce harmonious performance. Individuals use the network as a stage to play on, to serve others, and to communicate/monitoring. It is possible for a station not to provide any service to others. In this case, it is a customer/listener only station. However, such a station is still part of the architecture.
The above and other objects, features and advantages of the invention will be apparent from the following detailed description of illustrative embodiments which is to be read in conjunction with the following drawings in which:
It is envisaged that a typical home network will have connected to it a disparate collection of stations, each having different computing capabilities. For example, it may be expected that the personal computers 102 and 114 will have relatively powerful general processing and memory capabilities, whereas the digital video camera 116 and television 100 may have relatively powerful image processing capabilities.
Moreover, it is envisaged that some of the stations will be transient elements in the system in that they will be plugged in and out as “plug-and-play” devices, i.e. devices that are automatically configurable in the network. For example, the lap-top computer 114, and the digital camera 116 will be connected to the home network only sporadically.
The broadcast/answer module 12 is shown in its station environment in
The broadcast/answer module 12 is the module to broadcast service requirements to the network. The requirement can be anything related to the task it is performing. For example, if a station wants to take on a task since it is the most suitable station to do the job, but found that there was a software module missing in its library, it could then broadcast the requirement for the piece of software.
As shown in
The self assessment module 14 is illustrated in
The self assessment module 14 provides two kinds of self assessment or self evaluation, namely self assessment based on static status and self assessment based on dynamic status. The status information is held in respective status units 40 and 42. The status is evaluated by a status evaluation unit 44. The self assessment module 14 is connected to the broadcast/answer module 12 by a link 15. In response to a status request from the broadcast/answer module 12, the station status is evaluated by the status evaluation unit 44 and a result returned by the link 15. The status request may be prompted, for example, by receipt of a request from a trusted remote station for resources.
The static status information is held in a static status unit 40 and includes:
The dynamic status information is held in the dynamic status unit 42 and includes:
Static status takes relatively long time to complete. It generally needs to be done only once when the DAISP is up and running first time after a hardware update. It is then saved as a file which can be used when needed. Dynamic status has very short life time, i.e. it is out of date soon after it is obtained. It will be obtained periodically and dispatched if needed immediately.
The system security module 16 guards a station running DAISP by every means. It can prevent answering malicious requirements and unreasonable task execution requirements. It can use encryption to protect the communication between stations. Normally, this is done on a trust basis, as defined by a trust list held in and for each station. The trust list is a list of the station identifiers of those other stations which are permitted to pool tasks with the station concerned. That is, the trust list is a list of other stations which the station concerned will transmit broadcast requests to and will be prepared to consider answering broadcast requests from.
In the example of the home system, there may be a number of personal computers used by different family members. Personal computers of children, for example, could be excluded from trust lists to reduce the virus hazard.
If a station is trusted in the DAISP, it will have the right to access whatever it can access under the operating system's discretion. For example, if a DAISP is run by a normal user (compared with privileged user), it will have access to the resources which a normal user can access.
In the case of a normal UNIX box, it will have access to the user's own quota controlled hard disk, user ID priority governed CPU usage, etc.
In a Microsoft NT environment, a normal user will have the right to access all shared hard disks on the network and user ID priority governed CPU usage. Care must be taken in the Microsoft case since a normal user has access to the network wide shared disks.
The task execution, monitoring, reporting module 18 takes on a task and starts execution if necessary. It will broadcast status to the network. The purpose of doing this is that if the station fails in the middle of the execution, others will know about the task and its progress and take over. For example, if station α started a service and put up a message onto the network saying that “I am doing the task, it should finish by 21:10:35 and this information is updated at 21:10:10, and next update will be at 21:10:20”, if it fails to update the message at 21:10:21, everybody on the network knows that something unexpected happened to α, then the capable station at the time can take on the task and inform the network about its action. This will guarantee the quality of the service.
The task scheduler module 20 maintains a tasks' and stations' priority scheme which governs the task execution priority in the station. It will monitor all tasks in the station including local tasks, which are the tasks initiated locally and foreign tasks, which are created by remote DAISP users. For example, if a local user starts a task, say Microsoft word, the Task scheduler module has to act quickly to suspend some of the foreign tasks in order to release enough resources, say CPU power, back to the local resources pool. It will guarantee that the local user will not be affected by any foreign tasks running in the machine. That will encourage users to participate the DAISP scheme.
The service requirement analysis module 22 does extra work after finishing a service and provides information about performance and possible improvement. It maintains the redistributable software resource repository 32 inside of the station. For example, if a software module was not used for a long time, it can ask others to have it. If nobody wants it, it can put it into a software dump place. If it finds out there exists a new version of a software, it can update the software collection of the station by grabbing it through internet and let other station know it.
The service/performance history learning analysis module 24 is concerned with the history of the station. Its main task is to optimise the station so that it can service the network better. It will try to find bottlenecks for different tasks and will bring these to the attention of the system administrators if it can not solve it itself.
The task failure management module 26 deals with both failure of itself and other stations in the network. If it fails to do something, it will put a requirement up to the network for solution. If it found somebody else's failure such as mentioned in the “Task execution, monitoring, reporting module” section, it will see whether it can take on the task. If it can, it will broadcast the response and wait a while for answers. If nobody answers before timeout, it will start to continue the services.
The assistance service module 28 works as a bridge to other modules, for example, as a intermediate delivery station for a long distance material transfer. Or, it can be treated as sub-service to other service stations.
The service modules 30 are the modules that do the actual service jobs. they can be any services such as AI service for user habit catching, analysis and predicting, video streaming services, streaming convergence services, etc. Certain service modules can be inside of “Redistributable software resource repository”. They could be relocated to somewhere else in order to serve customers better.
A Distributed AI Service Provider (DAISP) based on the above-described distributed system architecture and a Linux operating system has been designed and implemented. It can be put on to one bootable floppy disk for machines which have sufficient memory to operate it. It can do distributed AI servicing without waste of hardware resources. Learning and predicting requirements from clients can be dealt with seamlessly, i.e. the DAISP provides a Plug-and-Play type of service. Testing has been done by using multiple PCs, such as dual Pentium II 400 with 256 Mb RAM. The whole system functioned as expected and execution time for learning and predicting was nearly linearly reduced as more DAISPs were put into service.
The DAISP provides a good solution for many networked applications, for example as a host to an AI engine. The distributed system architecture can provide a more robust and reliable service in many areas.
There follows a set of data defining structures and protocols of an exemplary embodiment of a distributed service provider:
Although illustrative embodiments of the invention have been described in detail herein with reference to the accompanying drawings, it is to be understood that the invention is not limited to those precise embodiments, and that various changes and modifications can be effected therein by one skilled in the art without departing from the scope and spirit of the invention as defined by the appended claims.
Embodiments of the invention described above are implemented, at least in part, using software-controlled data processing apparatus, so it will be appreciated that a computer program providing such software control and a transmission or storage medium by which such a computer program is stored are envisaged as aspects of the present invention.
| Number | Date | Country | Kind |
|---|---|---|---|
| 9921233.4 | Sep 1999 | GB | national |
| Number | Name | Date | Kind |
|---|---|---|---|
| 4466063 | Segarra et al. | Aug 1984 | A |
| 4969146 | Twitty et al. | Nov 1990 | A |
| 5034882 | Eisenhard et al. | Jul 1991 | A |
| 5151990 | Allen et al. | Sep 1992 | A |
| 5555376 | Theimer et al. | Sep 1996 | A |
| 5603054 | Theimer et al. | Feb 1997 | A |
| 5619657 | Sudama et al. | Apr 1997 | A |
| 5978940 | Newman et al. | Nov 1999 | A |
| 6085216 | Huberman et al. | Jul 2000 | A |
| 6250557 | Forslund et al. | Jun 2001 | B1 |
| 6256664 | Donoho et al. | Jul 2001 | B1 |
| 6279112 | O'Toole et al. | Aug 2001 | B1 |
| 6356929 | Gall et al. | Mar 2002 | B1 |
| 6408336 | Schneider et al. | Jun 2002 | B1 |
| 6463457 | Armentrout et al. | Oct 2002 | B1 |
| 6466978 | Mukherjee et al. | Oct 2002 | B1 |
| 6473794 | Guheen et al. | Oct 2002 | B1 |
| 6532368 | Hild et al. | Mar 2003 | B1 |
| 6598067 | Wydra et al. | Jul 2003 | B1 |
| 6665716 | Hirata et al. | Dec 2003 | B1 |
| 6757903 | Havemose | Jun 2004 | B1 |
| 7162525 | Cofta et al. | Jan 2007 | B2 |
| 20030055890 | Senda | Mar 2003 | A1 |
| Number | Date | Country |
|---|---|---|
| 9815903 | Apr 1998 | WO |
| WO9815903 | Apr 1998 | WO |
