Abstract: A method (and system) of storing data in a value-based storage system, includes optimizing a value of data stored in the value-based storage system.

Abstract: A method and system for providing click-once links is disclosed. Elision is used to automatically remove a URL and associated content from a web page as hyperlinks are selected, reducing previously visited material and providing visual feedback to a user. When a user selects an elision-enabled hyperlink, the hyperlink and its associated content are not displayed during subsequent displaying of the same web page. Web pages may be generated on the origin server and a browser client updates the content automatically. Click-once links may be flagged in an enclosing HTML source page through a combination of an indirection through a JavaScript function in an anchor and an additional HTML tag. Cookies may be used to record information about which links have been followed and to share such information with the origin server for use in subsequent page generation, or the browser may be adapted to perform elision without using cookies.

Abstract: A mechanism is provided that aggregates data in a way that permits data to be deleted efficiently, while minimizing the overhead necessary to support bulk deletion of data. A request is received for automatic deletion of segments in a container and a waterline is determined for the container. A determination is made if at least one segment in the container falls below the waterline. Finally, in response to one segment falling below the waterline, the segment from the container is deleted. Each object has an associated creation time, initial retention value, and retention decay curve (also known as a retention curve). At any point, based on these values and the current time, the object's current retention value may be computed. The container system continually maintains a time-varying waterline: at any point, objects with a retention value below the waterline may be deleted.

Abstract: The present invention is directed to a method of providing content distribution services while minimizing the processing time required for security protocols such as the Secure Sockets Layer.

Abstract: A system and method for optimizing a storage system to support full utilization of storage space are provided. With the system and method, data objects/containers of data objects are assigned retention values when they are created. These retention values may be dynamically modified based on a modification function associated with the data objects/containers. When storage space needs to be freed for the storage of new data objects/containers, the retention values of existing data objects/containers provide a prioritization as to which data objects/containers should be deleted from the storage system and the order by which these data objects/containers are to be deleted to make available storage space for the new data objects/containers. The identification of the data objects/containers that are to be deleted may be based on a dynamically modified delete threshold, a sorted list of retention values, or the like.

Abstract: A system and method for optimizing a storage system to support short data object lifetimes and highly utilized storage space are provided. With the system and method, data objects are clustered based on when they are anticipated to be deleted. When an application stores data, the application provides an indicator of the expected lifetime of the data, which may be a retention value, a relative priority of the data object, or the like. Data objects having similar expected lifetimes are clustered together in common data structures so that clusters of objects may be deleted efficiently in a single operation. Expected lifetimes may be changed by applications automatically. The system automatically determines how to handle these changes in expected lifetime using one or more of copying the data object, reclassifying the container in which the data object is held, and ignoring the change in expected lifetime for a time to investigate further changes in expected lifetime of other data objects.

Abstract: A method of limiting reuse of domain name information includes the steps of requesting the information by a local domain name server from an authoritative domain name server, and providing this information to a requestor, such as a client or server. The domain name information includes an allowable usage limit that represents a maximum number of times that the information can be provided to the requestor before revalidating the information. A system for limiting reuse of domain name information includes an authoritative domain name server, a local domain name server, and a requestor. The authoritative server provides the information, which includes the allowable usage limit, in response to a request by the local server. The request from the local server may include the number of times that the local server provided the information to one or more requestors as an observed usage.

Abstract: The apparent speed of a connection between a browser at a user station and a proxy or gateway on a network such as the Internet is increased by providing a local proxy at the user station which interacts with a remote proxy. While the remote proxy is retrieving a newly requested World Wide Web page, for example, from the appropriate content provider, it may also be sending to the local proxy a stale cached version of that page. When the new version of the page is finally retrieved, the remote proxy determines the differences between the new version and the stale version, and, assuming the differences do not exceed the new page in size, sends the differences to the local proxy which then reconstructs the new page from the differences and the stale version. The local proxy delivers the new page to the browser, which need not even be aware that a local proxy exists; it is aware only that it received the page it requested.

Abstract: A redundancy elimination mechanism is provided, which applies aspects of duplicate block elimination and delta encoding at the block level. The redundancy elimination mechanism divides file objects into content-defined blocks or “chunks.” Identical chunks are suppressed. The redundancy elimination mechanism also performs resemblance detection on remaining chunks to identify chunks with sufficient redundancy to benefit from delta encoding of individual chunks. Any remaining chunks that do not benefit from delta encoding are compressed. Resemblance detection is optimized by merging groups of fingerprints into super fingerprints. This merging can be constructed to ensure that if two objects have a single super fingerprint in common, they are extremely likely to be substantially similar.

Abstract: A power-aware monitor is provided for controlling the execution of state-unaware applications and optimizing their execution in light of power consumption issues. The power-aware monitor examines application usage to build profiles of resource consumption. When an application starts execution, the monitor determines the state of the battery to influence policy decisions. The monitor maintains a list of rules, which it uses in deciding policy. The user may modify these rules to override default behavior. The rules dictate whether an application executes unfettered, has its I/O, computation, or other activity restricted or delayed, or is completely aborted. When in doubt, the monitor may prompt the user for a decision.

Abstract: An information processing system comprises first and second levels of a storage hierarchy, wherein accessing information in the first level consumes more energy than accessing information in the second level; and a processor for writing information to the second level of storage based on energy-conserving criteria. The energy-conserving criteria comprise a set of heuristics, including system state information and user preferences.

Abstract: A method and apparatus for scalable inquiries in a network of communicating peers are provided. The method and apparatus of the present invention make use of communal filters and randomization to determine which client devices will output a message that is to be broadcast to a community of client devices. Each message is assigned a probability value that is determined based on various criteria or may be determined randomly. The message is then transmitted to the client devices who apply their own respective display criteria to the message parameters to determine if the message is one that is of interest to the user of the client device. If the message is not of interest to the user of the client device, the message is discarded. If the message is of interest to the user, logic is applied to the parameters of the message to determine whether the message should be displayed to the user or not.

Abstract: Techniques for automatically detecting similar subsets (e.g., fragments) in electronic documents such as dynamic content-based data, e.g., web pages. The techniques of the invention may perform a systematic analysis of the web pages with respect to one or more of their information sharing behavior, their personalization characteristics, and their change pattern over time. Thus, the invention may be applied to discover fragments in web pages of web sites that are most beneficial for caching the contents of the web site. The present invention also comprises techniques for publishing electronic documents with automatic fragment detection.

Abstract: Techniques for automatically detecting similar subsets (e.g., fragments) in electronic documents such as dynamic content-based data, e.g., web pages. The techniques of the invention may perform a systematic analysis of the web pages with respect to one or more of their information sharing behavior, their personalization characteristics, and their change pattern over time. Thus, the invention may be applied to discover fragments in web pages of web sites that are most beneficial for caching the contents of the web site. The present invention also comprises techniques for publishing electronic documents with automatic fragment detection.

Abstract: A system for accessing documents contained in a remote repository, which change in content from version-to-version. The system allows users to specify lists of documents of interest. Based on the lists, the system maintains an archive, which contains a copy of one version of each listed document, and material from which the other versions can be reconstructed. The system periodically compares the archive with current versions of the documents located in the repository, and updates the archive, thereby maintaining the ability to reconstruct current versions. The system also monitors access to the versions by each user. When a user calls for a current version, the system presents the current version, and indicates what parts of the current version have not been previously accessed by the user.

Abstract: In an arrangement where users are connected to an ISP through a bank of modems, a time-out threshold is then selected for the user based on the user's connection pattern. The threshold is varied dynamically in response to access patterns, in an attempt to trade the benefit accrued by using the ISP's modem and phone line for a shorter period of time, against the inconvenience to the user from having to reestablish a connection to the ISP. Specifically, the time interval between the last disconnection by the user and the time of reconnection is evaluated, and when this time interval is shorter than a preselected threshold, then the time-out threshold is increased. When this time interval is longer than the preselected threshold, then the time-out threshold is decreased. Typically, when the time-out threshold is decreased, it is decreased by a significantly smaller amount that the amount by which it is increased, when it is increased.

Abstract: A system and method for managing time and expense when communicating between a host and multiple network connections. A server program, inserted between an information requesting device and the network connections, reconfigures the information requesting device forcing the information requesting device to pass all requests through the server program. The server program then determines what type of network is being connected. Additionally, the server program makes costs visible to the user, warns the user when pre-specified budgets are exceeded, postpones actions to a later time when conditions are met, and automatically adapts user customization and system configuration values to the changing conditions of use. This allows asynchronous style browsing in which users can work disconnected from a cache of documents or trade off communication cost against information needs.

Abstract: The objective of this invention is to address issues such as the originator problem or the hidden load problem by providing mechanisms in a network having a domain name system for building associations of clients with the domain name servers they use.

Abstract: The present invention is directed to a mechanism that permits a browser to assemble content dynamically from cached static elements and dynamic elements retrieved from a data network.

Abstract: In an arrangement where users are connected to an ISP through a bank of modems, a time-out threshold is then selected for the user based on the user's connection pattern. The threshold is varied dynamically in response to access patterns, in an attempt to trade the benefit accrued by using the ISP's modem and phone line for a shorter period of time, against the inconvenience to the user from having to reestablish a connection to the ISP. Specifically, the time interval between the last disconnection by the user and the time of reconnection is evaluated, and when this time interval is shorter than a preselected threshold, then the time-out threshold is increased. When this time interval is longer than the preselected threshold, then the time-out threshold is decreased. Typically, when the time-out threshold is decreased, it is decreased by a significantly smaller amount that the amount by which it is increased, when it is increased.