Cisco Technology, Inc.

Yongyong Xu

Dan Li

Stephen Jeffrey Morris

Kenneth Earl Mueller, Ii

Ming Tan

Mahesh Viveganandhan

Dipak Punnoran Koroth

Zheng Yang

Dmitry Stavisky

Martin Andrew Ostrowski

Barbara Liskov

Etai Lev Ran

Arun Raghavendra Desai

Maxim S Martynov

Qiwen Zhang

Gideon Glass

Shanchi Zhan

Ivy K Lui

In some embodiments, a request for a content object may be received as a data packet. Upon determining that the content object is not cached, an element of the data packet may be modified and the modified data packet may be forwarded toward a content provider of the content object.

Distributed web object identification for web caching

A system and method for a new type of software repository and remote execution solution where any native application can be run from within a web page is disclosed. Users now have a much easier way to launch, run or execute any software directly from within a server or server cloud without the need to manually download and install. The system further allows software to run inside an isolated environment to protect user's local environment.

Online software execution platform

In one embodiment, redundancy elimination for web caching may be provided. Upon receiving a request for a content object, a determination of whether the content object is cached may be made. In response to determining that the content object is not cached, the requested content object may be retrieved and, if the content object is associated with an aggregate popularity exceeding a caching threshold, the content object may be cached before providing the requested content object.

Redundancy elimination for web caching

A data redundancy elimination system. In particular implementations, a method includes storing in a memory one or more aggregation trees, each aggregation tree comprising one or more base chunk nodes and one or more super chunk nodes, wherein each base chunk node comprises a chunk signature and corresponding raw data, and wherein super chunk nodes correspond to child base chunk nodes and include a chunk signature; receiving a data block; dividing the data block into a plurality of base chunks, each base chunk having a degree value characterizing the occurrence probability of the base chunk; computing chunk signatures for the plurality of base chunks; applying a super chunk rule to contiguous sequences of base chunks of the plurality of base chunks to create one or more aggregation trees, wherein the super chunk rule aggregates base chunks based on the respective occurrence probabilities of the base chunks; identifying one or more nodes in the one or more created aggregation trees that match corresponding nodes of the aggregation trees in the memory; compressing the received data block based on the identified nodes; and conditionally adding the one or more created aggregation trees to the memory.

Redundancy elimination by aggregation of multiple chunks

A system for providing a dynamic portal page in a content distributed network responds to a client request by generating the dynamic portal page at a content engine. The content engine has a portal template with at least one dynamic portion. The content engine writes into the at least one dynamic portion of the portal template links to content cached at the content engine. The content engine also writes into the at least one dynamic portion of the portal template information about availability of content not yet cached at the content engine.

Method and apparatus for a dynamic web portal with content distributed network content availability and user locality

A system for reliable multicast distribution includes a primary content engine and a backup content engine sender. The primary content engine sender sends out a multicast message of content to selected content engine receivers. The sender waits for negative acknowledgments from the selected content engine receivers declaring that content was not received. If a negative acknowledgment is received, the sender resends the multicast message a predetermined number of times. If the content is still not received after the number of multicast passes is exhausted, the sender sends out unicast messages to those receivers still requesting content. If the primary sender does not respond to a negative acknowledgment, the receiver sends a second negative acknowledgment to the backup multicast sender. The backup responds with the data requested in the negative acknowledgment and so is able to begin data distribution at the point where the primary sender left off without maintaining synchronicity with the primary sender.

Method and apparatus for reliable multicast distribution

An apparatus and method for defining content distribution paths in a content distribution network integrate unicast and multicast connections. Content engines in the content distributed network are organized into channels with a master content engine maintaining specific content. The content distribution network is further organized into a distribution hierarchy based on network topology and channel definitions, first by establishing unicast paths through the content distributed network and then by integrating multicast paths into the unicast hierarchy. The further organization of the content distribution network establishes distribution trees from the channel masters to the network edges.

Method and apparatus for multicast cloud with integrated multicast and unicast channel routing in a content distribution network

Mechanisms and techniques provide a system that operates in a computerized device(s) to establish a data distribution path for content within a content distribution network by receiving a network topology definition defining at least one hierarchical interconnection of network groups. Each network group comprises at least one content engine. The system also receives a channel definition comprising a selection of a plurality of content engines that are to distribute content within the content distribution network. The plurality of content engines in the channel definition is selected from content engines within the network groups defined within the network topology definition. The system determines an assignment of at least one root content engine within the channel definition and applies a content distribution path determination technique to the network topology definition in relation to the channel definition to determine a set of content distribution paths in the content distribution network to be used for distribution of content from the root content engine(s) to the content engines defined in the channel definition.

Growing community of inventors

Sunnyvale, CA, United States of America

Dan Li