CN1755692A - System and method for determining target failback and target priority for a distributed file system - Google Patents

Abstract

A system and method for organizing and sorting targets received in a referral response and for realizing a target fail-back and a target priority policy in a distributed file system is provided. In one embodiment, a sorting method includes receiving a referral response in the form of a list of targets that are sorted into bounded sets. Having a sorted referral response in bounded sets provides a basis for implementing a target fail-back and a target priority policy. The computer system may select a target from a sorted list of targets sorted according to site-cost and/or target priority. Then, the computer system may determine if the set target is associated with a more preferred target when compared to all available targets in the sorted list and if not, switch back to a more preferred target.

Description

Be used to distributed file system to determine to recover after the target faults and the system and method for target priority

The cross reference of related application

The present invention requires to submit on October 1st, 2004, sequence number is the right of priority of 60/615,411 United States Patent (USP) provisional application, and its integral body is included in this.

Technical field

The present invention relates generally to computer system, relate in particular to and be used to distributed file system to determine to recover after the target faults and the improved system and method for target priority.

Background technology

Distributed file system (Dfs) is the assembly of the network server of the data on location and the supervising the network.Dfs can be used to the file on the various computing machine is united to a single name space, allows the user that a plurality of file servers on the network and file server shared set up view single, classification like this.In the linguistic context of a server computer or one group of server computer, Dfs can be compared to the file system of the hard disk that is used for the personal computer system.For example, be similar to the role of the file system of the visit that is used to provide the unification name that disk sector is gathered, Dfs can provide Uniform Naming Convention and mapping to service routine, set shared and file.Like this, Dfs can be woven to the logic classification with file server and shared group thereof, makes large enterprises can more effectively manage and use its information resources.

And, if client computer is supported the local service program and share that no matter the file client that just is being used is how, Dfs is not limited to single file protocol, and can support service routine, share and the mapping of file.Dfs also can and share to different service routine volumes provides name transparency.By Dfs, the keeper can set up distribution of content single hierarchical file system of (WAN) on the wide area network of whole tissue.

Past, use UNC (UNC), for access file information, user or application program are required to specify the physics service routine and share.For example, user or application program must specify Server Share Path Filename.Although UNC can directly use, UNC generally is mapped to a drive letter, such as x:, it can map to conversely Server Share.From this aspect, the user is required the data that he or she wants to visit are exceeded the part navigation of redirected drive mapping.For example, customer requirements x: Path More_path ... the copy of Filename navigate to specific file.

Because the growth of network size and enterprise are for to bring into use existing storage such as the purpose of Intranet---internally or externally, the single driver name shows (scale) to the mapping of independent shared and is on duty mutually.And although the user can directly use the UNC title, these users may be overwhelmed by the quantity in the stored place of data possibility.

Dfs solves these problems by allowing service routine and shared being connected to enter a simpler and name space easier navigation.Dfs volume allows to share and is classified to be connected to other and shares.Because Dfs maps to logical expressions with physical store, user and application program are become transparent so net benefit (net benefit) is the physical location of any amount file.

And, because the network size increases to the level of global network, some copies of identical one or more files can be arranged in the some diverse locations of network, so that reduce and the expense that is associated from retrieving files the network (with regard to network time, offered load etc.).For example, the user who is positioned near the macroreticular first server location generally will use duplicate of the document on the most close their server (that is, the user of Seattle may the most closely be positioned near the server of the Randt's illiteracy by name Seattle).Similarly, be positioned near the general duplicate of the document on the most close their the different server (that is, the user of Thailand may the most close server that is positioned at the Bangkok by name in Bangkok) that uses of the user of a macroreticular the second server position.Like this, the place expense of retrieving files (that is, being the scalar of pseudorandom indication that comprises many network parameters of distance between the client-server, degree that server separates and other physical network parameter) can minimize by the hithermost server that visit contains required one or more files.

When the user wants retrieving files from Dfs, the client computer of customer requirements this document determines how to set about retrieving desired file thereon.Client computer can submit to quote request to obtain one or more positions about required one or more files.Quote and to be the client computer of request and can to find relative path between the server computer of required one or more files therein.Client computer can ask to be known as local disabled one or more files, and can make about there being how many different positions that copy definite of required file can be provided.Generally, may exist the hundreds and thousands of even thousands of target relative path of (that is, to this document) indication that the position of the file of this request can be provided.Similarly, return in response to quote request client computer quote the response generally comprise corresponding to service routine that contains required file and/or shared object listing.

Yet, the past, return to client computer quote response can contain be identified with the random sequence or the target of arranging by the place expense in some cases.Each target of quoting in the response needn't have any relation to the target that was right after before or after it.The result is that client computer is the top from the randomly ordered tabulation of target, and attempts last each the follow-up target of tabulating is connected up to a target by being communicated with response.

Yet, use a problem of this randomness to be, in fact the first available target may be positioned at the fact of the other end of the world really.Like this, with the suitable height and undesirable in the long term of the place expense of the communication of this first available targets.

Yet the continuity that keeps target is connected is very important.This is called as " clinging (sticking) " or " viscosity (stickiness) ".Like this, general in case located first available targets of the file demand that can satisfy client computer, unless all quoting and ask also just to be sent to this target in the future are quoting of please looking for novelty clearly of the user of client computer.Thereby, may keep causing indefinitely all more Internet traffics and general overall network expense to the connection of the possible high place expense of first available targets.

Keeping poor efficiency between client computer and the server computer quotes and keeps successional problem may cause the overhead communication session of high place.Need be used for when connection place expense is quoted in reduction, keeping quoting the successional method of connection.

Summary of the invention

The present invention provide briefly be used for to quote target that response receives organize and sort and in distributed file system, determine target faults after recover and fault after the system and method for the target priority that recovers.In one embodiment, sort method can comprise: from a plurality of positions (that is target) that the client computer request is arranged in file, catalogue on one or more computing machine of computer network, shares etc.Then, can return object listing to client computer such as the computing machine of Dfs server, wherein this object listing comprises that each quotes corresponding to required file in the computer network or a plurality of of directory location.And this object listing can be sorted based on estimating with the related respectively place expense of each target.

Low expense target by server computer identification can advantageously be come the top of quoting response.Client computer can be logical analysis this quote response, making with before the high cost target is set up the trial is communicated with, to attempt and be beginning than hanging down that the expense target is communicated with.

Such ordering system also can be performed as and comprise the use goal priority.The target of higher priority also can be come the top of quoting response.And, quote response and can further be sorted the supply that comprises place expense and target priority.Like this, contain the equal place expense that is associated respectively organize target priority that target can be further be associated respectively according to each target and in this group internal sort.

In another embodiment of the present invention, recover after the target faults and the target priority strategy can use one to be listed as and the object listing of the ordering that provides in the response is provided and is carried out.Thereby the target setting that computer system can select and specify a target conduct to come from the object listing that sorts according to the place expense is retrieved at least one required file or the catalogue on the client computer.Then, computer system can be determined: when with all available targets in the tabulation of ordering relatively the time, whether this target setting is associated with minimum place expense.If not, system can return to the different target that is associated with the place expense lower than target setting after the fault so, and to specify this fresh target be target setting.

When in conjunction with the accompanying drawings, other advantage can be become obviously by following detailed description, in the accompanying drawing:

Description of drawings

Fig. 1 is the block diagram that general expression can comprise computer system of the present invention therein;

Fig. 2 is according to an aspect of the present invention, and general expression is used for carrying out in one embodiment and recovers after the target faults and the block diagram of the example architecture of the distributed computing environment of target priority;

Fig. 3 is according to an aspect of the present invention, and general expression is used to use distributed file system to ask the process flow diagram of the step that adopted with retrieving files;

Fig. 4 is according to an aspect of the present invention, and general expression is used for assembling the process flow diagram of quoting the step that response adopts based on the place expense in one embodiment;

Fig. 5 is according to an aspect of the present invention, and general expression is used for based target priority in one embodiment and assembles the process flow diagram of quoting the step that response adopts;

Fig. 6 is according to an aspect of the present invention, and general expression is used for returning to after the fault process flow diagram of the step that target adopted of the lower place expense of quoting response that can be used to sort in one embodiment;

Fig. 7 is according to an aspect of the present invention, and general expression is used for returning to after the fault process flow diagram of the step that target adopted of the higher priority of quoting response that can be used to sort in one embodiment; And

Fig. 8 is according to an aspect of the present invention, and general expression is used in one embodiment sort and quotes the process flow diagram of the step that response adopts.

Embodiment

The exemplary operation environment

Fig. 1 shows the example that can carry out suitable computingasystem environment 100 of the present invention thereon.Computingasystem environment 100 is an example of suitable computing environment, is not intended to the scope or the function of usability of the present invention are proposed any restriction.Should not be interpreted as that the arbitrary assembly shown in the exemplary operation environment 100 or its combination are had any dependence or requirement to computing environment 100 yet.

The present invention can operate with numerous other universal or special computingasystem environment or configuration.The example of known computing system, environment and/or the configuration that may be fit to use in the present invention comprises, but be not limited to, personal computer, server computer, hand-held or laptop devices, flat-panel devices, headless server, multicomputer system, the system based on microprocessor, set-top box, programmable consumer electronics, network PC, minicomputer, large scale computer, comprise any the distributed computing environment etc. in said system or the equipment.

The present invention can for example, describe under the general context of program module at the computer executable instructions of just being carried out by computing machine.Generally speaking, program module comprises routine, program, object, assembly, data structure etc., and they are carried out particular task or implement particular abstract.The present invention also can put into practice under distributed computing environment, and wherein task is carried out by the teleprocessing equipment that connects by communication network.In distributed computing environment, program module can be arranged in this locality and/or the remote computer storage medium that comprises memory storage devices.

With reference to figure 1, be used to carry out the universal computing device that example system of the present invention comprises computing machine 110 forms.The assembly of computing machine 110 can include, but not limited to processing unit 120, system storage 130 and will comprise that the various system components of this system storage are coupled to the system bus 121 of processing unit 120.System bus 121 can be any in the bus structure of some types, comprises any the local bus in the various bus architectures of memory bus or memory controller, peripheral bus and use.As example, and unrestricted, such architecture comprises industrial standard architectures (ISA) bus, Micro Channel Architecture (MCA) bus, enhancement mode ISA (EISA) bus, VESA's (VESA) local bus and peripheral component interconnect (pci) bus (being also referred to as the Mezzanine bus).

Computing machine 110 generally includes various computer-readable mediums.Computer-readable medium can be any usable medium that can be visited by computing machine 110, and comprises volatibility and non-volatile media, removable and removable medium not.As example, and unrestricted, computer-readable medium can comprise computer-readable storage medium and communication media.Computer-readable storage medium comprised with any method or technology being used to of carrying out to be stored such as the volatibility of information such as computer-readable instruction, data structure, program module or other data and non-volatile, removable and removable medium not.Computer-readable storage medium comprises, but be not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc memory, tape cassete, tape, magnetic disk memory or other magnetic storage apparatus, maybe can be used to store information needed and can be by any other medium of computing machine 110 visits.Communication media is embodied as usually such as computer-readable instruction, data structure, program module or other data in the modulated message signal such as carrier wave or other transmission mechanism, and comprises any information transmitting medium.Term " modulated message signal " refers to a kind of like this signal, and its one or more features are set or change in the mode of coded message in signal.As example, and unrestricted, communication media comprises wire medium (such as cable network or directly line connection) and wireless medium (such as sound, RF, infrared ray and other wireless medium).The combination of any also should be included within the scope of computer-readable medium in above-mentioned.

System storage 130 comprises the computer-readable storage medium of volatibility or nonvolatile memory form, such as ROM (read-only memory) (ROM) 131 and random-access memory (ram) 132.Basic input/output 133 (BIOS) includes the basic routine of the information of transmitting when helping such as startup between the middle element of computing machine 110, it is stored among the ROM 131 usually.RAM 132 comprises processing unit 120 usually can zero access and/or present data and/or program module of operating.As example, and unrestricted, Fig. 1 shows operating system 134, application program 135, other program module 136 and routine data 137.

Computing machine 110 also can comprise other removable/not removable, volatile/nonvolatile computer storage media.Only as example, Fig. 1 shows and reads in never removable, the non-volatile magnetic medium or to its hard disk drive that writes 141, from removable, non-volatile magnetic disk 152, read or to its disc driver that writes 151, and from such as reading removable, the non-volatile CDs 156 such as CD ROM or other optical medium or to its CD drive that writes 155.Other that can use under the exemplary operation environment be removable/and not removable, volatile/nonvolatile computer storage media includes, but not limited to magnetic tape cassette, flash card, digital versatile disc, digital recording band, solid-state RAM, solid-state ROM etc.Hard disk drive 141 is usually by being connected to system bus 121 by mobile storage interface (such as interface 140), and disc driver 151 and CD drive 155 are connected to system bus 121 by removable memory interface (such as interface 150) usually.

More than describe and driver shown in Figure 1 and the computer-readable storage medium that is associated thereof provide storage to computer-readable instruction, data structure, program module and other data for computing machine 110.For example, in Fig. 1, hard disk drive 141 is illustrated as storage operating system 144, application program 145, other program module 146 and routine data 147.Notice that these assemblies can be identical or different with operating system 134, application program 135, other program module 136 and routine data 137.It is in order to illustrate that they are different copies at least that operating system 144, application program 145, other program module 146 and routine data 147 have been marked different labels here.The user can be by input equipment (such as handwriting pad or electronic digitalizing instrument 164, microphone 163, keyboard 162 and pointing device 161 (being often referred to mouse, tracking ball or touch pads)) to computing machine 110 input commands and information.Unshowned other input equipment can comprise operating rod, game mat, satellite dish, scanner or comprise the miscellaneous equipment of the equipment that contains biometric sensor, environmental sensor, position transducer or other type sensor in Fig. 1.These and other input equipment is connected to processing unit 120 by the user's input interface 160 that is coupled to system bus usually, but also can be by other interface or bus structure (connecting such as parallel port, game port or USB (universal serial bus) (USB)).The display device of monitor 191 or other type also is connected to system bus 121 via interface (such as video interface 190).Monitor 191 also can combine with touch-screen etc.Notice that monitor and/or touch-screen can physically be coupled to the shell that wherein comprises computing equipment 110, such as in tablet personal computer.In addition, computing machine (for example, computing equipment 110) also can comprise other peripheral output device (such as loudspeaker 194 and printer 195), and they can connect by output peripheral interface 193 or its analog.

Computing machine 110 can use to the logic of one or more remote computer (such as remote computer 180) and be connected under the networked environment operation.Remote computer 180 can be personal computer, server, router, network PC, peer device or other common network node, and generally include many or all elements of above describing, in Fig. 1 although memory storage devices 181 only is shown with respect to computing machine 110.Logic shown in Fig. 1 connects and comprises Local Area Network 171 and wide area network (WAN) 173, but also can comprise other network.Such network environment is common in office, enterprise-wide. computer networks, Intranet and the Internet.When using in the lan network environment, computing machine 110 is connected to LAN (Local Area Network) 171 by network interface or adapter 170.When using in the WAN network environment, computing machine 110 generally includes modulator-demodular unit 172 or is used for by setting up other device of communication such as WAN such as the Internet 173.Modulator-demodular unit 172 can be inner or outside, and it can be connected to system bus 121 by user's input interface 160 or other suitable mechanism.In networked environment, can be stored in the remote memory storage devices with respect to computing machine 110 described program modules or its various piece.As example, and unrestricted, Fig. 1 shows remote application 185 and resides on the memory device 181.It is exemplary that network shown in being appreciated that connects, and can use other means of setting up communication link between computing machine.

Quote the response ordering

The present invention is generally to be used to distributed file system to determine to recover after the target faults and the system and method for target priority is a target.The client computer that this system and method can be advantageously may contain the computer-list of required file or catalogue for request in computer network provides sort method.Response request, the object listing that can offer client computer can be sorted based on the assessment of some parameter, comprises the place expense that is associated respectively with each target.As seeing, the target of the low expense that is identified can be sorted to the top of quoting response, client computer can be that logical analysis is quoted response like this, before making the trial that is communicated with the foundation of high cost target, is beginning to attempt with being communicated with than low expense target.

Such ordering system also can use the priority ranking of target and be carried out, and whereby, in one embodiment, higher-priority goal also can be sorted to the top of quoting response.And this quotes response can further be sorted the supply that comprises place expense and target priority.Like this, contain the equal place expense that is associated respectively organize target priority that target can be further be associated respectively according to each target and in this group internal sort.As being understood, a plurality of block diagrams, process flow diagram and sight described herein only are examples, and have adaptable a plurality of other sights of the present invention.

Go to the Fig. 2 in the accompanying drawing, show according to an aspect of the present invention, general expression is used to carry out and recovers after the target faults and the block diagram of the example architecture of the distributed computing environment of target priority.Generally, client computer 205 can be similar with personal computer 110 shown in Figure 1, can operationally be coupled to first network 250 of the part that can be the part of corporate intranet or the Internet.Client computer 205 can be the part of Dfs, and the Dfs client program 270 that can provide the seamless access of the file of any position of being positioned at Dfs maybe can be provided.This network also can operationally be coupled to other computing machine, such as network computer m1 210, current directory server 220 and Dfs root server 230.Current directory server 220 can be used to store Dfs information---comprise Dfs link reference information.Yet in each embodiment, this information can be stored by network 250 addressable any computer-readable mediums.

Conversely, Dfs server 230 also can operationally be coupled to another network 280 of another part that also can be another corporate intranet or the Internet.As common in any computer network, network 280 can operationally be coupled to network 250 by router two 60.Dfs root server 230 can operationally be coupled to can comprise the Dfs root shared 240 that one or more links are quoted.For example, link //r1/s1/l1 can be positioned at //file of m1/s1 or catalogue provide and quote.Similarly, link, //r1/s1/12 can be positioned at //file of m2/s1 or catalogue provide and quote.And link can be to a plurality of computing machines, service routine, share and/or catalogue provides and quotes.Like this, comprise server computer m2215 many computing machines can by a large amount of networks and computing machine by liaison be coupled to client computer 205.

File and/or the catalogue that comes from the substantial any server location in network 250 or network 250 and 280 can be asked and be retrieved to client computer 205.Yet client computer 205 safeguards that the information about all computing machines that can be connected to network 250 may be infeasible.Generally, request can be to file or catalogue.So, although any file (and/or catalogue is hinted like file request in whole remainders of this announcement and retrieval) can be retrieved in any computing machine from network 250, client computer 205 generally is equipped with the position from the required file in another source.Like this, Dfs server computer 230 can operationally be safeguarded the information about many computing machines that are coupled to network 250 and 280, make when client computer 205 is asked local unavailable file, Dfs server computer 230 can provide object listing, and wherein each target is corresponding to the path to required file.

Generally, Dfs server computer 230 can return a hundreds and thousands of even thousands of target with in response to quote request, and can provide order about target according to all multiparameters.Two the such methods quoting that are used to sort can be to sort and sort by the target priority that is associated with each target by the place expense that is associated with each target.In these sort methods each can describe in further detail hereinafter.

In case object listing can be by Dfs server computer 230 (maybe can operate provides the preface and table of contents side by side to be marked with other dedicated computer system in response to quote request) ordering, it just can be returned to client computer 205.Client computer 220 can begin repeatedly then to attempt to set up with being communicated with of every target (with the order that is sorted) up to setting up and being communicated with an of target.File can be arranged in corresponding to the shared target place on the server computer m1 210 that shares s1 212, is ∥ m1/s1 simply.Sharing s1 212 can be associated with the file server 211 on server computer m1210, like this, may be able to be quoted by Dfs server computer 230.

Similarly, required file can be arranged on the server computer m2 215 that shares s2 217.Shared s2212 also can be associated with the file server 216 on the server computer m2 215, like this, also can be quoted by Dfs server computer 230.Yet because can operationally be coupled to server computer 215 by network 280, the path that can quote client computer may be more complicated, can set up by root Dfs server 230 because communicate to connect.By using the Dfs in the architecture shown in Figure 2, the file that comes from any position in the network can be retrieved by offering quoting of client computer 205 by Dfs server computer 230.

Fig. 3 shows according to an aspect of the present invention, and general expression is used to use the process flow diagram of the step that distributed file system request and retrieving files adopted.Client computer 205 can be the part of Dfs, and the Dfs client program 270 that can provide the seamless access of the file that is arranged in any position of Dfs maybe can be provided.Therefore client computer 205 can ask and retrieving files, and required seemingly All Files finds in this locality.

When may be on the client computer 205 local disabled specific file of client computer 205, can startup file request on the client computer 205 that uses Dfs client program 270.In each embodiment, the Dfs client program also can reside on the current directory server 220, and can be used to locate Dfs root server 230.Dfs server computer 230 can to may comprise with at step 308 place by Dfs can with the client computer 205 of the corresponding object listing of remote server computer provide and quote response.This object listing can be sorted according to the various parameters of understanding (site-awareness) (hereinafter roughly describing) such as place expense (hereinafter with reference Fig. 4 describes its method), the priority (hereinafter with reference Fig. 5 describes its method) that is associated and/or place.

And, quote response and can comprise the indication that each is comprised the bounded set of targeted packets.In one embodiment, can make the indication that bounded set is begun by the divide value that is associated with information about first target in this bounded set is provided.This can be by providing the border attribute to finish to client computer in quoting response, such as the expense that is associated with retrieving files or catalogue between target and this client computer.This bounded set can be based on any amount of parameter, comprises the health status of place expense, place understanding, target priority and/or this related computing machine in quoting.As used herein, other attribute that health status can refer to be used for providing response time, load of traffic, the processor load of quoting and quote related computing machine comprises performance metric.

Quote response in case client computer 205 can receive, the order that client computer 205 just can begin to attempt with ordering is set up communication session with each target in tabulation.Like this, client computer 205 can be attempted target 1 at step 310 place, but fails to connect.Client computer 205 can be attempted target 2 at step 312 place then, but fails to connect.Each target that client computer 205 can continue to attempt with in quoting response is connected, up to connecting with target m at step 314 place.In the time can being set up to the connection of target, this target can be designated as target setting, and is used up to no longer available with the continuity of this destinations traffic for keeping.For example, target m can be used as target setting and is used for follow-up document retrieval and is established, and can ask quoting of looking for novelty up to client computer 205, for example finds new target, or can otherwise be instructed to.

It will be appreciated by those skilled in the art that, implementation can be selected to carry out these steps with different orders, maybe can be chosen as efficient or adaptive purpose and only carry out some step in these steps, reach same effect simultaneously and do not deviate from scope of the present invention.And this identical notion can be applied to: location Dfs server 230 in first place, and as quoting to the specific Dfs server that can provide in much at one mode by current directory server 220.

Fig. 4 shows according to an aspect of the present invention, and general expression is used for assembling the process flow diagram of quoting the step that response adopts based on the place expense.Generally, quoting response can sort according to all multiparameters such as place expense or place understanding.In one embodiment, the target in the place identical with client computer 205 can be understood according to the place and sorted, and this is prior to the ordering according to the place expense.For example, the target in the place identical with client computer 205 can be drained into the top of quoting response, can use the place expense parameter remaining target that sorts then.Fig. 4 can illustrate an embodiment who uses place expense and place to understand to sort the method for quoting the target in the response that is generated by Dfs server computer 230.Yet, those skilled in the art will appreciate that the combination that can use any amount of parameter or parameter comes quoting each target ordering of response.

Dfs server computer 230 can be to satisfying the object listing compiling of the quote request that comes from client computer 205.These targets can be assembled with order at random, and the place begins in step 402.Then, Dfs server computer 230 can identification may be in the place identical with client computer 205 (for example, //m1/s1/) each target.At step 404 place, these targets that pick out can be moved into the top of tabulation, produce at present to understanding the response of quoting that parameter is sorted in the place.In each embodiment, quote response and can on this aspect, be transmitted back to client computer 205.Yet in other embodiments, as shown in Figure 4, quoting response can be extraly according to another parameter---the place expense sorts.

Remaining target can sort according to the place expense that is associated at step 408 place, and is divided into each bounded set.Each target that contains field one expense associated therewith can be moved into bounded set with other target that contains identical related place expense.Similarly, second bounded set can have one or more targets that contain the second related place expense.Like this, this object listing can be divided into each bounded set then, and wherein first bounded set can comprise the target with minimum related place expense, and next bounded set can comprise having the secondly target of minimum related place expense, and is like that.

Each bounded set can comprise the target of arranging by random sequence in a large number then, but these targets contain identical related with it place expense.Like this, because client computer 205 can repeat to attempt to set up communication session, it can at first begin circulation by minimum place expense target.

And, at step 410 place, in each bounded set first target of listing also can with can be configured to indicate the boundary bit of bounded set reference position to be associated.By this way, the client computer border between the identification bounded set easily.Boundary bit can be used as the indication that this target contains the place expense of the association higher than the previous target in the tabulation.Like this, can make about the decision that contains more information that recovers after the fault or fault is got rid of by providing based on the bounded set of place manufacturing cost.Dfs server computer 230 can assemble then contain based on the place understand and the object listing of the ordering of place expense finally quote response, and can this be quoted response back to client computer 205 at step 412 place.

Fig. 5 shows according to an aspect of the present invention, and general expression is used for based target priority and assembles the process flow diagram of quoting the step that response adopts.Again, quoting response can be sorted according to all multiparameters such as above-mentioned target priority of briefly mentioning and/or place understanding.Fig. 5 can illustrate and use target priority and place expense to be used for a embodiment in the method for quoting response ordering target that is generated by Dfs server computer 230.Yet, those skilled in the art will appreciate that the combination that can use any amount of parameter or parameter is sorted to quote each target of response.As mentioned above, Dfs server computer 230 can compile the object listing of quoting response that can satisfy from client computer 205.These targets can be assembled for beginning in the order that step 502 is sentenced at random.Then, the place that Dfs server computer 230 is can identification identical with client computer 205 (for example, // each target in m1/s1).At step 504 place, the top that these targets that pick out can be moved to tabulation produces at present understands the response of quoting that parameter sorted for the place.In certain embodiments, quote response and can on this aspect, be returned to client computer 205.Yet in other embodiments, as shown in Figure 5, quoting response can be extraly according to another parameter---target priority is sorted.

Have each target of first target priority such as the overall situation high (global high) associated therewith, can be moved in the bounded set together with other target that have identical associated objects priority.Similarly, second bounded set can contain one or more targets that have such as the second associated objects priority of the overall situation low (global low).Like this, this object listing can be divided into each bounded set then, wherein first bounded set can comprise and has the highest associated objects priority (promptly, overall situation height) target, secondly the bounded set of next comprises and has the highest associated objects priority (promptly, common height (normal high)) target, like that.

Each bounded set can comprise the target of arranging by random sequence in a large number then, but these targets all have identical target priority associated therewith.Like this and since client computer 205 can be repeatedly by target and attempt to set up communication session, it can be at first target by highest goal priority begin circulation.

And at step 510 place, first target of listing also can contain boundary bit in each bounded set, and this boundary bit is configured to indicate the reference position of this bounded set.By this way, client computer 205 can easily pick out the border between the bounded set.Boundary bit can have the indication of the associated objects priority lower than the previous target in the tabulation as this target.Like this, can make about the decision that contains more information that recovers after the fault or fault is got rid of by the bounded aggregate that based target priority is provided is incompatible.Dfs server computer 230 can assemble then contain based on the place understand and the object listing of the ordering of target priority finally quote response, and can will quote response back at step 512 place to client computer 205.

Dfs server computer 230 also can use the combination of parameters sortnig to set up the response of quoting of ordering.For example, first kind of ordering can move to the target in identical place the top of tabulation.Then, can be based on the global priority that is associated with each target target that sorts.For example, all targets that have a related overall high priority can be sorted to the top of quoting response.Similarly, all targets that have a related overall low priority can be arranged the bottom to this tabulation.Then, remaining target (can be known as " overall situation is common ") can further be divided into each bounded set based on the place expense.

In another embodiment, second kind of ordering can be set up based on place expense and the bounded set represented by the boundary bit of the setting of the target that is arranged in each set top.Then, each bounded set can sort according to target priority, make in each bounded set (the place expense that can have identical association inherently), target can be further according to the prioritization of each target association.Like this, in the bounded set based on the place expense, the target that is positioned at this bounded set top can be associated with high priority, and next grouping of target can be associated with next the highest priority (for example, common), and is like that.

In another embodiment, two previous embodiment can carry out together, make target by the priority arrangement on global basis and be arranged in each bounded set.

As another example, first kind of ordering can move to the target in identical place the top of tabulation once more.Then, second kind of bounded set that ordering can be set up based target priority and be represented by the boundary bit of the setting in the target on each set top.Then, each bounded set can be sorted according to the place expense, makes in each bounded set (the place expense that can have identical association inherently), and target further sorts according to the place expense that is associated with each target.Like this, in the bounded set of based target priority, the target that is positioned at this bounded set top can be associated with minimum place expense, and next grouping of target can be associated with next minimum place expense, and is like that.

By the target of quoting in the response being sorted with established order, and each target internal in quoting response is provided with some position, client computer can use then quotes the target that sorted in the response, carry out after the effective target faults recovery policy after the recovery policy and priority fault, below will describe this point.

Recover and priority after the target faults

Except being used for the sort method of server computer tabulation that the client computer request may contain the server computer network of required file, this system and method also can advantageously provide, and recovers and the target priority strategy after can using the target faults of the object listing that the ordering that provides in the response is provided.As it will be appreciated that computer system can select and specify a target as the target setting from the object listing that is sorted according to the place expense.Then, computer system can be determined: this target setting when with tabulation in this ordering in all available targets relatively the time, whether be associated with minimum place expense.If not, system returns to a different target that is associated with the place expense lower than this target setting after can fault so, and with new target as target setting.Will be understood that each process flow diagram and sight described herein only are examples, and exist and recover after the described target faults and adaptable a plurality of other the scenes of target priority.

Go to the Fig. 6 in the accompanying drawing, show according to an aspect of the present invention, general expression is used for returning to after the fault that response uses together with quoting of ordering the process flow diagram of the step that lower place expense target adopted.After target faults among each embodiment of recovery policy environment, Dfs server computer 230 can be classified about when the information that generates when quoting response the target that can be used by Dfs.In one embodiment, Dfs server computer 230 can be classified about the information of the target understood based on the place.In this pattern, quote response and can comprise two goal sets basically: set comprises the target in the place identical with client computer 205, and another set is included in the target in the place that is different from client computer 205.At first, the target in each set can be randomly ordered.

In another embodiment, Dfs server computer 230 can divide class reference based on the place expense.In this operator scheme, quote response and can be classified into a plurality of bounded sets.Each bounded set can comprise the target that has the identical place expense of being determined by Dfs server (can based on determining about the place Overhead of request client computer).Bounded set can make that the target in the place identical with client computer can be in first bounded set by the place expense ordering that increases progressively; The target that has minimum place expense secondly can be in second set, and is like that.At first, the target in each set can be randomly ordered.

Like this, when client computer when the request of step 602 place is quoted, the response of quoting of ordering can be provided by Dfs server computer 230.Client computer can begin at step 604 place to attempt setting up connectedness with each target of quoting in the response then, to determine first available target.When target owing to may be unavailable the time such as any amount of reason such as network error, target collapse, the Dfs client program can be fixed a breakdown to next available targets.For example, next target that can make and quote in the object listing in the response is set up connective trial.In the time may setting up connectedness with target, this specific target can be designated as target setting at step 606 place.

But may become the time spent once more than the better target of setting formerly of target when one or more, the Dfs client program can perhaps can obtain or obtain once more available better target for the target of continuity and this setting of seamlessness purpose continuation use.By having the bounded set of recovery policy and target after the fault, but when the time spent, the better target that can advantageously take into account such as the target that has lower place expense is acquired or obtains once more.

Like this, if recovery policy is specified after this target faults (for example, have target faults after the recovery policy position be set), client computer can be determined at step 608 place so: more preferably possible available such as lower place expense target.Should determine and at any time to make, and can start by client computer 205, Dfs server computer 230 or any other remote computer.And recovering after the fault constantly can be corresponding to from setting up the elapsed time that the connective moment begins with target setting.For example, client computer can be set up connectedness from first target setting and check after back 30 minutes whether better target is arranged.Further, recover after the fault constantly can corresponding one day particular moment, such as per half an hour or per five minutes.Further, recovering after the fault constantly can be corresponding to the next one request that comes from 205 pairs of files of client computer.

After fault, recover constantly, if the preferred target such as lower place expense target can be available, can set up the connectedness with this available preferred target so at step 612 place, and this available preferred target can be designated as target setting.Yet, if possible do not exist any availablely such as the preferred target that has lower place expense, can continue to be used at this target setting of step 610 place so as current goal.

Recovery policy can be carried out given Dfs root/link of quoting in the response after the fault.If recover unavailable after the target faults, can use setting to whole Dfs name space at independent link layer.In one embodiment, recover unavailable and available after the target faults at Dfs name space layer at link layer.

In one embodiment, recovering information can be with storing together such as other Dfs information of Dfs metadata after the target faults.For example, can use " Type " field in total root/link information of the metadata of each target.An idle digit position in this field can be identified and verify and act on legacy system.This new digit position can be defined as PKT_ENTRY_TYPE_TARGETFAIL.BACK.

Like this, in one embodiment, be used for can being defined by following pesudo-structure based on the typical format (being called " IDBLOB (ID drips) ") of the metadata of the Dfs in territory:

GUID VolumeId；

USHORT PrefixLength；

WCHAR Prefix[PrefixLength]；

USHORT ShortPrefixLength；

WCHAR ShortPrefix[ShortPrefixLength]

ULONG Type；ULONG State；

USHORT CommentLength；

WCHAR Comment[CommentLength]；

FILETIME PrefixTimeStamp；

FILETIME StateTimeStamp；

FILETIME CommentTimeStamp；

ULONG Version；

Similarly, being used for the typical format (being called " ID BLOB ") of the metadata of isolated Dfs can be by following pesudo-structure definition:

USHORT PrefixLength；

WCHAR Prefix[PrefixLength]；

USHORT ShortPrefixLength；

WCHAR ShortPrefix[ShortPrefixLength]；

GUID VolumeId；

ULONG State；

ULONG Type；

USHORT CommentLength；

WCHAR Comment[CommentLength]；

FILETIME PrefixTimeStamp；FILETIME StateTimeStamp；FILETIMECommentTimeStamp；

NetDfsGetInfo/NetDfsEnum API can retrieve setting from total root/link metadata.Thereby the front end of API that can certificate parameter can be modified, and can explain and return " info level (level of information) " thus the routine of specific information also can be modified.

In order to support to recover after target priority and the target faults, the Dfs client program can attempt returning to after the fault another target of lower place expense and/or higher priority.In one embodiment, the Dfs client program does not return to another target of place expense identical with the current active target and/or identical priority after the fault.

In an embodiment, goal set can be defined as the bounded set of target.For example, the bounded set of target can be the set that has the randomly ordered target of identical place expense.For example can make the indication to the border of the bounded set of target in quoting response, this is by comprise the indication to the border in quoting clauses and subclauses.

Thereby in an embodiment, the root/link of Dfs client program is quoted that response can indicate whether can be to recovering after root/link operational failure, and also can indicate the border of the bounded set between the target of returning.In one embodiment, can be by in references header with quote that the new bit field of following interpolation is used in the existing bit field definition in the clauses and subclauses: typedef struct{ to the form of quoting response of root/link preexist

USHORT?PathConsumed；∥Number?of?WCHARs?consumed?in

DfsPathName (quantity of the WCHAR that in DfsPathName, spends)

USHORT?NumberOfReferrals；∥Number?of?referrals?contained

Here (quantity of quoting that herein comprises)

struct{

ULONG?ReferralServers：1；//Elements?in?Referrals[]

Are referral servers (at Referrals[] in element be to draw

Use server)

ULONG?StorageServers：1；//Elements?in?Referrals[]

Are storage servers (at Referrals[] in element be the storage

Server)

ULONGTargetFailback：1；//Target?Fail-back?is?enabled

For this namespace root/link is (to this name space root/chain

The road is recovered after the target faults and can be used)

}；

ULONG?ReferralHeaderFlags

}；

Union{ //The vector of referrals (quoting vector)

DFS_REFERRAL_V1?v1；

DFS_REFERRAL_V2?v2；

DFS_REFERRAL_V3?V3；

DFS_REFERRAL_V4?v4；

Referrals[i]; // [NumberOfReferrals] (quantity of quoting)

∥

∥WCHAR?String?Buffer[]；∥Used?by?DFS..REFERRAL_V2

(using) by DFS..REFERRAL_V2

∥ } RESP_GET_DFS_REFERRAL; Typedef RESP_GET_DFS_REFERRAL*PRESP_GET_DFS_REFERRAL; Typedef struct{ USHORT VersionNumber; ∥==4 USHORT Size; //Size of this whole element (size of this whole element) USHORT ServerType; ∥ Type of server:0==Don ' t know, 1

==SMB, (type of server: 0==does not know 2==Netware, 1==SMB (clothes

Affair device message block), 2==netware) union{ struct{

USHORT?StripPath：1；∥Strip?off?PathConsumed

characters?from?front?of?DfsPathName?prior?to

Submitting name to UncShareName is (to UncShareName

Submit to before the title, peel off PathConsumed from the DfsPathName front end

Character)

USHORT?NameListReferral：1；∥This?referral?contains

An expanded name list (this quotes the name list that comprises expansion)

USHORT?TargetSetBoundary：1∥Denotes?this?target

Is the first in a target set (represents that this target is an object set

First target in closing) //All targets in have the same

Site-cost or priority rank; (all in this goal set

Target has identical place expense or priority ranking) }; USHORT ReferralEntryFlags };

ULONG TimeToLive; //In number of seconds (with second number represent) union{

struct{

USHORT?DfsPathOffset；∥Offset?from?beginning?of

This element to Path to access (begins to wanting from this element

The side-play amount in the path of visit)

USHORT?DfsAlternatePathOffset；∥Offset?from

Beginning of this element to 8.3 path are (from this element

Begin to the side-play amount in 8.3 paths)

USHORT?NetworkAddressOffset；∥Offset?from?beginning

Of this element to Network path (from this element begin to

The side-play amount of network path) GUID ServiceSiteGuid; //The guid for the site (to the guid of this website) }; Struct{

USHORT?Special?NameOffset；∥Offset?from?this

Element to the special name string (from this element to

The side-play amount of specific names string)

USHORT?NumberOfExpandedNames；∥Number?of?expanded

Names (quantity of expansion title)

USHORT?ExpandedNameOffset；∥Offset?from?this?element

To the expanded name list (is listed as to this expansion title from this element

The side-play amount of table)

}；

}DFS_REFERRAL_V4；

typedef?DFS_REFERRAL_V4*PDFS_REFERRAL_V4；

Those skilled in the art will appreciate that other data structure such as the data structure of separating can be used to provide the indication on the bounded set border between the target of quoting in the response, or be used for indicating and recover after the operational failure.

Fig. 7 shows according to an aspect of the present invention, returns to the process flow diagram of the step that the higher priority target adopted after the fault of quoting response that general expression is used for being used to sort.Among each embodiment of recovery policy environment, Dfs server computer 230 can be understood the information classification about target based on the place after target faults.In this pattern, quote response and can comprise two goal sets basically: set comprises the target in the place identical with client computer 205, and another set is included in the target in the place that is different from client computer 205.At first, the target in each set can be randomly ordered.

In another embodiment, Dfs server computer 230 can based target priority come a minute class reference.In this operator scheme, quote response and can be classified into a plurality of bounded sets.Each bounded set can comprise the target that can have the same target priority that the Dfs server quoted by request determines.Bounded set can make that the target of limit priority can be in first bounded set according to the target priority ordering of successively decreasing; The target that has time high priority can be in second set, and is like that.At first, the target in each set can be randomly ordered.

Dfs server computer 230 also can use the combination of parameters sortnig to set up the response of quoting of ordering.For example, first kind of ordering can move to the target in identical place the top of tabulation.Then, can be based on the global priority that is associated with each target target that sorts.For example, all targets that have a related overall high priority can be sorted to the top of quoting response.Similarly, all targets that have a related overall low priority can be arranged the bottom to this tabulation.Then, remaining target (can be known as " overall situation is common ") can further be classified into each bounded set based on the place expense.

In another embodiment, second kind of ordering can be set up based on the place expense and by the boundary bit of the setting that is arranged in each target of gathering the top and be represented next bounded set.Then, each bounded set can sort according to target priority, make in each bounded set (the place expense that can have identical association inherently), target can be further according to the prioritization of each target association.Like this, in the bounded set based on the place expense, the target that is positioned at this bounded set top can be associated with high priority, and next grouping of target can be associated with next the highest priority (for example, common), and is like that.

In another embodiment, two previous embodiment can carry out together, make target by the priority arrangement on global basis and be arranged in each bounded set.Like this, when client computer 205 when the request of step 702 place is quoted, Dfs server computer 230 can provide the response of quoting of ordering.Client computer can begin at step 704 place to attempt setting up connectedness with each target of quoting in the response then, to determine first available target.For example, next target that can make and quote in the object listing in the response is set up connective trial.In the time may setting up connectedness with target, this specific target can be designated as target setting at step 706 place.

But may the previous target more better than target setting become the time spent once more when one or more, the Dfs client program can perhaps can obtain or obtain once more available better target for continuity and this target setting of seamlessness purpose continuation use.By having the bounded set of recovery policy and target after the fault, but when the time spent, the better target that can advantageously take into account such as the target that has higher target priority is acquired or obtains once more.

Like this, if recovery policy is specified after this target faults (for example, have target faults after the recovery policy position be set), client computer can be determined at step 708 place so: the preferred target such as the target in preferred bounded set can be used.Should determine and at any time to make, and can start by client computer 205, Dfs server computer 230 or any other remote computer.And priority check constantly can be corresponding to the elapsed time quantity after setting up target setting.For example, check after client computer 205 can connect back 30 minutes from first target setting whether better target is arranged.Further, priority check constantly can be corresponding to one day particular moment, such as per half an hour or per five minutes.Further, priority check constantly can be corresponding to the next one request that comes from 205 pairs of files of client computer.

In priority check constantly, if the target of higher target priority can be available, can set up the connectedness with the target of this available higher target priority so at step 712 place, and the target of this higher target priority can be designated as target setting.Yet, if possible there is not any available target that has higher target priority, can continue to be used at this target setting of step 710 place so as current goal.

Like this, the classification of the target in Dfs self straightforward procedure can provide useful ordering advantage.The server target priority can be consistent with above-mentioned place cost.The server target priority can be created the certain classification between the target, if so that when available higher-priority goal is arranged, the target of lower priority may not can receive the traffic.

As mentioned above, quote response and can be classified into each bounded set based on the place expense that each target is associated.Use the server target priority, these bounded sets can be also based on the expense of access destination.The server target priority can just be expanded the expense ranking criteria to target, so set can be those targets that contain identical place expense and server target priority.

In one embodiment, the server target priority can be showed by two values: priority class and priority level.Priority class can be defined within two-layer on: local ground, within the expense goal set of promptly identical place, and globally.In in these each, may there be the rough ordering of height, common and low priority target.This can provide five priority class:

The overall situation is high

Place expense height

The place expense is common

The place expense is low

The overall situation is low

They can sort in listed priority.Notice,, may not have any independently " overall situation is common " class because can be considered to equal with place expense class.Priority level can be the simple integer classification---0,1,2, or the like.

In one embodiment, can be as follows to the process of quoting ordering:

1. can identification the set of the high and target that the overall situation is low of the overall situation, together with remaining " overall situation is common " target.

2. these three set can, the overall situation common and overall low priority orders placement high with the overall situation.

3. exclusive strategy if possible is set, and the target in exclusive set can be removed so.

4. in the set of each in these three set, target can be sorted by place overhead mechanisms (perhaps local place or complete place expense), thereby generates the bounded set of the target that equates the place expense.

5. in the set of " overall situation is common " target of the place expense that equates, target can be sorted by priority class, i.e. place expense height, common and low.

6. in the bounded set of the target of place expense that equates and priority class, target can sort by priority level (0 for the highest).

7. in the bounded set of the target that equates place expense, priority class and priority level, target can be reorganized at random for load balance.

It will be appreciated by those skilled in the art that, embodiment can be selected to carry out these steps with different orders, perhaps can be chosen as efficient and adaptive purpose and only carry out some step in these steps, and reach identical effect and do not deviate from scope of the present invention.

Present in diagrammatic form, may have the set of customization, client computer can receiving target therein:

[global high priority class] (overall high priority class)

[site-cost high priority class for targets of site-cost=0] (to place expense high priority class of the target of place expense=0)

[normal cost=0] (to place expense normal priority class of the target of place expense=0)

[low cost=0] (to place expense low priority class of the target of place expense=0)

[site-cost high priority class fortargets ofsite-cost=1] (to place expense high priority class of the target of place expense=1)

[normal cost=1] (to place expense normal priority class of the target of place expense=1)

[low cost=1] (to place expense low priority class of the target of place expense=1)

[global low priority class] (overall low priority class)

Because target priority information can be on the basis of general objective, be used for safeguarding that the physical slot of this information can be at the Dfs of the object listing that comprises each root/link copy metadata information.The information of each target can be defined by following pesudo-structure:

FILETIME ReplicaTimeStamp；

ULONG ReplicaState；

ULONG ReplicaType；USHORT?ServerNameLength；

WCHAR ServerName[ServerNameLength]；

USHORT ShareNameLength；WCHAR

ShareName[ShareNameLength]；

In one embodiment, target priority can be encoded in UCHAR, is used for storing in metadata:

0-4 position: the priority level in the priority class

5-7 position: priority class

In an embodiment, priority class can be by following value representation:

Place expense common (default) OxO

The high Ox1 of the overall situation

The low Ox2 of the overall situation

The high Ox3 of place expense

The place expense is hanged down Ox4

As an example, the target of the priority level 1 in overall low priority class can followingly be encoded:

Bit?765/43210

010/00001

This coding can be stipulated 32 priority levels and 8 possible priority class, and in the priority class 5 can use the overall situation height, place expense height, the place expense is common, the place expense is low and overall low priority level defines.Priority level can be 0 to 31 numerical value, and 0 is considered to limit priority.Like this, priority level be 0 target can first return and priority level to be those targets of 31 can return in each set at last.

Utility routine such as DfsUTIL can be used to directly disclose the priority class definition for being provided with/checking operation.Perhaps, user interface can disclose priority class by the radio button on the target property page.DfsUTIL and UI can select " place expense normal priority class " as default.

Target priority can be considered to the attribute of Dfs target.Thereby in one embodiment, the general objective attribute that above-mentioned UCHAR value can be used as in the Dfs object is stored in current directory and the registration table.Can followingly provide new DFS_REPLICA_INFORMATION structure: typedef struct DFS_REPLICA_INFORMATION{

PVOID pData；

ULONG DataSize；

UCHAR TargetPriority；

UCHAR[7] Unused；ULONG ReplicaState；

ULONG ReplicaType；UNICODE?STRING ServerName；UNICODE?STRING ShareName；DFS_REPLICA_INFORMATION，*PDFS_REPLICA_INFORMATION；}

DFS TARGET PRIORITY CLASS can provide new enumeration type, and this new enumeration type can define five possible target priority class settings in one embodiment:

typedef?enum{

DfsInvalidPriorityClass＝-1，

DfsSiteCostNormalPriorityClass?0，

DfsGlobalHighPriorityClass，

DfsSiteCostHighPriorityClass，

DfsSiteCostLowPriorityClass，DfsGlobaLowPriorityClass}DFS?TARGET?PRIORITY?CLASS；

Default target priority is provided with and can be＜PriorityClass=SiteCostNormalPriorityClass, PriorityRank=0〉(priority class=place expense normal priority class, priority level=0).This may be to have a mind to for it, because the default value of lower floor (downlevel) metadata is 0.Even the priority of DfsSiteCostNormalPriorityClass may be lower than DfsSiteCostHighPriorityClass, its value also can be 0.

In one embodiment, it may be tuple＜priority class that following structure can be provided to compression, priority level＞the definition of target priority: typedef struct_DFS_TARGET_PRIORITY{

DFS_TARGET_PRIORITY_CLASS TargetPriorityClass；

USHORT TargetPriorityRank

USHORT Reserved；}DFS_TARGET_PRIORITY；

Can represent that the Dfs copy class of root in the Dfs service or link target can comprise the example of new DfsTargetPriority class: class DfsTargetPriority (private:

DFS_TARGET_PRIORITY_TargetPriority，

The DfsTargetPriority class can convert the UCHAR that contains the packing of the target priority information of obtaining from the Dfs metadata to the DFS TARGET PRIORITY form of being more convenient for using.Given DFS TARGET PRIORITY, it also can create the UCHAR value of packing.It also can carry out the priority class definition and the mapping that is used between the priority class that metadata is stored defines of DFS TARGET PRIORITY CLASS.

The REPLICA COST INFORMATION of existing struct (structure) type can be converted into the new class that is called DfsTargetCostInfo: class DfsTargetCostInfo private:

ULONG TargetCost; //Site-cost (place expense)

DfsReplica*pReplica；∥Server?priority?is?an?attribute

OfDfsReplicaBOOLEANIsBoundary; (server priority is DfsReplica

The attribute of the IsBoundary of BOOLEAN (boolean) type) public:BOOLEAN operator＜=(DfsTargetCostInfo ﹠amp; Rhs);

BOOLEAN?operator！＝{DfsTargetCostInfo?&rhs)；

DfsTargetCostInfo&?operator＝(const?DfsTargetCostInfo

&rhs)；

Existing struct type REFERRAL INFORMATION can be converted into and will contain the class of DfsTargetCostInfo object array.Relating to shuffles, sorts and generate this logic of quoting can be compressed in this new class.Such also can convert the DfsTargetCostInfo object array that generates to the REFERRAL HEADER form of DFS agreement expectation.

Can following execution according to the ordering of quoting of target priority.Given two targets, r1 and r2, if r1 need come before the r2, r1 can be considered to＜=r2.Thereby if r1＜=r2, quoting of ordering can look like { r1, r2} so.Following observation is depended in right＜=execution relatively:

To the target in the global priority class, at first can compare priority class.And, at first can compare the place expense to the target in the non-global priority class.

1. if one or two target is all in the global priority class:

If a. priority class may be inequality, determine ordering based on priority class so.For example, if r1 may be in DfsGlobalHighPriorityClass, so r1 can come before the r2 and and the priority class of r2 irrelevant.

B. otherwise, priority class may be identical, so relatively the place expense of r1 and r2.If the place expense of place expense＜r2 of r1, r1＜r2 so.

C. priority class may be all identical with the place expense, forwards step 3 so to.

2. two targets all may be in the global priority class:

If a. target place expense may be different, if the place expense of place expense＜r2 of r1, r1＜r2 so.

B. otherwise, the place expense may be identical, checks priority class so.If r1 compares r2 in the higher priority class, so r1＜r2.

C. the place expense may be all identical with priority class, forwards step 3 so to.

3. priority class may be all identical with the place expense.If comparing r2, r1 has higher priority level (lower on the numerical value), r1＜r2 so.

To the global priority class, quote and to sort according to priority level then at first according to the ordering of place expense.This is contingent, because this can be the pattern that compares in other situation.For example, to the priority class of the non-overall situation, when the place expense equates, only consider priority level.

Fig. 8 shows according to an aspect of the present invention, and general expression is used in one embodiment sort and quotes the process flow diagram of the step that response adopts.When quote request can be sorted, can carry out the various combinations of said method.In this embodiment shown in the process flow diagram of Fig. 8, place understanding, place expense and target priority can respectively be used for quoting the target ordering of response.

At step 802 place, satisfy the tabulation of client computer request target and can sort for quoting the response gathering.Then, at step 804 place, the target in the place identical with requesting computer can be understood the top that is ordered in tabulation in foregoing place.At step 806 place, remaining target can sort according to global priority.More specifically, the target that is associated with overall high priority can head for target the top ordering of tabulation, and the bottom ordering that the target that is associated with overall low priority can the head for target tabulation.

Next step, may not be designated as the target that the overall situation is high or the overall situation is low can be according to the place expense ordering of association.In one embodiment, may not be designated as the high or overall low target of the overall situation like this can be designated as overall common.Like this, these targets can be grouped into the bounded set of target, make in any given bounded set each target can with all other target class in this specific bounded set that coexists like or the place expense that equates be associated.And in one embodiment, first target of each in each bounded set can comprise the boundary bit of the setting that can indicate the bounded set reference position.

At step 810 place, each bounded set can further sort based on the priority that is associated with each target in this bounded set.Like this, the target that is associated with high priority in bounded set can be ordered in the top of this bounded set, and the target that is associated with low priority in bounded set can be sorted the bottom to this bounded set.By this way, each bounded set can be by prioritization, and can be nested in the expense ordering of place, and expense ordering in place can be nested in the global priority ordering.

Again, it will be appreciated by those skilled in the art that, embodiment can be selected to carry out these steps with different orders, perhaps can be chosen as efficient or adaptive purpose and only carry out some step in these steps, and reach identical effect and do not deviate from scope of the present invention.

By this way, this system and method can support to recover after target priority and the target faults both.Subscriber's computer system can attempt to return to after the fault another target of lower place expense and/or higher priority.The present invention can advantageously support to quote based on place understanding and/or target priority ordering.Understand ordering based on the place and quote goal set in the place that can provide identical and another set that contains all other targets with the Dfs server quoted is provided to subscriber's computer system.The based target prioritization is provided by the bounded set that can provide according to priority orders, and wherein each bounded set can comprise the target with identical target priority that the subscriber's computer system quoted by request determines.In an embodiment, quote response and can be classified into each bounded set that contains identical place expense and server target priority for one.

Be used to distributed file system to determine to recover after the target faults and the improved system and method for target priority as from aforementioned detailed description, seeing, the invention provides.In order to respond the request that comes from client computer, can to client computer provide can based on each target object listing of sorting of the assessment of related place expense respectively.Can be sorted to the top of quoting response than low expense target, quote response so that client computer can be a logical analysis, before making the trial that is communicated with the foundation of high cost target, be beginning to attempt with being communicated with than low expense target foundation.In addition, also can use the priority ranking of target to carry out ordering to target, whereby, in one embodiment, the target of higher priority also can be ordered in the top of quoting response.And, quote response and can further be sorted the supply that comprises place expense and target priority.Like this, having the target group that equates related place expense can further sort according to the related respectively target priority of each target in this group.Any computer system is all right, by selecting and specify the new target setting that comes from according to the object listing of place expense and/or target priority ordering, uses the quoting response of ordering of the present invention and returns to the target of higher priority after the fault.As understandable now, like this, this system and method provides required significant advantage and interests in calculating the present age.

Although the present invention is to various modifications and replace the structure sensitivity, wherein some shown embodiment shows in the accompanying drawings and as above describes in detail.Yet, should be appreciated that, there is not the intention that limits the present invention to the particular form that is disclosed, and antithesis, is intended to comprise all modifications, replacement structure and the equivalent that belong in the spirit and scope of the present invention.

Claims (20)

1. in computer system, a kind of method that is used for the file of position computer network is characterized in that, described method comprises:

Be arranged in the position of the file at least one server computer of server computer network from the client computer request;

A plurality of positions of definite server computer network that file was arranged in of being asked;

Return an object listing to described client computer, described object listing comprises a plurality of quoting, its each position corresponding to the file of being asked in the described server computer network;

Based target information is categorized into bounded set with described object listing, is used for retrieving the file of being asked between each corresponding document position and described client computer; And

Provide indication to described client computer to described bounded set.

2. the method for claim 1, it is characterized in that, based target information is categorized into each bounded set with described object listing and also comprises based on the assessment of the place expense described tabulation of sorting, comprise described target is divided into bounded set, make in each bounded set each target be associated with the identical place expense of other target in the bounded set separately.

3. the method for claim 1 is characterized in that, provides indication to bounded set to comprise to described client computer the border attribute that comprises the expense between target and the described client computer is provided.

4. method as claimed in claim 2 is characterized in that, the border of described each bounded set is at least in part based on the position of the server computer that is associated with each target.

5. method as claimed in claim 2 is characterized in that, the border of described each bounded set is at least in part based on the associated health status indication of the server computer that is associated with each target.

6. the method for claim 1 is characterized in that, also comprises:

Each target of sequential access that makes repeated attempts and set up according to described ordering; And

When trial and success, set up connectedness with first target of successful access, as the target of the setting that is used for follow-up request of access.

7. method as claimed in claim 6 is characterized in that, also comprises:

Determine whether the target that is associated with lower place expense can be used for providing the subsequent access request; And

If the target of lower place expense can be used, so described target setting is changed into the target of described lower place expense.

8. method as claimed in claim 7, it is characterized in that, as long as describedly determine that whether available the target be associated with lower place expense can use recovery policy after the target faults that belongs to described target comprise, whether just definite target related with lower place expense be available.

9. method as claimed in claim 8 is characterized in that, recovery policy is associated with described object listing after the described target faults.

10. method as claimed in claim 8 is characterized in that, recovery policy is associated with the root that can be associated with each the independent target in the described object listing after the described target faults.

11. the method for claim 1 is characterized in that, also comprises based on exclusive strategy removing at least one target from described object listing.

12. the method for claim 1 is characterized in that, based target information with described object listing be categorized into each bounded set also comprise according to and the priority setting of each target association described target that sorts.

13. method as claimed in claim 12, it is characterized in that, described ordering comprises that also described object listing has been divided into each boundary to be gathered, make each target place expense identical in each bounded set be associated, and comprise also that according to the ordering of priority setting the target priority according to association is arranged on each each target of bounded set internal sort with other target in the bounded set separately of coexisting.

14. method as claimed in claim 12, it is characterized in that, according to the priority setting of each target association sort target also comprise will have the target of the high target priority setting of the overall situation come in the sorted lists the top of bounded set separately, and the target that will have a low target priority setting of the overall situation comes in the sorted lists the bottom of bounded set separately.

15. a distributed computing system is characterized in that, comprising:

Operationally be coupled to the server computer of network, the current directory server computer can be used in response to the request of target and provide an object listing to one or more client computer, each target is corresponding to the file on the computing machine that is arranged in network, described file is by one or more client computer request, described current directory server computer also can be used for according to the assessment of the place expense of each target association described object listing that sorts, indication of described place expense and expense from being associated to the client computer of request target corresponding to retrieving files the server computer of target;

Be coupled at least one client computer of described network, described client computer can be used for to other computing machine request and retrieving files of being coupled to network; And

At least one server computer corresponding to institute's demand file of at least one target that provides by described current directory server computer is provided thereon.

16. Distributed Computer System as claimed in claim 15, it is characterized in that, described current directory server computer also is used for described object listing is categorized into each bounded set, make in bounded set separately each target be associated with the identical place expense of other target in the bounded set separately, and make described bounded set according to bounded set in the place expense of each target association be sorted.

17. Distributed Computer System as claimed in claim 16 is characterized in that, described server computer also can be used for being arranged on each each target of bounded set internal sort according to the target priority with each target association.

18. Distributed Computer System as claimed in claim 17, it is characterized in that, it is target setting that described client computer also can be used for specifying first available targets, and determine subsequently that described target setting is compared with other target in the described object listing and whether be associated with minimum place expense, if not, switch to the available targets that contains lower place expense so, and to specify the described target that contains lower place expense be target setting.

19. Distributed Computer System as claimed in claim 17, it is characterized in that, it is target setting that described client computer also can be used for specifying first available targets, and determine subsequently that described target setting is compared with other target in the described object listing and whether be associated with preferred priority, if not, switch to so and contain the more preferably available targets of priority, and to specify the described target that contains preferred priority be target setting.

20. the computer-readable medium of store data structure thereon is characterized in that described data structure comprises:

First field is used to store the target that belongs to a target group, and each target is associated with a server computer;

Second field is used to store the information of indicating the relation between client computer and the described server computer; And

The 3rd field is used to store the value on the border of the described target group of indication.

Images