Short-cut response for distributed services

Electrical computers and digital processing systems: multicomput – Remote data accessing – Accessing a remote server

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S223000, C709S224000, C709S228000, C709S238000, C709S229000, C709S227000, C709S240000, C709S225000, C709S226000, C370S254000, C370S357000, C726S003000, C726S004000, C726S009000, C726S014000

Reexamination Certificate

active

07627650

ABSTRACT:
The systems and methods described herein include methods for providing resources over a data network. The methods may be embodied as processes operating on a computer server, wherein that server comprises a plurality of server platforms, each of which are truly equivalent in that each provides a functionally equivalent interface to a client. In one practice of the invention, a method responds to client requests by detecting a request from a client for access to a resource and by establishing a connection for communicating with the client. The method then identifies a server available for servicing the detected request, and determines whether state information is associated with the connection. The method then, grants the identified server with access to the state information and allows the identified server to create and transmit a response to the client, also allowing the identified server to update the state information.

REFERENCES:
patent: 5392244 (1995-02-01), Jacobson et al.
patent: 5774660 (1998-06-01), Brendel et al.
patent: 5774668 (1998-06-01), Choquier et al.
patent: 5978844 (1999-11-01), Tsuchiya et al.
patent: 6070191 (2000-05-01), Narendran et al.
patent: 6108727 (2000-08-01), Boals et al.
patent: 6122681 (2000-09-01), Aditya et al.
patent: 6128279 (2000-10-01), O'Neil et al.
patent: 6141688 (2000-10-01), Bi et al.
patent: 6144848 (2000-11-01), Walsh et al.
patent: 6148414 (2000-11-01), Brown et al.
patent: 6189079 (2001-02-01), Micka et al.
patent: 6195682 (2001-02-01), Ho et al.
patent: 6199112 (2001-03-01), Wilson
patent: 6212565 (2001-04-01), Gupta
patent: 6212606 (2001-04-01), Dimitroff
patent: 6226684 (2001-05-01), Sung et al.
patent: 6292181 (2001-09-01), Banjerjee et al.
patent: 6341311 (2002-01-01), Smith et al.
patent: 6360262 (2002-03-01), Guenthner et al.
patent: 6421723 (2002-07-01), Tawil
patent: 6434683 (2002-08-01), West et al.
patent: 6460083 (2002-10-01), Niwa et al.
patent: 6473791 (2002-10-01), Al-Ghosein et al.
patent: 6498791 (2002-12-01), Pickett et al.
patent: 6598134 (2003-07-01), Ofek et al.
patent: 6687731 (2004-02-01), Kavak
patent: 6725253 (2004-04-01), Okano et al.
patent: 6732171 (2004-05-01), Hayden
patent: 6742059 (2004-05-01), Todd et al.
patent: 6766348 (2004-07-01), Combs et al.
patent: 6813635 (2004-11-01), Jorgenson
patent: 6850982 (2005-02-01), Siegel
patent: 6859834 (2005-02-01), Arora et al.
patent: 6886035 (2005-04-01), Wolff
patent: 6910150 (2005-06-01), Mashayekhi et al.
patent: 6944777 (2005-09-01), Belani et al.
patent: 6950848 (2005-09-01), Yousefi'zadeh
patent: 6957433 (2005-10-01), Umberger et al.
patent: 6985956 (2006-01-01), Luke et al.
patent: 7043564 (2006-05-01), Cook et al.
patent: 7076555 (2006-07-01), Orman et al.
patent: 7085829 (2006-08-01), Wu et al.
patent: 7089293 (2006-08-01), Grosner et al.
patent: 7127577 (2006-10-01), Koning et al.
patent: 2001/0039581 (2001-11-01), Deng et al.
patent: 2002/0008693 (2002-01-01), Banerjee et al.
patent: 2002/0009079 (2002-01-01), Jungck et al.
patent: 2002/0010783 (2002-01-01), Primak et al.
patent: 2002/0035667 (2002-03-01), Brunning
patent: 2002/0059451 (2002-05-01), Haviv
patent: 2002/0065799 (2002-05-01), West et al.
patent: 2002/0138551 (2002-09-01), Erickson
patent: 2002/0194324 (2002-12-01), Guha
patent: 2003/0005119 (2003-01-01), Mercier et al.
patent: 2003/0074596 (2003-04-01), Mashayekhi et al.
patent: 2003/0117954 (2003-06-01), De Neve et al.
patent: 2003/0225884 (2003-12-01), Hayden
patent: 2004/0030755 (2004-02-01), Koning et al.
patent: 2004/0044771 (2004-03-01), Allred et al.
patent: 2004/0049564 (2004-03-01), Ng et al.
patent: 2004/0080558 (2004-04-01), Blumenau et al.
patent: 2004/0083345 (2004-04-01), Kim et al.
patent: 2004/0103104 (2004-05-01), Hara et al.
patent: 2004/0128442 (2004-07-01), Hinshaw et al.
patent: 2004/0143637 (2004-07-01), Koning et al.
patent: 2004/0153606 (2004-08-01), Schott
patent: 2004/0210724 (2004-10-01), Koning et al.
patent: 2004/0215792 (2004-10-01), Koning et al.
patent: 2005/0010618 (2005-01-01), Hayden
patent: 2005/0144199 (2005-06-01), Hayden
patent: 2007/0106857 (2007-05-01), Koning et al.
patent: WO 99/53415 (1999-10-01), None
patent: WO 01/38983 (2001-05-01), None
patent: WO 02/37943 (2002-05-01), None
patent: WO 02/44885 (2002-06-01), None
patent: WO 02/056182 (2002-07-01), None
Scheuermann P et al: “Data Partitioning And Load Balancing In Parallel Disk Systems” Techn. Rpt. A/02/96 University Of Saarland. pp. 1-48.
Wei Lui et al: “Design of an I/O balancing file system on web server clusters” Parallel Processing 2000 Intern. Workshops On Aug. 21-24, 2000, Piscataway, NJ, USA, IEEE, Aug. 21, 2000, pp. 119-125.
Anderson T E et al: “Serverless Network File Systems” ACM Transactions On Computer Systems, Assoc. For Computing Machinery, New York, US, vol. 14, No. 1, pp. 41-79, Feb. 1, 1996.
Hac A et al: IEEE: “Dynamic load balancing in a distributed system using a decentralized algorithm” Int. Conf. On Distributed Computing Systems, West Berlin, Sep. 21, 1987. Conf. Proceedings vol. 7, pp. 170-177.
Hartman J H et al: “The Zebra Striped Network File System” Operating Review (SIGOPS), ACM Headquarter New York, US vol. 27, No. 5, Dec. 1, 1993, pp. 29-43.
U.S. Appl. No. 60/411,743, filed Sep. 2002, Hinshaw et al.
Office Action dated Feb. 15, 2006 in U.S. Appl. No. 10/217,118, and subsequent reply.
Office Action dated Aug. 10, 2006 in U.S. Appl. No. 10/217,118, and subsequent reply.
Office Action dated Apr. 10, 2007 in U.S. Appl. No. 10/217,118, and subsequent reply.
Office Action dated Mar. 10, 2006 in U.S. Appl. No. 10/762,984, and subsequent reply.
Office Action dated Aug. 18, 2006 in U.S. Appl. No. 10/762,984, and subsequent reply.
Office Action dated Mar. 21, 2007 in U.S. Appl. No. 10/762,984, and subsequent pre-appeal brief.
Office Action dated May 31, 2006 in U.S. Appl. No. 10/347,898, and subsequent reply.
Office Action dated Oct. 16, 2006 in U.S. Appl. No. 10/347,898, and subsequent reply.
Office Action dated Mar. 14, 2006 in U.S. Appl. No. 10/761,884, and subsequent reply.
Office Action dated Oct. 20, 2006 in U.S. Appl. No. 10/761,884, and subsequent reply.
Office Action dated May 22, 2007 in U.S. Appl. No. 10/761,884, and subsequent reply.
Office Action dated Feb. 20, 2007 in U.S. Appl. No. 10/76,985, and subsequent reply.
Office Action dated Aug. 9, 2007 in U.S. Appl. No. 10/76,985, and subsequent reply.
Baltazar, H. And Garcia, A. Build Your Own SAN (2002).
Druschel, P., Rice University and Rowstron, A., Microsoft Reseach, Cambridge, UK. PAST: A large-scale, persistent peer-to-peer storage utility.
Ottem, E. Getting the Most From Your Storage: How to Deploy a SAN. Gadzoox Networks, Inc. (1999).
Networking with Pyramix.
Storage Area Networking (SAN)—The Veritas Strategy. Q Associates (2000).
Rapaport, L. And Baltazar, H. Introduction to SANs: Technology, Benefits, and Applications. (Jul. 9, 2001).
Enlist Desktops to Mirror Data. TechTarget (2002).

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

Short-cut response for distributed services does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Short-cut response for distributed services, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short-cut response for distributed services will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4146871

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