The subject matter of this application is related to the subject matter in the following application:
U.S. patent application Ser. No. 14/334,386, entitled “RECONSTRUCTABLE CONTENT OBJECTS,” by inventor Marc Mosko, filed 17 Jul. 2014 the disclosures of which are herein incorporated by reference in their entirety.
Field
The present disclosure relates generally to a content-centric network (CCN). More specifically, the present disclosure relates to a system and method for downloading a set of Content Objects using a single named stream in content-centric networks (CCNs).
Related Art
The proliferation of the Internet and e-commerce continues to fuel revolutionary changes in the network industry. Today, a significant number of information exchanges, from online movie viewing to daily news delivery, retail sales, and instant messaging, are conducted online. An increasing number of Internet applications are also becoming mobile. However, the current Internet operates on a largely location-based addressing scheme. The two most ubiquitous protocols, Internet Protocol (IP) and Ethernet protocol, are both based on end-host addresses. That is, a consumer of content can only receive the content by explicitly requesting the content from an address (e.g., IP address or Ethernet media access control (MAC) address) that is typically associated with a physical object or location. This restrictive addressing scheme is becoming progressively more inadequate for meeting the ever-changing network demands.
Recently, information-centric network (ICN) architectures have been proposed in the industry where content is directly named and addressed. Content-Centric networking (CCN), an exemplary ICN architecture brings a new approach to content transport. Instead of viewing network traffic at the application level as end-to-end conversations over which content travels, content is requested or returned based on its unique name, and the network is responsible for routing content from the provider to the consumer. Note that content includes data that can be transported in the communication system, including any form of data such as text, images, video, and/or audio. A consumer and a provider can be a person at a computer or an automated process inside or outside the CCN. A piece of content can refer to the entire content or a respective portion of the content. For example, a newspaper article might be represented by multiple pieces of content embodied as data packets. A piece of content can also be associated with metadata describing or augmenting the piece of content with information such as authentication data, creation date, content owner, etc.
In CCN, names play an important role. More specifically, Content Objects and Interests are identified by their name, which is typically a hierarchically structured variable-length identifier (HSVLI). Interests and Content Objects flow through the network based on their names. When downloading named content, which can be a file library or a web page, the requester often needs to issue an initial set of Interest messages to obtain the catalog of the library or the markup document of the web page. In the case of a web page, upon receiving the markup document, the requester needs to parse the markup document, and then start downloading embedded objects referenced by the markup document. Such a process often requires more than one round-trip time (RTT), thus adding significant latency to the content download process. This problem is similar to the download-latency problem experienced by IP networks.
In the IP world, people have not been satisfied with the performance of Hypertext Transfer Protocol (HTTP), because although very efficient at transferring individual files, HTTP cannot efficiently transfer a large number of small files. However, today's web destinations often include pages with tens of, or more, embedded objects, such as images, cascading style sheet (CSS) files, and external JavaScript files. Loading all these individual files takes time because of all the overhead of separately requesting them and waiting for the TCP (Transmission Control Protocol) sessions to probe the network capacity and ramp up their transmission speed. For example, when requesting web content using HTTP over TCP, the requester typically has to wait for a three-way TCP handshake to be completed to send a GET request before beginning to download the desired HTTP and HTML markup document. Then, after parsing the markup document, the requester can request the individual embedded objects. To reduce such download latency, certain “zero round-trip time” protocols have been developed in the IP setting, such as SPTY™ (registered trademark of Google Inc. of Menlo Park, Calif.) developed by Google. However, no such solutions exist in CCN settings.
One embodiment of the present invention provides a system for assembling a single content stream that enables downloading of a content collection using the single content stream over a network. During operation, the system obtains the content collection that includes a plurality of content components, and generates a manifest for the content collection. A respective entry in the manifest corresponds to a content component. The system assembles the single content stream by including the manifest followed by the plurality of content components. The manifest and the content components are packaged into objects under a same namespace, thereby facilitating a requester requesting one or more content components within the content collection using interests under the same namespace.
In a variation on this embodiment, the content component spans over multiple chunks within the single content stream with each chunk corresponding to a packaged object and being assigned a sequence number. The entry in the manifest specifies sequence numbers of the multiple chunks.
In a variation on this embodiment, the entry in the manifest further specifies hash values of one or more of the multiple chunks of the content component, thereby enabling the requester to determine whether a copy of the content component exists in the requester's local cache by checking the hash values.
In a variation on this embodiment, the system further receives, from the requester, a set of Interests under the same namespace; and determines, from the plurality of content components, which content component to be included in the single content stream.
In a variation on this embodiment, the network is a content-centric network, and the objects are standard CCN Content Objects.
In a further variation, at least one Content Object in the single content stream includes key information, and a respective Content Object includes a cryptographic signature associated with the key.
In a variation on this embodiment, a content component includes a second single content stream, and the second single content stream includes a second manifest.
In a variation on this embodiment, the manifest includes multiple segments, and the multiple segments of the manifest are scattered at different locations within the single content stream.
In a variation on this embodiment, assembling the single content stream further comprises placing the plurality of content components in order.
In a further variation, placing the plurality of content components in order involves one or more of: placing one or more content components that are required for rendering the content collection at beginning of the single content stream, and placing the plurality of content components in order based on their modification times.
In the figures, like reference numerals refer to the same figure elements.
Overview
Embodiments of the present invention provide a system and method for downloading a set of Content Objects using a single named stream without incurring a round-trip time for downloading the content manifest. More specifically, the system aggregates all necessary content (such as all content in a webpage) into a single named stream, known as an all-in-one stream. The all-in-one stream includes a specially constructed manifest (known as the all-in-one manifest) followed by constituent objects. The all-in-one manifest includes a set of entries, with each entry corresponding to a content component (which may span multiple Content Objects or Content Object fragments when fragmentation is enabled). An entry in the all-in-one manifest specifies the CCN base name of the content component (which can be an embedded object in a webpage or the markup document of the webpage), the list of chunk numbers occupied the content component, and the Content Object hash of each chunk (Content Object) within the content component. The entire all-in-one stream is under one chunked namespace, with all chunks having the same name prefix, so a requester of the content can open up one large Interest window to download the all-in-one manifest and all locally served content components. The all-in-one manifest has enough information such that the requester could skip specific not-yet downloaded content components if it already has them.
In general, CCN uses two types of messages: Interests and Content Objects. An Interest carries the hierarchically structured variable-length identifier (HSVLI), also called the “name” or the “CCN name” of a Content Object and serves as a request for that object. If a network element (e.g., router) receives multiple Interests for the same name, it may aggregate those Interests. A network element along the path of the Interest with a matching Content Object may cache and return that object, satisfying the Interest. The Content Object follows the reverse path of the Interest to the origin(s) of the Interest. A Content Object contains, among other information, the same HSVLI, the object's payload, and cryptographic information used to bind the HSVLI to the payload.
The terms used in the present disclosure are generally defined as follows (but their interpretation is not limited to such):
As mentioned before, an HSVLI indicates a piece of content, is hierarchically structured, and includes contiguous components ordered from a most general level to a most specific level. The length of a respective HSVLI is not fixed. In content-centric networks, unlike a conventional IP network, a packet may be identified by an HSVLI. For example, “abcd/bob/papers/ccn/news” could be the name of the content and identifies the corresponding packet(s), i.e., the “news” article from the “ccn” collection of papers for a user named “Bob” at the organization named “ABCD.” To request a piece of content, a node expresses (e.g., broadcasts) an Interest in that content by the content's name. An Interest in a piece of content can be a query for the content according to the content's name or identifier. The content, if available in the network, is sent back from any node that stores the content to the requesting node. The routing infrastructure intelligently propagates the Interest to the prospective nodes that are likely to have the information and then carries available content back along the reverse path traversed by the Interest message. Essentially the Content Object follows the breadcrumbs left by the Interest message and thus reaches the requesting node.
In accordance with an embodiment of the present invention, a consumer can generate an Interest for a piece of content and forward that Interest to a node in network 180. The piece of content can be stored at a node in network 180 by a publisher or content provider, who can be located inside or outside the network. For example, in
In network 180, any number of intermediate nodes (nodes 100-145) in the path between a content holder (node 130) and the Interest generation node (node 105) can participate in caching local copies of the content as it travels across the network. Caching reduces the network load for a second subscriber located in proximity to other subscribers by implicitly sharing access to the locally cached content.
The Manifest
In CCN, a manifest (also known as a catalog) is used to represent a collection of data. For example, a CCN node may contain a video collection that includes a large number of video files, and the manifest of the video collection can be an ordered list identifying the Content Objects corresponding to the video files. Note that, due to the size limit of a Content Object, a video file may span multiple Content Objects. Moreover, a CCN node may store content for a webpage, and the manifest for the web page identifies the different components of the webpage, such as the markup document and embedded objects (including Java scripts, image files, audio files, video files, etc.).
In the manifest, each Content Object is identified by its name and corresponding digest, where the digest is the hash value (often computed using a cryptographic hash function, such as hash function SHA-256) of the Content Object. In some embodiments, each Content Object is also identified by a modified time indicating the time that the content was modified.
In
As shown in
In conventional CCNs, when a content requester requests a content collection, such as a web page, the requester needs to issue an initial set of Interest messages to read a piece of the content.
To request JavaScript file 304 (File1.js), requester 312 sends a set of Interest messages 324. Without a priori knowledge of the size of File1.js, requester 312 may open too large a window by issuing too many Interests. In
In order to reduce the download latency and to improve throughput, in some embodiments, the system aggregates all the necessary content (including the markup document and all embedded objects) into a single named stream, and allows a requester to download all the necessary content using the single named stream, also known as an all-in-one stream. In some embodiments, this single named stream (the all-in-one stream) for a content collection includes an all-in-one manifest followed by the embedded objects. Note that, in order to facilitate downloading with the all-in-one stream, changes need to be made to a conventional manifest (as shown in
For example, in
Also shown in
Note that unlike conventional manifests, manifest 402 enumerates the chunk ranges (or offset) of each embedded object in the all-in-one stream. This allows the requester of the content to determine whether the object (content component) is already covered by the outstanding Interest window. For example, if 10 Interests have been issued, then the 10th chunk has been covered by the issued Interests. In addition, including the Content Object hash of each chunk in the manifest 402 allows the requester to determine whether it already has an object or a segment of the object in its cache by comparing the Content Object hash values. If an object is not yet covered by an outstanding request and the requestor already has the object in its cache, the requester can skip the download of that embedded object. For example, embedded JavaScript file 406 ranges from s10 to s11 in the all-in-one stream, and if an initial request issues Interests up to chunk 9, then JavaScript file 406 is not covered by the initial request. In addition, based on the Content Object hashes of JavaScript file 406, the requester may determine that it already has JavaScript file 406 in its cache. Hence, the requester can then skip the download of JavaScript file 406 while continuing to download subsequent content components within content collection 400.
Moreover, listing the Content Object hashes of each content component allows a requester to open up separate Interest windows for each individual content component and request them by their hashes. More specifically, the requester can request a particular embedded object under its own name, using a self-certified Content Object hash name. For example, the requester may request JavaScript file 406 by the hashes of its two segments, 0xD2A0 and 0x3333. In other words, in addition to enabling content download using a single all-in-one stream, the all-in-one manifest also enables a requester to download content components using a set of parallel streams that are independent of each other. Hence, instead of waiting to parse the markup document before downloading the embedded objects, the requester can download the markup document and the embedded documents in parallel. Each stream request can be based on the hash name of the embedded object. Downloading an embedded object using its own hash name also allows the download to come from some well-positioned caches, whereas downloading the embedded objects along with the markup document may result in their coming from a less optimal source. For example, image files may have very long cache lifetimes, so they can be cached in many places, while the frequently updated web page (the markup) might have a short cache lifetime and is cached in few locations. In such situations, it is desirable to download the images from a nearby cache location, instead of downloading them from the same location of the markup document, which can be far away.
The all-in-One Stream
The name component specifies the CCN name of each chunk/Content Object. In some embodiments, all Content Objects within the all-in-one stream have the same name prefix, and the CCN name of a Content Object is the name prefix plus its chunk number. In the example shown in
The key-ID component (514.x) within each Content Object identifies the public key used by the publisher to sign the Content Object. The signature component (518.x) can be obtained by signing, using the corresponding private key, the remaining portions of the Content Object. In some embodiments, the signature can be obtained by signing over the hash of the remaining portions of the Content Object. For example, one can obtain signature 518.1 by signing a hash value computed over name component 512.1, key-ID component 514.1, and payload component 516.1. Note that, in some embodiments, not all Content Objects within the all-in-one stream contain the key-ID. At a minimum, the first Content Object in the all-in-one stream should include the key-ID, or optionally carry the public key, so that intermediate nodes and end systems can verify signatures.
The payload component (516.x) for each Content Object or chunk includes either a portion of the manifest or a portion of an embedded content component, such as the markup document or a JavaScript file. The first few chunks (Content Objects) of the all-in-one stream often are wrapping objects that represent the manifest of the stream, and the payload of these wrapping objects is the manifest itself. Depending on the size of the manifest, the wrapping objects may include fewer or more Content Objects. In the example shown in
The payloads of subsequent Content Objects include portions of the content components. For example, the payloads of Content Objects 506 and 508 include embedded Content Objects /foo/markup/s0 and /foo/markup/s1, which are the first and second chunks of the markup document. Note that, although each embedded content component chunk itself may be a CCN Content Object that has its own name (such as /foo/markup/s0 in the case of the chunk being part of the markup document), the corresponding Content Object assembled in the all-in-one stream is assigned its own stream name, as indicated by name component 512.x. All Content Objects within the same all-in-one stream are assigned the same name prefix. Note that assigning the same name prefix to all Content Objects in the all-in-one stream allows a requester to open a large-enough window to download all embedded content components continuously without the need to parse the markup document. For example, the requester can construct an initial set of Interests by sequentially adding the chunk number to the name prefix, and using the initial set of Interests to request the embedded content components without needing to know the numbers, names, or sizes of those embedded content components within a content collection. For example, a requester can issue a set of Interests (/foo/page/all-in-one/s0, /foo/page/all-in-one/s1, . . . , /foo/page/all-in-one/s19) to request the first 20 chunks of the all-in-one stream. Note that while downloading the chunks, the requester can read the manifest (which is usually downloaded first) to determine whether it needs to issue more Interests and whether it can skip the download of certain components because it already has them in its cache.
During operation, requester 602 starts the downloading process by issuing an initial set of Interest messages 606 to responder 604. The number of Interests included in initial set of Interest messages 606 can be arbitrary. In some embodiments, this initial window (as defined by initial Interest set 606) can be sufficiently large to cover all wrapper objects, i.e., the manifest, but not larger than the entire content collection. In the example shown in
In addition, the requester can determine whether it already has one or more content components or chunks in its cache based on the Content Object hashes listed in the manifest, and if so, skip the download of these chunks. For example, by comparing the Content Object hashes, the requester may find that it already has JavaScript file File1.js, which occupies chunks s10 and s11 in the all-in-one stream. To improve the download efficiency, the requester can issue an Interest set that excludes Interests foo/page/all-in-one/s10 and /foo/page/all-in-one/s11. By doing so, the requester provides parameters to the responder so that the responder can configure which embedded objects to be included in the download stream. In this example, because the Interest set does not have Interests for chunks s10 and s11, these two chunks are excluded from the download stream.
In some embodiments, a responder may understand that the content stream will be rendered on a display, such as a webpage being displayed on a monitor or a movie being played, and then the responder can order the content components in the all-in-one stream to optimize the rendering. For example, to display a web page a browser needs the html file before all the images. Consequently, it is best for the responder to place the html file at the beginning of the all-in-one stream such that the browser can begin rendering the screen while transferring the images. If the content is a movie, the responder should place more important frames in front of less important frames in the all-in-one stream. In another example, if one or more content components are encrypted, the responder can place an item that describes the encryption before the encrypted content components.
Comparing
In some embodiments, an object embedded in the payload of a stream chunk may also be an all-in-one stream itself. For example, an HTML file may reference frames of other HTML files or other objects, which could themselves be organized as an all-in-one stream.
A content collection may include many embedded objects and each embedded object may span many Content Objects, such as a web page that contains a large number of high-resolution images. In such a situation, listing all embedded objects in a single manifest may result in the manifest being too big itself for efficient download. To improve manifest-download efficiency, in some embodiments, a large manifest that lists many embedded objects may be reorganized into a number of smaller manifests scattered at different locations within the all-in-one stream.
In situations where large content components (such as high-resolution images) exist, instead of listing Content Object hash values of all Content Objects in the manifest, the manifest may list only a few initial Content Object hashes of each embedded object. For example, an embedded image may span a few hundred Content Objects; instead of listing the hash values of these hundreds of Content Objects, the manifest may only list the initial few (such as 10%) hash values. These few hash values should provide enough information to allow a requester to determine whether it already has the image in its cache or to begin downloading the image, may be from a nearby location, under its own name space.
In some embodiments, a requester may be interested in changes to the content since a previoud download. In such a situation, the requester can include in the Interest messages a “modified since” parameter. When such Interests are received, the responder includes, in the all-in-one stream and/or its manifest, only embedded objects that are modified after the “modified since” parameter. This allows a requester to skip the downloading of old files, such as old photos, while downloading a web page. In a variation, the all-in-one stream can include older objects that are newly referenced. For example, if an old photo has not been included in the web page manifest in a long time, it may be included in the all-in-one stream even though it has not been modified since the “modified since” parameter specified in the Interests. Moreover, the response can also order the components in the all-in-one stream by their modification time, such that the most recently (or the least recently) modified content component comes first in the all-in-one stream.
In some embodiments, the all-in-one stream can be compressed.
The content provider further packages the constructed manifest along with the content components into standard Content Objects (operation 904). In some embodiments, the Content Objects conform to CCN standards. Note that each Content Object is assigned a stream name, and all Content Objects in the stream have the same name prefix. Subsequently, the content provider receives a set of initial Interest requests under the name space of the stream (operation 906), and in response, the content provider constructs a stream of Content Objects, starting with the manifest, based on the received Interests and parameters included in the initial Interest requests (operation 908). In some embodiments, while constructing the stream, the content provider can order the content components in a way that optimizes a system feature, such as facilitating faster rendering by the client. In further embodiments, content components that are required for the beginning of rendering, such as HTML files in the case of a webpage, are placed at the beginning of the stream, thus optimizing the rendering time. In some embodiments, the parameters included in the Interest requests may include a “modified since” parameter. In further embodiments, while constructing the stream, the content provider can place the newest (the most recently modified) content components at the beginning of the stream in order to minimize the number of chunks that need to be transferred, as the client may already has some of the older components. Note that once the requester receives the manifest, it may include, in subsequent Interests, parameters that are determined based on information included in the manifest. For example, the requester may skip one or more content components based on the hashes listed in the manifest, which may indicate that those components are in the requester's cache already.
The content provider continues to receive Interests from the requester (operation 910), determines the content components to be included in the stream based on the received Interests (operation 912), and continuously constructs the stream by including the appropriate components (operation 914).
Computer and Communication System
In some embodiments, modules 1032, 1034, and 1036 can be partially or entirely implemented in hardware and can be part of processor 1010. Further, in some embodiments, the system may not include a separate processor and memory. Instead, in addition to performing their specific tasks, modules 1032, 1034, and 1036, either separately or in concert, may be part of general- or special-purpose computation engines.
Storage 1030 stores programs to be executed by processor 1010. Specifically, storage 1030 stores a program that implements a system (application) for enabling all-in-one content download. During operation, the application program can be loaded from storage 1030 into memory 1020 and executed by processor 1010. As a result, system 1000 can perform the functions described above. System 1000 can be coupled to an optional display 1080 (which can be a touch screen display), keyboard 1060, and pointing device 1070, and can also be coupled via one or more network interfaces to network 1082.
The data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system. The computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed.
The methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a computer-readable storage medium as described above. When a computer system reads and executes the code and/or data stored on the computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the computer-readable storage medium.
Furthermore, methods and processes described herein can be included in hardware modules or apparatus. These modules or apparatus may include, but are not limited to, an application-specific integrated circuit (ASIC) chip, a field-programmable gate array (FPGA), a dedicated or shared processor that executes a particular software module or a piece of code at a particular time, and/or other programmable-logic devices now known or later developed. When the hardware modules or apparatus are activated, they perform the methods and processes included within them.
The above description is presented to enable any person skilled in the art to make and use the embodiments, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.
Number | Name | Date | Kind |
---|---|---|---|
817441 | Niesz | Apr 1906 | A |
4309569 | Merkle | Jan 1982 | A |
4921898 | Lenney | May 1990 | A |
5070134 | Oyamada | Dec 1991 | A |
5110856 | Oyamada | May 1992 | A |
5214702 | Fischer | May 1993 | A |
5377354 | Scannell | Dec 1994 | A |
5506844 | Rao | Apr 1996 | A |
5629370 | Freidzon | May 1997 | A |
5845207 | Amin | Dec 1998 | A |
5870605 | Bracho | Feb 1999 | A |
6047331 | Medard | Apr 2000 | A |
6052683 | Irwin | Apr 2000 | A |
6085320 | Kaliski, Jr. | Jul 2000 | A |
6091724 | Chandra | Jul 2000 | A |
6128623 | Mattis | Oct 2000 | A |
6128627 | Mattis | Oct 2000 | A |
6173364 | Zenchelsky | Jan 2001 | B1 |
6209003 | Mattis | Mar 2001 | B1 |
6226618 | Downs | May 2001 | B1 |
6233617 | Rothwein | May 2001 | B1 |
6233646 | Hahm | May 2001 | B1 |
6289358 | Mattis | Sep 2001 | B1 |
6292880 | Mattis | Sep 2001 | B1 |
6332158 | Risley | Dec 2001 | B1 |
6363067 | Chung | Mar 2002 | B1 |
6366988 | Skiba | Apr 2002 | B1 |
6574377 | Cahill | Jun 2003 | B1 |
6654792 | Verma | Nov 2003 | B1 |
6667957 | Corson | Dec 2003 | B1 |
6681220 | Kaplan | Jan 2004 | B1 |
6681326 | Son | Jan 2004 | B2 |
6732273 | Byers | May 2004 | B1 |
6769066 | Botros | Jul 2004 | B1 |
6772333 | Brendel | Aug 2004 | B1 |
6775258 | vanValkenburg | Aug 2004 | B1 |
6862280 | Bertagna | Mar 2005 | B1 |
6901452 | Bertagna | May 2005 | B1 |
6915307 | Mattis | Jul 2005 | B1 |
6917985 | Madruga | Jul 2005 | B2 |
6957228 | Graser | Oct 2005 | B1 |
6968393 | Chen | Nov 2005 | B1 |
6981029 | Menditto | Dec 2005 | B1 |
7007024 | Zelenka | Feb 2006 | B2 |
7013389 | Srivastava | Mar 2006 | B1 |
7031308 | Garcia-Luna-Aceves | Apr 2006 | B2 |
7043637 | Bolosky | May 2006 | B2 |
7061877 | Gummalla | Jun 2006 | B1 |
7080073 | Jiang | Jul 2006 | B1 |
RE39360 | Aziz | Oct 2006 | E |
7149750 | Chadwick | Dec 2006 | B2 |
7152094 | Jannu | Dec 2006 | B1 |
7177646 | ONeill | Feb 2007 | B2 |
7206860 | Murakami | Apr 2007 | B2 |
7206861 | Callon | Apr 2007 | B1 |
7210326 | Kawamoto | May 2007 | B2 |
7246159 | Aggarwal | Jul 2007 | B2 |
7257837 | Xu | Aug 2007 | B2 |
7287275 | Moskowitz | Oct 2007 | B2 |
7315541 | Housel | Jan 2008 | B1 |
7339929 | Zelig | Mar 2008 | B2 |
7350229 | Lander | Mar 2008 | B1 |
7362727 | ONeill | Apr 2008 | B1 |
7382787 | Barnes | Jun 2008 | B1 |
7395507 | Robarts | Jul 2008 | B2 |
7430755 | Hughes | Sep 2008 | B1 |
7444251 | Nikovski | Oct 2008 | B2 |
7466703 | Arunachalam | Dec 2008 | B1 |
7472422 | Agbabian | Dec 2008 | B1 |
7496668 | Hawkinson | Feb 2009 | B2 |
7509425 | Rosenberg | Mar 2009 | B1 |
7523016 | Surdulescu | Apr 2009 | B1 |
7542471 | Samuels | Jun 2009 | B2 |
7543064 | Juncker | Jun 2009 | B2 |
7552233 | Raju | Jun 2009 | B2 |
7555482 | Korkus | Jun 2009 | B2 |
7555563 | Ott | Jun 2009 | B2 |
7564812 | Elliott | Jul 2009 | B1 |
7567547 | Mosko | Jul 2009 | B2 |
7567946 | Andreoli | Jul 2009 | B2 |
7580971 | Gollapudi | Aug 2009 | B1 |
7623535 | Guichard | Nov 2009 | B2 |
7636767 | Lev-Ran | Dec 2009 | B2 |
7647507 | Feng | Jan 2010 | B1 |
7660324 | Oguchi | Feb 2010 | B2 |
7685290 | Satapati | Mar 2010 | B2 |
7698463 | Ogier | Apr 2010 | B2 |
7698559 | Chaudhury | Apr 2010 | B1 |
7769887 | Bhattacharyya | Aug 2010 | B1 |
7779467 | Choi | Aug 2010 | B2 |
7801069 | Cheung | Sep 2010 | B2 |
7801177 | Luss | Sep 2010 | B2 |
7816441 | Elizalde | Oct 2010 | B2 |
7831733 | Sultan | Nov 2010 | B2 |
7873619 | Faibish | Jan 2011 | B1 |
7908337 | Garcia-Luna-Aceves | Mar 2011 | B2 |
7924837 | Shabtay | Apr 2011 | B1 |
7953014 | Toda | May 2011 | B2 |
7953116 | Cohn | May 2011 | B2 |
7953885 | Devireddy | May 2011 | B1 |
7979912 | Roka | Jul 2011 | B1 |
8000267 | Solis | Aug 2011 | B2 |
8010691 | Kollmansberger | Aug 2011 | B2 |
8069023 | Frailong | Nov 2011 | B1 |
8074289 | Carpentier | Dec 2011 | B1 |
8117441 | Kurien | Feb 2012 | B2 |
8160069 | Jacobson | Apr 2012 | B2 |
8204060 | Jacobson | Jun 2012 | B2 |
8214364 | Bigus | Jul 2012 | B2 |
8224985 | Takeda | Jul 2012 | B2 |
8225057 | Zheng | Jul 2012 | B1 |
8271578 | Sheffi | Sep 2012 | B2 |
8271687 | Turner | Sep 2012 | B2 |
8312064 | Gauvin | Nov 2012 | B1 |
8332357 | Chung | Dec 2012 | B1 |
8386622 | Jacobson | Feb 2013 | B2 |
8447851 | Anderson | May 2013 | B1 |
8462781 | McGhee | Jun 2013 | B2 |
8467297 | Liu | Jun 2013 | B2 |
8473633 | Eardley | Jun 2013 | B2 |
8553562 | Allan | Oct 2013 | B2 |
8572214 | Garcia-Luna-Aceves | Oct 2013 | B2 |
8654649 | Vasseur | Feb 2014 | B2 |
8665757 | Kling | Mar 2014 | B2 |
8667172 | Ravindran | Mar 2014 | B2 |
8677451 | Bhimaraju | Mar 2014 | B1 |
8688619 | Ezick | Apr 2014 | B1 |
8699350 | Kumar | Apr 2014 | B1 |
8718055 | Vasseur | May 2014 | B2 |
8750820 | Allan | Jun 2014 | B2 |
8761022 | Chiabaut | Jun 2014 | B2 |
8762477 | Xie | Jun 2014 | B2 |
8762564 | Philpott | Jun 2014 | B1 |
8762570 | Qian | Jun 2014 | B2 |
8762707 | Killian | Jun 2014 | B2 |
8767627 | Ezure | Jul 2014 | B2 |
8817594 | Gero | Aug 2014 | B2 |
8826381 | Kim | Sep 2014 | B2 |
8832302 | Bradford | Sep 2014 | B1 |
8836536 | Marwah | Sep 2014 | B2 |
8861356 | Kozat | Oct 2014 | B2 |
8862774 | Vasseur | Oct 2014 | B2 |
8868779 | ONeill | Oct 2014 | B2 |
8874842 | Kimmel | Oct 2014 | B1 |
8880682 | Bishop | Nov 2014 | B2 |
8903756 | Zhao | Dec 2014 | B2 |
8923293 | Jacobson | Dec 2014 | B2 |
8934496 | Vasseur | Jan 2015 | B2 |
8937865 | Kumar | Jan 2015 | B1 |
8972969 | Gaither | Mar 2015 | B2 |
8977596 | Montulli | Mar 2015 | B2 |
9002921 | Westphal | Apr 2015 | B2 |
9032095 | Traina | May 2015 | B1 |
9071498 | Beser | Jun 2015 | B2 |
9112895 | Lin | Aug 2015 | B1 |
9137152 | Xie | Sep 2015 | B2 |
9253087 | Zhang | Feb 2016 | B2 |
9270598 | Oran | Feb 2016 | B1 |
9280610 | Gruber | Mar 2016 | B2 |
9432431 | O'Malley | Aug 2016 | B2 |
20020002680 | Carbajal | Jan 2002 | A1 |
20020010795 | Brown | Jan 2002 | A1 |
20020038296 | Margolus | Mar 2002 | A1 |
20020048269 | Hong | Apr 2002 | A1 |
20020054593 | Morohashi | May 2002 | A1 |
20020077988 | Sasaki | Jun 2002 | A1 |
20020078066 | Robinson | Jun 2002 | A1 |
20020138551 | Erickson | Sep 2002 | A1 |
20020152305 | Jackson | Oct 2002 | A1 |
20020176404 | Girard | Nov 2002 | A1 |
20020188605 | Adya | Dec 2002 | A1 |
20020199014 | Yang | Dec 2002 | A1 |
20030004621 | Bousquet | Jan 2003 | A1 |
20030009365 | Tynan | Jan 2003 | A1 |
20030033394 | Stine | Feb 2003 | A1 |
20030046396 | Richter | Mar 2003 | A1 |
20030046421 | Horvitz et al. | Mar 2003 | A1 |
20030046437 | Eytchison | Mar 2003 | A1 |
20030048793 | Pochon | Mar 2003 | A1 |
20030051100 | Patel | Mar 2003 | A1 |
20030061384 | Nakatani | Mar 2003 | A1 |
20030074472 | Lucco | Apr 2003 | A1 |
20030088696 | McCanne | May 2003 | A1 |
20030097447 | Johnston | May 2003 | A1 |
20030099237 | Mitra | May 2003 | A1 |
20030140257 | Peterka | Jul 2003 | A1 |
20030229892 | Sardera | Dec 2003 | A1 |
20040024879 | Dingman | Feb 2004 | A1 |
20040030602 | Rosenquist | Feb 2004 | A1 |
20040064737 | Milliken | Apr 2004 | A1 |
20040071140 | Jason | Apr 2004 | A1 |
20040073617 | Milliken | Apr 2004 | A1 |
20040073715 | Folkes | Apr 2004 | A1 |
20040139230 | Kim | Jul 2004 | A1 |
20040196783 | Shinomiya | Oct 2004 | A1 |
20040218548 | Kennedy | Nov 2004 | A1 |
20040221047 | Grover | Nov 2004 | A1 |
20040225627 | Botros | Nov 2004 | A1 |
20040233916 | Takeuchi | Nov 2004 | A1 |
20040246902 | Weinstein | Dec 2004 | A1 |
20040252683 | Kennedy | Dec 2004 | A1 |
20050003832 | Osafune | Jan 2005 | A1 |
20050028156 | Hammond | Feb 2005 | A1 |
20050043060 | Brandenberg | Feb 2005 | A1 |
20050050211 | Kaul | Mar 2005 | A1 |
20050074001 | Mattes | Apr 2005 | A1 |
20050132207 | Mourad | Jun 2005 | A1 |
20050149508 | Deshpande | Jul 2005 | A1 |
20050159823 | Hayes | Jul 2005 | A1 |
20050198351 | Nog | Sep 2005 | A1 |
20050249196 | Ansari | Nov 2005 | A1 |
20050259637 | Chu | Nov 2005 | A1 |
20050262217 | Nonaka | Nov 2005 | A1 |
20050281288 | Banerjee | Dec 2005 | A1 |
20050286535 | Shrum | Dec 2005 | A1 |
20050289222 | Sahim | Dec 2005 | A1 |
20060010249 | Sabesan | Jan 2006 | A1 |
20060029102 | Abe | Feb 2006 | A1 |
20060039379 | Abe | Feb 2006 | A1 |
20060051055 | Ohkawa | Mar 2006 | A1 |
20060072523 | Richardson | Apr 2006 | A1 |
20060099973 | Nair | May 2006 | A1 |
20060129514 | Watanabe | Jun 2006 | A1 |
20060133343 | Huang | Jun 2006 | A1 |
20060146686 | Kim | Jul 2006 | A1 |
20060173831 | Basso | Aug 2006 | A1 |
20060193295 | White | Aug 2006 | A1 |
20060203804 | Whitmore | Sep 2006 | A1 |
20060206445 | Andreoli | Sep 2006 | A1 |
20060215684 | Capone | Sep 2006 | A1 |
20060223504 | Ishak | Oct 2006 | A1 |
20060242155 | Moore | Oct 2006 | A1 |
20060256767 | Suzuki | Nov 2006 | A1 |
20060268667 | Jellison, Jr. | Nov 2006 | A1 |
20060268792 | Belcea | Nov 2006 | A1 |
20070019619 | Foster | Jan 2007 | A1 |
20070073888 | Madhok | Mar 2007 | A1 |
20070094265 | Korkus | Apr 2007 | A1 |
20070112880 | Yang | May 2007 | A1 |
20070124412 | Narayanaswami | May 2007 | A1 |
20070127457 | Mirtorabi | Jun 2007 | A1 |
20070160062 | Morishita | Jul 2007 | A1 |
20070162394 | Zager | Jul 2007 | A1 |
20070171828 | Dalal | Jul 2007 | A1 |
20070189284 | Kecskemeti | Aug 2007 | A1 |
20070195765 | Heissenbuttel | Aug 2007 | A1 |
20070204011 | Shaver | Aug 2007 | A1 |
20070209067 | Fogel | Sep 2007 | A1 |
20070239892 | Ott | Oct 2007 | A1 |
20070240207 | Belakhdar | Oct 2007 | A1 |
20070245034 | Retana | Oct 2007 | A1 |
20070253418 | Shiri | Nov 2007 | A1 |
20070255677 | Alexander | Nov 2007 | A1 |
20070255699 | Sreenivas | Nov 2007 | A1 |
20070255781 | Li | Nov 2007 | A1 |
20070274504 | Maes | Nov 2007 | A1 |
20070275701 | Jonker | Nov 2007 | A1 |
20070276907 | Maes | Nov 2007 | A1 |
20070283158 | Danseglio | Dec 2007 | A1 |
20070294187 | Scherrer | Dec 2007 | A1 |
20080005056 | Stelzig | Jan 2008 | A1 |
20080005223 | Flake | Jan 2008 | A1 |
20080010366 | Duggan | Jan 2008 | A1 |
20080037420 | Tang | Feb 2008 | A1 |
20080043989 | Furutono | Feb 2008 | A1 |
20080046340 | Brown | Feb 2008 | A1 |
20080059631 | Bergstrom | Mar 2008 | A1 |
20080080440 | Yarvis | Apr 2008 | A1 |
20080082662 | Dandliker | Apr 2008 | A1 |
20080095159 | Suzuki | Apr 2008 | A1 |
20080101357 | Iovanna | May 2008 | A1 |
20080107034 | Jetcheva | May 2008 | A1 |
20080107259 | Satou | May 2008 | A1 |
20080123862 | Rowley | May 2008 | A1 |
20080133583 | Artan | Jun 2008 | A1 |
20080133755 | Pollack | Jun 2008 | A1 |
20080151755 | Nishioka | Jun 2008 | A1 |
20080159271 | Kutt | Jul 2008 | A1 |
20080165775 | Das | Jul 2008 | A1 |
20080186901 | Itagaki | Aug 2008 | A1 |
20080200153 | Fitzpatrick | Aug 2008 | A1 |
20080215669 | Gaddy | Sep 2008 | A1 |
20080216086 | Tanaka | Sep 2008 | A1 |
20080243992 | Jardetzky | Oct 2008 | A1 |
20080250006 | Dettinger | Oct 2008 | A1 |
20080256138 | Sim-Tang | Oct 2008 | A1 |
20080256359 | Kahn | Oct 2008 | A1 |
20080270618 | Rosenberg | Oct 2008 | A1 |
20080271143 | Stephens | Oct 2008 | A1 |
20080287142 | Keighran | Nov 2008 | A1 |
20080288580 | Wang | Nov 2008 | A1 |
20080291923 | Back | Nov 2008 | A1 |
20080298376 | Takeda | Dec 2008 | A1 |
20080320148 | Capuozzo | Dec 2008 | A1 |
20090006659 | Collins | Jan 2009 | A1 |
20090013324 | Gobara | Jan 2009 | A1 |
20090022154 | Kiribe | Jan 2009 | A1 |
20090024641 | Quigley | Jan 2009 | A1 |
20090030978 | Johnson | Jan 2009 | A1 |
20090037763 | Adhya | Feb 2009 | A1 |
20090052660 | Chen | Feb 2009 | A1 |
20090067429 | Nagai | Mar 2009 | A1 |
20090077184 | Brewer | Mar 2009 | A1 |
20090092043 | Lapuh | Apr 2009 | A1 |
20090097631 | Gisby | Apr 2009 | A1 |
20090103515 | Pointer | Apr 2009 | A1 |
20090113068 | Fujihira | Apr 2009 | A1 |
20090116393 | Hughes | May 2009 | A1 |
20090117922 | Bell | May 2009 | A1 |
20090132662 | Sheridan | May 2009 | A1 |
20090135728 | Shen | May 2009 | A1 |
20090144300 | Chatley | Jun 2009 | A1 |
20090157887 | Froment | Jun 2009 | A1 |
20090185745 | Momosaki | Jul 2009 | A1 |
20090193101 | Munetsugu | Jul 2009 | A1 |
20090198832 | Shah | Aug 2009 | A1 |
20090222344 | Greene | Sep 2009 | A1 |
20090228593 | Takeda | Sep 2009 | A1 |
20090254572 | Redlich | Oct 2009 | A1 |
20090268905 | Matsushima | Oct 2009 | A1 |
20090274158 | Sharp | Nov 2009 | A1 |
20090276396 | Gorman | Nov 2009 | A1 |
20090285209 | Stewart | Nov 2009 | A1 |
20090287835 | Jacobson | Nov 2009 | A1 |
20090287853 | Carson | Nov 2009 | A1 |
20090288076 | Johnson | Nov 2009 | A1 |
20090288143 | Stebila | Nov 2009 | A1 |
20090288163 | Jacobson | Nov 2009 | A1 |
20090292743 | Bigus | Nov 2009 | A1 |
20090293121 | Bigus | Nov 2009 | A1 |
20090296719 | Maier | Dec 2009 | A1 |
20090300079 | Shitomi | Dec 2009 | A1 |
20090300407 | Kamath | Dec 2009 | A1 |
20090300512 | Ahn | Dec 2009 | A1 |
20090307333 | Welingkar | Dec 2009 | A1 |
20090323632 | Nix | Dec 2009 | A1 |
20100005061 | Basco | Jan 2010 | A1 |
20100027539 | Beverly | Feb 2010 | A1 |
20100046546 | Ram | Feb 2010 | A1 |
20100057929 | Merat | Mar 2010 | A1 |
20100058346 | Narang | Mar 2010 | A1 |
20100088370 | Wu | Apr 2010 | A1 |
20100094767 | Miltonberger | Apr 2010 | A1 |
20100094876 | Huang | Apr 2010 | A1 |
20100098093 | Ejzak | Apr 2010 | A1 |
20100100465 | Cooke | Apr 2010 | A1 |
20100103870 | Garcia-Luna-Aceves | Apr 2010 | A1 |
20100124191 | Vos | May 2010 | A1 |
20100125911 | Bhaskaran | May 2010 | A1 |
20100131660 | Dec | May 2010 | A1 |
20100150155 | Napierala | Jun 2010 | A1 |
20100165976 | Khan | Jul 2010 | A1 |
20100169478 | Saha | Jul 2010 | A1 |
20100169503 | Kollmansberger | Jul 2010 | A1 |
20100180332 | Ben-Yochanan | Jul 2010 | A1 |
20100182995 | Hwang | Jul 2010 | A1 |
20100185753 | Liu | Jul 2010 | A1 |
20100195653 | Jacobson | Aug 2010 | A1 |
20100195654 | Jacobson | Aug 2010 | A1 |
20100195655 | Jacobson | Aug 2010 | A1 |
20100217874 | Anantharaman | Aug 2010 | A1 |
20100217985 | Fahrny | Aug 2010 | A1 |
20100232402 | Przybysz | Sep 2010 | A1 |
20100232439 | Dham | Sep 2010 | A1 |
20100235516 | Nakamura | Sep 2010 | A1 |
20100246549 | Zhang | Sep 2010 | A1 |
20100250497 | Redlich | Sep 2010 | A1 |
20100250939 | Adams | Sep 2010 | A1 |
20100257149 | Cognigni | Oct 2010 | A1 |
20100268782 | Zombek | Oct 2010 | A1 |
20100272107 | Papp | Oct 2010 | A1 |
20100281263 | Ugawa | Nov 2010 | A1 |
20100284309 | Allan | Nov 2010 | A1 |
20100284404 | Gopinath | Nov 2010 | A1 |
20100293293 | Beser | Nov 2010 | A1 |
20100322249 | Thathapudi | Dec 2010 | A1 |
20110013637 | Xue | Jan 2011 | A1 |
20110019674 | Iovanna | Jan 2011 | A1 |
20110022812 | vanderLinden | Jan 2011 | A1 |
20110029952 | Harrington | Feb 2011 | A1 |
20110055392 | Shen | Mar 2011 | A1 |
20110055921 | Narayanaswamy | Mar 2011 | A1 |
20110060716 | Forman | Mar 2011 | A1 |
20110060717 | Forman | Mar 2011 | A1 |
20110090908 | Jacobson | Apr 2011 | A1 |
20110106755 | Hao | May 2011 | A1 |
20110131308 | Eriksson | Jun 2011 | A1 |
20110137919 | Ryu | Jun 2011 | A1 |
20110145597 | Yamaguchi | Jun 2011 | A1 |
20110145858 | Philpott | Jun 2011 | A1 |
20110149858 | Hwang | Jun 2011 | A1 |
20110153840 | Narayana | Jun 2011 | A1 |
20110158122 | Murphy | Jun 2011 | A1 |
20110161408 | Kim | Jun 2011 | A1 |
20110202609 | Chaturvedi | Aug 2011 | A1 |
20110219093 | Ragunathan | Sep 2011 | A1 |
20110219427 | Hito | Sep 2011 | A1 |
20110219727 | May | Sep 2011 | A1 |
20110225293 | Rathod | Sep 2011 | A1 |
20110231578 | Nagappan | Sep 2011 | A1 |
20110239256 | Gholmieh | Sep 2011 | A1 |
20110258049 | Ramer | Oct 2011 | A1 |
20110264824 | Venkata Subramanian | Oct 2011 | A1 |
20110265159 | Ronda | Oct 2011 | A1 |
20110265174 | Thornton | Oct 2011 | A1 |
20110271007 | Wang | Nov 2011 | A1 |
20110280214 | Lee | Nov 2011 | A1 |
20110286457 | Ee | Nov 2011 | A1 |
20110286459 | Rembarz | Nov 2011 | A1 |
20110295783 | Zhao | Dec 2011 | A1 |
20110299454 | Krishnaswamy | Dec 2011 | A1 |
20120011170 | Elad | Jan 2012 | A1 |
20120011551 | Levy | Jan 2012 | A1 |
20120023113 | Ferren | Jan 2012 | A1 |
20120036180 | Thornton | Feb 2012 | A1 |
20120045064 | Rembarz | Feb 2012 | A1 |
20120047361 | Erdmann | Feb 2012 | A1 |
20120066727 | Nozoe | Mar 2012 | A1 |
20120106339 | Mishra | May 2012 | A1 |
20120110159 | Richardson | May 2012 | A1 |
20120114313 | Phillips | May 2012 | A1 |
20120120803 | Farkas | May 2012 | A1 |
20120127994 | Ko | May 2012 | A1 |
20120136676 | Goodall | May 2012 | A1 |
20120136936 | Quintuna | May 2012 | A1 |
20120136945 | Lee | May 2012 | A1 |
20120137367 | Dupont | May 2012 | A1 |
20120141093 | Yamaguchi | Jun 2012 | A1 |
20120155464 | Kim | Jun 2012 | A1 |
20120158973 | Jacobson | Jun 2012 | A1 |
20120163373 | Lo | Jun 2012 | A1 |
20120166433 | Tseng | Jun 2012 | A1 |
20120170913 | Isozaki | Jul 2012 | A1 |
20120179653 | Araki | Jul 2012 | A1 |
20120197690 | Agulnek | Aug 2012 | A1 |
20120198048 | Ioffe | Aug 2012 | A1 |
20120198492 | Dhruv | Aug 2012 | A1 |
20120221150 | Arensmeier | Aug 2012 | A1 |
20120224487 | Hui | Sep 2012 | A1 |
20120226902 | Kim | Sep 2012 | A1 |
20120257500 | Lynch | Oct 2012 | A1 |
20120284791 | Miller | Nov 2012 | A1 |
20120290669 | Parks | Nov 2012 | A1 |
20120290919 | Melnyk | Nov 2012 | A1 |
20120291102 | Cohen | Nov 2012 | A1 |
20120300669 | Zahavi | Nov 2012 | A1 |
20120307629 | Vasseur | Dec 2012 | A1 |
20120314580 | Hong | Dec 2012 | A1 |
20120317307 | Ravindran | Dec 2012 | A1 |
20120322422 | Frecks | Dec 2012 | A1 |
20120323933 | He | Dec 2012 | A1 |
20120331112 | Chatani | Dec 2012 | A1 |
20130024560 | Vasseur | Jan 2013 | A1 |
20130041982 | Shi | Feb 2013 | A1 |
20130051392 | Filsfils | Feb 2013 | A1 |
20130054971 | Yamaguchi | Feb 2013 | A1 |
20130060962 | Wang | Mar 2013 | A1 |
20130061084 | Barton | Mar 2013 | A1 |
20130066823 | Sweeney | Mar 2013 | A1 |
20130073552 | Rangwala | Mar 2013 | A1 |
20130073882 | Inbaraj | Mar 2013 | A1 |
20130074155 | Huh | Mar 2013 | A1 |
20130090942 | Robinson | Apr 2013 | A1 |
20130091539 | Khurana | Apr 2013 | A1 |
20130110987 | Kim | May 2013 | A1 |
20130111063 | Lee | May 2013 | A1 |
20130128786 | Sultan | May 2013 | A1 |
20130132719 | Kobayashi | May 2013 | A1 |
20130139245 | Thomas | May 2013 | A1 |
20130151584 | Westphal | Jun 2013 | A1 |
20130151646 | Chidambaram | Jun 2013 | A1 |
20130152070 | Bhullar | Jun 2013 | A1 |
20130163426 | Beliveau | Jun 2013 | A1 |
20130166668 | Byun | Jun 2013 | A1 |
20130173822 | Hong | Jul 2013 | A1 |
20130182568 | Lee | Jul 2013 | A1 |
20130182931 | Fan | Jul 2013 | A1 |
20130185406 | Choi | Jul 2013 | A1 |
20130191412 | Kitamura | Jul 2013 | A1 |
20130197698 | Shah | Aug 2013 | A1 |
20130198119 | Eberhardt, III | Aug 2013 | A1 |
20130212185 | Pasquero | Aug 2013 | A1 |
20130219038 | Lee | Aug 2013 | A1 |
20130219081 | Qian | Aug 2013 | A1 |
20130219478 | Mahamuni | Aug 2013 | A1 |
20130223237 | Hui | Aug 2013 | A1 |
20130227048 | Xie | Aug 2013 | A1 |
20130227114 | Vasseur | Aug 2013 | A1 |
20130227166 | Ravindran | Aug 2013 | A1 |
20130242996 | Varvello | Sep 2013 | A1 |
20130250809 | Hui | Sep 2013 | A1 |
20130262365 | Dolbear | Oct 2013 | A1 |
20130262698 | Schwan | Oct 2013 | A1 |
20130282854 | Jang | Oct 2013 | A1 |
20130282860 | Zhang | Oct 2013 | A1 |
20130282920 | Zhang | Oct 2013 | A1 |
20130304758 | Gruber | Nov 2013 | A1 |
20130304937 | Lee | Nov 2013 | A1 |
20130325888 | Oneppo | Dec 2013 | A1 |
20130329696 | Xu | Dec 2013 | A1 |
20130332971 | Fisher | Dec 2013 | A1 |
20130336103 | Vasseur | Dec 2013 | A1 |
20130336323 | Srinivasan | Dec 2013 | A1 |
20130339481 | Hong | Dec 2013 | A1 |
20130343408 | Cook | Dec 2013 | A1 |
20140003232 | Guichard | Jan 2014 | A1 |
20140003424 | Matsuhira | Jan 2014 | A1 |
20140006354 | Parkison | Jan 2014 | A1 |
20140006565 | Muscariello | Jan 2014 | A1 |
20140029445 | Hui | Jan 2014 | A1 |
20140032714 | Liu | Jan 2014 | A1 |
20140033193 | Palaniappan | Jan 2014 | A1 |
20140040505 | Barton | Feb 2014 | A1 |
20140040628 | Fort | Feb 2014 | A1 |
20140043987 | Watve | Feb 2014 | A1 |
20140047513 | vantNoordende | Feb 2014 | A1 |
20140074730 | Arensmeier | Mar 2014 | A1 |
20140075567 | Raleigh | Mar 2014 | A1 |
20140082135 | Jung | Mar 2014 | A1 |
20140082661 | Krahnstoever | Mar 2014 | A1 |
20140089454 | Jeon | Mar 2014 | A1 |
20140096249 | Dupont | Apr 2014 | A1 |
20140098685 | Shattil | Apr 2014 | A1 |
20140108313 | Heidasch | Apr 2014 | A1 |
20140108474 | David | Apr 2014 | A1 |
20140115037 | Liu | Apr 2014 | A1 |
20140122587 | Petker et al. | May 2014 | A1 |
20140129736 | Yu | May 2014 | A1 |
20140136814 | Stark | May 2014 | A1 |
20140140348 | Perlman | May 2014 | A1 |
20140143370 | Vilenski | May 2014 | A1 |
20140146819 | Bae | May 2014 | A1 |
20140149733 | Kim | May 2014 | A1 |
20140156396 | deKozan | Jun 2014 | A1 |
20140165207 | Engel | Jun 2014 | A1 |
20140172783 | Suzuki | Jun 2014 | A1 |
20140172981 | Kim | Jun 2014 | A1 |
20140173034 | Liu | Jun 2014 | A1 |
20140173076 | Ravindran | Jun 2014 | A1 |
20140181140 | Kim | Jun 2014 | A1 |
20140192677 | Chew | Jul 2014 | A1 |
20140192717 | Liu | Jul 2014 | A1 |
20140195328 | Ferens | Jul 2014 | A1 |
20140195641 | Wang | Jul 2014 | A1 |
20140195666 | Dumitriu | Jul 2014 | A1 |
20140204945 | Byun | Jul 2014 | A1 |
20140214942 | Ozonat | Jul 2014 | A1 |
20140233575 | Xie | Aug 2014 | A1 |
20140237085 | Park | Aug 2014 | A1 |
20140237095 | Bevilacqua-Linn | Aug 2014 | A1 |
20140245359 | DeFoy | Aug 2014 | A1 |
20140254595 | Luo | Sep 2014 | A1 |
20140280823 | Varvello | Sep 2014 | A1 |
20140281489 | Peterka | Sep 2014 | A1 |
20140281505 | Zhang | Sep 2014 | A1 |
20140282816 | Xie | Sep 2014 | A1 |
20140289325 | Solis | Sep 2014 | A1 |
20140289790 | Wilson | Sep 2014 | A1 |
20140298248 | Kang | Oct 2014 | A1 |
20140314093 | You | Oct 2014 | A1 |
20140337276 | Iordanov | Nov 2014 | A1 |
20140365550 | Jang | Dec 2014 | A1 |
20150006896 | Franck | Jan 2015 | A1 |
20150018770 | Baran | Jan 2015 | A1 |
20150032892 | Narayanan | Jan 2015 | A1 |
20150033365 | Mellor | Jan 2015 | A1 |
20150039890 | Khosravi | Feb 2015 | A1 |
20150063802 | Bahadur | Mar 2015 | A1 |
20150089081 | Thubert | Mar 2015 | A1 |
20150095481 | Ohnishi | Apr 2015 | A1 |
20150095514 | Yu | Apr 2015 | A1 |
20150120663 | LeScouarnec | Apr 2015 | A1 |
20150169758 | Assom | Jun 2015 | A1 |
20150188770 | Naiksatam | Jul 2015 | A1 |
20150195149 | Vasseur | Jul 2015 | A1 |
20150207633 | Ravindran | Jul 2015 | A1 |
20150207864 | Wilson | Jul 2015 | A1 |
20150279348 | Cao | Oct 2015 | A1 |
20150288755 | Mosko | Oct 2015 | A1 |
20150312300 | Mosko | Oct 2015 | A1 |
20150349961 | Mosko | Dec 2015 | A1 |
20150372903 | Hui | Dec 2015 | A1 |
20150381546 | Mahadevan | Dec 2015 | A1 |
20160019275 | Mosko | Jan 2016 | A1 |
20160021172 | Mahadevan | Jan 2016 | A1 |
20160062840 | Scott | Mar 2016 | A1 |
20160110466 | Uzun | Apr 2016 | A1 |
20160171184 | Solis | Jun 2016 | A1 |
Number | Date | Country |
---|---|---|
103873371 | Jun 2014 | CN |
1720277 | Jun 1967 | DE |
19620817 | Nov 1997 | DE |
0295727 | Dec 1988 | EP |
0757065 | Jul 1996 | EP |
1077422 | Feb 2001 | EP |
1383265 | Jan 2004 | EP |
1384729 | Jan 2004 | EP |
1473889 | Nov 2004 | EP |
2120402 | Nov 2009 | EP |
2120419 | Nov 2009 | EP |
2120419 | Nov 2009 | EP |
2124415 | Nov 2009 | EP |
2214357 | Aug 2010 | EP |
2299754 | Mar 2011 | EP |
2323346 | May 2011 | EP |
2552083 | Jan 2013 | EP |
2214356 | May 2016 | EP |
03005288 | Jan 2003 | WO |
03042254 | May 2003 | WO |
03049369 | Jun 2003 | WO |
03091297 | Nov 2003 | WO |
2007113180 | Oct 2007 | WO |
2007122620 | Nov 2007 | WO |
2007144388 | Dec 2007 | WO |
2011049890 | Apr 2011 | WO |
2012077073 | Jun 2012 | WO |
2013123410 | Aug 2013 | WO |
2015084327 | Jun 2015 | WO |
Entry |
---|
Amadeo et al. “Design and Analysis of a Transport-Level Solution for Content-Centric VANETs”, University “Mediterranea” of Reggio Calabria, Jun. 15, 2013. |
Priya Mahadevan: “CCNx 1.0 Tutorial”, Mar. 16, 2014, pp. 1-11, Retrieved from the Internet: http://www.ccnx.org/pubs/hhg/1.2%20CCNx%201.0%20Tutorial.pdf [retrieved on Jun. 8, 2016] *paragraphs [003]-[006], [0011], 100131* *figures 1,2*. |
Cesar Ghali et al. “Elements of Trust in Named-Data Networking”, Feb. 13, 2014 Retrieved from the internet Jun. 17, 2016 http://arxiv.org/pdf/1402.3332v5.pdf *p. 5, col. 1* *p. 2, col. 1-2* * Section 4.1; p. 4, col. 2* *Section 4.2; p. 4, col. 2*. |
Jacobson, Van et al. ‘VoCCN: Voice Over Content-Centric Networks.’ Dec. 1, 2009. ACM ReArch'09. |
Rosenberg, J. “Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, Apr. 2010, pp. 1-117. |
Shih, Eugene et al., ‘Wake on Wireless: An Event Driven Energy Saving Strategy for Battery Operated Devices’, Sep. 23, 2002, pp. 160-171. |
Jacobson, Van et al., “Content-Centric Networking, Whitepaper Describing Future Assurable Global Networks”, Palo Alto Research Center, Inc., Jan. 30, 2007, pp. 1-9. |
Koponen, Teemu et al., “A Data-Oriented (and Beyond) Network Architecture”, SIGCOMM '07, Aug. 27-31, 2007, Kyoto, Japan, XP-002579021, p. 181-192. |
Fall, K. et al., “DTN: an architectural retrospective”, Selected areas in communications, IEEE Journal on, vol. 28, No. 5, Jun. 1, 2008, pp. 828-835. |
Gritter, M. et al., ‘An Architecture for content routing support in the Internet’, Proceedings of 3rd Usenix Symposium on Internet Technologies and Systems, 2001, pp. 37-48. |
“CCNx,” http://ccnx.org/. downloaded Mar. 11, 2015. |
“Content Delivery Network”, Wikipedia, Dec. 10, 2011, http://en.wikipedia.org/w/index.php?title=Content—delivery—network&oldid=465077460. |
“Digital Signature” archived on Aug. 31, 2009 at http://web.archive.org/web/20090831170721/http://en.wikipedia.org/wiki/Digital—signature. |
“Introducing JSON,” http://www.json.org/. downloaded Mar. 11, 2015. |
“Microsoft PlayReady,” http://www.microsoft.com/playready/.downloaded Mar. 11, 2015. |
“Pursuing a pub/sub internet (Pursuit),” http://www.fp7-pursuit.ew/PursuitWeb/. downloaded Mar. 11, 2015. |
“The FP7 4WARD project,” http://www.4ward-project.eu/. downloaded Mar. 11, 2015. |
A. Broder and A. Karlin, “Multilevel Adaptive Hashing”, Jan. 1990, pp. 43-53. |
Detti, Andrea, et al. “CONET: a content centric inter-networking architecture.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011. |
A. Wolman, M. Voelker, N. Sharma N. Cardwell, A. Karlin, and H.M. Levy, “On the scale and performance of cooperative web proxy caching,” ACM SIGHOPS Operating Systems Review, vol. 33, No. 5, pp. 16-31, Dec. 1999. |
Afanasyev, Alexander, et al. “Interest flooding attack and countermeasures in Named Data Networking.” IFIP Networking Conference, 2013. IEEE, 2013. |
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante. Drafting Behind Akamai: Inferring Network Conditions Based on CDN Redirections. IEEE/ACM Transactions on Networking {Feb. 2009). |
B. Ahlgren et al., ‘A Survey of Information-centric Networking’ IEEE Commun. Magazine, Jul. 2012, pp. 26-36. |
B. Lynn$2E. |
Bari, MdFaizul, et al. ‘A survey of naming and routing in information-centric networks.’ Communications Magazine, IEEE 50.12 (2012): 44-53. |
Baugher, Mark et al., “Self-Verifying Names for Read-Only Named Data”, 2012 IEEE Conference on Computer Communications Workshops (INFOCOM Wkshps), Mar. 2012, pp. 274-279. |
Brambley, Michael, A novel, low-cost, reduced-sensor approach for providing smart remote monitoring and diagnostics for packaged air conditioners and heat pumps. Pacific Northwest National Laboratory, 2009. |
C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography. Advances in Cryptology—ASIACRYPT 2002. Springer Berlin Heidelberg (2002). |
C.A. Wood and E. Uzun, “Flexible end-to-end content security in CCN,” in Proc. IEEE CCNC 2014, Las Vegas, CA, USA, Jan. 2014. |
Carzaniga, Antonio, Matthew J. Rutherford, and Alexander L. Wolf. ‘A routing scheme for content-based networking.’ INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 2. IEEE, 2004. |
Cho, Jin-Hee, Ananthram Swami, and Ray Chen. “A survey on trust management for mobile ad hoc networks.” Communications Surveys & Tutorials, IEEE 13.4 (2011): 562-583. |
Compagno, Alberto, et al. “Poseidon: Mitigating interest flooding DDoS attacks in named data networking.” Local Computer Networks (LCN), 2013 IEEE 38th Conference on. IEEE, 2013. |
Conner, William, et al. “A trust management framework for service-oriented environments.” Proceedings of the 18th international conference on World wide web. ACM, 2009. |
Content Centric Networking Project (CCN) [online], http://ccnx.org/releases/latest/doc/technical/, Downloaded Mar. 9, 2015. |
Content Mediator Architecture for Content-aware Networks (COMET) Project [online], http://www.comet-project.org/, Downloaded Mar. 9, 2015. |
D. Boneh, C. Gentry, and B. Waters, Collusi. |
D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. Advances in Cryptology—CRYPTO 2001, vol. 2139, Springer Berlin Heidelberg (2001). |
D.K. Smetters, P. Golle, and J.D. Thornton, “CCNx access control specifications,” PARC, Tech. Rep., Jul. 2010. |
Dabirmoghaddam, Ali, Maziar Mirzazad Barijough, and J. J. Garcia-Luna-Aceves. ‘Understanding optimal caching and opportunistic caching at the edge of information-centric networks.’ Proceedings of the 1st international conference on Information-centric networking. ACM, 2014. |
Detti et al., “Supporting the Web with an information centric network that routes by name”, Aug. 2012, Computer Networks 56, pp. 3705-3702. |
Dijkstra, Edsger W., and Carel S. Scholten. ‘Termination detection for diffusing computations.’ Information Processing Letters 11.1 (1980): 1-4. |
Dijkstra, Edsger W., Wim HJ Feijen, and A—J M. Van Gasteren. “Derivation of a termination detection algorithm for distributed computations.” Control Flow and Data Flow: concepts of distributed programming. Springer Berlin Heidelberg, 1986. 507-512. |
E. Rescorla and N. Modadugu, “Datagram transport layer security,” IETF RFC 4347, Apr. 2006. |
E.W. Dijkstra, W. Feijen, and A.J.M. Van Gasteren, “Derivation of a Termination Detection Algorithm for Distributed Computations,” Information Processing Letter, vol. 16, No. 5, 1983. |
Fayazbakhsh, S. K., Lin, Y., Tootoonchian, A., Ghodsi, A., Koponen, T., Maggs, B., & Shenker, S. {Aug. 2013). Less pain, most of the gain: Incrementally deployable ICN. In ACM SIGCOMM Computer Communication Review (vol. 43, No. 4, pp. 147-158). ACM. |
G. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved Proxy Reencryption Schemes with Applications to Secure Distributed Storage. In the 12th Annual Network and Distributed System Security Sympo. |
G. Tyson, S. Kaune, S. Miles, Y. El-Khatib, A. Mauthe, and A. Taweel, “A trace-driven analysis of caching in content-centric networks,” in Proc. IEEE ICCCN 2012, Munich, Germany, Jul.-Aug. 2012, pp. 1-7. |
G. Wang, Q. Liu, and J. Wu, “Hierarchical attribute-based encryption for fine-grained access control in cloud storage services,” in Proc. ACM CCS 2010, Chicago, IL, USA, Oct. 2010, pp. 735-737. |
G. Xylomenos et al., “A Survey of Information-centric Networking Research,” IEEE Communication Surveys and Tutorials, Jul. 2013. |
Garcia, Humberto E., Wen-Chiao Lin, and Semyon M. Meerkov. “A resilient condition assessment monitoring system.” Resilient Control Systems (ISRCS), 2012 5th International Symposium on. IEEE, 2012. |
Garcia-Luna-Aceves, Jose J. ‘A unified approach to loop-free routing using distance vectors or link states.’ ACM SIGCOMM Computer Communication Review. vol. 19. No. 4. ACM, 1989. |
Garcia-Luna-Aceves, Jose J. ‘Name-Based Content Routing in Information Centric Networks Using Distance Information’ Proc ACM ICN 2014, Sep. 2014. |
Ghali, Cesar, GeneTsudik, and Ersin Uzun. “Needle in a Haystack: Mitigating Content Poisoning in Named-Data Networking.” Proceedings of NDSS Workshop on Security of Emerging Networking Technologies (SENT). 2014. |
Ghodsi, Ali, et al. “Information-centric networking: seeing the forest for the trees.” Proceedings of the 10th ACM Workshop on Hot Topics in Networks. ACM, 2011. |
Ghodsi, Ali, et al. “Naming in content-oriented architectures.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011. |
Gupta, Anjali, Barbara Liskov, and Rodrigo Rodrigues. “Efficient Routing for Peer-to-Peer Overlays.” NSDI. vol. 4. 2004. |
H. Xiong, X. Zhang, W. Zhu, and D. Yao. CloudSeal: End-to$2. |
Heckerman, David, John S. Breese, and Koos Rommelse. “Decision-Theoretic Troubleshooting.” Communications of the ACM. 1995. |
Heinemeier, Kristin, et al. “Uncertainties in Achieving Energy Savings from HVAC Maintenance Measures in the Field.” ASHRAE Transactions 118.Part 2 {2012). |
Herlich, Matthias et al., “Optimizing Energy Efficiency for Bulk Transfer Networks”, Apr. 13, 2010, pp. 1-3, retrieved for the Internet: URL:http://www.cs.uni-paderborn.de/fileadmin/informationik/ag-karl/publications/miscellaneous/optimizing.pdf (retrieved on Mar. 9, 2012). |
Hoque et al., ‘NLSR: Named-data Link State Routing Protocol’, Aug. 12, 2013, ICN 2013, pp. 15-20. |
https://code.google.com/p/ccnx-trace/. |
I. Psaras, R.G. Clegg, R. Landa, W.K. Chai, and G. Pavlou, “Modelling and evaluation of CCN-caching trees,” in Proc. IFIP Networking 2011, Valencia, Spain, May 2011, pp. 78-91. |
Intanagonwiwat, Chalermek, Ramesh Govindan, and Deborah Estrin. ‘Directed diffusion: a scalable and robust communication paradigm for sensor networks.’ Proceedings of the 6th annual international conference on Mobile computing and networking. ACM, 2000. |
J. Aumasson and D. Bernstein, “SipHash: a fast short-input PRF”, Sep. 18, 2012. |
J. Bethencourt, A, Sahai, and B. Waters, ‘Ciphertext-policy attribute-based encryption,’ in Proc. IEEE Security & Privacy 2007, Berkeley, CA, USA, May 2007, pp. 321-334. |
J. Hur, “Improving security and efficiency in attribute-based data sharing,” IEEE Trans. Knowledge Data Eng., vol. 25, No. 10, pp. 2271-2282, Oct. 2013. |
J. Shao and Z. Cao. CCA-Secure Proxy Re-Encryption without Pairings. Public Key Cryptography. Springer Lecture Notes in Computer Sciencevol. 5443 (2009). |
V. Jacobson et al., ‘Networking Named Content,’ Proc. IEEE CoNEXT '09, Dec. 2009. |
Jacobson et al., “Custodian-Based Information Sharing,” Jul. 2012, IEEE Communications Magazine: vol. 50 Issue 7 (p. 3843). |
Ji, Kun, et al. “Prognostics enabled resilient control for model-based building automation systems.” Proceedings of the 12th Conference of International Building Performance Simulation Association. 2011. |
K. Liang, L. Fang, W. Susilo, and D.S. Wong, “A Ciphertext-policy attribute-based proxy re-encryption with chosen-ciphertext security,” in Proc. INCoS 2013, Xian, China, Sep. 2013, pp. 552-559. |
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part I.” HVAC&R Research 11.1 (2005): 3-25. |
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part II.” HVAC&R Research 11.2 (2005): 169-187. |
L. Wang et al., ‘OSPFN: An OSPF Based Routing Protocol for Named Data Networking,’ Technical Report NDN-0003, 2012. |
L. Zhou, V. Varadharajan, and M. Hitchens, “Achieving secure role-based access control on encrypted data in cloud storage,” IEEE Trans. Inf. Forensics Security, vol. 8, No. 12, pp. 1947-1960, Dec. 2013. |
Li, Wenjia, Anupam Joshi, and Tim Finin. “Coping with node misbehaviors in ad hoc networks: A multi-dimensional trust management approach.” Mobile Data Management (MDM), 2010 Eleventh International Conference on. IEEE, 2010. |
Lopez, Javier, et al. “Trust management systems for wireless sensor networks: Best practices.” Computer Communications 33.9 (2010): 1086-1093. |
M. Blaze, G. Bleumer, and M. Strauss, ‘Divertible protocols and atomic prosy cryptography,’ in Proc. EUROCRYPT 1998, Espoo, Finland, May-Jun. 1998, pp. 127-144. |
M. Green and G. Ateniese, “Identity-based proxy re-encryption,” in Proc. ACNS 2007, Zhuhai, China, Jun. 2007, pp. 288-306. |
M. Ion, J. Zhang, and E.M. Schooler, “Toward content-centric privacy in ICN: Attribute-based encryption and routing,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 39-40. |
M. Naor and B. Pinkas “Efficient trace and revoke schemes,” in Proc. FC 2000, Anguilla, British West Indies, Feb. 2000, pp. 1-20. |
M. Nystrom, S. Parkinson, A. Rusch, and M. Scott, “PKCS#12: Personal information exchange syntax v. 1.1,” IETF RFC 7292, K. Moriarty, Ed., Jul. 2014. |
M. Parsa and J.J. Garcia-Luna-Aceves, “A Protocol for Scalable Loop-free Multicast Routing.” IEEE JSAC, Apr. 1997. |
M. Walfish, H. Balakrishnan, and S. Shenker, “Untangling the web from DNS,” in Proc. USENIX NSDI 2004, Oct. 2010, pp. 735-737. |
Mahadevan, Priya, et al. “Orbis: rescaling degree correlations to generate annotated internet topologies.” ACM SIGCOMM Computer Communication Review. vol. 37. No. 4. ACM, 2007. |
Mahadevan, Priya, et al. “Systematic topology analysis and generation using degree correlations.” ACM SIGCOMM Computer Communication Review. vol. 36. No. 4. ACM, 2006. |
Matocha, Jeff, and Tracy Camp. ‘A taxonomy of distributed termination detection algorithms.’ Journal of Systems and Software 43.3 (1998): 207-221. |
Matted Varvello et al., “Caesar: A Content Router for High Speed Forwarding”, ICN 2012, Second Edition on Information-Centric Networking, New York, Aug. 2012. |
McWilliams, Jennifer A., and Iain S. Walker. “Home Energy Article: A Systems Approach to Retrofitting Residential HVAC Systems.” Lawrence Berkeley National Laboratory (2005). |
Merindol et al., “An efficient algorithm to enable path diversity in link state routing networks”, Jan. 10, Computer Networks 55 (2011), pp. 1132-1140. |
Mobility First Project [online], http://mobilityfirst.winlab.rutgers.edu/, Downloaded Mar. 9, 2015. |
Narasimhan, Sriram, and Lee Brownston. “HyDE—A General Framework for Stochastic and Hybrid Modelbased Diagnosis.” Proc. DX 7 (2007): 162-169. |
NDN Project [online], http://www.named-data.net/, Downloaded Mar. 9, 2015. |
Omar, Mawloud, Yacine Challal, and Abdelmadjid Bouabdallah. “Certification-based trust models in mobile ad hoc networks: A survey and taxonomy.” Journal of Network and Computer Applications 35.1 (2012): 268-286. |
P. Mahadevan, E.Uzun, S. Sevilla, and J. Garcia-Luna-Aceves, “CCN-krs: A key resolution service for ccn,” in Proceedings of the 1st International Conference on Information-centric Networking, Ser. INC 14 New York, NY, USA: ACM, 2014, pp. 97-106. [Online]. Available: http://doi.acm.org/10.1145/2660129.2660154. |
R. H. Deng, J. Weng, S. Liu, and K. Chen. Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings. CANS. Spring Lecture Notes in Computer Science vol. 5339 (2008). |
S. Chow, J. Weng, Y. Yang, and R. Deng. Efficient Unidirectional Proxy Re-Encryption. Progress in Cryptology—AFRICACRYPT 2010. Springer Berlin Heidelberg (2010). |
S. Deering, “Multicast Routing in Internetworks and Extended LANs,” Proc. ACM SIGCOMM '88, Aug. 1988. |
S. Deering et al., “The Pim architecture for wide-area multicast routing,” IEEE/ACM Trans, on Networking, vol. 4, No. 2, Apr. 1996. |
S. Jahid, P. Mittal, and N. Borisov, “EASiER: Encryption-based access control in social network with efficient revocation,” in Proc. ACM ASIACCS 2011, Hong Kong, China, Mar. 2011, pp. 411-415. |
S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc. FC 2010, Tenerife, Canary Islands, Spain, Jan. 2010, pp. 136-149. |
S. Kumar et al. “Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking,” 2008, pp. 556-564. |
S. Misra, R. Tourani, and N.E. Majd, “Secure content delivery in information-centric networks: Design, implementation, and analyses,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 73-78. |
S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained data access control in cloud computing,” in Proc. IEEE INFOCOM 2010, San Diego, CA, USA, Mar. 2010, pp. 1-9. |
S.J. Lee, M. Gerla, and C. Chiang, “On-demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile Networks and Applications, vol. 7, No. 6, 2002. |
Sandvine, Global Internet Phenomena Report—Spring 2012. Located online at http://www.sandvine.com/downloads/ documents/Phenomenal H 2012/Sandvine Global InternetPhenomena Report 1H 2012.pdf. |
Scalable and Adaptive Internet Solutions (SAIL) Project [online], http://sail-project.eu/ Downloaded Mar. 9, 2015. |
Schein, Jeffrey, and Steven T. Bushby. A Simulation Study of a Hierarchical, Rule-Based Method for System-Level Fault Detection and Diagnostics in HVAC Systems. US Department of Commerce,[Technology Administration], National Institute of Standards and Technology, 2005. |
Shani, Guy, Joelle Pineau, and Robert Kaplow. “A survey of point-based POMDP solvers.” Autonomous Agents and Multi-Agent Systems 27.1 (2013): 1-51. |
Sheppard, John W., and Stephyn GW Butcher. “A formal analysis of fault diagnosis with d-matrices.” Journal of Electronic Testing 23.4 (2007): 309-322. |
Shneyderman, Alex et al., ‘Mobile VPN: Delivering Advanced Services in Next Generation Wireless Systems’, Jan. 1, 2003, pp. 3-29. |
Solis, Ignacio, and J. J. Garcia-Luna-Aceves. ‘Robust content dissemination in disrupted environments.’ proceedings of the third ACM workshop on Challenged networks. ACM, 2008. |
Sun, Ying, and Daniel S. Weld. “A framework for model-based repair.” AAAI. 1993. |
T. Ballardie, P. Francis, and J. Crowcroft, “Core Based Trees (CBT),” Proc. ACM SIGCOMM '88, Aug. 1988. |
T. Dierts, “The transport layer security (TLS) protocol version 1.2,” IETF RFC 5246, 2008. |
T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, and I. Stoica, ‘A data-oriented (and beyond) network architecture,’ ACM SIGCOMM Computer Communication Review, vol. 37, No. 4, pp. 181-192, Oct. 2007. |
The Despotify Project (2012). Available online at http://despotify.sourceforge.net/. |
V. Goyal, 0. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. ACM CCS 2006, Alexandria, VA, USA, Oct.-Nov. 2006, pp. 89-98. |
V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard, ‘Networking named content,’ in Proc. ACM CoNEXT 2009, Rome, Italy, Dec. 2009, pp. 1-12. |
V. K. Adhikari, S. Jain, Y. Chen, and Z.-L. Zhang. Vivisecting Youtube:An Active Measurement Study. In INFOCOM12 Mini-conference (2012). |
Verma, Vandi, Joquin Fernandez, and Reid Simmons. “Probabilistic models for monitoring and fault diagnosis.” The Second IARP and IEEE/RAS Joint Workshop on Technical Challenges for Dependable Robots in Human Environments. Ed. Raja Chatila. Oct. 2002. |
Vijay Kumar Adhikari, Yang Guo, Fang Hao, Matteo Varvello, Volker Hilt, Moritz Steiner, and Zhi-Li Zhang. Unreeling Netflix: Understanding and Improving Multi-CDN Movie Delivery. In the Proceedings of IEEE INFOCOM 2012 (2012). |
Vutukury, Srinivas, and J. J. Garcia-Luna-Aceves. A simple approximation to minimum-delay routing. vol. 29. No. 4. ACM, 1999. |
W.-G. Tzeng and Z.-J. Tzeng, “A public-key traitor tracing scheme with revocation using dynamic shares,” in Proc. PKC 2001, Cheju Island, Korea, Feb. 2001, pp. 207-224. |
Waldvogel, Marcel “Fast Longest Prefix Matching: Algorithms, Analysis, and Applications”, A dissertation submitted to the Swiss Federal Institute of Technology Zurich, 2002. |
Walker, Iain S. Best practices guide for residential HVAC Retrofits. No. LBNL-53592. Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US), 2003. |
Wang, Jiangzhe et al.,“DMND: Collecting Data from Mobiles Using Named Data”, Vehicular Networking Conference, 2010 IEEE, pp. 49-56. |
Xylomenos, George, et al. “A survey of information-centric networking research.” Communications Surveys & Tutorials, IEEE 16.2 (2014): 1024-1049. |
Yi, Cheng, et al. ‘A case for stateful forwarding plane.’ Computer Communications 36.7 (2013): 779-791. |
Yi, Cheng, et al. ‘Adaptive forwarding in named data networking.’ ACM SIGCOMM computer communication review 42.3 (2012): 62-67. |
Zahariadis, Theodore, et al. “Trust management in wireless sensor networks.” European Transactions on Telecommunications 21.4 (2010): 386-395. |
Zhang, et al., “Named Data Networking (NDN) Project”, http://www.parc.com/publication/2709/named-data-networking-ndn-project.html, Oct. 2010, NDN-0001, PARC Tech Report. |
Zhang, Lixia, et al. ‘Named data networking.’ ACM SIGCOMM Computer Communication Review 44.3 {2014): 66-73. |
Soh et al., “Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updateable Address Set”, Jan. 2008, IEEE Transactions on Computers, vol. 57, No. 1. |
Beben et al., “Content Aware Network based on Virtual Infrastructure”, 2012 13th ACIS International Conference on Software Engineering. |
Biradar et al., “Review of multicast routing mechanisms in mobile ad hoc networks”, Aug. 16, Journal of Network$. |
D. Trossen and G. Parisis, “Designing and realizing and information-centric Internet,” IEEE Communications Magazing, vol. 50, No. 7, pp. 60-67, Jul. 2012. |
Garcia-Luna-Aceves et al., “Automatic Routing Using Multiple Prefix Labels”, 2012, IEEE, Ad Hoc and Sensor Networking Symposium. |
Gasti, Paolo et al., ‘DoS & DDoS in Named Data Networking’, 2013 22nd International Conference on Computer Communications and Networks (ICCCN), Aug. 2013, pp. 1-7. |
Ishiyama, “On the Effectiveness of Diffusive Content Caching in Content-Centric Networking”, Nov. 5, 2012, IEEE, Information and Telecommunication Technologies (APSITT), 2012 9th Asia-Pacific Symposium. |
J. Hur and D.K. Noh, “Attribute-based access control with efficient revocation in data outsourcing systers,” IEEE Trans. Parallel Distrib. Syst, vol. 22, No. 7, pp. 1214-1221, Jul. 2011. |
J. Lotspiech, S. Nusser, and F. Pestoni. Anonymous Trust: Digital Rights Management using Broadcast Encryption. Proceedings of the IEEE 92.6 (2004). |
Kaya et al., “A Low Power Lookup Technique for Multi-Hashing Network Applications”, 2006 IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, Mar. 2006. |
S. Kamara and K. Lauter. Cryptographic Cloud Storage. Financial Cryptography and Data Security. Springer Berlin Heidelberg (2010). |
RTMP (2009). Available online at http://wwwimages.adobe.com/www.adobe.com/content/dam/Adobe/en/devnet/rtmp/ pdf/rtmp specification 1.0.pdf. |
Hoque et al., “NLSR: Named-data Link State Routing Protocol”, Aug. 12, 2013, ICN'13. |
Nadeem Javaid, “Analysis and design of quality link metrics for routing protocols in Wireless Networks”, PhD Thesis Defense, Dec. 15, 2010, Universete Paris-Est. |
Wetherall, David, “Active Network vision and reality: Lessons form a capsule-based system”, ACM Symposium on Operating Systems Principles, Dec. 1, 1999. pp. 64-79. |
Kulkarni A.B. et al., “Implementation of a prototype active network”, IEEE, Open Architectures and Network Programming, Apr. 3, 1998, pp. 130-142. |
Xie et al. “Collaborative Forwarding and Caching in Content Centric Networks”, Networking 2012. |
Lui et al. (A TLV-Structured Data Naming Scheme for Content-Oriented Networking, pp. 5822-5827, International Workshop on the Network of the Future, Communications (ICC), 2012 IEEE International Conference on Jun. 10-15, 2012). |
Peter Dely et al. “OpenFlow for Wireless Mesh Networks” Computer Communications and Networks, 2011 Proceedings of 20th International Conference on, IEEE, Jul. 31, 2011 (Jul. 31, 2011), pp. 1-6. |
Garnepudi Parimala et al “Proactive, reactive and hybrid multicast routing protocols for Wireless Mesh Networks”, 2013 IEEE International Conference on Computational Intelligence and Computing Research, IEEE, Dec. 26, 2013, pp. 1-7. |
Tiancheng Zhuang et al. “Managing Ad Hoc Networks of Smartphones”, International Journal of Information and Education Technology, Oct. 1, 2013. |
Amadeo et al. “Design and Analysis of a Transport-Level Solution for Content—Centric VANETs”, University “Mediterranea” of Reggio Calabria, Jun. 15, 2013. |
Marc Mosko: “CCNx 1.0 Protocol Introduction” Apr. 2, 2014 [Retrieved from the Internet Jun. 8, 2016] http://www.ccnx.org/pubs/hhg/1.1%20CCNx%201.0%20Protocol%20Introduction.pdf *paragraphs [01.3], [002], [02.1], [0003]. |
Akash Baid et al: “Comparing alternative approaches for networking of named objects in the future Internet”, Computer Communications Workshops (Infocom Wkshps), 2012 IEEE Conference on, IEEE, Mar. 25, 2012, pp. 298-303, *Paragraph [002]* *figure 1*. |
Priya Mahadevan: “CCNx 1.0 Tutorial”, Mar. 16, 2014, pp. 1-11, Retrieved from the Internet: http://www.ccnx.org/pubs/hhg/1.2%20CCNx%201.0%20Tutorial.pdf [retrieved on Jun. 8, 2016] *paragraphs [003]-[006], [0011], [0013]*figures 1,2*. |
Marc Mosko et al “All-In-One Streams for Content Centric Networks”, May 24, 2015, retrieved from the Internet: http://www.ccnx.org/pubs/AllinOne.pdf [downloaded Jun. 9, 2016] *the whole document*. |
Cesar Ghali et al. “Elements of Trust in Named-Data Networking”, Feb. 13, 2014 Retrieved from the internet Jun. 17, 2016 http://arxiv.org/pdf/1402.3332v5.pdf *p. 5, col. 1* *p. 2, col. 1-2* *Section 4.1; p. 4, col. 2* *Section 4.2; p. 4, col. 2*. |
Priya Mahadevan et al. “CCN-KRS”, Proceedings of the 1st International Conference on Information-Centric Networking, Inc. '14, Sep. 24, 2014. |
Flavio Roberto Santos et al. “Funnel: Choking Polluters in BitTorrent File Sharing Communities”, IEEE Transactions on Network and Service Management, IEEE vol. 8, No. 4, Dec. 1, 2011. |
Liu Wai-Xi et al: “Multisource Dissemination in content-centric networking”, 2013 Fourth International conference on the network of the future (NOF), IEEE, Oct. 23, 2013, pp. 1-5. |
Marie-Jose Montpetit et al.: “Network coding meets information-centric networking”, Proceedings of the 1st ACM workshop on emerging Name-Oriented mobile networking design, architecture, algorithms, and applications, NOM '12, Jun. 11, 2012, pp. 31-36. |
Asokan et al.: “Server-Supported Signatures”, Computer Security Esorics 96, Sep. 25, 1996, pp. 131-143, Section 3. |
Mandl et al.: “A Fast FPGA Based Coprocessor Supporting Hard Real-Time Search”, New Frontiers of Information Technology, Proceedings of the 23rd Euromicro Conference Budapest, Sep. 1, 1997, pp. 499-506 *the Whole Document*. |
Sun et al.: “Content-Based Route Lookup Using CAMs”, Global Communications Conference, IEEE, Dec. 3, 2012 *The Whole Document*. |
Number | Date | Country | |
---|---|---|---|
20160057189 A1 | Feb 2016 | US |