Abstract: An approach for caching an electronic product generally involves the use of confirmation data that indicates that an electronic product was successfully provided from a cache to a user. A request to provide an electronic product to a user is received at a cache. In response to receiving the request to provide the electronic product to the user, the cache provides electronic product to the user. If the electronic product was successfully provided by the cache to the user, then the cache generates confirmation data that indicates that the electronic product was successfully provided by the cache to the user. The cache may also provide the confirmation data to a confirmation recipient. The confirmation data may also specify other information, such as an identity of the user, a location of the user and/or a time at which the cache provided the electronic product to the user.

Abstract: An approach for caching an electronic product generally involves the use of confirmation data that indicates that an electronic product was successfully provided from a cache to a user. A request to provide an electronic product to a user is received at a cache. In response to receiving the request to provide the electronic product to the user, the cache provides electronic product to the user. If the electronic product was successfully provided by the cache to the user, then the cache generates confirmation data that indicates that the electronic product was successfully provided by the cache to the user. The cache may also provide the confirmation data to a confirmation recipient. The confirmation data may also specify other information, such as an identity of the user, a location of the user and/or a time at which the cache provided the electronic product to the user.

Abstract: Content is managed and provided to users over a communications link using a differencing engine. The differencing engine is configured to selectively cause content to be refreshed in a cache. Specifically, the differencing engine is configured to detect whether a more recent version of a data item is available, and if so, delete a current version of the data item from the cache and retrieve and store in the cache the more recent version of the data item. Content is selected for refresh based upon a set of one or more selection criteria. The selection criteria may include, for example, the source of content, the size of content, the age of content, the type of content and users to which the content is being provided.

Abstract: A method and apparatus for reducing performance overhead of a media server sending packetized audio/video data to an end-player or user is provided. The main sources of performance overhead associated with a media server transmitting packetized audio/video data are (1) copying data from the user space buffer to the kernel buffer and (2) context switching from user level to kernel level. There are several techniques that can be used to address overhead. One technique involves creating an aggregate packet, which includes a policy, at the user level and transmitting this aggregate packet from the user level to the OS level with a system call. A second technique involves manipulating packets based on a policy in the OS level rather than in the user level. The manipulation of packets may include redirecting packets or splitting packets.

Abstract: The techniques described employ a cooperative organization of network service providers to provide improved distributed network services. The network service providers that are constituent to the cooperative organization represent various perspectives within the overall Internet content distribution network, and may include network owners, telecommunications carriers, network access providers, hosting providers and distribution network owners, the latter being an entity that caches content at a plurality of locations distributed on the network. Aspects include managing content caches by receiving control signals specifying actions related to cached content that is distributed on a network, such as the Internet, and forwarding the control signals through to the caching locations to implement the actions represented by the control signals, thus providing content publishers the capability of refreshing their content regardless of where it is cached.

Abstract: A method and apparatus are provided for capturing and managing user-specific data, where the user-specific data contains information on the user's interaction with the Net. The method generally involves using a proxy to capture or cause to capture the user-specific data and then storing the user-specific data. The user-specific data may be used to customize the contents of electronic information delivered to the particular user.

Abstract: A method and apparatus are provided for managing changes to a directory of electronic documents. A custom directory is created and stored based on the contents of a master directory. The master directory comprises a taxonomy of categories. A plurality of electronic documents are classified in one or more of the categories. One or more mappings defines how the documents of categories of the master directory map to categories of the custom directory. Mappings may express merges or splits of categories. One or more judgments may be created and stored in the custom directory in association with documents in the categories of the custom directory. Each judgment expresses whether a document is in or not in a category, or locked out of all categories. Modifications to the master directory are automatically propagated to the custom directory, according to the mapping, but without overriding the judgments in the custom directory.

Abstract: The foregoing needs and other needs are addressed by the present invention, which provides, in one aspect, a mechanism for locating a data object. According to an aspect of the present invention, key values for data objects are generated, each key value may contain a first subkey value and a second subkey value. A mapping associates the first subkey values with storage locations. A particular first subkey value is mapped to storage location that contains second subkeys of a set of key values that correspond to the first subkey value. The storage location also includes additional information that may be used to locate objects associated with the set of key values.

Abstract: A mechanism for managing data communications is provided. A circularly arranged set of buckets is disposed between input buffers and output buffers in a networked computer system. Connections among the system and clients are stored in the buckets. Each bucket in the set is successively examined, and each connection in the bucket is polled. During polling, the amount of information that has accumulated in a buffer associated with the connection since the last poll is determined. Based on the amount, a period value associated with the connection is adjusted. The connection is then stored in a different bucket that is generally identified by the sum of the current bucket number and the period value. Polling continues with the next connection and the next bucket. In this way, the elapsed time between successive polls of a connection automatically adjusts to the actual operating bandwidth or data communication speed of the connection.

Abstract: Techniques are provided for delivering search results pages to the users of a search engine, where one or more search result listings on the search results pages include items that are not included by default. The non-default items may take many forms, including but not limited to images, banners, controls, animations, and even Java applets. The non-default items may be designed to entice the search engine users to select the search result listing with which they are associated over possibly higher-ranked search result listings that contain only default items.

Abstract: An Internet Protocol driver executed by a network interface card, or a network address translation module, includes a mechanism that enables a server to bypass packets associated with certain destinations, sources, or a combination of the two based upon their IP address. When a packet arrives at the network interface card, the driver extracts a source IP address and a destination IP address from the packet. The driver searches a table to locate a rule matching one of the addresses. If a match is found, the packet is bypassed. If no match is found, the packet is sent on to an indexing and caching server for further processing. The bypass rules may be adaptively and dynamically generated when a message causes a remote server to respond with an error code. The dynamically generated bypass rules prevent the first server from sending subsequent requests to the remote server, thereby insulating the indexing and caching server from unnecessary network traffic.

Abstract: A method and apparatus are provided for managing changes to a directory of electronic documents. A custom directory is created and stored based on the contents of a master directory. The master directory comprises a taxonomy of categories. A plurality of electronic documents are classified in one or more of the categories. One or more mappings defines how the documents of categories of the master directory map to categories of the custom directory. Mappings may express merges or splits of categories. One or more judgements may be created and stored in the custom directory in association with documents in the categories of the custom directory. Each judgement expresses whether a document is in or not in a category, or locked out of all categories. Modifications to the master directory are automatically propagated to the custom directory, according to the mapping, but without overriding the judgements in the custom directory.

Abstract: Techniques are provided for delivering search results pages to the users of a search engine, where one or more search result listings on the search results pages include items that are not included by default. The non-default items may take many forms, including but not limited to images, banners, controls, animations, and even Java applets. The non-default items may be designed to entice the search engine users to select the search result listing with which they are associated over possibly higher-ranked search result listings that contain only default items.

Abstract: A high-performance cache is disclosed. The cache is designed for time- and space-efficiency for a diverse range of information objects. Information objects are stored in portions of a non-volatile storage device called arenas, which are contiguous regions from which space is allocated in parallel. Objects are substantially contiguously allocated within an arena and are mapped by name keys and content-based object keys to a tag table, an open directory, and a directory table. The tag table is indexed by the name keys, and stores references to sets in the directory table. The tag table is compact and therefore can be stored in fast main memory, facilitating rapid lookups. The directory table is organized so that at least a frequently-accessed portion of it also usually resides in fast main memory, which further speeds lookups. The tag and directory tables are organized to quickly determine non-presence of objects.

Abstract: A method and apparatus are provided for indexing electronic documents that include one or more visible text portions and one or more non-visible text portions. The method includes the step of identifying an electronic document. Once the electronic document is identified, a set of words is selected from a particular tag type that is associated with one or more non-visible text portions of the electronic document. Each word in the selected set of words is compared with words in the one or more visible text portions of the electronic document. An index word set is then determined for the electronic document based on matches between words in the selected set of words and words in the one or more visible text portions of the electronic document.

Abstract: A method and apparatus are provided for retrieving documents from a collection of documents based on information other than the contents of a desired document. The collection of documents, which may be a hypertext system or documents available via the World Wide Web, is indexed. In one embodiment, an indexing process of a search engine receives one or more specifications that identify documents, or document locations, and non-content information such as a tag word or code word. The indexing process searches the index to identify all documents in the index that match one or more of the specifications. If a match is found, the tag word is added to the index, and information about the matching document is stored in the index in association with the tag word. A search query is submitted to the search engine. The search query is automatically modified to add a reference to the tag word, such as a query term that will exclude any index entry for a document associated with the tag word.

Abstract: A method and apparatus for managing data communications is provided. A circularly arranged set of buckets is disposed between input buffers and output buffers in a networked computer system. Connections among the system and clients are stored in the buckets. Each bucket in the set is successively examined, and each connection in the bucket is polled. During polling, the amount of information that has accumulated in a buffer associated with the connection since the last poll is determined. Based the amount, a period value associated with the connection is adjusted. The connection is then stored in a different bucket that is generally identified by the sum of the current bucket number and the period value. Polling continues with the next connection and the next bucket. In this way, the elapsed time between successive polls of a connection automatically adjusts to the actual operating bandwidth or data communication speed of the connection.

Abstract: A method for caching information objects is provided. Information objects are stored in portions of a non-volatile storage device called arenas, which are contiguous regions from which space is allocated in parallel. Objects are contiguously allocated within an arena and are mapped to directory tables that provide an efficient search mechanism. Each object is identified by a name key and a content key. The name key is constructed by applying a hash function to the composition of the name or URL of the object along with implicit or explicit context about the request. The content key is constructed by applying a hash function to the entire contents of the object data. Buckets and blocks in the directory tables store tags and subkeys derived from the keys. Since duplicate objects that have different names will hash to the same content key, the cache can detect duplicate objects even though they have different names, and store only one copy of the object.

Abstract: A method is provided for caching and delivering an alternate version from among a plurality of alternate versions of information objects. One or more alternate versions of an information object, for example, versions of the information object that are prepared in different languages or compatible with different systems, are stored in an object cache database. In the cache, a vector of alternates is associated with a key value that identifies the information object. The vector of alternates stores information that describes the alternate, the context and constraints of the object's use, and a reference to the location of the alternate's object content. When a subsequent client request for the information object is received, the cache extracts information from the client request, and attempts to select an acceptable and optimal alternate from the vector by matching the request information to the cached contextual information in the vector of alternates.

Abstract: A method for garbage collection in a cache of information objects is provided. A non-volatile storage device is segmented into storage areas called pools. Each pool has a pool header and a plurality of arenas. Each arena stores one or more fragments of an object. Header information for each arena is stored in the pool header in which that arena is stored. Each fragment comprises a fragment header and fragment data. The garbage collection periodically selects a pool that is storing an amount of data greater than a minimum storage value or high water mark. Each arena in the pool is examined and selected for garbage collection according to selection criteria. Each fragment within a selected arena is examined based upon a second set of selection criteria that determine whether the fragment is retained or deleted. If the fragment is deleted, all other fragments in the storage device that relate to that fragment's object are also deleted.