System and method for proxying data access commands in a...

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

C709S201000

Reexamination Certificate

active

08073899

ABSTRACT:
A system and method proxies data access commands acrossed a cluster interconnect between storage appliances and a cluster using a file-level protocol. Each storage appliance activates two ports per data access, a local port for data access requests directed to clients of the storage appliance and a proxy port for data access requests directed to the partner storage appliance. Clients utilizing multi-pathing software may send data access requests to either the local port of the storage appliance or the proxy port of the storage appliance. The system and method improves high availability, especially during a loss of connectivity due to non-storage appliance hardware failure.

REFERENCES:
patent: 4937763 (1990-06-01), Mott
patent: 5067099 (1991-11-01), McCown et al.
patent: 5157663 (1992-10-01), Major et al.
patent: 5163131 (1992-11-01), Row et al.
patent: 5355453 (1994-10-01), Row et al.
patent: 5485579 (1996-01-01), Hitz et al.
patent: 5633999 (1997-05-01), Clowes et al.
patent: 5781770 (1998-07-01), Byers et al.
patent: 5802366 (1998-09-01), Row et al.
patent: 5812748 (1998-09-01), Ohran et al.
patent: 5812751 (1998-09-01), Ekrot et al.
patent: 5819292 (1998-10-01), Hitz et al.
patent: 5892955 (1999-04-01), Ofer
patent: 5894588 (1999-04-01), Kawashima et al.
patent: 5931918 (1999-08-01), Row et al.
patent: 5941972 (1999-08-01), Hoese et al.
patent: 5951695 (1999-09-01), Kolovson
patent: 5963962 (1999-10-01), Hitz et al.
patent: 5975738 (1999-11-01), DeKoning et al.
patent: 6038570 (2000-03-01), Hitz et al.
patent: 6065037 (2000-05-01), Hitz et al.
patent: 6119244 (2000-09-01), Schoenthal et al.
patent: 6128734 (2000-10-01), Gross et al.
patent: 6173293 (2001-01-01), Thekkath et al.
patent: 6173374 (2001-01-01), Heil et al.
patent: 6292905 (2001-09-01), Wallach et al.
patent: 6425035 (2002-07-01), Hoese et al.
patent: 6606690 (2003-08-01), Padovano
patent: 6625749 (2003-09-01), Quach
patent: 6636879 (2003-10-01), Doucette et al.
patent: 6643654 (2003-11-01), Patel et al.
patent: 6654902 (2003-11-01), Brunelle et al.
patent: 6671773 (2003-12-01), Kazar et al.
patent: 6708265 (2004-03-01), Black
patent: 6721764 (2004-04-01), Hitz et al.
patent: 6728897 (2004-04-01), Cramer et al.
patent: 6757695 (2004-06-01), Noveck et al.
patent: 6760304 (2004-07-01), Uzrad-Nali et al.
patent: 6775702 (2004-08-01), Oeda et al.
patent: 6868417 (2005-03-01), Kazar et al.
patent: 6868438 (2005-03-01), Fujimoto
patent: 6877109 (2005-04-01), Delaney et al.
patent: 6912627 (2005-06-01), Matsunami et al.
patent: 6915389 (2005-07-01), Fujimoto
patent: 6978283 (2005-12-01), Edwards et al.
patent: 7003634 (2006-02-01), Takeda et al.
patent: 7038058 (2006-05-01), Lee et al.
patent: 7107385 (2006-09-01), Rajan et al.
patent: 7181439 (2007-02-01), Lent et al.
patent: 7184445 (2007-02-01), Gupta et al.
patent: 7194597 (2007-03-01), Willis et al.
patent: 7210061 (2007-04-01), Anderson
patent: 7213045 (2007-05-01), Uzrad-Nali
patent: 7231412 (2007-06-01), Hitz et al.
patent: 7260678 (2007-08-01), Agarwal et al.
patent: 7260737 (2007-08-01), Lent et al.
patent: 7296068 (2007-11-01), Sarma et al.
patent: 7340639 (2008-03-01), Lee et al.
patent: 7409494 (2008-08-01), Edwards et al.
patent: 7451163 (2008-11-01), Selman et al.
patent: 7467191 (2008-12-01), Wang et al.
patent: 7523201 (2009-04-01), Lee et al.
patent: 7707618 (2010-04-01), Cox et al.
patent: 7783787 (2010-08-01), DeBergalis et al.
patent: 2002/0078371 (2002-06-01), Heilig et al.
patent: 2003/0061491 (2003-03-01), Jaskiewicz et al.
patent: 2003/0115350 (2003-06-01), Uzrad-Nali et al.
patent: 2003/0120743 (2003-06-01), Coatney et al.
patent: 2004/0030668 (2004-02-01), Pawlowski et al.
patent: 2004/0064815 (2004-04-01), Uzrad-Nali et al.
patent: 2004/0078467 (2004-04-01), Grosner et al.
patent: 2004/0139145 (2004-07-01), Bar-or et al.
patent: 2004/0156393 (2004-08-01), Gupta et al.
patent: 2004/0205143 (2004-10-01), Uemura
patent: 2004/0268017 (2004-12-01), Uzrad-Nali et al.
patent: 2005/0097260 (2005-05-01), McGovern et al.
patent: 2005/0125503 (2005-06-01), Iyengar et al.
patent: 2005/0268032 (2005-12-01), Sikdar et al.
patent: 2006/0184587 (2006-08-01), Federwisch et al.
patent: WO 2005/029251 (2005-03-01), None
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, PCT/US2005/042173 Nov. 21, 2005.
Anupam Bhide, Elmootazbellah N. Elnozahy, Stephen P. Morgan, “A Highly Available Network File Server,” Proceedings of the Winter 1991 USENIX Conference, Jan. 21-25, 1991, pp. 199-205.
Maintenance Procedures ND (8C) nd-network disk control Feb. 1985.
Misc. Reference Manual Pages ND (4P) nd-network disk driver Jul. 26, 1985.
Asante EN/SC Adapter Family Installation Guide May 1994.
Asante Desktop EN/SC Adapters User's Manual Apr. 1996.
Performance Without Compromise: The Virtual Storage Architecture 1997.
Anthony J. McGregor Department of Computer Science, University of Waikato Dissertation: Block-Based Distributed File Systems Jul. 1997.
Chutani, Sailesh, et al., The Episode File System, In Proceedings of the USENIX Winter 1992, 18 pages.
Gait, Jason, Phoenix: A Safe In-Memory File System. Communications of the ACM, 33(1): pp. 81-86, Jan. 1990.
Hitz, Dave et al., File System Design for an NFS File Server Appliance, Technical Report 3002, Rev. C395, presented Jan. 19, 1994, 23 pages.
Howard, John H., An Overview of the Andrew File System, Carnegie Mellon University, CMU-ITU-88-062 1988, 6 pages.
Hu Yoshida: “LUN Security Considerations for Storage Area Networks” Hitachi Data Systems, 1999, pp. 1-7, XP002185193.
Kazar, Michael L., et al., Decorum File System Architectural Overview, USENIX Summer Conference, Anaheim, California, 1990, 13 pages.
McKusick, Marshall Kirk, et al., A Fast File System for UNIX, Computer Science Division, Department of Electrical Engineering and Computer Sciences, Univ. of CA, Berkley, Feb. 18, 1994, 14 pages.
Ousterhout, John K. et al., The Sprite Network Operating System, Computer Science Division, Department of Electrical Engineering and Computer Sciences, Univ. of CA, Berkley, Nov. 19, 1987, 32 pages
Santry, Douglas S., et al., Deciding When to Forget in the Elephant File System, Operating Systems Review, 34(5), (Dec. 1999) pp. 110-123.
Satyanarayanan, M., et al., The ITC Distributed File System: Principles and Design, In Proceedings of the 10th ACM Symposium on Operating Systems Principles, (19)5:56-67, Dec. 1985.
Satyanarayanan, M., A survey of distributed file-systems. Annual Review of Computing Science, 4(73-104), 1989.
Satyanarayanan, M., et al., Coda: A highly available file system for a distributed workstation environment Carnegie Mellon University, CMU-ITU, Dated 1990.
Sidebotham, Bob, Volumes: The Andrew File System Data Structuring Primitive, EEUG Conference Proceedings, Manchester, UK, Autumn 1986.
Soltis Set al. “The Design and Performance of a Shared Disk File System for IRIX” NASA Goddard Space Flight Center Conference on Mass Storage and Technologies in Cooperation with the IEEE Symposium on Mass Storage Systems, Mar. 23 1998, pp. 1-17, XP002194621.

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

System and method for proxying data access commands in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for proxying data access commands in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for proxying data access commands in a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4295572

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