Self-policing, rate limiting online forums

This application is a continuation of U.S. patent application Ser. No. 09/968,539, filed Oct. 2, 2001, now U.S Pat. No. 6,826,618, which is a continuation of U.S. patent application Ser. No. 09/076,484, filed May 13, 1998, now U.S. Pat. No. 6,339,784, which claims priority from provisional application number 60/047,235 filed May 20, 1997, the entire contents of the prior applications being incorporated herein by reference.

BACKGROUND

1. Technical Field

This invention relates to distributed computer services, particularly computer services having online forums.

2. Background Information

An online forum is a communications interchange in which people may communicate with others through successive electronic transmissions between respective computer systems. An online forum, or any other type of distributed computer services, may be implemented on a distributed computer system such as that shown in <figref idref="DRAWINGS">FIG. 1</figref>. Forum participants (equivalently, users of the computer services) typically are scattered across a large geographical area and communicate with one or more central server systems <b>100</b> through respective client systems <b>102</b> (e.g., a personal or laptop computer). In practice, the server system <b>100</b> typically will not be a single monolithic entity but rather will be a network of interconnected server computers, possibly physically dispersed from each other, each dedicated to its own set of duties and/or to a particular geographical region. In such a case, the individual servers are interconnected by a network of communication links, in known fashion. One such server system is “America Online” from America Online Incorporated of Virginia.

Each client system <b>102</b> runs client software that allows it to communicate in a meaningful manner with corresponding software running on the server system <b>100</b>. The client systems <b>102</b> communicate with the server system <b>100</b> through various channels, such as a modem <b>104</b> connected to a telephone line <b>106</b> or a direct Internet connection using a transfer protocol such as TCP/IP (Transfer Control Protocol/Internet Protocol). The server system <b>100</b> is responsible for receiving input from the client systems <b>102</b>, manipulating the collective body of input information (and possibly information from other sources) into a useful format, and retransmitting the formatted information back to one or more clients <b>102</b> for output on an output device, such as a display screen.

Referring to <figref idref="DRAWINGS">FIG. 2</figref>, one type of forum is a “chat room” <b>200</b>, in which the various participants <b>204</b> (e.g., “Allens9,” “JOSHUAALEX,” etc.) may enter text which appears in a scrolling text window <b>202</b> on each participant's computer display screen. In the example in <figref idref="DRAWINGS">FIG. 2</figref>, the chat room <b>200</b> has 22 participants whose identities (or “screen names”) are listed in a scrolling window <b>210</b>. A participant <b>204</b> may respond to the comment of another participant <b>204</b> by entering a line of text in an edit box <b>206</b> and activating (e.g., by clicking with a pointer device, such as a mouse) a SEND button <b>208</b>. In response, the text in the scrolling text window <b>202</b> scrolls upwards and the newly entered line of text is displayed at the bottom of the scrolling text window <b>202</b>. In the illustrated example, the last participant to enter a comment was JOSHUAALEX, who typed “TEXAS.”

The chat room <b>200</b> shown in <figref idref="DRAWINGS">FIG. 2</figref> is “public”, meaning that it has multiple participants who were placed in the chat room by the computer-service provider and who most likely never have met or conversed with one another before. A comment by a participant in a public forum may be seen by all of the participants of the chat room. If a participant desires some privacy, that participant may “open” and enter a “private” chat room (for example, by clicking on a SETUP button <b>212</b>), and thereafter invite one or more other participants to enter the private chat room. Once in a private forum, participants may communicate with one another without fear that uninvited participants will be able to see their comments.

When a participant in a forum, whether public or private, makes a comment that others in the forum regard as offensive, in poor taste, wildly incorrect, or otherwise objectionable, the offending participant most likely will be “flamed” by one or more of the other participants. A “flame” is a reprimand or other stringent response directed at the offending party. One purpose behind flaming another participant is to dissuade the offender, through embarrassment or intimidation, from making further objectionable comments. In this manner, if the offending user chooses to curb his or her behavior in response to the flaming, a forum may be crudely regulated or “policed” by the forum's participants. However, the offending participant may continue to behave in an objectionable manner. Further, a participant who overly “flames” other participants may also be objectionable. Accordingly, participant policing of forums does not always work well. In such cases, offended participants may drop out of “flame-filled” forums, and/or the online service must devote resources to actively police problematic participants.

Other objectionable behavior includes sending one or more messages to “spoof” other users as to the sender's identity in order to try to get confidential information (e.g., credit card numbers or passwords) sent in response (sometimes called “password fishing”).

Another problem that can arise in online systems is “resource hogging”, where a participant uses features such as broadcast or multi-cast messaging to send a large number of messages to other users in a short period of time (sometimes called “spamming”). Such resource hogging deprives other users of server resources, and can slow an online system response time to undesirable levels.

Accordingly, the inventor has determined that there is a need for a better way to police recalcitrant participants in online forums and to reduce spamming. The present invention provides a method and means for accomplishing this goal.

SUMMARY

The invention provides a method and means for self-policing and automatically rate-limiting multiple-user online forums. The preferred embodiment of the invention includes a set of rules that permit users to censure other users. A censured user has one or more “privileges” (which may include access to the online computer system or the effective message rate of a communications connection) taken away or diminished; the privilege is gradually restored if the censured user behaves. The censuring participant and other pertinent participants are notified of the effect of the censuring on the censured user. In another aspect of the invention, the online computer system automatically tracks the rate at which a user sends certain types of messages, and can message rate limit a user who uses too many system resources by sending a large number of messages in rapid succession. The amount of rate limiting may be a function of the amount of censure that has been applied to the user being limited.

Advantages of this invention may include one or more of the following. The techniques described here enable a multiple-user online service (e.g., a chat room or other forum) to be self-policing. Access to the computer service for a particular user is automatically regulated by the computer based on input from other users concerning the conduct of the user under consideration, or based on the message rate of a user. Users of a computer-based system have the ability to sanction a misbehaving user and thereby have the offending user's access to the system denied or curtailed. Unlike the conventional “flaming” approach to policing, which typically fails because it relies on the misbehaving user curbing his or her own behavior or results in retaliatory “flaming”, the policing techniques described here are based on predetermined rules and operate automatically in response to votes cast by other users of the computer system. The offending user has no choice in the matter once he or she chooses to misbehave. Because the operation of these policing techniques are automatic, the computer-based service provider need not expend personnel time and resources to police public forums, direct user communications, and the like.

The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

<figref idref="DRAWINGS">FIG. 1</figref> shows a prior art distributed computer system of the type used for providing online computer services.

<figref idref="DRAWINGS">FIG. 2</figref> is a screen shot showing an example of a prior art online computer forum.

<figref idref="DRAWINGS">FIG. 3</figref> is a flowchart of a basic embodiment of the self-policing aspect of the invention.

<figref idref="DRAWINGS">FIG. 4</figref> is a flowchart of a basic embodiment of the rate-limiting aspect of the invention.

Like reference numbers and designations in the various drawings indicate like elements.

DETAILED DESCRIPTION

The prospect of millions of concurrent users of an online computer system puts great pressure on the ability of the system provider to police abusive participants. Accordingly, the invention provides a self-policing online environment that makes participants responsible for their behavior. That is, other participants can express an opinion about that behavior, and have that opinion affect the offending user in a negative way and be “visible” to other participants. Providing such a self-policing user feedback mechanism lowers the cost of providing online services to users and provides a more “user-friendly” environment for participants.

In another aspect of the invention, the online computer system automatically tracks the rate at which a user sends certain types of messages, and can “rate limit” a user who “hogs” too many system resources by sending a large number of messages (or messages of selected types) in rapid succession.

Participant Self-Policing

<figref idref="DRAWINGS">FIG. 3</figref> is a flowchart of a basic embodiment of the self-policing aspect of the invention. Initially, user A generates an event I, such as a message (STEP <b>300</b>). Event I is transmitted to some number of other participants, such as users B and C in a public forum on an online computer system (STEP <b>302</b>). However, event I may be a direct communication between user A to user B, such as by use of the Instant Message™ feature of the America Online computer service. User B may feel that event I is “objectionable” or “evil” (a subjective decision by B), and therefore generates a “vote” against the behavior of user A by sending a special type of response message—an “evil” event E (STEP <b>304</b>). In the preferred embodiment, a user cannot “evil” another participant except in response to a message from the participant, or otherwise in cases where the participant's actions affect the user doing the “eviling.” In order to reduce retaliation, users cannot “evil” other participants directly in response to being “eviled”.

The online system receives event E and checks a database to see whether user B has the right to “evil” user A (STEP <b>306</b>). For example, this step can limit users who themselves have been restricted from “eviling” other users.

If user B does not have the right to “evil” user A, then user B is notified of the affect of user B's action on user A's “evil index”—a value of how restricted user A is with respect to use of resources on the online system (STEP <b>308</b>). In this case, user B's action has no affect on user A.

If user B does have the right to “evil” user A, then user A's “evil index” is modified by a suitable amount, which will affect further actions by user A (STEP <b>310</b>), as described below. The amount of modification can be based on the past behavior of user A, or of users A and B. The amount of modification may also depend on the type of “eviling” asserted by user B. For example, user B may wish to assert an “eviling” event E anonymously rather than be identified. Anonymous “eviling” may be accorded lesser weight. That is, an anonymous “eviling” response may count as fewer evil “votes” than it would if the eviling user's identity was revealed. In one embodiment, an “eviling” user may set up an automatic “eviling” response to all communications from another specific user. In this case, the effect of the “eviling”, which is intended to discourage communication from the specific user, is given very low weight (equivalently, counts as very few evil “votes”) because of its automatic invocation.

User A's “evil index” is “broadcast” to other users who “know about” user A (STEP <b>312</b>). For example, such users might be all of the participants in a private chat room, or all visitors to a public chat room. In one embodiment, a modified “evil index” is reported to each user in a current chat room's user list and to each user who has the “eviled” users on his or her “buddy list” (described in co-pending U.S. patent application Ser. No. 08/803,692, filed Feb. 24, 1997, entitled “User Definable On-line Co-user Lists”, hereby incorporated by reference). Thus, an “eviled” user is publicly chastised.

Thereafter, user A's “evil index” begins to gradually “decay” back to normal over time (STEP <b>314</b>). Such decay may be linear, exponential, step-wise, or some other function. Meanwhile, user B is notified of the affect of user B's action on user A's “evil index” (STEP <b>308</b>). In this case, user B's action has had an affect on user A.

Some of the steps noted above may be done in different order without substantially changing the effect of the process. For example, STEPS <b>312</b>, and <b>314</b>, and <b>308</b> may be performed in different order.

A basic “penalty” for having a non-normal “evil index” is denial of access to a forum or the online service until the user's “evil index” has decayed back to normal. In a more refined embodiment, a user's “evil index” affects a rate limit which governs a user's ability to send (and/or receive) messages. This feature allows other participants to “evil” a user who “flames” or “spams” them, and thus reduce the rate at which the recalcitrant user can send and/or receive messages. A description of rate limiting is set forth below.

A server database (which may be centralized or distributed) stores a user's “evil index”. A user's “evil index” can be maintained in a user-record as a global total, or by forum, or both. The value of each “evil index” can be used to control the user's ability to log on to the online computer system or access selected forums, and/or the effective rate of message or file transmissions.

Other rules may be applied in different embodiments. For example, the following rules can be implemented: <ul id="ul0001" list-style="none"><li id="ul0001-0001" num="0000"><ul id="ul0002" list-style="none"><li id="ul0002-0001" num="0033">A user must be in a forum (e.g., a chat room, but including direct communication between users, such as the Instant Message™ feature of the America Online computer service) for a specified amount of time before being allowed to “evil” another user in that forum; this reduces “hit-and-run flaming”. The minimum amount of time may vary from forum to forum, and from user to user (e.g., a forum “sysop” may be immune to “eviling”). A user's user-record in the server database thus would record a time-of-entry for a forum. For example, a user's time-of-entry to a forum would be compared to the current time in STEP <b>306</b> of <figref idref="DRAWINGS">FIG. 3</figref> to determine if the user had the right to “evil” another participant.</li><li id="ul0002-0002" num="0034">A user must be in a forum for a specified amount of time before being allowed to “evil” anther user who has been in that forum for a longer period of time. For example, a user's time-of-entry to a forum would be compared to the time-of-entry of another participant in STEP <b>306</b> of <figref idref="DRAWINGS">FIG. 3</figref> to determine if the user had the right to “evil” that other participant. The specified amount of time may vary from forum to forum, and from user to user.</li><li id="ul0002-0003" num="0035">A user's eviling response may be accorded increased weight (equivalently, counted as extra “evil” votes) based on the “seniority” of the “eviling” user. Each additional unit of time spent in a forum could enhance a user's “seniority,” thereby allowing long term user's more “eviling” power than new-corners. That is, being “eviled” by an “old-timer” can have a greater than normal affect on modification of a chastised user's “evil index” in STEP <b>310</b> of <figref idref="DRAWINGS">FIG. 3</figref>. A user's user-record in the server database thus would record a total-time-of-access for each forum, which could be a “lifetime” total (such that users who had belonged to the online computer service for longer periods would have greater “eviling” power than relatively new subscribers to the service), a running total for a selected period of time, or a session total. The time period for accumulating extra votes and the “eviling” value of extra votes may vary from forum to forum, and from user to user.</li><li id="ul0002-0004" num="0036">A user may be limited in the number of “eviling” votes that can be cast in any one online session or time period (e.g., a day or week). A user's user-record in the server database thus would record the number of “eviling” votes cast globally or by forum. For example, a user's number of previous “eviling” votes cast could be examined in STEP <b>306</b> of <figref idref="DRAWINGS">FIG. 3</figref> to determine if the user had the right to “evil” another participant.</li><li id="ul0002-0005" num="0037">The amount of modification of a user's “evil index” in STEP <b>310</b> of <figref idref="DRAWINGS">FIG. 3</figref> after being “eveiled” is preferably non-linear, so that the first few times a user is “eviled” has little effect (and possibly no effect until some threshold level of accumulated “eviling” votes from several participants are asserted against the user) on the user's “evil index” (everyone makes a few mistakes). However, for subsequent times that a user is “eviled”, the user's “evil index” preferably is modified to a much greater degree, increasing the penalty for recidivism. The determination of how much to modify a user's “evil index” can be based on the user's global “evil index” (i.e., a “rap sheet” evaluation) or forum “evil index” (i.e., a “fresh start” approach). A user's user-record in the server database would thus record the number of times the user has been “eviled”, either globally or by forum, for example. The recorded number might be a “lifetime” total or a running total for a selected period of time. The amount of “evil index” modification may also vary from forum to forum, and from user to user.</li><li id="ul0002-0006" num="0038">As an example, each user may be given an initial “evil index” of 100. A first “offense” may reduce that value to 95; a second “offense” reduces the value to 85; third and subsequent offenses reduce the current value by 15 units. Alternatively, each user is given an initial “evil index” of 0 and “eviling” increases that value. If a range of 100 is used, a user's “evil index” may be regarded as a “percentage of evil”, up to 100% “evil”.</li><li id="ul0002-0007" num="0039">The decay rate for returning a user's modified “evil index” to normal can vary from forum to forum. For example, the decay in chat rooms (where most flaming occurs) may be less than in other forums. Using the example from immediately above, the user's “evil index” may “decay” back to “normal” at the rate of 2 units per hour in a chat room, but at the rate of 5 units per hour in other forums.</li><li id="ul0002-0008" num="0040">A user may query a forum to determine the rate of “eviling” within the forum as a measure of how much members of the forum “evil” one another. A high rate may indicate that one or more members are misbehaving. The system keeps track of all users participating in a forum, so the current “eviling” rate is a time-weighted average of the number of “eviling” votes cast by the current participants. In an alternative embodiment, a user may query a forum to determine the accumulated value of the “evil index” of all current users. This measures how often the users have misbehaved in the past, and can serve as an estimate of the likelihood that the current users will misbehave in the future. The system keeps track of all users participating in a forum, so the total “evil index” is the sum of the pertinent forum “evil index” for each participant.</li><li id="ul0002-0009" num="0041">In some embodiments, a user who has been “eviled” has a lessened ability to “evil” other users (thus reducing retaliation). However, some online systems implement message types, such as broadcast or multi-cast messages or self-repeating messages, that are more frequently used than other message types to flame or spam other participants. In some embodiments, it may be desirable to allow all users (even those with a modified “evil index”, and thus possibly restricted in usage rights) to “evil” the originator of such message types. Such a determination would be made in STEP <b>306</b> of <figref idref="DRAWINGS">FIG. 3</figref> by examining the message type of event I sent by the originating user. The amount of modification of such an originator's “evil index” can be set to be greater than for flaming to discourage use of such message types for spamming.</li></ul></li></ul>

When a user's “evil index” is modified, the user is notified that privileges, such as rate of messaging, have been limited. In one embodiment, a message is sent from the server that contains the user's current “evil index” to the “eviled” user, and optionally includes the current rate of decay back to normal. Such information allows a wide range of feedback to be presented to the user about his or her ability to interact with the online computer system. For example, a graphical “power meter” or “power bar graph” can be used to indicate the “evil index” of the user. For instance, a color-coded bar graph can be divided into (1) a green zone to represent that the user's “evil index” is normal; (2) a yellow zone to represent that the user's “evil index” has been modified slightly; (3) a red zone to represent that the user's “evil index” has been modified significantly; and (4) a black zone to represent that access or message privileges have been suspended for a time. However, other methods of informing a recalcitrant user of his or her “evil index” can be used.

In one embodiment, a user can “rehabilitate” his or her “evil index” by visiting advertisements displayed on the online computer system; “visits” can be determined by requiring the user to “click” on an advertisement. The user is rewarded with more “power” by adjusting the value of the user's “evil index” more towards normal.

Automatic Rate Limiting

In one embodiment, both input and output messaging rates of a user are limited based on the behavior of the user and/or available system resources. Such rate limiting can stop malicious users and errant client computers from consuming more than a fair share of online system resources. However, preferably the rate limiting system is weighted to tolerate brief bursts of messaging activity while penalizing unacceptably large rates of messaging. Rate limiting can also limit aggregate input to a server to a level at which the system is reasonably loaded under normal conditions. Rate limiting can also be combined with “eviling” by automatically adjusting a users rate limit parameters based on their “evil index.”

In one embodiment, input rate—limiting from user to server—is conducted on a per user connection basis, and within a user connection on a per-message type basis (that is, rate limits for different types of messages may be set to different values). In one embodiment, rate limiting for a user is achieved in accordance with the following algorithm: <ul id="ul0003" list-style="none"><li id="ul0003-0001" num="0046">1) Define A as the running average of inter-message time gaps for the last N messages of selected types that the user has attempted to send; a system selected value I is used as the first value for A. Calculation of A can be done, for example, on a forum basis (accounting only for messages sent in the current forum), session basis (accounting for messages sent in the user's current online session), or message-count basis (accounting for the last N messages sent at any time in any forum).</li><li id="ul0003-0002" num="0047">2) If A is below a warning threshold W (indicating that the user is approaching a point of sending messages too frequently), when the user attempts to send a message, send the user a warning message but transmit the user's message.</li><li id="ul0003-0003" num="0048">3) If A is below a rate limit threshold R (indicating that the user is sending messages too frequently) when the user attempts to send a message, send the user a warning message and drop the user's message.</li><li id="ul0003-0004" num="0049">4) Repeat the above steps until A rises above a clear threshold C (indicating that the user is not sending messages too frequently), at which time the rate limiting condition is considered cleared.</li><li id="ul0003-0005" num="0050">5) If at any time A drops below a disconnect threshold D, disconnect the user.</li></ul>

<figref idref="DRAWINGS">FIG. 4</figref> is a flowchart of a basic embodiment of the rate-limiting aspect of the invention, showing a slightly different order for the steps described above. A user attempts to send a message (STEP <b>400</b>). Average A is computed (STEP <b>402</b>). If A is less than a disconnect threshold D (STEP <b>404</b>), the user is disconnected (STEP <b>406</b>). Otherwise, if A is less than a rate limit threshold R (STEP <b>408</b>), the message is dropped, the user is warned that the rate limited has been exceeded, and the user is flagged as “rate limited” (STEP <b>410</b>).

Otherwise, if A is less than a warning threshold W(Step <b>412</b>), a determination is made as to whether the user is rate limited (Step <b>414</b>). If not, the message is sent, but the user is warned that the rate limit is being approached (Step <b>416</b>). Otherwise, the message is dropped and the user is warned that the rate limit has been exceeded (Step <b>418</b>).

If A is not less than the warning threshold W(Step <b>412</b>), and A is less than a clear threshold C(Step <b>420</b>), a determination is made as to whether the user is rate limited (Step <b>421</b>). If not, the message is sent (Step <b>423</b>). Otherwise, the message is dropped and the user is warned that the rate limit has been exceeded (Step <b>418</b>).

Finally, if A is not less than the clear threshold C (STEP <b>420</b>), the rate limit flag for the user is cleared (STEP <b>422</b>) and the message is sent (STEP <b>423</b>).

The rate limiting algorithm supports several “tunable” parameters: <ul id="ul0004" list-style="none"><li id="ul0004-0001" num="0000"><ul id="ul0005" list-style="none"><li id="ul0005-0001" num="0056">The running average of inter-message time gaps—A</li><li id="ul0005-0002" num="0057">The number of message receptions over which A is calculated—N</li><li id="ul0005-0003" num="0058">An initial average—I</li><li id="ul0005-0004" num="0059">A clear threshold—C</li><li id="ul0005-0005" num="0060">A warning threshold—W</li><li id="ul0005-0006" num="0061">A rate limit threshold—R</li><li id="ul0005-0007" num="0062">A disconnect threshold—D</li></ul></li></ul>

In one embodiment, the values for C, W, R, and D are selected such that C&gt;W&gt;R&gt;D. The initial average rate I can be weighted to increase the algorithm's tolerance of bursts of activity, such as “chatty startups” when a user joins a forum and sends several messages in succession. The threshold rates can be set globally for all user's, or “tuned” for each user.

In one embodiment, the difference between the clear threshold C and the rate limit threshold R can be “tuned” by the online computer system to alter the interval between commencement of rate limiting for a user and the resumption of normal activity. The difference between C and R may be automatically increased, for example, if the user sends excessive “spamming” type messages at too great a rate. Further, the threshold values C, W, R, and D can be dynamically modified by the online system as a way of limiting system resource usage if too many users are simultaneously using the system.

As noted above, when a user's message rate is limited, the user is notified. In one embodiment, a message is sent from the server to a rate limited user that contains values for each of the parameters outlined above, and another message is sent the next time that the server will accept messages from the user without restriction. Such information allows a wide range of feedback to be presented to the user about his or her ability to interact with the online computer system. For example, a graphical “power meter” or “power bar graph” can be used to indicate the “health” or “power” of the user. For instance, a color-coded bar graph can be divided into (1) a green zone to represent that no rate limiting is in effect; (2) a yellow zone to represent that the user's message rate is near the point where rate limiting would take effect; (3) a red zone to represent that message rate limiting is in effect; and (4) a black zone to represent that access privileges have been suspended for a time. However, other methods can be used to inform a recalcitrant user of his or her message rate limit status.

In one embodiment, a user can “rehabilitate” his or her message rate limit status by visiting advertisements displayed on the online computer system. The user is rewarded with more “power” by adjusting the parameters.

In one embodiment, output rate limiting—from server to user—is performed in a similar manner, with the following differences: <ul id="ul0006" list-style="none"><li id="ul0006-0001" num="0068">1) The system server audits the rate of outgoing error messages of selected types (e.g., RATE_TO_HOST), and uses the above rate limiting algorithm with R=D, to prevent excessive load due to handling users that are generating rate errors.</li><li id="ul0006-0002" num="0069">2) The system server can limit the rate of outgoing messages of selected types (e.g., those types that may be used for spamming) using the above rate limiting algorithm when A&lt;R. In this case, a notice message can be sent to the user, to the user's intended recipient, and to a server storing the user's “evil index”. The intended recipient can “evil” the sending user, or the system server can automatically modify the user's “evil index” based on the sending of excessive “spamming” type messages at too great a rate.</li></ul>

The algorithms described above prevent abuse of online system resources without causing undue “pain” to users, including “power users” and users who are subject to delays and input/output timing changes by non-ideal networks (which can cause otherwise normal user activity to appear to be unacceptable activity).

Rate Limiting and “Eviling”

The concepts of automatic rate limiting and modification of a user's “evil index” can be combined to provide a refined self-policing, automatic rate limiting system that can regulate an “eviled” user's ability to participate in forums without requiring total exclusion from the forum. Further, a user's current global or forum “evil index” can be used to modify the parameters used to effect automatic (i.e., “non-eviled” basis) rate limiting for the user. For example, a user's ability to interact in a forum can be rate limited by modifying the values for A, C, W, R, and/or D as a function of whether the user's “evil index” has been modified, or as a function of the current value of the user's “evil index”. Conversely, the amount of modification of a user's “evil index” can be a function of the current value of A. Thus, conceptually, a user's permitted message rate R_pis a function of the user's “evil index” EI plus the user's rate of attempted message activity A: R_p=f(EI)+g(A)

Conceptually, each user's user-record thus may look like the following table:

<tables id="TABLE-US-00001" num="00001"><table frame="none" colsep="0" rowsep="0" pgwide="1"><tgroup align="left" colsep="0" rowsep="0" cols="12"><colspec colname="1" colwidth="35pt" align="left" /><colspec colname="2" colwidth="28pt" align="left" /><colspec colname="3" colwidth="21pt" align="left" /><colspec colname="4" colwidth="28pt" align="left" /><colspec colname="5" colwidth="28pt" align="left" /><colspec colname="6" colwidth="21pt" align="left" /><colspec colname="7" colwidth="28pt" align="left" /><colspec colname="8" colwidth="14pt" align="left" /><colspec colname="9" colwidth="14pt" align="left" /><colspec colname="10" colwidth="14pt" align="left" /><colspec colname="11" colwidth="14pt" align="left" /><colspec colname="12" colwidth="14pt" align="left" /><thead><row><entry namest="1" nameend="12" align="center" rowsep="1" /></row><row><entry /><entry /><entry /><entry /><entry># times</entry><entry>time-</entry><entry>total-</entry><entry /><entry /><entry /><entry /><entry /></row><row><entry /><entry>“evil</entry><entry>decay</entry><entry># times</entry><entry>“eviled”</entry><entry>of-</entry><entry>time of-</entry></row><row><entry>Forum ID</entry><entry>index”</entry><entry>rate</entry><entry>“eviled”</entry><entry>others</entry><entry>entry</entry><entry>access</entry><entry>A</entry><entry>C</entry><entry>W</entry><entry>R</entry><entry>D</entry></row><row><entry namest="1" nameend="12" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="259pt" align="left" /><tbody valign="top"><row><entry>Global</entry></row><row><entry>value</entry></row><row><entry>Forum 1</entry></row><row><entry>value</entry></row><row><entry>Forum 2</entry></row><row><entry>value</entry></row><row><entry>etc.</entry></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>

Separate “lifetime” and “session” records may be kept where useful. Of course, other or different information may be recorded for each user, and other ways of organizing such data may be used. Further, users may be assigned a “class” designation (such as “sysop” (system operator), corporate users, paying members, non-paying members, etc.) which can be given weight in making a determination of right to “evil” or absolute or relative immunity from being “eviled” in STEP <b>306</b> of <figref idref="DRAWINGS">FIG. 3</figref>.

In setting rate parameter values for a user, a global rate table can be used which is indexed by a user's “evil index”; that is, message rate parameters are a function of the user's global or forum “evil index”. A conceptual example of one such table might be the following (ΔA represents an optional adjustment to be applied to the calculated value of A):

<tables id="TABLE-US-00002" num="00002"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="7"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="42pt" align="center" /><colspec colname="2" colwidth="42pt" align="center" /><colspec colname="3" colwidth="14pt" align="center" /><colspec colname="4" colwidth="49pt" align="center" /><colspec colname="5" colwidth="14pt" align="center" /><colspec colname="6" colwidth="42pt" align="center" /><thead><row><entry /><entry namest="offset" nameend="6" align="center" rowsep="1" /></row><row><entry /><entry>“evil index”</entry><entry /><entry /><entry /><entry /><entry /></row><row><entry /><entry>value</entry><entry>ΔA</entry><entry>C</entry><entry>W</entry><entry>R</entry><entry>D</entry></row><row><entry /><entry namest="offset" nameend="6" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="3"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="42pt" align="center" /><colspec colname="2" colwidth="161pt" align="left" /><tbody valign="top"><row><entry /><entry> 0-20</entry><entry /></row><row><entry /><entry>21-40</entry></row><row><entry /><entry>41-60</entry></row><row><entry /><entry>61-80</entry></row><row><entry /><entry>81-90</entry></row><row><entry /><entry>91-95</entry></row><row><entry /><entry> 96-100</entry></row><row><entry /><entry namest="offset" nameend="2" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>

The values for ΔA, C, W, R and D in this table can be defined globally or by forum. If by forum, the values can be defined in absolute terms or as relative offsets to a global table. Multiple tables of this form also can be defined, indexed by message type, so that misuse of certain types of messages are punished more than misuse of other message types.

Alternatively, a non-tabular implementation could be used instead of the global rate table described above. For example, a user's rate parameter values (ΔA, C, W, R, D) could be defined as a function describing a relation between these quantities.

Implementation

The methods and mechanisms described here are not limited to any particular hardware or software configuration, but rather they may find applicability in any computing or processing environment used in connection with online computer services.

The invention may be implemented in hardware or software, or a combination of both. However, preferably, the invention is implemented in computer programs executing on programmable computers each comprising at least one processor, at least one data storage system (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device. Program code is applied to input data to perform the functions described herein and generate output information. The output information is applied to one or more output devices, in known fashion.

Each program is preferably implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the programs can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language.

Each such computer program is preferably stored on a storage media or device (e.g., ROM or magnetic diskette) readable by a general or special purpose programmable computer, for configuring and operating the computer when the storage media or device is read by the computer to perform the procedures described herein. The inventive system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner to perform the functions described herein.

A number of embodiments of the present invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.