US 7,415,504 B2Grant
System and method for controlling distribution of network communications
Issue Date:2008-08-19
•34 Claims
•4 Drawing Sheets
Abstract
A method for controlling distribution of network communications (messages). An incoming message either carries priority information, or is assigned priority information based on a shared characteristic with other messages. The priority information is used to determine how and/or when to deliver the message, e.g. by delaying the message for a fixed time. Preferences for receipt of messages by priority level may be communicated to upstream hosts along a network path. Accordingly, an intermediary host may reject and/or delay messages that the intended recipient does not wish to receive. This pushes the burden of low-priority messages back to the sender, thereby reducing or eliminating burdens on network/system resources of the recipient and/or intermediaries between the recipient and the sender. Accordingly, it can “squelch” spam messages at or close to their source. Trusted senders complying with prescribed practices may include priority information allowing for delivery of their messages with higher priority.
Metadata
Assignee
- Symantec Corporation
Inventors
- Vincent J. Schiavone
- James H. Koenig
- David I. Brussin
Application Information
Application Number:US 10/084,038
Filing Date:2002-02-26
Priority Date:2001-02-26
Art Unit:2143
Classifications
IPC:
G06F15/16
Patent Drawings (4 sheets)
Description
Related Applications
[0001] This application claims the benefit of U.S. Provisional Patent Application No. 60/271,521, filed Feb. 26, 2001, the entire disclosure of which is hereby incorporated herein by reference.
Field of the Invention
[0002] The present invention relates generally to the field of electronic mail messaging, and in particular to a system and method for controlling distribution of electronic mail messages to reduce the burden of bulk electronic mail messages, often referred to as “spam,” on recipient and intermediate messaging systems.
Background
[0003] Electronic mail messaging via computerized communications networks is widespread. Current mail servers have no way to ensure Quality of Service (“QoS”) and/or Class (e.g. priority treatment) of electronic mail (“e-mail”) processing, since they have no way to request or require limitations on the volume of different types of e-mail message traffic. For example, QoS problems often arise in the context of spam attacks—i.e. large mass mailings of unsolicited commercial e-mail messages. A common method for sending spam is the “dictionary attack.” When this method is used, a marketer uses a list of common usernames, connects to a mail server, and then attempts to send a message to every username at the connected mail server. The method is then repeated for a next mail server. For example, john@ is a common username. The marketer might connect to anydomain.com's mail server and attempt to send e-mail to [email protected], even if the marketer doesn't know for sure whether such an e-mail account exists. If it does exist, the account (and a recipient) will receive the e-mail message. Another common method for sending spam is the “brute force” method in which various alphanumeric combinations are tried for selected domains, whether the addresses are known to be valid or not. This creates a particularly heavy burden on communications network resources. The method is often repeated for multiple mail domains to obtain a list of valid e-mail addresses that may sold or used for marketing purposes.
[0004] As a result, irresponsible senders of e-mail messages may, at will, undesirably burden messaging systems, e.g. by using network bandwidth, mail server and other messaging system resources, by sending messages as they desire.
[0005] What is needed is a system and method for controlling distribution of e-mail messages (or other network communications, collectively “e-mail” messages) that reduce the burden on network resources of recipients and intermediaries and/or allows for distribution of e-mail messages in a prioritized manner according to preferences. Prioritization and preferences allow a recipient or intermediary to define criteria and/or set preferences to regain control of the utilization of the recipient's or intermediary's system resources.
Summary
[0006] The present invention allows recipients, ISPs, ESPs, and other network communication (message) recipients to control how their network's or system's resources, such as network connectivity bandwidth, are used and/or allocated for use to distribute messages from others. The present invention also allows for preferential prioritized treatment of compliant messages sent from trusted senders, and lower priority treatment of non-compliant messages from non-compliant and/or irresponsible senders. The present invention further provides for lessening or avoiding the impact of virus, spam, and denial of service attacks, and the ability to load balance incoming messages onto a cluster of servers.
[0007] The present invention provides flow prioritization and spam squelcher functionality whereby network communications (messages) either carry priority information, or are assigned priority information based on a shared characteristic with other messages. The priority information is used to determine how, when and/or whether to deliver or process the message, e.g. by delaying the message for a fixed time, routing to a “junk” folder, or deleting. Preferences for receipt of messages by priority level may be communicated to upstream hosts along a network path. Accordingly, an intermediary host may reject, delay and/or delete messages that the intended recipient does not wish to receive or the intermediary does not wish to process (e.g. messages carrying viruses, fraudulent messages, or spam messages). This pushes the burden of low-priority messages back to the sender, thereby reducing or eliminating burdens on network/system resources of the recipient and/or intermediaries between the recipient and the sender. Accordingly, it can “squelch” spam messages at or close to their source. Trusted senders complying with prescribed practices may include priority information allowing for delivery of their messages with higher priority.
[0008] Various hosts (ESP & ISP) along the message's path may prevent poorly-behaved hosts from monopolizing their message processing capability (bandwidth, CPU, storage, etc). The flow prioritization and spam squelcher functionalities create an infrastructure of well-behaved messaging hosts that respect the priority of messages and the capacity of other hosts. An added benefit of the present invention is the ability to “squelch,” i.e. delay or block, spam (unsolicited bulk e-mail messages) close to its source. By squelching close to the source of the messages, a greater beneficial effect on overall network resources may be achieved because fewer subnetworks are burdened by the messages.
Brief Description of the Drawings
[0009] FIG. 1 is a flow diagram of an exemplary method for controlling distribution of e-mail messages according to the present invention;
[0010] FIG. 2 is a flow diagram of an exemplary method for using a heuristic approach to identifying a priority level for an e-mail path according to the present invention; and
[0011] FIG. 3 is a block diagram of a system for controlling distribution of e-mail messages according to the present invention.
Detailed Description
[0012] Conceptually, the present invention controls distribution of network communications, e.g. e-mail messages (collectively, “e-mail messages”), in a prioritized manner or pursuant to an industry supported standard regarding specific classes of service, e.g. BUSINESS PRIORITY (IMMEDIATE DELIVERY, high cost) or PERSONAL PRIORITY (QUICK DELIVERY, moderate cost), etc. This is achieved by controlling the allocation of network connections for delivery of messages, e.g. to delay allocation of requested connections until load parameters are met, until higher priority messages are delivered, etc. For example, e-mail messages may be distributed according to recipient or intermediary preferences. Accordingly, from the recipients' perspective, higher priority messages appear to be delivered/received first. Recipients and intermediaries can prevent overburdening of their systems' network resources due to delivery of spam messages or other relatively unimportant e-mail, e.g. commercial e-mail, billing statements, personal e-mail messages, etc. This allows for higher priority processing of e-mail messages of relatively higher importance (or paid-for higher priority), e.g. business-related communications. For example, this prevents a high-priority business-related e-mail from being delayed due to a deluge of spam messages, and/or prevents high-priority business-related e-mail messages from getting “lost” among a list of spam messages in a user's mail client “inbox.”
[0013] The inventive method may be implemented in software, e.g. by modifying mail server software, or by providing a hardware appliance along a network path between an e-mail sender and an e-mail recipient. The appliance may be located logically between external networks and internal messaging systems. Preferably, the network appliance receives all incoming and outgoing message connections. The network appliance acts similarly to a recipient mail server, firewall, proxy, router, switch and/or load balancer in that it allocates network connections. However, the network appliance uses additional logic, in accordance with the present invention, to allocate network connections in an order to achieve a prioritization effect in accordance with the present invention, e.g. by delaying allocation of a network connection for delivery of a low priority message and/or allocation a network connection for delivery of a relatively high priority message before a relatively low priority message. Additionally, allocation of the network connection may be delayed for a given path or priority to meet preference criteria, e.g. that a certain path, sender, priority, etc. message should not be delivered if utilization of network resources exceeds a predetermined threshold.
[0014] Preferably, senders, recipients and intermediaries, such as ISP or ESP servers, etc. are provided with software and/or hardware for carrying out the present invention. When the inventive method is used closer to the sender, relatively greater conservation of network resources can be achieved, as discussed below.
[0015] FIG. 1 is a flow diagram 10 of an exemplary method for controlling distribution of e-mail messages according to the present invention. In the example of FIG. 1 , a network appliance 100 configured for carrying out the inventive method is provided between the communications network (e.g. Internet) and internal e-mail servers of an enterprise (e.g. a corporation), as shown in FIG. 3 . This allows the enterprise to conserve the enterprise's network and/or system resources in accordance with the present invention.
[0016] As shown in FIG. 1 , the method starts with receipt of an e-mail message intended for delivery at a recipient, as shown at step 11. It should be noted that this step may include a call for a network connection for delivery of an e-mail message. This step may be achieved by the network appliance 100 of FIG. 3 . Consider an e-mail message intended to be delivered from a sender via the sender's e-mail server 80 via a communications network 90. In the prior art, the e-mail message is typically routed through to the intended recipient's internal e-mail server(s) 140. In accordance with the present invention, the network appliance 100 (or a process/modified mail server software, etc.) is provided in the communications path between the sender and the intended recipient so that the e-mail message is effectively intercepted by the network appliance 100 before being delivered to the intended internal e-mail server(s) 140. Accordingly, the e-mail message can be processed in accordance with the present invention before delivery to the recipient to conserve the enterprise's network resources.
[0017] A priority level for the incoming e-mail message is then identified, as shown at step 14 of FIG. 1 . This may be performed in a variety of ways. In one embodiment, the e-mail messages are configured to carry priority information in accordance with the present invention. For example, such priority information may include a priority flag, such as “Immediate Action Required,” “For Reference Only”, “For Information Only”, “Highest Priority”, etc., or may include a categorization of the e-mail message, e.g. “Internal Business Communication”, “External Business Communication”, “Personal”, “Friends and Family”, “Bills and Statements”, etc. It should be noted that higher priority treatment may be sold to or purchased from senders as desired to obtain higher priority treatment of their messages. In one embodiment, the message may include a message-type specifier such as a keyword or a seal graphic/image object (indicating compliance with certain laws, regulations and/or best practices standards) contained in the viewable portion of the message, e.g., body, subject line, etc., of the message, that may be used as the priority information. Alternatively, the priority information may be a compiled header that is a datastring, such as an alphanumeric or ASCII character string, stored in a special field of the message's header information that includes information indicating a priority level, or information that may be used to determine a priority level. The compiled header may include encrypted or formatted data that may be understood by the network appliance, and preferably not by others. Such header information is typically hidden from the recipient. Provision of such header information, message specifiers and/or other priority information is disclosed in commonly assigned U.S. application Ser. No. 09/793,263, filed Feb. 26, 2001, U.S. application Ser. No. 09/793,296, filed Feb. 26, 2001 and U.S. application Ser. No. 09/792,936, filed Feb. 26, 2001, the disclosures of which are hereby incorporated herein by reference. The compiled header is generated by appropriate software and/or an appropriate appliance at the sender or an intermediary, such as an ISP or ESP. The header includes information indicating that it is a message that is compliant with the present invention and/or a certain standard associated with the present invention, e.g. identifying the sender of the message as a “trusted sender.” This header is generated programmatically from the full header information contained generally in all e-mail messages (generated at the sender), e.g. at the same time by the same software or a component thereof.
[0018] This priority information, which is very compact in terms of additional data required, allows compliant e-mail hosts to ensure that message priority is taken into account in message processing and handling. The header may be built using such techniques as a binary bitmask, and be processed with negligible impact on throughput. The message handling can provide a priority scale, e.g. giving system compliant mail highest priority (or ranked priority, such as ‘immediate response required,’ fyi, etc), and noncompliant mail lower priority or other priority (e.g., for preferred customer, etc.). This priority information provides e-mail hosts the ability to process inbound message traffic based on priority schedules defined by a multitude of processes, including business logic, workflow processes, time-of-day, urgency and communication protocol requests.
[0019] Forgery of the compiled header would yield no benefit. Encrypted and/or digitally signed messages could also be processed by the receiving host. Legacy mailers not yet using this inventive technology may be prioritized using source address and path information when available. For example, ISP/ESP software and/or appliance processing compiled headers (i.e. Flow Prioritizer and Spam Squelcher) are processed based on a list (static or dynamic, local or remote) of preferred customers' e-mail domains.
[0020] Accordingly, in such an embodiment, senders are expected to make declarative statements about the e-mail, and are trusted to make accurate statements, e.g. that the mail is a “BUSINESS” type e-mail. In a sense, the sender is “trusted” to make accurate statements, and to respect the recipients' wishes that incoming messages include such accurate statements/information. For example, the sender may select a priority level from a menu of priority levels displayed on the sender's communication device via a graphical user interface in accordance with the present invention. This selection may then be used to associate a priority level with an outgoing message. Alternatively, unless otherwise indicated, all e-mail from a given sender or domain may be assigned a predetermined of default priority, and appropriate information may be incorporated in the outgoing message. Mail composition software must be modified using known techniques to provide for presentation of such a menu and/or automatic designation of such information. The “trusted sender's” privileges in terms of use of the necessary software may be revoked in the case of irresponsible use of such statements/information.
[0021] For incoming e-mail messages that do not carry priority information, e.g. do not include a specifier, compiled header information, etc., other information must be used to identify a priority level for the message in step 14. In such a case, other information typically carried by an e-mail message, or associated with an e-mail message, is used in an inventive way in accordance with the present invention to identify a priority level. For example, information that may be used includes a network address of a sending or intermediary (e.g. ISP) system, a sub-network of a sending or intermediary system, a domain name of a sending or intermediary system, or other network path information typically found in network communication headers, such as TCP/IP packet headers, or application path information such as network path information of systems previously processing and/or routing the message, sender identity domain or other information typically carried by an e-mail header (e.g., SMTP header information such as TO, FROM, SUBJECT, DATE, mail agent, “received” history, etc.), or other geographic origin (as determined by known techniques), source, origin, path or other information that may be shared by multiple messages and thereby provide identifying information by which future messages from the same geographic origin, source, origin, path, etc. may be prioritized, etc.
[0022] Any message not bearing the compiled header may be processed at a lower priority than a message with such a compiled header, thereby providing the prioritization functionality of the present invention.
[0023] FIG. 2 is a flow diagram 20 of an exemplary method for using a heuristic approach for identifying a priority level for an e-mail message's network path according to the present invention. Accordingly, the method of FIG. 2 may be used as part of step 14 of FIG. 1 when an e-mail message does not carry priority information. Conceptually, the method of FIG. 2 identifies characteristic information that may be shared by multiple messages and performs a statistical analysis on those messages to determine which messages are likely to be from irresponsible senders or be undesirable, etc., and then assigns all messages having that shared characteristic information a corresponding priority level. Accordingly, messages having a shared characteristic are assigned a priority level based on some metric or other shared information. For example, messages delivered from a certain sender along a certain network path may be sampled to determine levels of messages containing viruses, to determine whether the messages are undeliverable (which is often the case when a dictionary attack spam method is used), or whether the messages are spam, e.g. as determined by pattern matching or other known techniques for detecting abusive messages.
[0024] Referring now to FIG. 2 , the exemplary method starts with identification of an incoming e-mail message's network path, as shown at steps 21 and 22. For example, such information may be ascertained by referring to TCP/IP packet headers. This is performed by the network appliance 100 of FIG. 3 , specifically, by the heuristic engine 102. One or more pluralities of messages sharing a network path are then sampled, as shown at step 24. For example, the sampling rate of messages may be predetermined and static, e.g. 5% of all messages received on the network path. For example, this may be established by the system, system administrator, or recipient. The sampling rate may be determined by reference to the rules engine 104 or another repository for storing system or recipient preferences.
[0025] In another embodiment, the sampling rate is dynamic and therefore changes over time. In such an embodiment, it may be desirable to sample at a default rate, and then to adjust the sampling rate. For example, consider that a recipient has determined that messages received along a certain network path are relatively unimportant to him and so should be delivered at a rate that consumes no more than a fixed percentage of available network resources. The recipient may specify a preference setting the percentage. Accordingly, when an analysis determines that messages are being received at a rate beginning to exceed the preferred percentage, the priority level of messages for that path may be decreased, and the sampling rate may be increased. Sampling at a rate inversely proportional to the determined priority of a given path allows more sampling/monitoring to be devoted to questionable senders or paths, etc. Alternatively, prioritization can be inferred by observing behavior of a recipient and prioritizing according to the observed preferences of the recipient.
[0026] For the sample messages, e.g. 5% of messages arriving along a certain network path, a value for a sender metric is determined, as shown at step 26. For example, sender metrics may include a delivery success rate metric indicating the percentage of messages that are delivered (or undeliverable). For example, this may be achieved by maintaining a hash table of valid addresses in order to determine deliverability of sampled messages, or by proxy processing of e-mail “bounce” messages by the network appliance. It should be noted that this table of processing may be performed dynamically, in real time. Methods and techniques for doing so are straightforward as will be appreciated by those skilled in the art. The rate of undeliverable messages is typically unusually high when the messages are sent using a dictionary attack or brute force spam method because many of the recipient addresses are merely guesses at valid network addresses. Alternatively, a spam rate metric may be determined to indicate the proportion of messages from a certain path that are deemed to be spam, and therefore undesirable. For example, messages may be determined to be spam using content-based analysis, such as pattern matching, as is well known in the art. While this technique may not be completely effective for filtering, it is useful for heuristic analysis. As another alternative, a virus rate metric may be used to reflect the number of messages along a given network path that carry viruses, e.g. using virus-checking software. Any suitable metric and/or value may be used. The sampled messages are scanned by the e-mail scanners 106 of the network appliance 100 (FIG. 3 ), and suitable software for implementing the e-mail scanners is well-known in the art, or requires straightforward modification of software well-known in the art.
[0027] Once a value for a given path is determined, a rule base 104 is referenced, as shown at step 28. The rule base 104 stores recipient, system, etc. preferences and rules for delivering e-mail messages. For example, the rule base 104 may store a rule indicating that a network path having a delivery success rate of less than 80% shall be assigned a “LOWEST” priority level.
[0028] Finally, the method ends when the priority level specified in the rule base for the metric having a certain value is assigned the associated priority level specified in the rule base, as shown at steps 30 and 31. For example, the network path having a delivery success rate of less than 80% is assigned the “LOWEST” priority level. For example, this may involve storing data associating the network path with the “LOWEST” priority level so that data may be accessed and used by the network appliance 100, namely the e-mail connection processor 108, for the delivery of e-mail messages in a prioritized manner, as discussed below.
[0029] Accordingly, the priority level determined for the network path as discussed with reference to FIG. 2 may be identified as the priority level to the incoming e-mail message arriving along that network path in step 14 of FIG. 1 .
[0030] Referring again to FIG. 1 , the rule base 104 is next referenced to determine a prescribed delay for the identified priority level. More generally, the rule base may specify any kind of delivery instructions for the identified priority level. For example, the rule base may store rules indicating that messages with a “HIGHEST” priority level are to be delivered directly to the recipient's mail server 140 without any unnecessary delay. For example, this may be performed without regard to network resource availability or load. Alternatively, a rule may specify that messages with a “LOWEST” priority be delayed, e.g. by holding the message for a fixed period of time, or until network resource availability reaches a certain level, etc. Similar rules may apply to any message characteristic, e.g. “BUSINESS.” By delaying delivery, more network/system resources are available for distribution of higher priority messages, and distribution of the lower priority message will not likely use network resources that are needed to deliver higher priority messages. By not delivering the message at the desired time, or by rejecting the message altogether and not delivering the message, the burden may be shifted from the recipient's network resources to the senders (or an intermediary's) network resources, which then must resend the message. The technique of delaying the message in fact delays the entire connection, so no recipient mail server resources are used until that connection is processed. The benefit is realized over time as the total number/volume of connections from a certain path is contained to desired levels through the cumulative delay in processing of individual connections. An application of this concept is the balancing of paths in terms of a percentage of total available resources. This delaying or rejecting of network connections provides a mechanism for controlling the total number of connections for a particular message source or path.
[0031] In one embodiment, any connection refusal is not reported back to the originator as “host not available” or some other message that makes the recipient's ISP seem technically in error (e.g., system is down). Due to the workings of SMTP (mail protocol), the slowing and/or temporary stopping of connections will not be reported for a predetermined time period, typically four hours.
[0032] Delaying of messages, or blocking of messages, because of the low priority can effectively “squelch” spam or other undesirable messages. This squelching effectively eliminates or softens the undesirable “noise” of unwanted or relatively unimportant e-mail messages, allowing the relatively more important messages to be distributed sooner, and apart from the deluge of undesired e-mail.
[0033] The delaying and/or eventual delivery of messages is performed by the e-mail connection processor 108 of the network appliance, as shown in FIG. 3 . The connection processor 108 receives incoming connections for delivery of e-mail messages and calls other components of the network appliance 100 as necessary. The connection processor 108 also creates network connections as necessary to deliver e-mail messages at the appropriate time, e.g. after the prescribed delay, to deliver messages in accordance with the prioritization techniques described herein. The connection processor may be implemented with software using network architecture layer 4 and/or layer 7 switching and/or load balancing techniques that are well known in the art. Modification of such techniques to provide for delayed delivery, etc. in accordance with the present invention is straightforward, as will be appreciated by those skilled in the art.
[0034] Accordingly, when an incoming message is received by the network appliance 100 (or by software for implementing the functionality of the network appliance, e.g. in the form of modified mail server software) the message either carries priority information, or is assigned priority information based on a shared characteristic with other e-mails, such as the message's network path. The priority information is used to determine how and/or when to deliver the e-mail message. For example, the message may be delayed for a fixed time, or until network/system resource utilization drops to a certain level, etc. or as otherwise prescribed. In this manner, for example, a recipient may choose to have low priority spam messages held for delivery until after his network resource utilization drops to a desired level, or until after all higher priority messages have been delivered, etc. This reduces the burden on the recipient's network/system resources.
[0035] It should be noted that intermediaries, such as ISP's, routing nodes, gateways, etc., between the recipient and the sender may also have network appliances 100 (or similar software) for carrying out the inventive method. This provides advantages similar to those described above for recipients, except that the recipient may also benefit from the intermediary's delay, etc. in sending of lower priority messages.
[0036] In addition, in such embodiments, the network appliances may be provided with notification ability for broadcasting preferences to another party. For example, the network appliance of a recipient may be provided with an upstream notification module 110, and an intermediary ISP may be provided with a network appliance configured to receive messages from the upstream notification module 110. Accordingly, when the network appliance 100 at the recipient determines to hold messages from a certain network path, etc., the upstream notification module 110 notifies an intermediary, such as the recipient's ISP, of this preference. The recipient's preference may then be stored in the intermediary's rule base. Accordingly, the intermediary may begin rejecting, or delaying, messages that the recipient does not wish to receive. This may be repeated by the intermediary for another upstream intermediary closer to the sender. Repeating of this process can eventually push the burden of low-priority messages back to the sender, thereby reducing or eliminating burdens on network/system resources of the recipient and all intermediaries between the recipient and the sender. This is particularly useful to push the burden of spam messages back to the systems of the spam senders. This can create a spam “squelch” at the source of the spam messages, thereby reducing burdens on multiple communications networks and systems.
[0037] It should be noted that such notifications may be broadcasted to any other party, not just upstream parties. Accordingly, information from one party, e.g. ISP, may be shared with another party, e.g. another ISP. For example, this information sharing allows the second ISP to lower priority of messages arriving along a certain network path before any such messages are received by using information learned by the first ISP that messages received along that certain network path are undesirable, or should be treated with a lower priority, e.g. because of an irresponsible sender. This is advantageous for conserving ISP network resources. In effect, this allows for creation of a list of “blacklisted” senders, communication paths, etc. that may be shared with other parties that have network appliances and operate in accordance with the present invention.
[0038] When any compliant e-mail host is faced with an overburdening of its network or system resources, e.g. by a volume of message exceeding its processing capability, e.g., as determined when CPU utilization and/or disk and/or network parameters surpass acceptable levels, the system can broadcast or post a request that sending hosts reduce the e-mail message traffic volume by sending a message upstream to compliant systems.
[0039] The upstream message will be passed back along the e-mail delivery network path until it reaches the sender or until it reaches a poorly-behaved email host. E-mail hosts ignoring priority, volume and squelch messages are considered poorly behaved because they do not respect the capacity of downstream servers.
[0040] If such a request is ignored by a poorly-behaved email host (as evidenced by no change in e-mail traffic volume), the inventive system initiates a Spain Squelch by limiting the number and volume of connections, minimally at a network level, from the offending host. For example, the network appliance tracks volume/number of inbound connections per host, and slows and/or stops the TCP and/or SMTP connection build process for squelched hosts. Additionally, when a source path is identified, e.g. for spam, it may be traced to an ISP of the spam sender. Accordingly, the ISP may be identified and pressured to demand compliance of the spam sender with a certain industry standard of best practices. The ISP may be held responsible for failure to obtain compliance of the spam sender by imposing a lower priority level to all messages receive via the ISP's communication path, thereby imposing a heavy burden on the ISP.
[0041] FIG. 3 is a block diagram of a system 200 for controlling distribution of e-mail messages according to the present invention. As discussed above, the senders, or more precisely the senders' e-mail servers, may be configured with software to provide compiled headers or other priority information as described above. For example, this functionality may be integrated into existing mail server software. Alternatively, a network appliance may be provided to appropriately modify an outgoing message after leaving the mail server but before it reaches the network. Recipients, or more specifically recipients' mail servers, or mail clients, may be configured with software for carrying out the inventive method described above. Alternatively, a network appliance may be provided upstream of the recipients' mail servers, as shown in FIG. 3 . Intermediaries may also have modified mail software and/or network appliances for carrying out the present invention, as described above.
[0042] This present invention also provides the capability to track and report the last known path for spam messages. Specifically, squelch events (i.e., poorly behaved hosts) and excessive volume may be tied to manually and/or automatically detected (using existing and inventive techniques). In some embodiments, spam messages are transmitted to a central host for logging. This aids in the identification of spam sources, which can be identified by IP address, network path, hosting ISP, etc.
[0043] Accordingly, the present invention allows the ISPs/ESPs and other email hosts to control the volume of messages to within their network's/systems' processing capability, and still respect the priority of compliant e-mail messages. Furthermore, the content of email messages is not of concern to the ISPs/ESPs, so longstanding arguments by the ISP community regarding their role as telecommunications infrastructure (with respect to Communications Decency Act (CDA), COPPA, etc.) will not be threatened by their inspection of e-mail message content. In this manner, ISPs maintain their lack of responsibility for content on the grounds that they do not inspect content in any way, but rather merely deliver communications traffic. Accordingly, the present invention provides for spam reduction without the need for such content inspection.
[0044] In a system in which hosts are required to have a digital certificate from a designated authority, and digital signatures are required for various communications, poorly behaved hosts may have their digital certificates revoked, e.g., when a sender violates a service agreement, to ensure compliance. A system may be implemented that is programmed to automatically file unsigned messages in a special mailbox.
[0045] In systems in which e-mail messages are processed by rules, it is advantageous to digitally sign the rules in the header of each message. For example, an SMTP proxy may be advantageously configured so that all outgoing e-mail messages are automatically signed using a private key that is specially registered to a sender (e.g. a marketer). Each e-mail message must be individually signed because each message is different, since e-mail messages tend to have “unsubscribe” links at their bottom. This provides the advantage of guarding against accidental or malicious modification of the rules. It also verifies to the recipient that the e-mail were in fact deals offered by the sender of the email.
Claims
What is claimed is:
1. A method for controlling distribution of network communications via a communications network, the method comprising:
sampling and classifying a subset of network communications according to sender in order to determine, for every sender, a level of network communications having a certain characteristic;
identifying a plurality of subsequent network communications, each being intended for delivery to a respective recipient and each having a respective sender;
determining a priority value for each of the plurality of subsequent network communications as a function of the level previously determined for the communication's sender; and
causing delivery of the plurality of subsequent network communications to the respective recipients in an order corresponding to the respective priority values by allocating a network connection for delivery of a relatively high priority network communication before allocating the network connection for delivery of a relatively low priority network communication.
2. A method for controlling distribution of network communications via a communications network, the method comprising:
sampling and classifying a subset of network communications according to network paths over which the communications travel in order to determine, for every network path, a level of network communications having a certain characteristic;
identifying a plurality of subsequent network communications, each having a respective network path;
determining a priority value for each of the plurality of subsequent network communications as a function of the level previously determined for its respective network path; and
delaying allocation of a network connection for delivery of a first network communication having a first priority, and allocation of the network connection for delivery of a second network communication having a second priority higher than the first priority, allocation of the network connection for delivery of the second network communication being performed before allocation of the network communication for delivery of the first network communication.
3. A method for controlling distribution of network communications via a communications network, the method comprising:
sampling network communications received from a certain sender to determine a level of network communications having a certain characteristic;
determining a priority level as a function of the level; and
assigning the priority level to subsequent network communications received from the certain sender; and
selectively allocating network connections for each of a plurality of subsequent network communications in order to receive a prioritization effect according to the assigned priority level of the incoming network communication, the prioritization effect comprising allocating a network connection for delivery of a relatively high priority network communication before allocating the network connection for delivery of a relatively low priority network communication.
4. The method of claim 3, wherein the characteristic comprises containing of a virus.
5. The method of claim 3, wherein the characteristic comprises undeliverability of network communication to a respective receiver.
6. The method of claim 3, wherein the characteristic comprises characterization of network communication as spam.
7. The method of claim 6, wherein characterization of the network communication as spam is determined according to a pattern matching technique.
8. An apparatus for controlling distribution of network communications via a communications network, the apparatus comprising:
means for identifying a respective priority for each of a plurality of network communications by initially sampling, and classifying according to communication sender, a subset of all network communications on the communications network to determine, for every communication sender, a level of network communications having a given characteristic, wherein each of the plurality of network communications from a communications sender is assigned a priority based upon the level; and
means for allocating network connections for delivery of network communications, the means being configured to provide a prioritization effect whereby connections are allocated for delivery of the plurality of network communications in an order corresponding to respective priorities of the plurality of network communications, a network communication having a relatively high priority being allocated a network connection before another network communication having a relatively low priority;
whereby said means for allocating network connections provides unnecessary delay for allocation of a network connection for a network communication having a relatively low priority to permit allocation of said network connection for delivery of a network communication having a relatively high priority.
9. The apparatus of claim 8, wherein said delay is provided for any network communications having a certain priority.
10. The apparatus of claim 8, wherein said delay is provided for any network communication received along a certain network path.
11. The apparatus of claim 8, wherein said delay is provided for any network communication originating from a certain sender.
12. The apparatus of claim 8, wherein said delay is provided for any network communication when utilization of network resources exceeds a predetermined threshold.
13. A network appliance for controlling distribution of network communications via a communications network, the network appliance comprising:
a heuristic engine for identifying a network path for each of a plurality of network communications received by the network appliance, and for sampling a subset of the plurality of network communications, each network communication of the subset having a common network path;
a scanner for scanning each network communication of the subset and for determining a value for a sender metric for the network communications of the subset;
a rules database storing rules for delivering network communications, at least one of the rules correlating the value to a priority level; and
a connection processor for allocating network connections for delivery of network communications, the connection processor being configured to allocate network connections for certain network communications in an order of priority corresponding to the certain network communications' respective priority levels, wherein each network communication's respective priority level is assigned according to its respective network path, and the priority level assigned to the subset of network communications having an identical network path, and wherein the order of priority is achieved by allocating a network connection for delivery of a relatively high priority network communication before allocating the network connection for delivery of a relatively low priority network communication.
14. The network appliance of claim 13, further comprising a notification module, the notification module being capable of communicating to another network appliance.
15. The network appliance of claim 13, wherein the notification module is configured to communicate via the communications network.
16. The network appliance of claim 14, wherein the notification module is configured to communicate priority level information for a corresponding network path.
17. The network appliance of claim 14, wherein the notification module is configured to communicate a preference to delay network communications from a certain network path.
18. The network appliance of claim 14, wherein the notification module is configured to communicate a request to reduce a volume of network communications directed to the network appliance.
19. The network appliance of claim 13, wherein the sampling is performed according to a predetermined sampling rate.
20. The network appliance of claim 19, wherein the predetermined sampling rate is stored in the rules database.
21. The network appliance of claim 13, wherein the sampling rate is varied over time.
22. The network appliance of claim 13, wherein the sender metric comprises a virus rate indicating a percentage of the network communications of the subset that carry a virus.
23. The network appliance of claim 13, wherein the sender metric comprises a delivery success rate indicating the percentage of the network communications of the subset that are delivered.
24. The network appliance of claim 13, wherein the sender metric comprises a spam rate indicating a percentage of the network communications of the subset that are determined to be unwanted.
25. The network appliance of claim 24, wherein the determination of whether a certain network communication is unwanted is determined by content-based analysis.
26. The network appliance of claim 24, wherein the determination of whether a certain network communication is unwanted is determined by pattern matching.
27. The network appliance of claim 13, wherein the rules database further comprises a prescribed delay corresponding to the priority level.
28. The network appliance of claim 27, wherein the prescribed delay comprises a fixed period of time.
29. The network appliance of claim 27, wherein the prescribed delay comprises delay until network resource availability reaches a certain level.
30. A system for controlling distribution of network communications via a communications network, the system comprising:
a mail server operating within an internal communications network for distribution of incoming network communications received via an external communications network; and
a network appliance logically positioned between the mail server and the external communications network, the network appliance being specially configured to selectively allocate network connections of the internal communications network for delivery of the incoming network communications to the mail server, the network appliance being further configured to allocate network connections to the incoming network communications in a prioritized manner determined according to an incoming network communication priority value corresponding to the communication's sender, wherein the priority value is determined based on having previously sampled and classified an initial subset of network communications according to sender in order to determine, for every sender, a level of network communications having a certain characteristic, and wherein the prioritized manner of allocating network connections comprises allocating a network connection for delivery of a relatively high priority network communication before allocating the network connection for delivery of a relatively low priority network communication.
31. A network appliance for controlling distribution of network communications via a communications network, the network appliance receiving incoming network communication connections, the network appliance being capable of allocating network connections for delivering network communications, the network appliance selectively allocating network connections for each of a plurality of network communications in order to receive a prioritization effect according to an incoming network communication priority value corresponding to the communication's sender, wherein the priority value is determined based on having previously sampled and classified an initial subset of network communications according to sender in order to determine, for every sender, a level of network communications having a certain characteristic, and wherein the prioritization effect comprises delaying allocation of a network connection for delivery of a first network communication having a first priority, and allocation of the network connection for delivery of a second network communication having a second priority higher than the first priority, allocation of the network connection for delivery of the second network communication being performed before allocation of the network communication for delivery of the first network communication.
32. A network appliance for controlling distribution of network communications via a communications network, the network appliance receiving incoming network communication connections, the network appliance being capable of allocating network connections for delivering network communications, the network appliance selectively allocating network connections for each of a plurality of network communications in order to receive a prioritization effect according to an incoming network communication priority value corresponding to the communication's sender, wherein the priority value is determined based on having previously sampled and classified an initial subset of network communications according to sender in order to determine, for every sender, a level of network communications having a certain characteristic, and wherein the prioritization effect comprises allocating a network connection for delivery of a relatively high priority network communication before allocating the network connection for delivery of a relatively low priority network communication.
33. A method for controlling distribution of network communications via a communications network, the method comprising:
identifying a plurality of network communications, each having a respective priority level corresponding to the communication's sender, wherein the respective priority level is determined based on having previously sampled and classified an initial subset of network communications according to sender in order to determine, for every sender, a level of network communications having a certain characteristic;
allocating network connections for delivery of network communications to allocate network connections as a function of a respective priority level of each of the plurality of network communications, wherein said allocating comprises allocating a network connection to a certain network communication having a first priority level before allocating the network connection to another network communication having a second priority level lower than the first priority level.
34. A method for controlling distribution of network communications via a communications network, the method comprising:
identifying a plurality of network communications, each having a respective priority level corresponding to the communication's sender, wherein the respective priority level is determined based on having previously sampled and classified an initial subset of network communications according to sender in order to determine, for every sender, a level of network communications having a certain characteristic;
allocating network connections for delivery of network communications to allocate network connections as a function of a respective priority level of each of the plurality of network communications, wherein said allocating comprises causing delivery of a certain network communication having a first priority level to occur after delivery of another network communication having a second priority level higher than the first priority level.
Patent Citations (106)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3969723(A) | 1976-07-01 | Kennicott | Applicant |
| US4558413(A) | 1985-12-01 | Schmidt et al. | Applicant |
| US4714992(A) | 1987-12-01 | Gladney et al. | Applicant |
| US4809170(A) | 1989-02-01 | Leblang et al. | Applicant |
| US4962532(A) | 1990-10-01 | Kasiraj et al. | Applicant |
| US5155847(A) | 1992-10-01 | Kirouac et al. | Applicant |
| US5182806(A) | 1993-01-01 | McKeeman et al. | Applicant |
| US5204960(A) | 1993-04-01 | Smith et al. | Applicant |
| US5377354(A) | 1994-12-01 | Scannell et al. | Applicant |
| US5458575(A) | 1995-10-01 | Wang | Applicant |
| US5479654(A) | 1995-12-01 | Squibb | Applicant |
| US5485575(A) | 1996-01-01 | Chess et al. | Applicant |
| US5495610(A) | 1996-02-01 | Shing et al. | Applicant |
| US5508817(A) | 1996-04-01 | Kunigami | Applicant |
| US5519866(A) | 1996-05-01 | Lawrence et al. | Applicant |
| US5555346(A) | 1996-09-01 | Gross et al. | Applicant |
| US5557723(A) | 1996-09-01 | Holt et al. | Applicant |
| US5566335(A) | 1996-10-01 | Nash et al. | Applicant |
| US5574906(A) | 1996-11-01 | Morris | Applicant |
| US5581764(A) | 1996-12-01 | Fitzgerald et al. | Applicant |
| US5613108(A) | 1997-03-01 | Morikawa | Applicant |
| US5619648(A) | 1997-04-01 | Canale et al. | Applicant |
| US5649200(A) | 1997-07-01 | Leblang et al. | Applicant |
| US5671398(A) | 1997-09-01 | Neubauer | Applicant |
| US5673387(A) | 1997-09-01 | Chen et al. | Applicant |
| US5684875(A) | 1997-11-01 | Ellenberger | Applicant |
| US5694616(A) | 1997-12-01 | Johnson et al. | Applicant |
| US5699275(A) | 1997-12-01 | Beasley et al. | Applicant |
| US5717923(A) | 1998-02-01 | Dedrick | Applicant |
| US5729743(A) | 1998-03-01 | Squibb | Applicant |
| US5774552(A) | 1998-06-01 | Grimmer | Applicant |
| US5781901(A) | 1998-07-01 | Kuzma | Applicant |
| US5790856(A) | 1998-08-01 | Lillich | Applicant |
| US5794210(A) | 1998-08-01 | Goldhaber et al. | Applicant |
| US5799189(A) | 1998-08-01 | Koser et al. | Applicant |
| US5832220(A) | 1998-11-01 | Johnson et al. | Applicant |
| US5883946(A) | 1999-03-01 | Beck et al. | Examiner |
| US5892900(A) | 1999-04-01 | Ginter et al. | Applicant |
| US5893113(A) | 1999-04-01 | McGrath et al. | Applicant |
| US5903880(A) | 1999-05-01 | Biffar | Applicant |
| US5905896(A) | 1999-05-01 | Delannoy | Applicant |
| US5909581(A) | 1999-06-01 | Park | Applicant |
| US5911048(A) | 1999-06-01 | Graf | Applicant |
| US5917489(A) | 1999-06-01 | Thurlow et al. | Applicant |
| US5933647(A) | 1999-08-01 | Aronberg et al. | Applicant |
| US5933811(A) | 1999-08-01 | Angles et al. | Applicant |
| US5948058(A) | 1999-09-01 | Kudoh et al. | Applicant |
| US5948104(A) | 1999-09-01 | Gluck et al. | Applicant |
| US5953532(A) | 1999-09-01 | Lochbaum | Applicant |
| US5960204(A) | 1999-09-01 | Yinger et al. | Applicant |
| US5960411(A) | 1999-09-01 | Hartman et al. | Applicant |
| US5999967(A) | 1999-12-01 | Sundsted | Applicant |
| US6006034(A) | 1999-12-01 | Heath et al. | Applicant |
| US6006242(A) | 1999-12-01 | Poole et al. | Applicant |
| US6035423(A) | 2000-03-01 | Hodges et al. | Applicant |
| US6052531(A) | 2000-04-01 | Waldin, Jr. et al. | Applicant |
| US6057841(A) | 2000-05-01 | Thurlow et al. | Applicant |
| US6073142(A) | 2000-06-01 | Geiger et al. | Examiner |
| US6081814(A) | 2000-06-01 | Mangat et al. | Applicant |
| US6088803(A) | 2000-07-01 | Tso et al. | Applicant |
| US6092080(A) | 2000-07-01 | Gustman | Applicant |
| US6119165(A) | 2000-09-01 | Li et al. | Applicant |
| US6134658(A) | 2000-10-01 | Multerer et al. | Applicant |
| US6138146(A) | 2000-10-01 | Moon et al. | Applicant |
| US6145079(A) | 2000-11-01 | Mitty et al. | Applicant |
| US6146026(A) | 2000-11-01 | Ushiku | Applicant |
| US6147977(A) | 2000-11-01 | Thro et al. | Examiner |
| US6151643(A) | 2000-11-01 | Cheng et al. | Applicant |
| US6161130(A) | 2000-12-01 | Horvitz et al. | Applicant |
| US6161181(A) | 2000-12-01 | Haynes et al. | Applicant |
| US6178551(B1) | 2001-01-01 | Sana et al. | Applicant |
| US6185603(B1) | 2001-02-01 | Henderson et al. | Applicant |
| US6199081(B1) | 2001-03-01 | Meyerzon et al. | Applicant |
| US6260059(B1) | 2001-07-01 | Ueno et al. | Applicant |
| US6278709(B1) | 2001-08-01 | Walker et al. | Examiner |
| US6334140(B1) | 2001-12-01 | Kawamata | Examiner |
| US6345256(B1) | 2002-02-01 | Milsted et al. | Applicant |
| US6349407(B1) | 2002-02-01 | Towfiq | Applicant |
| US6363415(B1) | 2002-03-01 | Finney et al. | Applicant |
| US6374237(B1) | 2002-04-01 | Reese | Applicant |
| US6418555(B2) | 2002-07-01 | Mohammed | Applicant |
| US6421669(B1) | 2002-07-01 | Gilmour et al. | Applicant |
| US6460036(B1) | 2002-10-01 | Herz | Applicant |
| US6460050(B1) | 2002-10-01 | Pace et al. | Applicant |
| US6484315(B1) | 2002-11-01 | Ziese | Applicant |
| US6490587(B2) | 2002-12-01 | Easty et al. | Applicant |
| US6493722(B1) | 2002-12-01 | Daleen et al. | Applicant |
| US6510552(B1) | 2003-01-01 | Benayoun et al. | Applicant |
| US6535894(B1) | 2003-03-01 | Schmidt et al. | Applicant |
| US6609196(B1) | 2003-08-01 | Dickinson et al. | Applicant |
| US6651249(B2) | 2003-11-01 | Waldin et al. | Applicant |
| US6654787(B1) | 2003-11-01 | Aronson et al. | Examiner |
| US6771765(B1) | 2004-08-01 | Crowther et al. | Examiner |
| US6941304(B2) | 2005-09-01 | Gainey et al. | Examiner |
| US7050445(B1) | 2006-05-01 | Zellner et al. | Examiner |
| US2001/0018739(A1) | 2001-08-01 | Anderson et al. | Applicant |
| US2002/0007400(A1) | 2002-01-01 | Pedersen | Applicant |
| US2002/0120705(A1) | 2002-08-01 | Schiavone et al. | Applicant |
| US2004/0133776(A1) | 2004-07-01 | Putzolu | Applicant |
| EP230616(A2) | 1987-08-01 | Applicant | |
| EP735474(A2) | 1996-10-01 | Applicant | |
| EP774720(A2) | 1997-05-01 | Applicant | |
| WO96/32679(A1) | 1996-10-01 | Applicant | |
| WO99/22325(A1) | 1999-05-01 | Applicant | |
| WO/29945(A1) | 2000-05-01 | Applicant | |
| WO1/37123 | 2001-05-01 | Applicant |
Non-Patent Literature (34)
- Faith Cranor, L., LaMacchia, Brian A., Spam! Communications of the ACM. vol. 41, No. 8 pp. 74-83 (Aug. 1998).Applicant
- Jee, et al., “A Generic Virus Detection Agent on the Internet”, pp. 210-219, 1997 IEEE, retrieved May 10 , 2006, Taiwan.Applicant
- Bellare et al., “Incremental Cryptography and Application to Virus Protection”, pp. 45-56, 1995 ACM, retrieved May 10, 2006, New York, NY.Applicant
- U.S. Appl. No. 10/211,827, filed Aug. 2, 2002, Nachenberg.Applicant
- “User-Friendly Interface for Applying Specific Levels of Coordinated Updates to Software in the Field,” IBM Technical Disclosure Bulletin, vol. 31, No. 10, Mar. 1989, Armonk, NY, U.S.A.Applicant
- Ambriola, Vincenzo; Bendix, Lars; and Ciancarini, Paolo, “The Evolution of Configuration Management and Version Control,” Software Engineering Journal, Nov. 1990, pp. 303-310, retrieved from IEEE database, Sep. 24, 2002, U.S.A.Applicant
- Conradi, Reidar and Westfechtel, Bernhard, “Configuring Versioned Software Products,” Department of CS and Telematics, Norwegian Institute of Technology, Trondhiem, Norway, 1996, retrieved from http://citeseer.nj.nec.com/conradi96 on Sep. 24, 2002.Applicant
- Grundy, et al., “Support For Collaborative, Integrated Software Development,” Proc 95 Software Engineering Environments, Abstract Only, Apr. 1995, U.S.A.Applicant
- Hedin, Gorel, “Incremental Execution In A Programming Environment Based On Compilation,” Proc. Of Nineteenth Hawaii Intl. Conf. On System Sciences, Abstract Only, Jan. 1986, U.S.A.Applicant
- Hurwitz Group, “Application Management for Distributed Applications,” pp. 1-7, Jun. 1998, U.S.A.Applicant
- Lindsay, Peter; Liu, Yaowei, and Traynor, Owen, “A Generic Model for Fine Grained Configuration Management Including Version Control and Traceability,” 1997 IEEE, retrieved from the IEEE database Sep. 24, 2002, U.S.A.Applicant
- Marimba, “Castanet 3.0 Product Family,” Jun. 1998, U.S.A.Applicant
- Marimba, “Castanet Infrastructure Suite,” Jun. 1998, U.S.A.Applicant
- Marimba, “Castanet Management Suite,” Jun. 1988, U.S.A.Applicant
- Marimba, “Castanet Production Suite,” Jun. 1998, U.S.A.Applicant
- Pocket Soft, “.RTPatch® Professional for Windows, NT, and DOS Binary Update System,” pp. 1-6. Jun. 23, 1998, http://www.pocketsoft.com\whtwind.html, U.S.A.Applicant
- Pollock, Lori, “Incremental Version of Iterative Data Flow Analysis,” IEEE Trans Software Eng., v 15, n 12, Abstract Only, Dec. 1989, U.S.A.Applicant
- Reichenberger, Christoph, “Orthogonal Version Management,” Universitat Linz, Institute fur Informatik, Austria, 1989 ACM.Applicant
- Suk Oh, Am, et al. “An Incremental Update Propagation Scheme For A Cooperative Transaction Model,” Proc. 7th Intl. Workshop On Database And Expert Systems Appl, Abstract Only, Sep. 1996, U.S.A.Applicant
- “System File Protection and Windows ME”, [online], last updated Dec. 4, 2001, [retrieved on Apr. 9, 2002] Retrieved from the Internet: <URL: http://www.Microsoft.com/hwdev/archive/sfp/winME—sfpP.asp>.Applicant
- “Description of Windows 2000 Windows File Protection Feature (Q222193)”, [online], first published May 26, 1999, last modified Jan. 12, 2002, [retrieved on Apr. 9, 2002] Retrieved from the Internet <URL:http://support.microsoft.com/default.aspx?scid=kb:EN-US;q222193>.Applicant
- “Software: Windows ME; Windows ME and System File Protection”, [online] last updated Mar. 11, 2002, [retrieved on Apr. 9, 2002] Retrieved from the Internet: <URL: http//www.wackyb.co.nz/mesfp.html>.Applicant
- “Gold Parser, A Free Multi-Platform Parser Generator”, [online] devincook.com [retrieved Oct. 17, 2003] Retrieved from the Internet: <URL: http://www.devincook.com/goldparser/index.htm>.Applicant
- “RFC 2821—Simple Mail Transport Protocol”, Klensin J., editor, Apr. 2001, [online] Faqs.org [retrieved Oct. 13, 2003] Retrieved from the Internet: <URL: http://www.faqs.org/rfcs/rfc2821.html>.Applicant
- Keneipp, Ray, Traffic Shaping [Online], May 14, 2001, [retrieved from the Internet on Apr. 27, 2004] Retrieved from the Internet: <URL: Itworld.com—supersite manager—Traffic Shaping http://www.itworld.com/nl/sup—mgr/05142001/>.Applicant
- ISP-Planet Staff, Slower Spam Would Annoy Spammers [Online] Feb. 20, 2003, [retrieved from the Internet on Apr. 22, 2005]. Retrieved from the Internet: <URL: ISP-Planet—Equipment—Slower Spam Would Annoy Spammers, http://www.isp-planet.com/equipment/2003/spamsquelcher.html>.Applicant
- Wagner, Mitch, “Tool Users Network Analysis to Fight Spam” [Online] retrieved from the Internet on Apr. 22, 2005] Retrieved from the Internet: <URL: Internet Week>E-mail>Tool Uses Network Analysis to Fight Spam> Feb. 13, 2003, http://www.internetweek.com/story/showarticle.jhtml?articleID=6900032>.Applicant
- PR Newswire, “Spam Squelcher Technology Cuts Costly Impact of Spam on Enterprises and ISPs;” New Product from ePrivcacy Group turns back Spam Attacks with False Positives, [Online] Feb. 11, 2003, [Retrieved from the Internet on May 3, 2004]. Retrieved from the Internet:<URL: PR Newswire Spam Squelcher Technology Cuts Costly Impact of Spam on Enterprises and ISPs http://www.findarticles.com/cf—dls/m4prn/2003—Feb—11/97463210/p1/article.Applicant
- CAUCE.org web pages [Online] Coalition Against Unsolicited Commercial Email [Retrieved on Mar. 17, 2003] Retrieved from the Internet<URL:http://www.cauce.org/about/problem.shtml>.Applicant
- MacNamara, J.E., “Technical Aspects of Data Communication,” 2nd Ed., 1982, Digital Equipment Corporation, pp. 110-122, U.S.A.Applicant
- Morar, J.E. et al., “Can Cryptography Prevent Computer Viruses?” Virus Bullentin Conference 2000, Sep. 2000, pp. 127-138, Virus Bullentin Ltd., Oxfordshire, England.Applicant
- “News Release—Symantec Delivers Cutting-Edge Anti-Virus Technology with Striker32,” Oct. 1, 1999, 2 pages [Online], Retrieved on Nov. 11, 2003, Retrieved from the Internet<URL:http://www.symantec.com/press/1999/n991001.html> Author unknown.Applicant
- Ore, O., “Number Theory and Its History,” 1976, pp. 124-129, Gudron Ore, U.S.A.Applicant
- Wikipedia.org web pages [Online], Wikipedia, [Retrieved on Mar 17, 2003] Retrieved from the Internet:<URL:http://www.wikipedia.org/w/wiki.phintl?title=machine learning and printable=yes>.Applicant