Openwave Systems Inc.

Xerocole, Inc.

Unwired Planet, LLC

Akamai Technologies, Inc.

Robert M Fleischman

William Thomas Waters

Robert Alton Wyatt

Bruce L Brown, Jr

Samuel G Silberman

Mark H Granoff

Rajesh P Chaube

Michael S Zraly

Robert A Wyatt

According to a first embodiment of the invention, if an e-mail sender attempts to make too many connections within a predetermined period of time, the excess connections are automatically rejected. According to a second embodiment of the invention, an agreement is established between an e-mail sender and an e-mail recipient that states when the sender may send e-mail messages to the recipient. According to a third embodiment of the invention, trend data reflecting an amount of e-mail sent by a sender is collected. The trend data can be used to establish a rate limit for the sender. According to a fourth embodiment of the invention, separate rate limits are established for authenticated and unauthenticated mail from addresses. According to a fifth embodiment of the invention, a sender may have a rate at which their e-mail is transmitted reduced if they exceed predetermined rate limits.

System for managing e-mail traffic

This disclosure describes systems, methods, and apparatus to protect users of the Internet from DNS outages. In particular, an outage avoidance system is provided that includes query processing, outage avoidance processing, and a local cache, all configured to extend the TTL of expired answers to DNS queries or to ignore the expiration of an answer's TTL value, and thereby provide the expired answer in response to a client request when a DNS server is unable to obtain an answer from a remote DNS server.

DNS outage avoidance method for recursive DNS servers

This disclosure describes systems, methods, and apparatus for sharing DNS answers between DNS server systems within a DNS cluster, between proxy servers, and/or between DNS server systems of different DNS clusters. When a DNS answer is obtained by a DNS server system, the answer can be shared with peer DNS server systems within a same DNS cluster or with DNS server systems having a logical relation to the first DNS server system (e.g., geographic relationship), but being in different DNS clusters. Proxy servers may also mediate communication between a client and the DNS clusters. These proxies can also include the ability to share DNS answers between each other.

Data sharing method for recursive DNS servers

According to an embodiment of the invention, a communal memory is disclosed. A communal memory is a shared memory between several participants over a network. The memory tracks the connectivity status of the participants. The state of each of the participants is shared with all of the other participants. Every participant tracks local connections, and compiles the connection data into an update. At a predetermined local interval, the update is transmitted to the other participants. This information can then be used to determine whether to accept network connections or for other purposes.

Communal memory

A chaining system for Usenet applications allows local Usenet servers having a relatively small storage capacity to provide access to a large number of articles through network connections with large-capacity storage devices. The local servers can thereby advertise the availability of the union of its own stored content and the content stored on the large-capacity storage device. Chaining can be accomplished with and without-caching. In addition, the chaining system of the present invention allows storage devices to be staged throughout a network so that the most requested Usenet articles are available on fast, local servers, thereby freeing larger storage devices to hold greater numbers of less-popular articles. The larger devices may be shared among several local servers. The overall system performance is enhanced because the load on storage devices can be advantageously balanced, with the fastest (and typically smallest) storage devices absorbing the greatest load, while the slower (and typically larger) storage devices have reduced load and offer a larger selection of less-popular news articles. The net result for the user is a system with a large selection of articles in which most of the requests will be served quickly from local storage devices.

Server chaining system for usenet

A database structure is disclosed that is particularly suited to Usenet servers. The database is thread-hot, synchronized, and highly parallel. In addition, the database structure enables high speed read/write activity with low latency search processes. The database is statically sized, self-expiring, and self-reparing. No throttling or down-time is required in the normal course of operations. The database is accompanied by several caches to provide a system capable of high perfomance Usenet operations. The invention comprises a &ldquo;key-value&rdquo; database, several pointers, linked lists, locks, and queues. All of these elements are arranged to operate in a synergistic manner to achieve a highly efficient history database. Under normal conditions, most of the queries from newsfeeds can be satisfied from a cache of the latest history database entries because many of the newsfeeds will offer the same articles as the other newsfeeds. The same cache also provides space in which to store and aggregate the latest additions to the database such that both &ldquo;read&rdquo; and &ldquo;write&rdquo; operations to the disk are optimized.

Growing community of inventors

Concord, NH, United States of America

Robert M Fleischman