Openmarket, Inc.

Soverain Software LLC

Sicortex, Inc.

Quanta Computer Incorporated

Soverain Ip, LLC

Lawrence Colm Stewart

Andrew C Payne

Stephen Jeffrey Morris

Thomas Mark Levergood

George Winfield Treese

Judson S Leonard

David J Mackie

Matteo Frigo

Matthew H Reilly

Washington Taylor

David Gingold

An example method to decode an error-correcting code includes receiving a tuple including a seed and a coded packet over a communication channel, and based on the seed, reconstructing a set of pseudorandom coefficients used by an encoder to create the coded packet. The method also includes entering the set of pseudorandom coefficients and the coded packet in a decoding matrix and reducing the decoding matrix to a row echelon form. After reducing the decoding matrix to a row echelon form, the method further includes determining if the decoding matrix is decodable up to a number of rows, reducing the decoding matrix up to the number of rows by backward substitution so a part of the first matrix becomes an identity matrix and a corresponding part of the second matrix comprise source packets, and extracting the source packets from the padded packets.

Error-correcting code

This invention relates to methods for controlling and monitoring access to network servers. In particular, the process described in the invention includes client-server sessions over the Internet. In this environment, when the user attempts to access an access-controlled file, the server subjects the request to a secondary server which determines whether the client has an authorization or valid account. Upon such verification, the user is provided with a session identification which allows the user to access to the requested file as well as any other files within the present protection domain.

Internet server access control and monitoring systems

A method is provided to transmit an error-correcting code. The method includes receiving a source packet, advancing a sliding encoder window after receiving the source packet, and generating coded packets by, when the padded packet is encoded for a first time, encoding the source packet alone, and, when the source packet is encoded for a number of times after the first time, encoding the source packet with older source packets in the sliding window.

Link traversals leading from an advertisement on the Web to a product page are determined. The determined link traversals are used as a basis for charging for advertising, for example, by counting the number of link traversals from the advertising page to a product page, or by counting the number of sales resulting from such traversals. The effectiveness of advertising on the Web is evaluated by measuring the number of sales or transactions resulting from link traversals from the advertisement to the page.

Web advertising method

Service requests from a client to a server system through a network are processed. A session identifier is appended to requests for information. The server responds to the requests from the client by returning the requested information to the client. Requests to particular information are counted, exclusive of repeated requests from a common client.

Method and system for counting web access requests

Computer system and method using a Kautz-like digraph to interconnect computer nodes and having control back channel between nodes. A multinode computing system includes a large plurality of computing nodes interconnected via a Kautz topology having order O, diameter n, and degree k. The order equals (k+1)k; The data interconnections from a node x to a node y in the topology satisfy the relationship y=(&#x2212;x*k&#x2212;j) mod O, where 1&#x2266;j&#x2266;k; and each x,y pair includes a unidirectional control link from node y to node x to convey flow control and error information from a receiving node y to a transmitting node x.

Computer system and method using a kautz-like digraph to interconnect computer nodes and having control back channel between nodes

Computer systems and methods using efficient module and backplane tiling to interconnect computer nodes via a Kautz-like digraph. A multinode computing system includes a large plurality of computing nodes interconnected via a Kautz topology having order O, diameter n, and degree k. The order equals (k+1)k. The interconnections from a node x to a node y in the topology satisfy the relationship y=(&#x2212;x*k&#x2212;j) mod O, where 1&#x2266;j&#x2266;k, and the computing nodes are arranged onto a plurality of modules. Each module has an equal plurality of computing nodes on it. A majority of the inter-node connections are contained on the plurality of modules and a minority of the inter-node connections are inter-module connections. Inter-module connections are routed among modules in parallel on an inter-module connection plane.

Computer system and method using efficient module and backplane tiling to interconnect computer nodes via a Kautz-like digraph

A multi-node computer system with a plurality of interconnected processing nodes, including a method of using DMA engines without page locking by the operating system. The method includes a sending node with a first virtual address space and a receiving node with a second virtual address space. Performing a DMA data transfer operation between the first virtual address space on the sending node and the second virtual address space on the receiving node via a DMA engine, and if the DMA operation refers to a virtual address within the second virtual address space that is not in physical memory, causing the DMA operation to fail. The method includes causing the receiving node to map the referenced virtual address within the second virtual address space to a physical address, and causing the sending node to retry the DMA operation, wherein the retried DMA operation is performed without page locking.

System and method for remote direct memory access without page locking by the operating system

A network-based sales system includes at least one buyer computer for operation by a user desiring to buy a product, at least one merchant computer, and at least one payment computer. The buyer computer, the merchant computer, and the payment computer are interconnected by a computer network. The buyer computer is programmed to receive a user request for purchasing a product, and to cause a payment message to be sent to the payment computer that comprises a product identifier identifying the product. The payment computer is programmed to receive the payment message, to cause an access message to be created that comprises the product identifier and an access message authenticator based on a cryptographic key, and to cause the access message to be sent to the merchant computer. The merchant computer is programmed to receive the access message, to verify the access message authenticator to ensure that the access message authenticator was created using the cryptographic key, and to cause the product to be sent to the user desiring to buy the product.

Network sales system

This invention relates to methods for controlling and monitoring access to network servers. In particular, the process described in the invention includes client-server sessions over the Internet involving hypertext files. In the hypertext environment, a client views a document transmitted by a content server with a standard program known as the browser. Each hypertext document or page contains links to other hypertext pages which the user may select to traverse. When the user selects a link that is directed to an access-controlled file, the server subjects the request to a secondary server which determines whether the client has an authorization or valid account. Upon such verification, the user is provided with a session identification which allows the user to access to the requested file as well as any other files within the present protection domain.

Growing community of inventors

Wayland, MA, United States of America

Lawrence Colm Stewart