Method and system for referral management

[0002] This application claims priority benefits of prior filed copending U.S. provisional application Ser. No. 60/139,627 filed Jun. 17, 1999, which is incorporated herein by reference.

[0003] The present invention is related generally to computers and networks and is related more particularly to methods and systems for using computers and networks to manage referrals.

[0004] There is a growing need in essentially all sectors of human endeavor including business, industry, government, education and science to find and acquire resources that can satisfy a wide variety of demands. One example is in the area of employment where, for some disciplines, the competition for qualified people is so intense that it is necessary to use search firms and recruiters to find and employ suitably qualified people. Another example is in the area of real estate where agents are frequently used to match selling or leasing opportunities with the particular needs of prospective buyers or lessors. The area of employment is illustrative and is discussed more fully in the following paragraphs.

[0005] There is a growing trend to use computers and networks to facilitate finding and acquiring resources. such as employees. For example, computers and networks like the Internet are already used to provide wide access to lists of employment opportunities that are maintained in databases. Various tools, generally known as search engines, are provided to facilitate searching the databases for employment opportunities that match a of criteria. Unfortunately, the extent to which these systems have helped attract qualified people to fill the listed employment opportunities has been disappointing.

[0006] Two ways by which companies have sought qualified employees is through recruiting firms and through employee-referral programs. Recruiting firms identify and refer candidates in exchange for an opportunity to receive a recruiting fee. Employee-referral programs solicit referrals by offering referral fees to people that are already employed by the company. These two ways may be adequate to satisfy employment opportunities in situations where there is an abundant supply of qualified people; however, they are proving to be inadequate in situations that require people with education, training, skills or experience that are either difficult to find or are in such great demand that the need exceeds the supply. A more extensive network of people who can refer potential employees is needed.

[0007] A similar need for such a referral network exists in other areas such as real estate, “matchmaking” in a social context, and auctions. At present, there is no known mechanism that can develop or manage such a network.

[0008] It is an object of the present invention to provide for a method and system that can be used to develop and manage a large referral network by which resources may be referred to entities that have need for such resources.

[0009] According to one aspect of the present invention, a method for managing referrals that includes receiving an opportunity description and related referral-payment information that represents terms for paying a resource-referral fee, and in response, generating an opportunity identifier that uniquely identifies the opportunity and recording in an opportunity database the opportunity description, the related referral-payment information and the opportunity identifier; receiving a search request and, in response, providing information from the opportunity database that is obtained from the opportunity description and the related referral-payment information; accepting a referral that includes a resource description that describes a resource, and in response, generating a referral identifier that uniquely identifies the referral, and recording in a referral database the resource description and the referral identifier; and receiving an indication a trigger event has occurred with respect to the opportunity and the resource, and in response, determining a referral fee according to the related referral-payment information, and generating information indicating that payment of the referral fee is due.

[0010] According to another aspect of the present invention, a method for soliciting referrals that includes receiving an opportunity description and related referral-payment information that represents terms for paying one or more resource-referral fees that vary according to one or more criteria, and in response, generating an opportunity identifier that uniquely identifies the opportunity and recording in an opportunity database the opportunity description, the related referral-payment information and the opportunity identifier; and receiving a search request and, in response, providing information from the opportunity database that is obtained from the opportunity description and the related referral-payment information.

[0011] According to yet another aspect of the present invention, a method for managing referrals that includes accepting a referral that identifies an opportunity and includes a resource description, and in response, generating a referral identifier that uniquely identifies the referral and recording in a referral database the resource description and the referral identifier; and receiving an indication that a trigger event has occurred with respect to the resource, and in response, determining a referral fee according to a plurality of fees and one or more criteria and generating information indicating that payment of the referral fee is due.

[0012] According to a further aspect of the present invention, a method for managing referrals that includes receiving a referring-party description and related information that includes one or more characteristics of the party; generating a party identifier that uniquely identifies the party; recording in a database the party description, the related information and the party identifier; and providing to the party a representation of the party identifier.

[0013] The various features of the present invention and its preferred embodiments may be better understood by referring to the following discussion and the accompanying drawings in which like reference numerals refer to like elements in the several figures. The contents of the following discussion and the drawings are set forth as examples only should not be understood to represent limitations upon the scope of the present invention.

[0014] FIG. 1 is a block diagram of several computer systems including one computer providing referral management according to the present invention that are interconnected by a communication facility such as a network.

[0015] FIG. 2 is a block diagram of a computer system that may be used to carry out various aspects of the present invention.

[0016] FIGS. 3 and 4 are block diagrams of illustrating various aspects of a referral management system according to the present invention.

[0017] FIG. 5 is a block diagram of one method for receiving and recording opportunities.

[0018] FIG. 6 is a block diagram of one method for receiving and responding to search requests of an opportunity database.

[0019] FIG. 7 is a block diagram of one method for receiving and recording referrals.

[0020] FIG. 8 is a block diagram of one method for initiating payment to a referring party in response to a trigger event associated with an opportunity.

[0021] FIG. 9 is a block diagram of one method for registering referring parties.

[0022] The present invention may be used to facilitate and manage the solicitation and submission of referrals. FIGS. 3 and 4 illustrate processes that may be used in a referral management system (RMS) to carry out various aspects of the present invention.

[0023] A first aspect of the present invention represented by POST 110 includes receiving from an “originator” information that describes an “opportunity” by either describing needs that can be fulfilled by a “resource” or by describing the desired resource itself, and that describes terms under which payment will be made to a “party” that refers one or more resources.

[0024] The originator is a person or other type of entity that decides to solicit referrals of resources that can potentially satisfy the opportunity. The originator can solicit referrals for its own opportunity or for the opportunity of another entity or person.

[0025] The opportunity may be essentially any type of need such as a need for an employee or contract worker, a need for unimproved or improved real estate such as a house, or a desire for a social acquaintance.

[0026] The party may be a person or other type of entity that decides to refer a resource that can potentially satisfy an opportunity. The party can refer itself or it can refer another entity or person.

[0027] A second aspect of the present invention represented by SEARCH 120 includes receiving a request from a party to search or browse published descriptions of opportunities and, in response, returning appropriate information to the party making the request.

[0028] A third aspect of the present invention represented by REFER 130 includes receiving information from a party that describes a resource that can potentially satisfy an opportunity.

[0029] A fourth aspect of the present invention represented by PAY 140 includes paying a party for a referral according to terms associated with an opportunity.

[0030] A fifth aspect of the present invention represented by REGISTER 150 includes receiving information describing a party that may subsequently submit a referral.

[0031] Several methods or processes that may be used to carry out these aspects of the present invention are discussed below. A few variations are presented that may be used in various combinations.

[0032] 1. Posting an Opportunity

[0033] FIG. 5 is a block diagram of one method that may be used to post opportunity descriptions. According to this method, step 112 receives information from an originator that describes an opportunity and provides referral-payment information that specifies the terms under which payments will be made for resource referrals. Preferably, the descriptive information includes a classification of the opportunity, discussed below, and any pertinent geographical information. This information may also include one or more acceptance criteria that must be satisfied before a referral is accepted, and one or more “trigger events” that specify when the payment of a referral fee to referring parties is due. Other types of information are discussed throughout this disclosure.

[0034] In employment applications, the opportunity classification mentioned above could be the field of employment, the type of position, and a likely range for salary or pay rate. In real estate applications, the opportunity classification could be commercial or residential, business or industrial, single- or multi-family residence, single- or multi-story, etc.

[0035] Step 113 determines whether the information submitted by the originator satisfies all criteria that must be satisfied before the opportunity description is accepted. The acceptance criteria, if any, for an opportunity description may be established as desired. For example, the acceptance criteria may require certain types of information or may require the originator to be registered, perhaps by paying a registration fee. In an alternative implementation, step 113 is omitted because no acceptance criterion is imposed and the method continues with step 114.

[0036] If the information submitted by the originator does not satisfy all acceptance criteria, step 119 notifies the originator that the submission has been rejected. Preferably, the notification informs the originator what criterion was not satisfied or how the criterion can be satisfied.

[0037] If the information submitted by the originator satisfies all acceptance criteria, step 114 generates an identifier that uniquely identifies the opportunity. This identifier as well as other identifiers disclosed herein may be obtained in any manner that provides unique identification. For example, the opportunity identifier may be derived from a monotonically increasing number such as a count of all opportunities accepted thus far, or it may be derived using information that is unique to the originator.

[0038] The identifier may be derived in a secure manner that prevents valid identifiers from being easily guessed. For example, the identifier may be derived with check codes or by hashing. Secure identifiers could be used by an originator to remain anonymous yet provide a way for a RMS to authenticate an originator for subsequent transactions such as picking up referrals. It is anticipated that, in preferred implementations, a RMS that permits an originator to remain anonymous at the time of posting would required that originator to divulge its identity to at least the operator of the RMS before referral information could be retrieved.

[0039] Step 116 records in an “opportunity database” information that describes the opportunity and the related referral-payment information, and the opportunity identifier. Any other information that pertains to this opportunity, such as the referral acceptance criteria mentioned above, may also be recorded.

[0040] Step 118 returns the opportunity identifier to the originator. Step 118 may be omitted in an alternative implementation; however, preferred implementations include this step because it confirms to the originator that the opportunity has been accepted and recorded.

[0041] 2. Searching Opportunities

[0042] FIG. 6 is a block diagram of one method that may be used to search or browse posted opportunities. According to this method, step 122 receives a request from a party to search or browse opportunities that are posted in the opportunity database. If desired, this step may validate the syntax or content of the request and notify the party if the request is invalid. It is assumed herein for the sake of simplicity that the request is valid.

[0043] Step 124 fetches information from the opportunity database in response to the request. The request may pertain to the classification of the opportunity, to pertinent geographical information or to any other information that is recorded in the database. If desired, a RMS may support searches based on referral-payment criteria. Such searches would allow a party to identify those opportunities offering the most attractive referral payments. In an employment application, for example, a search could be based on the field of employment, years of experience required, type of employer and/or range of salary.

[0044] Step 126 returns a representation of the information fetched in step 124.

[0045] 3. Referring Resources

[0046] FIG. 7 is a block diagram of one method that may be used to submit a resource description as a referral. According to this method, step 132 receives information from a referring party that describes a resource and preferably identifies the opportunity for which the referral is being made. Preferably, this information also includes an identifier that uniquely identifies the referring party. An implementation that does not require a party identifier is described below.

[0047] Step 133 determines whether the information submitted by the party satisfies all criteria that must be satisfied before the referral is accepted. The acceptance criteria, if any, may be established by the originator or by the operator of the RMS, for example, and recorded in the opportunity database as described above. The acceptance criteria may require the referring party to be registered. In an employment application, for example, the acceptance criteria may restrict acceptance to only those referrals that include a resume for the referred person or that include an indication that the referred person is aware of and approves the referral.

[0048] In preferred implementations that accept resumes, information is extracted from the resumes in a manner that utilizes context-sensitive parsing to improve the accuracy and usefulness of the extracted information. Techniques for extracting information from resumes are disclosed in U.S. Pat. Nos. 5,164,899 and 5,197,004, both of which are incorporated herein by reference.

[0049] If the information submitted by the party does not satisfy all acceptance criteria, step 139 notifies the party that the referral has been rejected. Preferably, the notification informs the party what criterion was not satisfied or how the criterion can be satisfied.

[0050] If the referral submitted by the party satisfies all acceptance criteria, step 134 generates an identifier that uniquely identifies the referral. This referral identifier may be obtained in essentially any manner that uniquely identifies the referral including a derivation from a count of all referrals accepted thus far or from information that is unique to the party. A secure identifier may also be used to maintain the true identity of the referring party until required at a later time. This feature may be especially useful to parties who wish to refer themselves anonymously.

[0051] Preferably, a priority is assigned to referrals according to the order in which the referrals are accepted. This may be accomplished in a wide variety of ways such as by recording the date and time a referral is accepted. In implementations that derive a referral identifier from a monotonic sequence such as a count of accepted referrals, the identifier itself may used as an indication of priority. The priority can be used to resolve fee disputes between parties that refer the same resource.

[0052] Step 136 records in a “referral database” information that describes the referral, and the referral identifier. Any other information that pertains to this referral such as the referring party identifier may also be recorded.

[0053] Step 138 returns the referral identifier to the referring party. Step 138 may be omitted in any implementation that does not require the party to know the identifier; however, preferred implementations include this step because it confirms to the party that the referral has been accepted and recorded.

[0054] 4. Making Payment

[0055] FIG. 8 is a block diagram of one method that may be used to make payment to a referring party. According to this method, step 142 receives an indication that a “trigger event” for a particular opportunity has occurred. As explained above, a trigger event indicates when payment to a referring party is due.

[0056] A wide range of trigger events are possible. In an employment application, for example, a trigger event may occur when a person is called for a personal interview, is hired, or is hired and employed for a specified period of time such as three months. In a real estate application, a trigger event may occur when an offer is made to buy a property, when the owner of the property accepts an offer, or when the sale of a property is consummated. Essentially any trigger event may be specified. Furthermore, multiple trigger events may be specified for a particular opportunity.

[0057] Step 144 fetches referral-payment information from the opportunity database for the opportunity that is associated with the trigger event and determines the amount of payment that is due. The referral-payment information may indicate that the amount of payment varies according to one or more criteria. A few examples are discussed below that show essentially any fee-payment arrangement is possible.

[0058] A first example is a payment amount that varies as a function of the type of trigger event that has occurred. In an employment application, for example, a particular opportunity may be associated with trigger events for (1) a personal interview with a referred person before a position is filled, (2) hiring the referred person to fill the position, and (3) a satisfactory employee review after three months of employment. Progressively larger fees could be defined for each successive trigger event. In principle, any combination of trigger events and associated fees is possible.

[0059] A second example is a payment amount that varies as a function of the qualifications of the referred resource. An originator may post a list of resource criteria that is being sought to satisfy an opportunity and, for each criterion that is met, a fee can be specified. In an employment application, for example, resource criteria could include a specified number of years of related employment experience, a college degree in a related fee, and managerial experience.

[0060] A third example is a payment amount that varies according to characteristics of the person or entity that submitted a referral, or the amount of information that was included in the referral. Continuing the employment example, different fees could be specified according to whether the referring party is deemed to be a full-time or part-time employment recruiter, whether the party knows the referred person personally, whether the referred person was aware of and agreed to the referral, and whether the referring party provided a sufficiently detailed resume for the referred person. A schedule of fees could be established to encourage a referring party to provide more complete information about itself or about the referred resource.

[0061] Preferably, each referral is assigned a priority at the time it is accepted and that priority is used to resolve any disputes that may arise between parties that referred the same resource. In one implementation, the referral fee is paid to the party associated with the referral having the highest priority.

[0062] Step 146 generates information that may be printed or transmitted in some form that either provides notification of the amount that is due, or that initiates actual payment of the amount that is due. The content of the information and the recipient may be established uniformly for all opportunities posted in a referral management system, they may vary according to originator or party, or they may vary for each opportunity. A few examples are described in the following paragraphs.

[0063] In a first example, the operator of a RMS is responsible for payment. Step 146 either notifies the operator that payment is due or, alternatively, causes payment to be made by initiating one or more transactions in appropriate financial systems.

[0064] In a second example, the originator of an opportunity is responsibility for payment. Step 146 provides to the originator a notification of the amount of the fee that is due and the identity of the party to receive payment. Preferably, step 146 also provides a copy of this notification to the referring party.

[0065] In a third example, step 146 provides to the referring party a notification of the amount of the fee that is due and the person or entity that is responsible for payment. In this example, the referring party is expected to send an invoice to the responsible entity.

[0066] Preferably, step 146 also provides a copy of this notification to the person or entity responsible for payment.

[0067] 5. Registering Referring Parties

[0068] In preferred implementations, referrals are accepted only from registered parties. If desired, registration could be encouraged by permitting only registered parties to search or browse the opportunity database.

[0069] FIG. 9 is a block diagram of one method that may be used to register referring parties. According to this method, step 152 receives information that describes a party wishing to register so that referrals may be submitted. Preferably, the descriptive information includes a classification of the party such as, for example, an indication of the field of the party's employment and some indication of work experience. If the party's field of employment is submitting referrals, the information could also indicate whether this work is full-time or part-time.

[0070] Incentives could be provided to encourage the party to provide additional information. For example, incentives could be provided by assigning parties to higher tiers or classifications in exchange for additional information, and making higher referral-payments available to the parties that are placed into these higher tiers or classifications.

[0071] Step 153 determines whether the information submitted by the party satisfies all criteria that must be satisfied before the party description is accepted for registration. The acceptance criteria, if any, for a party description may be established as desired. For example, the acceptance criteria may restrict acceptance to only those parties that are full-time recruiters or that provide a minimum amount of descriptive information about themselves. In an alternative implementation, step 153 is omitted because no acceptance criterion is imposed and the method continues with step 154.

[0072] If the information submitted by the party does not satisfy all acceptance criteria, step 159 notifies the party that the submission has been rejected. Preferably, the notification informs the party what criterion was not satisfied or how the criterion can be satisfied.

[0073] If the information submitted by the party satisfies all acceptance criteria, step 154 generates an identifier that uniquely identifies the party. This party identifier may be obtained in essentially any manner that uniquely identifies the party including a derivation from a count of all party registrations or from information that is unique to the party. Secure identifiers may be used if desired to preserve anonymity until such time as the true identity is required such as, for example, when a referral fee is to be paid.

[0074] Step 156 records in a “referring-party database” information that describes the party and the party identifier. Other information that pertains to this party may also be recorded.

[0075] Step 158 returns the party identifier to the party. Step 158 may be omitted in an alternative implementation; however, preferred implementations include this step because it confirms registration to the party.

[0076] The features described below may be incorporated into implementations of the present invention as desired.

[0077] 1. Party Rating

[0078] Referring parties may be rated and the ratings themselves may be used in a number of ways. A few implementations are mentioned briefly.

[0079] In one implementation, a referring party is paid a referral fee that is calculated at least in part based on a rating of the party. This may be accomplished by establishing a hierarchy of parties in which higher-rated parties are paid higher referral fees and lower-rated parties are paid lower referral fees. Alternatively, this may be accomplished by assigning each party a rating score that serves as a weighting factor in a fee calculation.

[0080] In a second implementation, parties with higher ratings receive referral-fee payments for a larger number of trigger events. In an employment application, for example, parties having the lowest ratings are paid a fee for each referral that is and remains employed for three months, whereas parties having the highest ratings are paid one fee for each referral that is called for an interview, paid a second fee for each referral that is hired, and are paid a third fee for each referral that remains employed for three months.

[0081] In a third implementation, an originator accepts referrals from only the parties that have a rating higher than a specified threshold.

[0082] The ratings may be established in essentially any matter. For example, the rating of a party may reflect the number of successful referrals the party has submitted, or it may reflect a success rate or percentage of successful referrals. The meaning of a “successful” referral may be established as desired. The rating may be based on an assessment by either the originator or by the referred resource or resource owner. A combination of factors may be used to establish a party rating.

[0083] 2. Penalties

[0084] In addition to or instead of the party ratings discussed above, a party with a potential referral can be encouraged to submit only high-quality referrals by imposing a penalty on referral that are deemed to be of low quality. This penalty could be included in the ratings discussed above and/or it could be implemented by debiting a penalty fee from the party's account. These penalties would offset any referral fees the party might earn through successful referrals.

[0085] This penalty feature could be used to discourage a party from submitting large numbers of “garbage” referrals that the party does not know to be suitable. Any undesirable behavior, either by party or originator, may be subject to a penalty fee as desired.

[0086] 3. Fee Splitting

[0087] An implementation of the present invention may facilitate referral-fee splitting between a referring party and another party. For example, a first party who searches the opportunity database does not know a suitable resource personally and decides to enlist the assistance of a second party who does know the resource personally. The first party solicits this assistance by offering to share a referral fee. The RMS may incorporate one or more features to facilitate fee splitting.

[0088] One feature allows the first party to record in the opportunity database a fee-splitting arrangement that is used by a RMS to determine the fee due to each party at the time a trigger event occurs. In other words, the RMS implements the fee-splitting arrangement.

[0089] A second feature allows the first party to submit a preliminary referral with incomplete information that, in effect, reserves the right to submit a referral for a particular resource. The second party, who agrees to a fee-splitting arrangement with the first party, submits additional information for the referred resource to complete the referral. For example, in an employment application, a first party discovers a posted opportunity in the opportunity database and recalls a person who the first party does not know well but believes to be a suitable candidate for referral. The first party submits a preliminary referral that identifies the person but the first person is not able to include all of the information that is requested by the originator. This preliminary referral is given priority over all subsequent referrals of this person. The first party then contacts a second party, negotiates a fee-splitting arrangement, and arranges for the second party to augment the preliminary referral by providing the missing information. The RMS could use the priority accorded the preliminary referral to prevent the second party from receiving a referral fee for referring the person directly, thereby avoiding the fee-splitting arrangement with the first party.

[0090] A third feature implements a tiered-marketing structure whereby referral fees are automatically allocated among a hierarchy of parties. It is anticipated that a system that implements such a feature either would require all referring parties to be sponsored by another party already registered in the system, thereby clearly defining the proper hierarchical relationship, or would require all referring parties to identify themselves clearly so that a party registered in the tiered-structure not could also register under an alias outside the structure to submit a referral that avoids fee splitting.

[0091] 4. Auctions

[0092] An implementation of the present invention may. facilitate auctions. An originator may hold an auction in which parties bid for a chance to submit referrals. A party may hold an auction in which originators bid for a chance to receive a referral.

[0093] If an originator has an opportunity for which numerous parties have potential resources to refer, the originator may wish to hold an auction allowing the parties to bid down the fee that must be paid for a successful referral. The originator could accept referrals from the party who bid the lowest referral fees.

[0094] If party has a resource that is in great demand, the party may wish to hold an auction allowing originators to bid up the fee that must be paid for a successful referral. The party could then submit the referral to the originator who bid the highest referral fee.

[0095] 5. Referral-Fee Database

[0096] An implementation of the present invention may provide a database of referral-fees that can be browsed or searched. On one hand, a referring party can search the database for opportunities that offer the highest referral fees. On the other hand, an originator can search the database to learn what fees are being offered by others and determine what referral fees should be offered for a new opportunity posting. The referral-fee database may be a part of the opportunity database.

[0097] 6. Party Notification

[0098] An implementation of the present invention may include features that provide notification of various events. For example, a potential referring party can be notified of the posting of a new opportunity or the modification of an existing opportunity that meets one or more criteria. An originator can be notified of a new referral or the modification of an existing referral that is submitted in response to a posted opportunity. A party can be notified of the occurrence of a trigger event. Notification may be made in many ways including by conventional mail, by electronic mail, by facsimile, by electronic paging, or by telephone call using speech-synthesis technology.

[0099] 7. Resource Checking

[0100] An implementation of the present invention can provide a feature that facilitates checking a referred resource. In an employment application, this feature would facilitate checking the references and former employers and co-workers of a referred person. This could be done by constructing a resource database of employee and employer information that is extracted from submitted opportunities and referrals. The resource database could be augmented from other sources of information sources to provide a more complete picture of who worked for whom and when. This database could be interrogated to either confirm information provided on resumes or to identify individuals that could be contacted to better assess the qualifications of a prospective employee. Resource-checking fees could be paid to encourage participation.

[0101] Various aspects of the present invention may be carried out by an arrangement such as that illustrated in FIG. 1, which is a block diagram of computer systems interconnected by communication facility 40 in the form of a network such as the Internet. Computer systems 11 and 12 each provide services to an originator that is an entity or person having an opportunity or need for one or more resources. Computer systems 21 to 24 each provide services to a party that is an entity or person that may refer one or more resources capable of satisfying the opportunity of an originator. Computer system 30 provides services to carry out various aspects of a RMS according to the present invention. Communication facility 40 may be essentially any facility such as a network, switch, or point-to-point communication path that allows computer system to communicate with one another. No particular feature of this arrangement is important to the present invention.

[0102] FIG. 2 is a block diagram of computer system 50 that may be used to provide services to an originator, a party, or a referral management system. CPU 52 provides computing resources. Input control 53 represents an interface to input device 54 such as a keyboard or mouse. RAM 59 is system random access memory (RAM). Storage control 55 represents an interface to storage device 56 that includes a storage medium such as magnetic tape or disk, or an optical medium. The storage medium may be used to record programs of instructions for operating systems, utilities and applications, and may include embodiments of programs that implement various aspects of the present invention. In computer system 30, storage device 56 may also be used to record opportunity, party and resource information needed to provide a referral management system. Display control 57 provides an interface to display device 58. Communication control 47 represents an interface to communication channel 42 that connects to communication facility 40.

[0103] Throughout this disclosure, mention is made of separate opportunity, referral and party databases. Implementations of the present invention do not require distinct or separate databases for recorded information. For example, information may be recorded in tables or other structures that are incorporated into a single database. No particular organization of information is required.

[0104] In the embodiment shown, all major system components connect to bus 51, which may represent more than one physical bus. For example, some personal computers incorporate only one bus that conforms to the so called Industry Standard Architecture (ISA) or some variant of ISA. Other computers incorporate an additional bus such as a higher bandwidth bus conforming to some bus standard such as the Peripheral Component Interconnect (PCI) local bus standard. A bus architecture is not required to practice the present invention.

[0105] The features required to practice various aspects of the present invention can be performed by components that are implemented in a wide variety of ways including discrete logic components, one or more Application Specific Integrated Circuits (ASIC) and/or program-controlled processors. The manner in which these components are implemented is not important to the present invention. For example, the operations required to practice the present invention can be implemented in a computer system such as computer system 50 by programs of instructions that are stored in storage device 56, copied into RAM 59 and executed by CPU 52.

[0106] Such software may be conveyed by a variety of machine readable media including magnetic tape, magnetic disk, optical disc, and baseband or modulated communication paths throughout the spectrum including from supersonic to ultraviolet frequencies. Various aspects can also be implemented in various components of computer system 50 by processing circuitry such as ASICs, general-purpose integrated circuits, microprocessors controlled by programs embodied in various forms of read-only memory (ROM) or RAM, and other techniques.