Redundant data forwarding storage

Information

  • Patent Grant
  • 8909738
  • Patent Number
    8,909,738
  • Date Filed
    Thursday, May 30, 2013
    12 years ago
  • Date Issued
    Tuesday, December 9, 2014
    10 years ago
Abstract
Methods and apparatus, including computer program products, for redundant data forwarding are described. In one respect, the method includes intermittently forwarding the portion of the data among the first memory and memories of other nodes in the first network without storing the portion of data on any physical storage device of the interconnected nodes in the first network. The method may also include intermittently forwarding the first copy of the portion of the data among the second memory and memories of other nodes in the second network without storing the first copy of the portion of the data on any physical storage device of the interconnected nodes in the second network.
Description
FIELD AND BACKGROUND

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


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 redundant data forwarding.


In general, in one aspect, the invention features a method including, in two or more networks of interconnected computer system nodes, receiving a request from a source system in a first network to store data, directing the data to a first computer memory in a first network, directing a first copy of the data to a second computer memory in a second network, continuously forwarding the data from the first computer memory to other computer memories in the first network without storing on any physical storage device in the first network, and continuously forwarding the first copy of the data from the second computer memory to other computer memories in the second network without storing on any physical storage device in the second network.


In another aspect, the invention features a system including, at least two networks wherein computer system nodes are each adapted to receive data and copies of data and continuously forward the data and copies of data from computer memory to computer memory without storing on any physical storage device in response to a request to store data from a 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 system.



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.





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 redundant data forwarding system, i.e., data and copies of data are stored by continually forwarding it from one node memory to another node memory. Copies of data may continuously forwarded in one or more networks.


As shown in FIG. 1, an exemplary system 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 system 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 system 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 system 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.


In one example, nodes 14, 16, 18, 20 and 22 can be considered a private network. In a private network, an administrator controls the nodes and may designate which node is the central server. The system 10 can also include one or more additional nodes. For example, nodes 24, 26 and 28. These nodes 24, 26 and 28 may be considered to be part of one or more public networks in which the administrator has little or no control.


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 copies of data, which are used to provide redundancy, are stored locally or on remote physical storage devices such as disk drives. 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 and does not use physical data storage to provide data redundancy. 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 system 10 where it is then continuously forwarded from node memory to node memory in the system 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 request to store data makes at least one copy of the data, which is directed to a node in a secondary private or public network, or directed to nodes on more than one network, where it too is continuously forwarded from node memory to node memory in the secondary private or public network. The forwarded data resides only for a very brief period of time in the memory of any one node in the system 10. Data and copies of data are not stored on any physical storage medium in any network node.


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 system 10, is retrieved.


Data forwarded in this manner can be segmented and segments forwarded as described above. Still, 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) first address of a node and a second address of a node from the central server 14 and forwards (106) the data to the node memory represented by the received first address and a copy of the data to the node memory represented by the received second address.


As shown in FIG. 5, data forwarding process 200 includes receiving (202) a request from a source system in a first network to store data.


Process 200 directs (204) the data to the first computer memory in a first network and directs (206) a first copy of the data to a second computer memory in a second network. Directing (206) may be to node memories in one or more networks, both private and/or public.


Process 200 continuously forwards (208) the data from the first computer memory to other computer memories in the first network without storing on any physical storage device in the first network.


Continuously forwarding (208) includes detecting a presence of the data in memory of the specific node of the first network and forwarding the data to another computer memory of a node in the first network of interconnected computer system nodes without storing any physical storage device.


Process 200 continuously forwards (210) the first copy of the data from the second computer memory to other computer memories in the second network without storing on any physical storage device in the second network.


Continuously forwarding (210) includes detecting a presence of the first copy of data in memory of the specific node of the second network, and forwarding the first copy of the data to another computer memory of a node in the second network of interconnected computer system nodes without storing any physical storage device.


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.


New nodes and node states may be added and/or deleted from the system 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 system 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 and copies of data are passed, routed, forwarded from node memory to node memory. The data and copies of 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 redundant data storage and management system where the redundant data is never fixed in physical storage, but in fact, is continually being routed/forwarded from node memory to node memory. The path of the nodes to which redundant 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.


The invention can be implemented to realize one or more of the following advantages. One or more networks create redundant data storage without caching or downloads. Redundant data storage and management are accomplished via a constant routing of the redundant 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 computerized method comprising: receiving a request from a source node to store data, wherein the source node is outside of a first network of interconnected nodes that are configured to store one or more portions of the data and the source node is outside of a second network of interconnected nodes that are configured to store one or more portions of the data, each of the interconnected nodes in the first network and the second network comprising a memory;directing at least a portion of the data to a first memory of a first node in the first network;directing a first copy of the portion of the data to a second memory of a second node in the second network;intermittently forwarding the portion of the data among the first memory and memories of other nodes in the first network without storing the portion of the data on any physical storage device of the interconnected nodes in the first network, wherein the interconnected nodes in the first network to which the portion of the data is forwarded are determined dynamically based at least in part on status of one or more of the interconnected nodes in the first network or previous paths used for forwarding one or more portions of the data; andintermittently forwarding the first copy of the portion of the data among the second memory and memories of other nodes in the second network without storing the first copy of the portion of the data on any physical storage device of the interconnected nodes in the second network, wherein the interconnected nodes in the second network to which the first copy of the portion of the data is forwarded are determined dynamically,wherein physical storage devices include one or more of hard disks, magnetic disks, magnetic tape, magneto optical disks, or optical disks.
  • 2. The computerized method of claim 1 further comprising: directing a second copy of the portion of the data to a third memory of a third node in a third network of interconnected nodes; andintermittently forwarding the second copy of the portion of the data among the third memory and memories of other nodes in the third network without storing the second copy of the data on any physical storage device of the interconnected nodes in the third network.
  • 3. The computerized method of claim 1, wherein each of the networks comprise one or more of a private network and a public network.
  • 4. The computerized method of claim 1 wherein at least one of said intermittently forwarding of the portion of the data and said intermittently forwarding of the first copy of the portion of the data comprises: determining a first address of a first available node in the first network to receive the portion of the data based on one or more first factors;determining a second address of a second available node in the second network to receive the first copy of the portion of the data based on one or more second factors;sending a first message to a first specific node of the first network associated with memory that contains the portion of the data, the first message comprising the first address of the first available node and a request to forward the portion of the data; andsending a second message to a second specific node of the second network associated with memory that contains the first copy of the portion of the data, the second message comprising the second address of the second available node and a request to forward the first copy of the portion of the data.
  • 5. The computerized method of claim 4 wherein the one or more first factors and the one or more second factors comprise network traffic analysis and available memory.
  • 6. The computerized method of claim 1 wherein at least one of said intermittently forwarding of the portion of the data and said intermittently forwarding of the first copy of the portion of the data comprises: detecting presence of the portion of the data in a first specific memory of a first specific node of the first network;forwarding the portion of the data to a second specific memory of a second specific node in the first network without storing the portion of the data on any physical storage device of the interconnected nodes of the first network;detecting presence of the first copy of the portion of the data in a third specific memory of a third specific node of the second network; andforwarding the first copy of the portion of the data to a fourth specific memory of a fourth node in the second network without storing the first copy of the portion of the data on any physical storage device of the interconnected nodes of the second network.
  • 7. The computerized method of claim 6 further comprising: associating one or more specific users with the portion of the data; andretrieving the portion of the data in response to receiving a retrieval request for the data from one of the specific users.
  • 8. A non-transitory computer readable medium configured to store software code that is readable by a computing system having one or more processors, wherein the software code is executable on the computing system in order to cause the computing system to perform operations comprising: receiving a request to store data from a source node that is not part of a first network of interconnected nodes or a second network of interconnected nodes;intermittently forwarding at least a portion of the data between memories of the interconnected nodes in the first network without storing the portion of the data on any physical storage device of the interconnected nodes in the first network, wherein the interconnected nodes in the first network to which the portion of the data is forwarded are determined dynamically based at least in part on status of one or more of the interconnected nodes in the first network or previous paths used for forwarding one or more portions of the data; andintermittently forwarding a first copy of the portion of the data between memories of the interconnected nodes in the second network without storing the first copy of the portion of the data on any physical storage device of the interconnected nodes in the second network, wherein the interconnected nodes in the second network to which the first copy of the portion of the data is forwarded are determined dynamically,wherein physical storage devices include one or more of hard disks, magnetic disks, magnetic tape, magneto optical disks, or optical disks.
  • 9. The non-transitory computer readable medium of claim 8 wherein the operations further comprise intermittently forwarding a second copy of the portion of the data between memories of the interconnected nodes in a third network without storing the second copy of the portion of the data on any physical storage device of the interconnected nodes in the third network.
  • 10. The non-transitory computer readable medium of claim 8 wherein at least one of said intermittently forwarding of the portion of the data and said intermittently forwarding of the first copy of the portion of the data comprises: determining a first address of a first node in the first network that is available to receive the portion of the data, wherein the determination is based on one or more factors;sending a message to a specific node that is associated with memory that contains the portion of the data, the message comprising the address of the first node and a request to forward the portion of the data to the first node; andapplying a time stamp to the portion of the data in memory of the first node in the first network.
  • 11. The non-transitory computer readable medium of claim 10 wherein the one or more factors comprise network traffic analysis and available memory.
  • 12. The non-transitory computer readable medium of claim 10 wherein at least one of said intermittently forwarding the data of the portion of the data and said intermittently forwarding of the first copy of the portion of the data further comprises: detecting a presence of the portion of the data in a memory of the specific node; andforwarding the portion of the data to memory of the first node in the first network from the memory of the specific node of the first network that contains the portion of the data without storing the portion of the data on any physical storage device of the interconnected nodes of the first network.
  • 13. The non-transitory computer readable medium of claim 12 wherein the operations further comprise: associating one or more specific users with the portion of the data; andretrieving the portion of the data in response to receiving a request for the data from one of the specific users.
  • 14. The non-transitory computer readable medium of claim 10 wherein the first copy of the portion of the data is sent to a private network selected by a user or user application.
  • 15. A system comprising: at least two networks of interconnected nodes, each node comprising a memory and each node being configured to receive one or more portions of data or a copy of one or more portions of the data from other memories of nodes within the respective network,wherein each of the interconnected nodes is further configured to intermittently forward the portion of the data or the copy of the portion of the data among the memories of the interconnected nodes of the respective network without storing the portion of the data or the copy of the portion of the data on any physical storage device associated with the interconnected nodes of the respective network, andwherein the interconnected nodes to which the portion of the data or the copy of the portion of the data is forwarded are determined dynamically based at least in part on status of one or more of the interconnected nodes or previous paths used for forwarding one or more portions of the data or a copy of one or more portions of the data,wherein physical storage devices include one or more of hard disks, magnetic disks, magnetic tape, magneto optical disks, or optical disks.
  • 16. The system of claim 15 wherein at least one node of the interconnected nodes is adapted to encrypt the portion of the data or the copy of the portion of the data.
  • 17. The system of claim 15 wherein at least one node of the interconnected nodes is adapted to intermittently forward a second copy of the portion of the data between memories of the interconnected nodes in a third network without storing the second copy of the portion of the data on any physical storage device of the interconnected nodes in the third network.
  • 18. A computer system comprising: a computer memory;at least one network interface configured to allow the computer system to communicate with two or more networks of interconnected nodes, each of the interconnected nodes in the two or more networks comprising a memory; anda processor configured to: direct at least a portion of data to a first memory of a node in a first network from a source node, wherein the source node is not in the two or more networks; andinitiate intermittent forwarding of the portion of the data among the first memory and other memories of interconnected nodes of the first network without storing the portion of the data on any physical storage device of the interconnected nodes in the first network,wherein the interconnected nodes in the first network to which the portion of the data is forwarded are determined dynamically based at least in part on status of one or more of the interconnected nodes in the first network or previous paths used for forwarding one or more portions of the data,wherein physical storage devices include one or more of hard disks, magnetic disks, magnetic tape, magneto optical disks, or optical disks.
  • 19. The computer system of claim 18, wherein the processor of the computer system is further configured to: detect a presence of the portion of the data in a first specific memory of a first specific node in the first network;determine based on one or more factors an address of a second memory of a second node in the first network, wherein the second memory is available to receive the portion of the data; andsend a message to the first specific node in the first network, the message comprising an address of the second memory and a request to forward the portion of the data to the second memory.
  • 20. The computer system of claim 19, wherein the processor is further configured to: associate one or more specific users with the portion of the data; andretrieve the portion of the data in response to receiving a request for the data from one of the specific users.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 12/052,345, filed Mar. 20, 2008, entitled “Redundant Data Forwarding Storage,” herein incorporated by reference in its entirety. Any and all priority claims identified in the Application Data Sheet, or any correction thereto, are hereby incorporated by reference under 37 C.F.R. §1.57.

US Referenced Citations (182)
Number Name Date Kind
3786424 McVoy et al. Jan 1974 A
5751928 Bakalash May 1998 A
5774553 Rosen Jun 1998 A
5787258 Costa et al. Jul 1998 A
5978485 Rosen Nov 1999 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
7061925 Joshi Jun 2006 B2
7103824 Halford Sep 2006 B2
7120631 Vahalia et al. Oct 2006 B1
7136638 Wacker et al. Nov 2006 B2
7139820 O'Toole, Jr. et al. Nov 2006 B1
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
7218952 Alperovich et al. May 2007 B1
7240214 Gazzetta et al. Jul 2007 B2
7257817 Cabrera et al. Aug 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
7415506 Gajjar et al. Aug 2008 B2
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
7457835 Toebes et al. Nov 2008 B2
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
7707287 Shafir et al. Apr 2010 B2
7783608 Shitomi Aug 2010 B2
7844695 Fein et al. Nov 2010 B2
7865586 Cohn Jan 2011 B2
7877456 Fein et al. Jan 2011 B2
7924888 Schultze et al. Apr 2011 B2
7974645 Choi-Grogan Jul 2011 B2
8266237 Moore et al. Sep 2012 B2
8352635 Fein et al. Jan 2013 B2
8386585 Fein et al. Feb 2013 B2
8452844 Fein et al. May 2013 B2
8458285 Fein et al. Jun 2013 B2
8554866 Fein et al. Oct 2013 B2
8599678 Fein et al. Dec 2013 B2
20020059444 Shinno May 2002 A1
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
20050131984 Hofmann et al. Jun 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
20060091007 Inoue et al. May 2006 A1
20060095512 Noma May 2006 A1
20060143505 Olarig et al. 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
20070171832 Agmon et al. Jul 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 Dinda 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
20090036171 Palenius Feb 2009 A1
20090063187 Johnson et al. Mar 2009 A1
20090063419 Nurminen et al. Mar 2009 A1
20090067322 Shand et al. Mar 2009 A1
20090092124 Singhal et al. Apr 2009 A1
20090104978 Ben-Ami Apr 2009 A1
20090141621 Fan et al. Jun 2009 A1
20090204320 Shaffer et al. Aug 2009 A1
20090228593 Takeda Sep 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
20110125721 Fein May 2011 A1
20110138075 Fein Jun 2011 A1
20110167131 Fein Jul 2011 A1
20110179131 Fein Jul 2011 A1
20130124336 Fein May 2013 A1
Foreign Referenced Citations (98)
Number Date Country
2009296500 Jan 2013 AU
2009296744 Jan 2013 AU
2009240392 Feb 2013 AU
2009244352 Feb 2013 AU
2009276965 Feb 2013 AU
2009296495 Feb 2013 AU
2009268716 Mar 2013 AU
2009296496 Mar 2013 AU
2009225859 Sep 2013 AU
2009268792 Oct 2013 AU
2009296490 Nov 2013 AU
1529964 Sep 2004 CN
1823506 Aug 2006 CN
1855857 Nov 2006 CN
101188569 May 2008 CN
101330451 Dec 2008 CN
0 458 567 May 1991 EP
0 722 591 Jun 1999 EP
1 048 998 Nov 2000 EP
1 266 308 Dec 2002 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-013857 Feb 1981 JP
56-116144 Sep 1981 JP
56-116145 Sep 1981 JP
60-241346 Nov 1985 JP
61-165889 Jul 1986 JP
06-021953 Jan 1994 JP
06-068047 Mar 1994 JP
10-254761 Sep 1998 JP
11-065911 Mar 1999 JP
2002-510409 Apr 2002 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-275937 Oct 2005 JP
2005-310126 Nov 2005 JP
2005-339325 Dec 2005 JP
2007-304665 Nov 2007 JP
2007-310673 Nov 2007 JP
2008-033406 Feb 2008 JP
2008-052340 Mar 2008 JP
2008-516304 May 2008 JP
2008-192129 Aug 2008 JP
2008-537258 Sep 2008 JP
2011-519097 Jun 2011 JP
2011-523120 Aug 2011 JP
2011-528141 Nov 2011 JP
WO 9404991 Mar 1994 WO
WO 9719427 May 1997 WO
WO 9719427 May 1997 WO
WO 0167303 Sep 2001 WO
WO 02052417 Jul 2002 WO
WO 03009544 Jan 2003 WO
WO 2004059529 Jul 2004 WO
WO 2005034441 Apr 2005 WO
WO 2005062578 Jul 2005 WO
WO 2006026567 Mar 2006 WO
WO 2006115594 Nov 2006 WO
WO 2006124084 Nov 2006 WO
WO 2006124217 Nov 2006 WO
WO 2007001631 Jan 2007 WO
WO 2007019689 Feb 2007 WO
WO 2009021289 Feb 2007 WO
WO 2007031593 Mar 2007 WO
WO 2008006079 Jan 2008 WO
WO 2008013036 Jan 2008 WO
WO 2008070958 Jun 2008 WO
WO 2008094930 Aug 2008 WO
WO 2008108699 Sep 2008 WO
WO 2008109390 Sep 2008 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 (136)
Entry
Australian Exam Report, re AU Application No. 2009296500, dated Oct. 24, 2012.
Canadian Office Action, re CA Application No. CA 2,727,457, dated May 9, 2013.
Canadian Office Action, re CA Application No. CA 2722,415, dated Mar. 25, 2013.
Japanese Office Action dated Mar. 19, 2013, re JP App. No. 2011-517515. w/Machine Trans.
Japanese Office Action re JP Application No. 2011-529256, dated Mar. 12, 2013.
Japanese Office Action, re JP Application No. 2011-506496, dated Mar. 8, 2013.
Korean Notice of Allowance re KR Application No. KR 10-2011-7009321, dated Apr. 30, 2103.
Korean Notice of Allowance, re KR Patent Application No. KR 10-2011-7009318, dated Mar. 19, 2013.
U. S. Interview Summary re U.S. Appl. No. 13/003,505, dated May 8, 2013.
U.S. Notice of Allowance re U.S. Appl. No. 13/119,122, dated Mar. 5, 2013.
U.S. Notice of Allowance re U.S. Appl. No. 13/119,124, dated Mar. 15, 2013.
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.
Australian Office Action (Exam Report No. 2) re AU Application No. 2009240392, dated Sep. 25, 2012.
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 AUu Application No. 2009268792, dated Nov. 13, 2012.
Australian Office Action, re AU Application No. 2009-268716, dated Feb. 29, 2012.
Australian Office Action, re AU Application No. 2009276965, dated Mar. 22, 2012.
Australian Office Action, re AU Application No. 2009296490, issued Feb. 4, 2013.
Australian Office Action, re AU Application No. 2009296495, dated Apr. 5, 2012.
Australian Office Action, re AU Application No. 2009296496, dated May 23, 2012.
Australian Office Action, re AU Application No. 2009296500, dated Apr. 13, 2012.
Australian Office Action, re AU Application No. 2009296744, dated Apr. 19, 2012.
Canadian Office action, re CA Application No. CA 2,738,634, dated Dec. 20, 2013.
Canadian Office Action, re CA Application No. CA 2722,415, dated Feb. 18, 2014.
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.
Chinese Notice of Rejection, re CN Application No. 200980109783.4, dated Nov. 20, 2013. (With Machine Translation).
Chinese Office Action, re CN Application No. 200980126972.2, dated Mar. 17, 2014 (with machine translation).
Chinese Office Action, re CN Application No. 200980126972.2, dated Sep. 2, 2013. w/machine translation.
Chinese Office Action, Second, re CN Application No. 200980138485.8, dated May 30, 2013.
Chou, et al.: “Dynamic route mainenance for geographic forwarding in mobile ad hoc networks,” Computer Networks 52 (2008) 418-431.
EPO Exam Report re App. No. 09723251.6, dated Nov. 11, 2010.
EPO, Extended Search Report re EPO App. No. 09734559.9, dated Jul. 25, 2011.
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.
European Extended Search Report, re EP Application No. 09743557.2 dated Nov. 9, 2012.
European Extended Search Report, re EP Application No. 09795041, dated Oct. 11, 2011.
European Extended Search Report, re EP Application No. 09816904.8, dated Feb. 6, 2012.
European Office Action, re EP Application No. 09795041, dated Aug. 9, 2012.
European Supplemental Search Report, re EP Application No. 09795034.9, dated Nov. 7, 2011.
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).
Hirose, et al., “Computer Software Dictionary,” Japan, Maruzen Company, Limited, Apr. 5, 1996, third printing, pp. 92-93 and 106-107.
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.
Japanese Decision of Rejection re JP Application No. 2011-529255, dated Nov. 14, 2012.
Japanese Office Action (Notice of Rejection), re JP Application No. JP 2011-500858, dated May 29, 2012.
Japanese Office Action dated Apr. 13, 2012, re JP App. No. 2011-517515.
Japanese Office Action re JP Application No. 2011-529185, dated Aug. 22, 2013.
Japanese Office Action re JP Application No. 2011-529185, dated Jan. 23, 2013.
Japanese Office Action re JP Application No. 2011-529255, dated Apr. 26, 2012.
Japanese Office Action re JP Application No. 2011-529256, dated Aug. 22, 2013.
Japanese Office Action re JP Application No. JP 2011-517508, dated Aug. 2, 2013.
Japanese Office Action re JP Application No. JP 2011-517508, dated Feb. 27, 2013.
Japanese Office Action re JP Application No. JP 2011-517508, dated Feb. 4, 2014.
Japanese Office Action re JP Application No. JP 2011-521163, dated May 23, 2012.
Japanese Office Action re JP Application No. 2011-508626, dated Sep. 27, 2012.
Japanese Office Action, re JP App. No. 2011-529258, dated Apr. 26, 2012.
Japanese Office Action, re JP Application No. 2011-504044, dated Sep. 4, 2012.
Japanese Office Action, re JP Application No. 2011-506496, dated Mar. 21, 2012.
Japanese Office Action, re JP Application No. 2011-529253, dated Feb. 13, 2013.
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.
Korean Office Action, re KR Application No. 10-2011-7000703, dated Jul. 16, 2012.
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/.
Na, et al.: “GLR: A novel geographic routing scheme for large wireless ad hoc networks,” Computer Networks 50 (2006) 3434-3448.
Pakkala, 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.
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.
Pierre, et al.: “Globule: A Collaborative Content Delivery Network”, IEEE Communications Magazine, vol. 44, No. 8, Aug. 1, 2006, pp. 127-133.
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.
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.
Tanenbaum, Andrew S.: “Network Protocols”, Computing Surveys, vol. 13, No. 4, Dec. 1, 1981, pp. 453-489.
U. S. Interview Summary mailed Aug. 8, 2012, re U.S. Appl. No. 12/989,638.
U. S. Interview Summary re U.S. Appl. No. 13/003,505, dated Sep. 20, 2012.
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. Office Action re U.S. Appl. No. 13/003,505, dated Aug. 22, 2012.
U. S. Office Action re U.S. Appl. No. 13/003,505, dated Feb. 11, 2013.
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/003,502.
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. Non-Final Office Action mailed Apr. 16, 2010, re U.S. Appl. No. 12/099,498.
U.S. Notice of Allowance mailed Aug. 31, 2012, re U.S. Appl. No. 13/119,133.
U.S. Notice of Allowance mailed Dec. 14, 2012, re U.S. Appl. No. 12/991,383.
U.S. Notice of Allowance mailed Dec. 6, 2012, re U.S. Appl. No. 12/052,345.
U.S. Notice of Allowance mailed Jul. 25, 2013, re U.S. Appl. No. 13/003,505.
U.S. Notice of Allowance mailed Jun. 10, 2013, re U.S. Appl. No. 13/119,147.
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/052,345, dated Apr. 2, 2012.
U.S. Notice of Allowance re U.S. Appl. No. 12/052,345, dated Dec. 29, 2011.
U.S. Notice of Allowance re U.S. Appl. No. 12/989,638, dated Nov. 5, 2012.
U.S. Office Action re U.S. Appl. No. 12/052,345, dated Oct. 4, 2011.
U.S. Response to U.S. Office Action re U.S. Appl. No. 12/170,901, dated Jun. 12, 2009.
U.S. Response to U.S. Office Action re U.S. Appl. No. 12/170,925, dated Jul. 12, 2009.
U.S. Response to U.S. Office Action re U.S. Appl. No. 12/241,003, dated Jun. 11, 2009.
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.
Canadian Office Action, re CA Application No. CA 2730,310, dated May 16, 2014.
European Examination Report, re EP Application No. 09743557.2 dated Jul. 18, 2014.
European Supplemental Search Report re EPO Application No. 09 81 6907, mailed Jul. 10, 2014.
Related Publications (1)
Number Date Country
20130262632 A1 Oct 2013 US
Continuations (1)
Number Date Country
Parent 12052345 Mar 2008 US
Child 13906124 US