Method and apparatus for making a computational service...

Electrical computers and digital processing systems: multicomput – Distributed data processing – Client/server

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S219000

Reexamination Certificate

active

07401114

ABSTRACT:
The present invention provides a method and apparatus for making a computational service highly available in a multiple server computer environment. In the thin client computing paradigm, end user terminals rely on remote server computers for operation of most functions traditionally associated with personal computing. If the remote server computer fails, all of the users' computers will likewise fail. The present invention provides a solution by implementing a redundant server strategy and a redirection process. One or more servers hosting a communication to the terminal do not contain the only copy of permanent user data. This makes all session hosting servers interchangeable. If a server fails, the failure is detected and the terminal switches to another host server.

REFERENCES:
patent: 5491752 (1996-02-01), Kaufman et al.
patent: 5590199 (1996-12-01), Krajewski et al.
patent: 5602918 (1997-02-01), Chen et al.
patent: 5633999 (1997-05-01), Clowes et al.
patent: 5796999 (1998-08-01), Azagury et al.
patent: 5828847 (1998-10-01), Gehr et al.
patent: 5835724 (1998-11-01), Smith
patent: 5870546 (1999-02-01), Kirsch
patent: 5875306 (1999-02-01), Bereiter
patent: 5938732 (1999-08-01), Lim et al.
patent: 5951694 (1999-09-01), Choquier et al.
patent: 5987621 (1999-11-01), Duso et al.
patent: 6018805 (2000-01-01), Ma et al.
patent: 6023762 (2000-02-01), Dean et al.
patent: 6070191 (2000-05-01), Narendran et al.
patent: 6195680 (2001-02-01), Goldszmidt et al.
patent: 6199110 (2001-03-01), Rizvi et al.
patent: 6226744 (2001-05-01), Murphy et al.
patent: 6279001 (2001-08-01), DeBettencourt et al.
patent: 6381650 (2002-04-01), Peacock
patent: 2002/0120763 (2002-08-01), Miloushev et al.
patent: 2003/0037160 (2003-02-01), Wall et al.
patent: WO 97/15885 (1997-05-01), None
patent: WO 01/63402 (2001-08-01), None
About clustering technology in WebLogic BEA WebLogic Server 4.5, Aug. 1999, pp. 1-7.
Host Configuration and Robustness in the Internet Protocol version 6, Lesiuk, B.C., Aug. 1998, pp. 1-18.
Network Working Group, Request for Comments (Draft): DHCP Safe Failover Protocol, Kinnear, K., Sep. 1998, pp. 1-29.
Network Working Group, Request for Comments (1541/1531): Dynamic Host Configuration Protocol, Droms, R., Oct. 1993, pp. 1-39.
SWEB: Towards a scalable WWW Server on Multicomputers, Andresen, et. al., Dept. Comp. Science, Univ. of California, 1996, pp. 1-7.
LDD Today, Lotus Domino Advanced Services High Availability, Smelser, C., Jan. 1997, pp. 1-5.
The Design and Architecture of the Microsoft Cluster Service, A Practical Approach to High-Availability and Scalability, Vogels, et. al., Proceedings of FTCS'98, Jun. 1998 in Munich, Germany, IEEE, pp. 1-10.
Microsoft Windows NT, Server Cluster Strategy, High Availability and Scalability with Industry-Standard Hardwar, Business Systems Div., 1995, pp. 1-9.
High Availability and Scalability with Domino Clustering and Partioning an AIX, by Barrios, Conradsen, Haramoto & Marin, International Technical Support Organization, http://www.redbooks.ibm.com, SG24-5163-00, pp. 1-182.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for making a computational service... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for making a computational service..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for making a computational service... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2797979

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.