Protocol virtualization for a network file system

• US 8,990,270 B2
• Filed: 08/03/2006
• Issued: 03/24/2015
• Est. Priority Date: 08/03/2006
• Status: Active Grant

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Uysal, Mustafa, Swaminathan, Ram, Lai, Junwen
• Primary Examiner(s): Badawi, Sherief
• Assistant Examiner(s): RAHMAN, SABANA
• Application Number:
  US11/498,344
• Publication Number:
  US 20080126434A1
• Time in Patent Office: 3,155 Days
• Field of Search: 707/10
• US Class Current: 707/821
• CPC Class Codes: G06F 16/188 Virtual file systems
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 69/08 Protocols for interworking; Protocol conversion

Abstract

A network file system includes at least one unmodified client and at least one unmodified physical file server (PFS). Each PFS has at least one file that is identified by an associated physical file handle (PFH). The network file system includes virtual file servers (VFSs) in a data path between the client(s) and the PFS(s). The network file system also includes a virtualized name space that is mapped to the PFS(s) and is provided to the client(s) by the VFS(s). The network file system further includes a virtualized ID space that is established in response to a request from a client. Within the ID space, each file is identified by a physical file handle (PFH) on a PFS. The PFH and PFS pair are mapped to provide a virtual file handle (VFH), and the map of the VFHs is allocated among the VFSs.

Claims

1. A method of protocol virtualization for a network file system, comprising:

establishing virtual file servers (VFSs) in a data path between at least one client and at least one physical file server (PFS);

presenting a virtualized name space to the at least one client, the virtualized name space mapped to individual name spaces of at least one PFS by the VFSs;

virtualizing an ID space in response to a request from a client, within the ID space each file identified by a physical file handle (PFH) on each PFS, the PFH and PFS pair mapped to provide a virtual file handle (VFH) and the map of the VFHs being allocated among the VFSs;

providing the VFHs to the at least one client by the VFSs, the at least one client perceiving the VFSs as file servers;

wherein with each file request from a first client, a first VFS receives a first VFH, the first VFS translating the first VFH to the associated PFH and PFS, the first VFS re-formatting the file request and directing the re-formatted file request and PFH to the PFS, the first VFS receiving at least one response from the PFS, and the first VFS reformatting the response and transmitting the re-formatted response to the first client;

selecting a VFS to act as a choke point for all access transactions involving the files to be moved;

informing all other VFSs of the selected VFS choke point, all other VFSs directing requests to VFHs translating to involved files to the choke point;

copying each involved file from a source directory PFS to a destination directory PFS;

updating the map of PFH, PFS and associated VFH entries to reflect the destination directory; and

releasing the VFS choke point and informing all other VFSs of the release; and

propagating the updated VFHs to the other VFSs;

wherein for each read request transaction received by the VFS choke point, accessing and returning data from the source directory;

wherein for each write request transaction received by the VFS choke point, the VFS choke point delivering the write transaction to both the source directory and the destination directory.

2. The protocol virtualization method of claim 1, wherein the VFSs are transparent to the at least one client and the at least one PFS.

3. The protocol virtualization method of claim 1, wherein:

in response to a plurality of PFSs, establishing at least one junction directory upon at least one of the VFSs, the junction directory identifying files mapped between at least two PFS;

wherein for a directory request involving the junction directory, said at least one of the VFSs receives the request, identifies at least two PFSs, re-formatting the request for each identified PFS, receives at least one response from each identified PFS, and returns a combined response.

4. The protocol virtualization method of claim 1, wherein each PFS is an NFS server, each VFS perceived as an NFS server by each client, each VFS perceived as a client by each PFS.

5. The protocol virtualization method of claim 1, wherein the mapping of each PFH and PFS pair to a VFH is unique and arbitrary.

6. The protocol virtualization method of claim 1, wherein for the translation of the first VFH, the first VFS consults its allocation of the map;

in response to the translation occurring in the allocation, the first VFH performing the translation directly, and

in response to the translation being unavailable in the allocation performing a hash upon the VFH to identify a second VFS having the appropriate allocation and requesting the translation from the second VFS.

7. The protocol virtualization method of claim 6, wherein requested translations are locally cached by the first VFH for a tunable period of time.

8. The protocol virtualization method of claim 1, wherein the method is stored on a computer readable medium as a computer program which, when executed by a computer will perform the steps of protocol virtualization.

9. A method of protocol virtualization for a network file system, comprising:

establishing virtual file servers (VFSs) in a data path between at least one client and at least one physical file server (PFS);

presenting a virtualized name space to the at least one client, the virtualized name space mapped to individual name spaces of at least one PFS by the VFSs;

virtualizing an ID space in response to a request from a client, within the ID space each file identified by a physical file handle (PFH) on each PFS, the PFH and PFS pair mapped to provide a virtual file handle (VFH) and the map of the VFHs being allocated among the VFSs;

providing the VFHs to the at least one client by the VFSs, the at least one client perceiving the VFSs as file servers;

wherein with each file request from a first client, a first VFS receives a first VFH, the first VFS translating the first VFH to the associated PFH and PFS, the first VFS re-formatting the file request and directing the re-formatted file request and PFH to the PFS, the first VFS receiving at least one response from the PFS, and the first VFS reformatting the response and transmitting the re-formatted response to the first client;

selecting a VFS to act as a choke point for all access transactions involving a source directory on a source PFS to be moved;

informing all other VFSs of the selected VFS choke point, all other VFSs directing requests to VFHs translating to involved files under the source directory to the choke point;

performing destination setup, including;

establishing a destination directory on a destination PFS corresponding to the source directory;

transforming the source directory into a junction directory consisting of all existing objects within the source directory and the destination directory;

retrieving a list of all objects within the source directory;

copying each file object from the source directory to the destination directory;

in response to a sub-directory object, recursively performing the destination setup for each sub-directory object;

updating the map of PFH, PFS and associated VFH entries to reflect the at least one destination directory; and

releasing the VFS choke point and informing all other VFSs of the release; and

propagating the updated VFHs to the other VFSs;

wherein for each read request transaction received by the VFS choke point, accessing and returning data from the source directory;

wherein for each write request transaction received by the VFS choke point, the

VFS choke point delivering the write transaction to both the source directory and the destination directory.

10. A network file system, comprising:

at least one unmodified client;

at least one unmodified physical file server (PFS), each PFS having at least one file identified by an associated physical file handle (PFH);

virtual file servers (VFSs) in a data path between the at least one client and at least one PFS;

a virtualized name space mapped to the at least one PFS, the name space provided to the at least one client by the VFSs;

a virtualized ID space established in response to a request from a client, within the ID space each file identified by a physical file handle (PFH) on a PFS, the PFH and PFS pair mapped to provide a virtual file handle (VFH) and the map of VFHs being allocated among the VFSs.

11. The network file system of claim 10, wherein with each file request from a first client, a first VFS is operable to receive a first VFH, the first VFS translating the first VFH to the associated PFH and PFS, the first VFS re-formatting the file request and directing the re-formatted file request and the PFH to the PFS, the first VFS receiving at least one response from the PFS, the VFS re-formatting the response and transmitting the re-formatted response to the first client.

12. The network file system of claim 10, further including a junction directory upon at least one of the VFSs, the junction directory identifying files mapped between at least two PFSs.

13. The network file system of claim 12, wherein for a directory request involving the junction directory, a first VFS is operable to receive the request, identifies the at least two PFSs, re-formatting the request for each identified PFS, receives at least one response from each identified PFS, and returns a combined response.

14. The network file system claim 10, wherein the mapping of each PFH and PFS pair to a VFH is unique and arbitrary.

15. The network file system claim 10, wherein for the translation of the first VFH the first VFS is operable to consult its allocation of the map;

in response to the translation occurring in the allocation, the first VFH performing the translation directly;

in response to the translation being unavailable in the allocation performing a hash upon the VFH to identify a second VFS having the appropriate allocation and requesting the translation from the second VFS.

16. the network file system of claim 15, wherein each VFH is operable to cache requested translations for a tunable period of time.