Advertisement forwarding storage and retrieval network

Information

  • Patent Grant
  • 8370446
  • Patent Number
    8,370,446
  • Date Filed
    Tuesday, July 7, 2009
    16 years ago
  • Date Issued
    Tuesday, February 5, 2013
    12 years ago
Abstract
Methods and apparatus, including computer program products, for to advertisement forwarding storage and retrieval network. A method includes, in a network of interconnected computer system nodes, directing advertisement to a computer memory, directing data to a computer memory, continuously forwarding each of the unique data, independent of each other, from one computer memory to another computer memory in the network of interconnected computer system nodes without storing on any physical storage device in the network, continuously forwarding each of the unique advertisements, independent of each other, from one computer memory to another computer memory in the network of interconnected computer system nodes without storing on any physical storage device in the network, and retrieving one of the advertisements in response to an activity.
Description
BACKGROUND

At least some embodiments disclosed herein relate to data storage, and more particularly, to advertisement forwarding storage and retrieval network.


The volume of data that must be stored by individuals, organizations, businesses and government is growing every year. In addition to just keeping up with demand, organizations face other storage challenges. With the move to on-line, real-time business and government, critical data must be protected from loss or inaccessibility due to software or hardware failure. Today, many storage products do not provide complete failure protection and expose users to the risk of data loss or unavailability. For example, many storage solutions on the market today offer protection against some failure modes, such as processor failure, but not against others, such as disk drive failure. Many organizations are exposed to the risk of data loss or data unavailability due to component failure in their data storage system.


The data storage market is typically divided into two major segments, i.e., Direct Attached Storage (DAS) and Network Storage. DAS includes disks connected directly to a server.


Network Storage includes disks that are attached to a network rather than a specific server and can then be accessed and shared by other devices and applications on that network. Network Storage is typically divided into two segments, i.e., Storage Area Networks (SANs) and Network Attached Storage (NAS).


A SAN is a high-speed special-purpose network (or subnetwork) that interconnects different kinds of data storage devices with associated data servers on behalf of a larger network of users. Typically, a SAN is part of the overall network of computing resources for an enterprise. A storage area network is usually clustered in close proximity to other computing resources but may also extend to remote locations for backup and archival storage, using wide area (WAN) network carrier technologies.


NAS is hard disk storage that is set up with its own network address rather than being attached to the local computer that is serving applications to a network's workstation users. By removing storage access and its management from the local server, both application programming and files can be served faster because they are not competing for the same processor resources. The NAS is attached to a local area network (typically, an Ethernet network) and assigned an IP address. File requests are mapped by the main server to the NAS file server.


All of the above share one common feature that can be an Achilles tendon in more ways than one, i.e., data is stored on a physical medium, such as a disk drive, CD drive, and so forth.


SUMMARY OF THE DESCRIPTION

The present invention provides methods and apparatus, including computer program products, for advertisement forwarding storage and retrieval network.


In general, in one aspect, the invention features a method including, in a network of interconnected computer system nodes, directing advertisement to a computer memory, directing data to a computer memory, continuously forwarding each of the unique data, independent of each other, from one computer memory to another computer memory in the network of interconnected computer system nodes without storing on any physical storage device in the network, continuously forwarding each of the unique advertisements, independent of each other, from one computer memory to another computer memory in the network of interconnected computer system nodes without storing on any physical storage device in the network, and retrieving one of the advertisements in response to an activity.


In another aspect, the invention features a network including a group of interconnected computer system nodes each adapted to receive data and advertisements, continuously forward the data and advertisements from computer memory to computer memory, independent of each other, without storing on any physical storage device in response to a request to store the data or advertisements from a requesting system and retrieve a particular data being continuously forwarded from computer memory to computer memory, along with an advertisement being continuously forwarded from computer memory to computer memory, in response to an activity of the requesting system.


The details of one or more implementations of the invention are set forth in the accompanying drawings and the description below. Further features, aspects, and advantages of the invention will become apparent from the description, the drawings, and the claims.





BRIEF DESCRIPTION OF THE DRAWINGS

The embodiments are illustrated by way of example and not limitation in the FIGS. of the accompanying drawings in which like references indicate similar elements.



FIG. 1 is a block diagram of an exemplary network.



FIG. 2 is a block diagram of an exemplary user system.



FIG. 3 is a block diagram of an exemplary network system.



FIG. 4 is a flow diagram of a process.



FIG. 5 is a flow diagram of a process.



FIG. 6 is a flow diagram of a process.





DETAILED DESCRIPTION

Unlike peer to peer networks, which use data forwarding in a transient fashion so that data is eventually stored on a physical medium such as a disk drive, the present invention is a continuous data forwarding system, i.e., data is stored by continually forwarding it from one node memory to another node memory.


As shown in FIG. 1, an exemplary network 10 includes a user system 12 and a number of network systems 14, 16, 18, 20, 22. Each of the network systems 14, 16, 18, 20, 22 can be considered to be a node in the network 10 and one such network system may be designated as a central server, such as network system 14, which may assume a control position in network 10. Each of the nodes 14, 16, 18, 20, 22 may be established as a privately controlled network of peers under direct control of the central server 14. Peered nodes may also be a mix of private and public nodes, and thus not under the direct physical control of the central server 14. The network 10 may also be wholly public where the central server 14 (or servers) has no direct ownership or direct physical control of any of the peered nodes.


As shown in FIG. 2, the user system 12 can include a processor 30, memory 32 and input/output (I/O) device 34. Memory 32 can include an operating system (OS) 36, such as Linux, Apple® OS or Windows®, one or more application processes 38, and a storage process 100, explained in detail below. Application processes 38 can include user productivity software, such as OpenOffice or Microsoft® Office. The I/O device 34 can include a graphical user interface (GUI) 40 for display to a user 42.


As shown in FIG. 3, each of the network systems, such as network system 14, can include a processor 50 and memory 52. Memory 52 can include an OS 54, such as Linux, Apple® OS or Windows®, and a data forwarding process 200, explained in detail below.


In traditional systems, application processes 38 need to store and retrieve data. In these traditional systems, data is stored on local or remote physical devices. And in some systems, this data can be segmented into different pieces or packets and stored locally or remotely on physical mediums of storage. Use of fixed physical data storage devices add cost, maintenance, management and generate a fixed physical record of the data, whether or not that is the desire of the user 42.


The present invention does not use fixed physical data storage to store data. When a request to store data is received by the central server 14 from storage process 100, data is directed to a node in the network 10 where it is then continuously forwarded from node memory to node memory in the network 10 by the data forwarding process 200 in each of the network nodes without storing on any physical storage medium such as a disk drive. The forwarded data resides only for a very brief period of time in the memory of any one node in the network 10. Data is not stored on any physical storage medium in any network node.


In a like manner, when a request to retrieve data is received by the central server 14 from storage process 100, the requested data, which is being forwarded from node memory to node memory in the network 10, is retrieved.


Data forwarded in this manner can be segmented and segments forwarded as described above. Sill, the segmented data is not stored on any physical storage medium in any network node, but merely forwarded from the memory of one node to the memory of another node.


As shown in FIG. 4, storage process 100 includes sending (102) a request to a central server 14 to store or retrieve data. If the request is a retrieve data request, storage process 100 receives the requested data from the central server 14 or node in the network.


If the request to the central server 14 is a store data request, storage process 100 receives (104) an address of a node from the central server 14 and forwards (106) the data to the node memory represented by the received address. Determining an address of a node available to receive the data can be based on one or more factors, such as network traffic analysis, available memory, combinations of factors, and so forth. A time stamp can be applied to the data in the computer memory of the specific node.


As shown in FIG. 5, data forwarding process 200 includes receiving (202) a request to store or retrieve data. If the received request is a request to store data, data forwarding process 200 determines (204) an address of a node available to receive the data in memory. This determination (204) can include pinging the network and determining which of the nodes in a network is available, or determining which node in the network has the least traffic, or determining which node in the network has the largest available memory, or any combination of these or other factors.


Process 200 sends (206) a message to the user system with the address of a specific node for the requester to forward the data.


Process 200 detects (208) the presence of data in node memory. Process 200 forwards (210) the data in memory to another node in the network of nodes and continues to repeat detecting (208) and forwarding (210) of the data from node memory to node memory. When data arrives in any node memory, process 200 affixes (212) a time stamp to the data.


Forwarding (210) can include pinging the node in the network to determine which of the nodes in the network is available, or determining which node in the network has the least traffic, or determining which node in the network has the largest available memory, or any combination of these or other factors.


In one specific example, at the point of entry to a node, data undergoes an encrypted “handshake” with the node or central server 14 or user. This can be a public or private encryption system, such as the Cashmere system, which can use public-private keys. Cashmere decouples the encrypted forwarding path and message payload, which improves the performance as the source only needs to perform a single public key encryption on each message that uses the destination's unique public key. This has the benefit that only the true destination node will be able to decrypt the message payload and not every node in the corresponding relay group. Cashmere provides the capability that the destination can send anonymous reply messages without knowing the source's identity. This is done in a similar way, where the source creates a reply path and encrypts it in a similar manner as the forwarding path.


In another example, other routing schemes are utilized.


If the received request is a request to retrieve data being continuously forwarded from node memory to node memory, data forwarding process 200 matches (214) at the central server 14 using a hash mark or other unique code that can be “sniffed” by the node upon the data entering the node via the encryption handshake. This can occur by pinging the nodes in the network. Process 200 sends (216) the message to return the data to the user directly to the node or node state where the central server 14 believes the data will likely appear. The more the central server 14 can narrow the node state that it pings to, then the more efficient the retrieval will become and the less burdened by unnecessary messaging traffic to nodes that are not necessary for a transaction between the central server 14 and the node capable of forwarding the data.


Once the correct node receives the message to forward the data in node memory to the requester, process 200 forwards (218) in node memory the data to the requester and forwards (220) a confirmation message that the data has been sent to the user. This routing message may be sent directly to the central server 14 or may be passed to the central server 14 or servers via other node(s) or supernode(s) in the network 10. Upon the user receiving the requested data the user's application functions to automatically ping the central server 14 that the data requested has been received. Thus the network 10 creates data storage without caching, downloading and/or storing the data on any physical storage medium. Data storage and management is accomplished via a continuous routing of the data from node memory to node memory, the forwarded data only downloaded when the user requests the data to be returned to the user from the network 10.


New nodes and node states may be added and/or deleted from the network 10 based upon performance. Users may have access to all nodes or may be segmented to certain nodes or “node states” by the central server(s) or via the specific architecture of the private, public or private-public network.


Individual nodes, nodes states and supernodes may also be extranet peers, wireless network peers, satellite peered nodes, Wi-Fi peered nodes, broadband networks, and so forth, in public or private networks. Peered nodes or users may be used as routing participants in the network 10 from any valid peer point with the same security systems employed, as well as custom solutions suitable for the rigors of specific deployments, such as wireless encryption schemes for wireless peers, and so forth.


In process 200, rather than have data cached or held in remote servers, hard drives or other fixed storage medium, the data are passed, routed, forwarded from node memory to node memory. The data are never downloaded until the authorized user calls for the data. A user on the system may authorize more than one user to have access to the data.


A primary goal in process 200 is to generate a data forwarding storage and management system where the data is never fixed in physical storage, but in fact, is continually being routed/forwarded from node memory to node memory in the network. The path of the nodes to which data is forwarded may also be altered by the central server 14 to adjust for system capacities and to eliminate redundant paths of data that may weaken the security of the network due to the increased probability of data path without this feature.


This data forwarding storage and management system in which the data is never fixed in physical storage, but in fact, is continually being routed/forwarded from node memory to node memory in the network, can be used as a backend system(s) in many applications that currently used fixed medium storage. In one example, this data forwarding storage and management system where the data is continually being routed/forwarded from node memory to node memory in the network is used as an advertisement forwarding and retrieval system. Advertisement is deployed into the data forwarding storage and management system from a master server or control station and recalled on demand or in response to a stimulus or activity. Here, we consider advertisement as a broad term that can include any content, including, but limited to, text, audio, visual or any combination thereof. Advertisement can be deployed into the data forwarding storage network and recalled/retrieved when needed, e.g., directed to an IP address of a specific user system, directed to paid and/or unpaid subscribers of applications within the data forwarding storage network, and/or directed to users outside of the data forwarding storage network. Advertisement being continuously forwarded in the data forwarding storage network can be sent to all users or specifically targeted according to one or more user characteristics, user profiles, usage patterns, history and/or past or present viewed page content. The advertisement being continuously forwarded in the data forwarding storage network can be displayed to a current user within an application or web browser or delivered to a wired or wireless radio, television and/or television network. Advertisements can be retrieved in response to a stimulus or activity, such as the user's profile, traffic patterns of one or more users, application profiles, and so forth. Advertisements can be stored and delivered in any media form and either pre-configured by specific file type and size for a specific end user or site delivery requirements/formats, or delivered and formatted by virtue of the end user or middleware software compatibility systems.


In one example, selected advertisement can be delivered to a user through a web browser. More particularly, a plug-in and/or helper application can be associated with a user's web browser. In general, a plug-in is a computer program that interacts with a host application (a web browser or an email client, for example) to provide a certain, usually very specific, function “on demand.” As a user navigates to a particular web page, the plug-in can parse displayed text. The plug-in can then request specific advertisement being continuously forwarded in the data forwarding storage network that matches the parsed text to the web browser of the user for display in a section of the display screen or as a pop-up.


In another example, a user requesting retrieval of a data file being continuously forwarded in the data forwarding storage network may be presented with specific advertisement being continuously forwarded in the data forwarding storage network that matches the user's profile. The user's profile may include various personal and/or demographic data that aids in directing appropriate advertisement to the user. The advertisement may then be displayed as a banner or in a shared window or in a separate window.


In each of the examples above, the network includes a group of interconnected computer system nodes each adapted to receive data and advertisement and continuously forward the data and advertisement from computer memory to computer memory, independent of each other, without storing on any physical storage device, in response to a request to store the data from a requesting system and retrieve data being continuously forwarded from computer memory to computer memory in response to a request to retrieve the data from the requesting system. Each node in the network is adapted to detect the presence of a data and advertisement in its memory and forward the data and advertisement to a computer memory of another node in the interconnected computer systems nodes according to a node's availability. The node's availability can be determined according to its volume of network traffic. Each node can encrypt the data.


A central node can be adapted to match the data retrieval request at a central server using a hash mark representing the data or advertisement entering a node, send a message to a node that is predicted to have the data or advertisement in memory, the message instructing the node to forward the data and/or advertisement in memory to the requester, and send a confirmation message to the central server that the data or advertisement in memory has been forwarded to the requester.


As shown in FIG. 6, a process 300 includes directing (302) advertisement to a computer memory. The advertisement can include any content, including, but limited to, text, audio, visual or any combination thereof The advertisement can include multiple configurations in order to satisfy different systems delivery specifications. Advertisements can be stored and delivered in any media form and either pre-configured by specific file type and size for a specific end user or site delivery requirements/formats, or delivered and formatted by virtue of the end user or middleware software compatibility systems.


Process 300 directs (304) data to a computer memory.


Process 300 continuously forwards (306) each of the unique data, independent of each other, from one computer memory to another computer memory in the network of interconnected computer system nodes without storing on any physical storage device in the network.


Process 300 continuously forwards (308) each of the unique advertisements, independent of each other, from one computer memory to another computer memory in the network of interconnected computer system nodes without storing on any physical storage device in the network.


Process 300 retrieves (310) one of the advertisements in response to an activity.


The invention can be implemented to realize one or more of the following advantages. A network creates data storage without caching or downloads. Data storage and management are accomplished via a constant routing of the data.


Embodiments of the invention can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Embodiments of the invention can be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine readable storage device or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.


Method steps of embodiments of the invention can be performed by one or more programmable processors executing a computer program to perform functions of the invention by operating on input data and generating output. Method steps can also be performed by, and apparatus of the invention can be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).


Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. Information carriers suitable for embodying computer program instructions and data include all forms of non volatile memory, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in special purpose logic circuitry.


It is to be understood that the foregoing description is intended to illustrate and not to limit the scope of the invention, which is defined by the scope of the appended claims. Other embodiments are within the scope of the following claims.

Claims
  • 1. A method comprising: receiving, from a user computer, an indication of text displayed on a display of the user computer;determining, by a computing system, advertising content for transmission to the user computer based on at least the indication of text displayed on the display of the user computer;transmitting, from the computing system, a request for the determined advertising content to one or more computer system nodes of a network of computer system nodes, wherein the computer system nodes are configured to: dynamically determine, for advertisements received at respective computer system nodes, one or more forwarding nodes of the computer system nodes based on one or more statuses of the respective forwarding nodes and/or one or more statuses of the network;continuously forward the advertisements from respective computer system nodes to respective determined forwarding nodes without storing the advertisements on any fixed storage medium in the network; andproviding the determined advertising content to the user computer.
  • 2. The method of claim 1, wherein providing the determined advertising content to the user computer comprises instructing one or more computer system nodes of the network to forward the determined advertising content to the user computer.
  • 3. The method of claim 1, wherein providing the determined advertising content to the user computer comprises providing the user computer with a network location of the determined advertising content.
  • 4. The method of claim 1 wherein continuously forwarding comprises: detecting a particular advertisement at a specific node; andforwarding the particular advertisement to another node in the network of computer system nodes without storing the particular advertisement on any fixed storage medium.
  • 5. The method of claim 1 wherein the one or more statuses of the respective forwarding nodes and/or the one or more statuses of the network comprise network traffic analysis and/or available memory.
  • 6. The method of claim 1 further comprising: continuously forwarding each of a plurality of data items, independent of one other, among the computer system nodes in the network without storing the data items on any fixed storage medium in the network;receiving a request from a requesting computing system to retrieve a particular data item being continuously forwarded in the network of computer system nodes; andretrieving the particular data item from a node in response to the request to retrieve the particular data item.
  • 7. The method of claim 6 wherein retrieving comprises: identifying an entry of a data structure associated with the particular data item based on a hash mark associated with the particular data item;determining, based on the identified entry of the data structure, a node that is predicted to have the particular data item; andtransmitting a message instructing the determined node to forward the particular data item to the requesting computing system.
  • 8. The method of claim 7 further comprising receiving an acknowledgment from the requesting computing system that the particular data item has been received.
  • 9. A computing system comprising: one or more hardware processor configured to execute software instructions;a computer readable medium storing instructions for execution by the one or more processor in order to cause the computing system to perform operations comprising: receiving an indication of text displayed on a display of a user computer;determining advertising content for transmission to the user computer based on at least the indication of text displayed on the display of the user computer;transmitting a request for the determined advertising content to one or more computer system nodes of a network of computer system nodes, wherein the computer system nodes are configured to continuously forward each of a plurality of advertisements, independent of one other, among the computer system nodes in the network without storing the advertisements on any fixed storage medium of the computer system nodes, wherein computer systems nodes to which respective advertisements are forwarded are determined dynamically at computer system nodes receiving the respective advertisements based on statuses of respective computer system nodes and/or one or more statuses of the network; andproviding the determined advertising content to the user computer.
  • 10. The computing system of claim 9, wherein providing the determined advertising content to the user computer comprises instructing one or more computer system nodes of the network to forward the determined advertising content to the user computer.
  • 11. The computing system medium of claim 9, wherein providing the determined advertising content to the user computer comprises providing the user computer with a network location of the determined advertising content.
  • 12. The computing system of claim 9, wherein continuously forwarding comprises: detecting a particular advertisement at a specific node; andforwarding the particular advertisement to another node in the network of computer system nodes without storing the particular advertisement on any fixed storage medium.
  • 13. The computing system of claim 12, further comprising: determining an address of a node available to receive the particular advertisement based on one or more factors.
  • 14. A non-signal computer readable storage medium storing instructions for causing a computing system to perform operations comprising: receiving an indication of content displayed on a display of a user computer;determining advertising content for transmission to the user computer based on at least the indication of content displayed on the display of the user computer;transmitting a request for the determined advertising content to one or more computer system nodes of a network of computer system nodes, wherein the computer system nodes are configured to continuously forward each of a plurality of advertisements, independent of one other, among the computer system nodes in the network without storing the advertisements on any fixed storage medium of the computer system nodes, wherein computer systems nodes to which respective advertisements are forwarded are determined dynamically at computer system nodes receiving the respective advertisements based on statuses of respective computer system nodes and/or one or more statuses of the network; andproviding the determined advertising content to the user computer.
  • 15. The non-signal computer readable storage medium of claim 14, wherein providing the determined advertising content to the user computer comprises instructing one or more computer system nodes of the network to forward the determined advertising content to the user computer.
  • 16. The non-signal computer readable storage medium of claim 14, wherein providing the determined advertising content to the user computer comprises providing the user computer with a network location of the determined advertising content.
  • 17. The non-signal computer readable storage medium of claim 14, wherein continuously forwarding comprises: detecting a particular advertisement at a specific node; andforwarding the particular advertisement to another node in the network of computer system nodes without storing the particular advertisement on any fixed storage medium.
  • 18. The non-signal computer readable storage medium of claim 17, further comprising: determining an address of a node available to receive the particular advertisement based on one or more factors.
  • 19. The non-signal computer readable storage medium of claim 18 wherein the one or more factors comprise network traffic analysis and/or available memory.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a U.S. National Phase of International Application No. PCT/US2009/049763, filed Jul. 7, 2009 which is a continuation of U.S. patent application Ser. No. 12/170,925, filed Jul. 10, 2008, now U.S. Pat. No. 7,636,758, entitled “ADVERTISEMENT FORWARDING STORAGE AND RETRIEVAL NETWORK,” each of which is hereby expressly incorporated by reference in its entirety.

PCT Information
Filing Document Filing Date Country Kind 371c Date
PCT/US2009/049763 7/7/2009 WO 00 2/1/2011
Publishing Document Publishing Date Country Kind
WO2010/005935 1/14/2010 WO A
US Referenced Citations (155)
Number Name Date Kind
3786424 McVoy et al. Jan 1974 A
5751928 Bakalash May 1998 A
5787258 Costa et al. Jul 1998 A
5978839 Okuhara et al. Nov 1999 A
6085030 Whitehead et al. Jul 2000 A
6151395 Harkins Nov 2000 A
6205478 Sugano et al. Mar 2001 B1
6219691 Youn Apr 2001 B1
6260159 Garnett et al. Jul 2001 B1
6298380 Coile et al. Oct 2001 B1
6505213 Kamada et al. Jan 2003 B1
6549957 Hanson et al. Apr 2003 B1
6587866 Modi et al. Jul 2003 B1
6650640 Muller et al. Nov 2003 B1
6677976 Parker et al. Jan 2004 B2
6684258 Gavin et al. Jan 2004 B1
6721275 Rodeheffer et al. Apr 2004 B1
6724767 Chong et al. Apr 2004 B1
6745289 Gruner et al. Jun 2004 B2
6907447 Cooperman et al. Jun 2005 B1
6941338 Madsen Sep 2005 B1
6983303 Pellegrino et al. Jan 2006 B2
6985476 Elliott et al. Jan 2006 B1
7007142 Smith Feb 2006 B2
7035933 O'Neal et al. Apr 2006 B2
7043530 Isaacs et al. May 2006 B2
7061923 Dugan et al. Jun 2006 B2
7103824 Halford Sep 2006 B2
7120631 Vahalia et al. Oct 2006 B1
7136638 Wacker et al. Nov 2006 B2
7143170 Swildens et al. Nov 2006 B2
7191298 Kaminsky et al. Mar 2007 B2
7197576 Lo et al. Mar 2007 B1
7209973 Tormasov et al. Apr 2007 B2
7240214 Gazzetta et al. Jul 2007 B2
7266776 Quillen et al. Sep 2007 B2
7274706 Nguyen et al. Sep 2007 B1
7277941 Ignatius et al. Oct 2007 B2
7295556 Roese et al. Nov 2007 B2
7320059 Armangau et al. Jan 2008 B1
7327731 Kumar et al. Feb 2008 B1
7346063 Herbst Mar 2008 B1
7346909 Eldar et al. Mar 2008 B1
7356540 Smith et al. Apr 2008 B2
7356567 Odell et al. Apr 2008 B2
7363316 Anderson et al. Apr 2008 B2
7366868 Reuter et al. Apr 2008 B2
7404002 Pereira Jul 2008 B1
7424514 Noble et al. Sep 2008 B2
7426471 Briscoe et al. Sep 2008 B1
7426574 Liao Sep 2008 B2
7426637 Risan et al. Sep 2008 B2
7426745 McCarty Sep 2008 B2
7428219 Khosravi Sep 2008 B2
7428540 Coates et al. Sep 2008 B1
7430584 Fein et al. Sep 2008 B1
7529784 Kavuri et al. May 2009 B2
7599997 Fein et al. Oct 2009 B1
7631051 Fein et al. Dec 2009 B1
7631052 Fein et al. Dec 2009 B2
7636758 Fein et al. Dec 2009 B1
7636759 Fein et al. Dec 2009 B1
7636760 Fein et al. Dec 2009 B1
7636761 Fein et al. Dec 2009 B1
7636762 Fein et al. Dec 2009 B1
7636763 Fein et al. Dec 2009 B1
7636764 Fein et al. Dec 2009 B1
7668926 Fein et al. Feb 2010 B2
7668927 Fein et al. Feb 2010 B2
7673009 Fein et al. Mar 2010 B2
7685248 Fein et al. Mar 2010 B1
7844695 Fein et al. Nov 2010 B2
7877456 Fein et al. Jan 2011 B2
7924888 Schultze et al. Apr 2011 B2
20020158899 Raymond Oct 2002 A1
20020194371 Kadoi Dec 2002 A1
20030093463 Graf May 2003 A1
20030101200 Koyama et al. May 2003 A1
20030137880 Barrenscheen et al. Jul 2003 A1
20030158958 Chiu Aug 2003 A1
20040064633 Oota Apr 2004 A1
20040093390 Oberdorfer May 2004 A1
20040165525 Burak Aug 2004 A1
20040223503 Lynch et al. Nov 2004 A1
20040250029 Ji et al. Dec 2004 A1
20050010647 Durham Jan 2005 A1
20050010685 Ramnath et al. Jan 2005 A1
20050015466 Tripp Jan 2005 A1
20050044162 Liang et al. Feb 2005 A1
20050071568 Yamamoto et al. Mar 2005 A1
20050201409 Griswold et al. Sep 2005 A1
20050216473 Aoyagi Sep 2005 A1
20050216727 Chattopadhyay et al. Sep 2005 A1
20050240749 Clemo et al. Oct 2005 A1
20050243823 Griswold et al. Nov 2005 A1
20060031593 Sinclair Feb 2006 A1
20060091977 Inoue et al. May 2006 A1
20060095512 Noma May 2006 A1
20060143505 Olarig Jun 2006 A1
20060159456 Gumaste et al. Jul 2006 A1
20060209822 Hamamoto et al. Sep 2006 A1
20060212551 Kao et al. Sep 2006 A1
20060242212 Brinkmann et al. Oct 2006 A1
20070005694 Popkin et al. Jan 2007 A1
20070011097 Eckleder Jan 2007 A1
20070050446 Moore Mar 2007 A1
20070050761 Hester et al. Mar 2007 A1
20070055765 Lisiecki et al. Mar 2007 A1
20070058606 Koskelainen Mar 2007 A1
20070073965 Rajakarunanayake Mar 2007 A1
20070079087 Wang et al. Apr 2007 A1
20070186068 Agrawal Aug 2007 A1
20070195772 Shadish Aug 2007 A1
20070214105 Sfarti et al. Sep 2007 A1
20070266220 Nelson Nov 2007 A1
20070271349 Clemo et al. Nov 2007 A1
20080013448 Horie et al. Jan 2008 A1
20080016564 Claudatos et al. Jan 2008 A1
20080037777 Ignatius et al. Feb 2008 A1
20080059495 Kiessig et al. Mar 2008 A1
20080071855 Farber et al. Mar 2008 A1
20080084330 Picard Apr 2008 A1
20080091744 Shitomi et al. Apr 2008 A1
20080095075 Monier Apr 2008 A1
20080101277 Taylor et al. May 2008 A1
20080104085 Papoutsakis et al. May 2008 A1
20080114891 Pereira May 2008 A1
20080144655 Beam et al. Jun 2008 A1
20080151893 Nordmark et al. Jun 2008 A1
20080155094 Roese et al. Jun 2008 A1
20080155252 Nambiar Jun 2008 A1
20080155275 Natarajan et al. Jun 2008 A1
20080155537 Dinta et al. Jun 2008 A1
20080181224 Van Hensbergen et al. Jul 2008 A1
20080222415 Munger et al. Sep 2008 A1
20080222492 Earhart et al. Sep 2008 A1
20080225842 Goldfein et al. Sep 2008 A1
20080225888 Valluri et al. Sep 2008 A1
20080228943 Balus et al. Sep 2008 A1
20080313318 Vermeulen et al. Dec 2008 A1
20090006808 Blumrich et al. Jan 2009 A1
20090063419 Nurminen et al. Mar 2009 A1
20090067322 Shand et al. Mar 2009 A1
20090092124 Singhal et al. Apr 2009 A1
20090141621 Fan et al. Jun 2009 A1
20090204320 Shaffer et al. Aug 2009 A1
20090234933 Fein et al. Sep 2009 A1
20090238167 Fein et al. Sep 2009 A1
20090254567 Fein et al. Oct 2009 A1
20090300635 Ferris Dec 2009 A1
20100185581 Bakalash Jul 2010 A1
20110179131 Fein et al. Jan 2011 A1
20110125721 Fein May 2011 A1
20110138075 Fein Jun 2011 A1
20110167131 Fein Jul 2011 A1
Foreign Referenced Citations (65)
Number Date Country
0 458 567 May 1991 EP
0 722 591 Jun 1999 EP
1 048 998 Nov 2000 EP
1 968 257 Sep 2003 EP
1 357 476 Oct 2003 EP
1406446 Apr 2004 EP
1 802 051 Nov 2006 EP
1322068 Nov 2006 EP
1 746 790 Jan 2007 EP
1 372 316 May 2007 EP
1798934 Jun 2007 EP
1798937 Jun 2007 EP
1826968 Aug 2007 EP
1485787 Oct 2007 EP
1776639 Dec 2007 EP
1479236 Jan 2008 EP
1 931 090 Jun 2008 EP
56-116144 Sep 1981 JP
56-116145 Sep 1981 JP
61-165889 Jul 1986 JP
06-068047 Mar 1994 JP
10-254761 Sep 1998 JP
11-065911 Mar 1999 JP
2002-268952 Sep 2002 JP
2003-296176 Oct 2003 JP
2003-296179 Oct 2003 JP
2005-070987 Mar 2005 JP
2005-216241 Aug 2005 JP
2005-310126 Nov 2005 JP
2005-339325 Dec 2005 JP
2007-304665 Nov 2007 JP
2007-310673 Nov 2007 JP
2008-052340 Mar 2008 JP
2008-192129 Aug 2008 JP
2011-519097 Jun 2011 JP
WO 9404991 Mar 1994 WO
WO 0167303 Sep 2001 WO
WO 02052417 Jul 2002 WO
WO 2004059529 Jul 2004 WO
WO 2005062578 Jul 2005 WO
WO 2006115594 Nov 2006 WO
WO 2006124084 Nov 2006 WO
WO 2006124217 Nov 2006 WO
WO 2007001631 Jan 2007 WO
WO 2009021289 Feb 2007 WO
WO 2007031593 Mar 2007 WO
WO 2008006079 Jan 2008 WO
WO 2008070958 Jun 2008 WO
WO 2008094930 Aug 2008 WO
WO 2008108699 Sep 2008 WO
WO 2008109390 Sep 2008 WO
WO 2009036171 Sep 2009 WO
WO 2009117259 Sep 2009 WO
WO 2009126418 Oct 2009 WO
WO 2009132345 Oct 2009 WO
WO 2009137571 Nov 2009 WO
WO 2010005928 Jan 2010 WO
WO 2010005935 Jan 2010 WO
WO 2010014368 Feb 2010 WO
WO 2010036712 Apr 2010 WO
WO 2010036881 Apr 2010 WO
WO 2010036883 Apr 2010 WO
WO 2010036886 Apr 2010 WO
WO 2010036887 Apr 2010 WO
WO 2010036891 Apr 2010 WO
Non-Patent Literature Citations (93)
Entry
Japanese Office Action dated Apr. 13, 2012, re JP App. No. 2011-517515.
U.S. Notice of Allowance re U.S. Appl. No. 12/052,345, dated Apr. 2, 2012.
Akasaka, Tsutomu, “Remote Copy Technology of ETERNUS6000 and ETERNUS3000 Disk Arrays”, Fujitsu Sci. Tech. J., Jan. 2006, vol. 42, Issue 1, pp. 9-16.
Amazon Elastic Compute Cloud (Amazon EC2)—Limited Beta, Amazon.com: Amazon EC2, Amazon Elastic Compute Cloud, Virtual Grid Computing: . . . p. 1 of 9, http://web.archive.org/web/20070705164650rn—2/www.amazon.com/b?ie=UTF8&node=2 . . . Jun. 18, 2010.
Aref, et al.: “Nile: A Query Processing Engine for Data Streams”, Department of Computer Sciences Purdue University, West Lafayette, IN., USA, Data Engineering, 2004. Proceedings. 20th International Conference on Mar. 30-Apr. 2, 2004.
Ari, Ismail: “Design and Management of Globally-Distributed Network Caches”, University of California Santa Cruz, Sep. 2004, 220 pages.
Cheeha Kim, “An Efficient Multicast Data Forwarding Scheme for Mobile Ad Hoc Networks”, Information Networking, Convergence in Broadband and Mobile Networking, International Conf., Lecture Notes in Computer Science, Jan. 31-Feb. 2, 2005, vol. 3391/2005, 510-519, DOI: 10.1007/978-3-540-30582-8—53.
EPO Exam Report re App. No. 09723251.6, dated Nov. 11, 2010.
Ertaul et al.: “ECC Based Threshold Cryptography for Secure Data Forwarding and Secure Key Exchange in MANET (I)”, LNCS 3462, pp. 102-113, Networking 2005, May 2-6, 2005 University of Waterloo, Waterloo Ontario Canada.
Ertaul et al: “Implementation of Homomorphic Encryption Schemes for Secure Packet Forwarding in Mobile Ad Hoc Networks (MANETs)”, IJCSNS, vol. 7, Issue No. 11, pp. 132-141, Nov. 2007.
Girao et al.: “TinyPEDS: Tiny Persistent Encrypted Data Storage in Asynchronous Wireless Sensor Networks”, Ad Hoc Networks, vol. 5, Issue 7, p. 1073-1089 (Sep. 2007).
Hoke, et al.: “InteMon: Continuous Mining of Sensor Data in Large-scale Self- Infrastructures”, Carnegie Mellon University. Appears in ACM SIGOPS Operating Systems Review, 40(3): pp. 38-44. ACM Press, Jul. 2006.
Huang et al., “Secure Data Forwarding in Wireless Ad Hoc Networks”, IEEE International Conference, May 16-20, 2005, pp. 3535-3531, vol. 5.
Ito, Takeshi et al.,, “Technologies of ETERNUSVS900 Storage Virtualization Switch”, Fujitsu Sci. Tech. J., Jan. 2006, vol. 42, Issue 1, pp. 17-23.
Ji, Lusheng et al., “On Providing Secure and Portable Wireless Data Networking Services: Architecture and Data Forwarding Mechanisms”, IPSJ Journal, Oct. 2004, vol. 45, Issue 10, pp. 2261-2269.
Kim, Youngmin, “An Efficient Multicast Data Forwarding Scheme for Mobile Ad Hoc Networks”, Information Networking, Convergence in Broadband and Mobile Networking, International Conf., 2005, vol. ICOIN 2005, Jeju Island, Korea, Jan. 31-Feb. 2, 2005.
Komandur et al., “SPAM: A Data Forwarding Model for Multipoint-to-Multipoint Connection Support in ATM Networks”, IC3N, IEEE Computer Society, Sep. 1997, pp. 1-7.
Mellor, Chris: “Storage in the cloud—Doppler shift or marketing gloss?”, Storage in the cloud—Feature—Techworld.com, Published: 12:00, Dec. 18, 2007, http://features.techworld.com/storage/3893/storage-in-the-cloud/.
PCT International Preliminary Report and Report on Patentability re App. No. PCT/US2009/49763, dated Jan. 20, 2011.
PCT International Preliminary Report on Patentability and Written Opinion re App. No. PCT/US2009/041817, dated Oct. 26, 2010.
PCT International Preliminary Report on Patentability and Written Opinion re App. No. PCT/US2009/042971, dated Nov. 9, 2010.
PCT International Preliminary Report on Patentability and Written Opinion re App. No. PCT/US2009/49755, dated Jan. 20, 2011.
PCT International Preliminary Report on Patentability and Written Opinion re App. No. PCT/US2009/58052, dated Mar. 29, 2011.
PCT International Preliminary Report on Patentability and Written Opinion re App. No. PCT/US2009/58364, dated Mar. 29, 2011.
PCT International Preliminary Report on Patentability and Written Opinion re App. No. PCT/US2009/58367, dated Mar. 29, 2011.
PCT International Preliminary Report on Patentability and Written Opinion re App. No. PCT/US2009/58368, dated Mar. 29, 2011.
PCT International Preliminary Report on Patentability and Written Report re App. No. PCT/US2009/58376, dated Mar. 29, 2011, mailed on Apr. 7, 2011.
PCT International Report on Patentability and Written Opinion Re PCT/US2009/036171 dated Sep. 21, 2010.
PCT International Report on Patentability and Written Opinion re PCT/US2009/037579, dated Oct. 12, 2010.
PCT International Report on Patentability re App. No. PCT/US2009/50008, dated Feb. 10, 2011.
PCT International Search Report and Written Opinion, PCT/US2009/036171, dated Sep. 4, 2009 in 13 pgs.
PCT International Search Report and Written Opinion, PCT/US2009/037579, dated Jun. 24, 2009, 12 pages.
PCT International Search Report re App. No. PCT/US2009/41817, dated Jun. 30, 2009.
PCT International Search Report re App. No. PCT/US2009/42971, dated Jun. 24, 2009.
PCT International Search Report re App. No. PCT/US2009/49755, dated Aug. 7, 2009.
PCT International Search Report re App. No. PCT/US2009/49763, dated Oct. 16, 2009.
PCT International Search Report re App. No. PCT/US2009/50008, dated Aug. 11, 2009.
PCT International Search Report re App. No. PCT/US2009/58052, dated Nov. 4, 2009.
PCT International Search Report re App. No. PCT/US2009/58362, dated Nov. 2, 2009.
PCT International Search Report re App. No. PCT/US2009/58368, dated Oct. 26, 2009.
PCT International Search Report re App. No. PCT/US2009/58376, dated Oct. 28, 2009.
PCT International Search Report, re App. No. PCT/US2009/58364, dated Nov. 4, 2009.
PCT International Search Report, re App. No. PCT/US2009/58367, dated Oct. 26, 2009.
Sharma, et al.: “Data Warehouse and Olap Technology Part-1”, power point presentation, first cited on Sep. 29, 2008 in U.S. Appl. No. 12/241,003.
Stefansson, et al.: “MyriadStore: Technical Report”, Swedish Institute of Computer Science (SICS), Technical Report T2006:09, ISSN 1100-3154, ISRN: SCIS-T02006/09-SE. May 3, 2006 in 13 pages.
U. S. Non-Final Office Action mailed May 14, 2009, re U.S. Appl. No. 12/132,804.
U. S. Notice of Allowance mailed Aug. 7, 2008, re U.S. Appl. No. 12/046,757.
U. S. Notice of Allowance mailed Jul. 15, 2009, re U.S. Appl. No. 12/132,804.
U. S. Notice of Allowance mailed Jul. 26, 2010, re U.S. Appl. No. 12/240,802.
U. S. Notice of Allowance mailed Sep. 15, 2010, re U.S. Appl. No. 12/099,498.
U. S. Office Action re U.S. Appl. No. 12/240,757, dated Jun. 22, 2009.
U.S. Non-Final Office Action mailed Apr. 16, 2010, re U.S. Appl. No. 12/099,498.
Wagner, et al.: “A Network Application Programming Interface for Data Processing in Sensor Networks”, Rice University Technical Report TREE0705. 10 pages, Submitted to IPSN (Jan. 2007)—http://www.citeulike.org/user/leosteinfeld/article/5146294.
European Extended Search Report, re EP Application No. 09795041, dated Oct. 11, 2011.
Pakkala, D. et al.: “Towards a Peer-to-Peer Extended Content Delivery Network”, pp. 1-5, XP002615892, retrieved from the Internet: Url:http://www.eurasip.org/Proceedings/Ext/IST05/papers/99.pdf on Jan. 7, 2011.
Pierre, G. et al.: “Globule: A Collaborative Content Delivery Network”, IEEE Communications Magazine, vol. 44, No. 8, Aug. 1, 2006, pp. 127-133.
Tanenbaum, Andrew S.: “Network Protocols”, Computing Surveys, vol. 13, No. 4, Dec. 1, 1981, pp. 453-489.
EPO, Extended Search Report re EPO App. No. 09734559.9, dated Jul. 25, 2011.
European Extended Search Report, re EP Application No. 09816904.8, dated Feb. 6, 2012.
Japanese Office Action re JP Application No. 2011-529255, dated Apr. 26, 2012.
Japanese Office Action, re JP App. No. 2011-529258, dated Apr. 26, 2012.
Purczynski, et al.: “Juggling with packets: floating data storage,” Internet Archive, Oct. 2003. [retrieved on Apr. 25, 2012]. Retrieved from the Internet: <URL: http://web.archive.org/web/20031017082346/http://lcamtuf.coredump.cx/juggling—with—packets.txt>.
Australian Office Action, re AU Application No. 2009-268716, dated Feb. 29, 2012.
Japanese Office Action, re JP Application No. 2011-506496, dated Mar. 21, 2012.
U.S. Notice of Allowance re U.S. Appl. No. 12/052,345, dated Dec. 29, 2011.
Australian Office Action re AU Application No. 2009240392, dated May 1, 2012.
Australian Office Action re AU Application No. 2009268792, dated Jun. 8, 2012.
Australian Office Action, re AU Application No. 2009296496, dated May 23, 2012.
Japanese Office Action (Notice of Rejection), re JP Application No. JP 2011-500858, dated May 29, 2012.
Japanese Office Action re JP Application No. JP 2011-521163, dated May 23, 2012.
Korean Office Action, re KR Application No. 10-2011-7000703, dated Jul. 16, 2012.
Wojciech Purczynski et al.: “Juggling with packets: floating data storage”, Internet Archive, Oct. 2003. [retrieved on Apr. 25, 2012]. Retrieved from the Internet:<URL: http://web.archive.org/web/20031017082346/http://lcamtuf.coredump.cx/juggling—with—packets.txt.
Japanese Office Action, re JP Application No. 2011-504044, dated Sep. 4, 2012.
European Office Action, re EP Application No. 09795041, dated Aug. 9, 2012.
U. S. Interview Summary mailed Aug. 8, 2012, re U.S. Appl. No. 12/989,638.
U. S. Office Action re U.S. Appl. No. 13/003,505, dated Aug. 22, 2012.
U.S. Interview Summary mailed Aug. 6, 2012, re U.S. Appl. No. 12/991,383.
U.S. Interview Summary mailed Aug. 6, 2012, re U.S. Appl. No. 13/057,072.
U.S. Interview Summary mailed Aug. 6, 2012, re U.S. Appl. No. 13/119,124.
U.S. Interview Summary mailed Aug. 7, 2012, re U.S. Appl. No. 13/119,122.
U.S. Interview Summary mailed Aug. 7, 2012, re U.S. Appl. No. 13/119,147.
U.S. Interview Summary re U.S. Appl. No. 13/119,133, dated Aug. 7, 2012.
U.S. Notice of Allowance mailed Aug. 31, 2012, re U.S. Appl. No. 13/119,133.
U.S. Office Action re U.S. Appl. No. 12/052,345, dated Oct. 4, 2011.
Australian Office Action re AU Application No. 2009268792, dated Nov. 13, 2012.
Australian Office Action (Exam Report No. 2) re AU Application No. 2009240392, dated Sep. 25, 2012.
European Extend Search Report, re EP Application No. 09743557.2, dated Nov. 9, 2012.
Japanese Decision of Rejection re JP Application No. 2011-529255, dated Nov. 14, 2012.
Japanese Office Action re JP Application No. 2011-508626, dated Sep. 27, 2012.
U. S. Interview Summary re U.S. Appl. No. 13/003,505, dated Sep. 20, 2012.
U.S. Notice of Allowance mailed Sep. 17, 2012, re U.S. Appl. No. 13/057,072.
U.S. Notice of Allowance re U.S. Appl. No. 12/989,638, dated Nov. 5, 2012.
U.S. Notice of Allowance mailed Dec. 6, 2012, re U.S. Appl. No. 12/052,345.
Related Publications (1)
Number Date Country
20110173069 A1 Jul 2011 US
Continuations (1)
Number Date Country
Parent 12170925 Jul 2008 US
Child 13003502 US