What is claimed is:
`
`CLAIMS
`
`l.
`
`A method for exchanging data between a sender and a recipient comprising:
`
`receiVing, at a second node of a plurality of nodes of a dead drop domain, from the
`
`sender Via a first node of the plurality of nodes of the dead drop domain, a
`
`write request to write data to a specified dead drop of a plurality of dead drops
`
`in the dead drop domain, wherein each dead drop of the plurality of dead
`
`drops is a distinct storage location on a node of the plurality of nodes and
`
`identified by a unique dead drop identifier (DDID), each node of the plurality
`
`of nodes comprising a processor and a memory and connected to one or more
`
`other nodes Via a network,
`
`determining that the specified dead drop is on the second node,
`
`writing the data to the specified dead drop on the second node,
`
`receiVing a read request to read data from the specified dead drop, the read request
`
`made by the recipient and received at the second node from a third node of the
`
`plurality of nodes of the dead drop domain, and
`
`providing the data from the specified dead drop to the recipient in response to the
`
`read request.
`
`2.
`
`The method of claim 1, further comprising:
`
`receiVing, at the second node, a create request from the recipient,
`
`creating the specified dead drop at the second node in response to the create request,
`
`32
`
`
`
`CLAIMS
`
`l.
`
`A method for exchanging data between a sender and a recipient comprising:
`
`receiVing, at a second node of a plurality of nodes of a dead drop domain, from the
`
`sender Via a first node of the plurality of nodes of the dead drop domain, a
`
`write request to write data to a specified dead drop of a plurality of dead drops
`
`in the dead drop domain, wherein each dead drop of the plurality of dead
`
`drops is a distinct storage location on a node of the plurality of nodes and
`
`identified by a unique dead drop identifier (DDID), each node of the plurality
`
`of nodes comprising a processor and a memory and connected to one or more
`
`other nodes Via a network,
`
`determining that the specified dead drop is on the second node,
`
`writing the data to the specified dead drop on the second node,
`
`receiVing a read request to read data from the specified dead drop, the read request
`
`made by the recipient and received at the second node from a third node of the
`
`plurality of nodes of the dead drop domain, and
`
`providing the data from the specified dead drop to the recipient in response to the
`
`read request.
`
`2.
`
`The method of claim 1, further comprising:
`
`receiVing, at the second node, a create request from the recipient,
`
`creating the specified dead drop at the second node in response to the create request,
`
`32
`
`
`
`generating a DDID identifying the specified dead drop, a write token associated with
`
`the specified dead drop, and a read token associated with the specified dead
`
`drop, and
`
`providing the DDID identifying the specified dead drop, the write token, and the read
`
`token to the recipient.
`
`3.
`
`The method of claim 2, wherein writing the data to the specified dead drop
`
`comprises:
`
`comparing a write token received from the sender as part of the write request with the
`
`write token associated with the specified dead drop,
`
`determining that the write token received from the sender is valid based on the
`
`comparison, and
`
`writing the data to the specified dead drop responsive to determining that the write
`
`token from the sender is valid.
`
`4.
`
`The method of claim 2, wherein providing the data from the specified dead drop
`
`to the recipient comprises:
`
`comparing a read token received from the recipient with the read token associated
`
`with the specified dead drop,
`
`determining that the read token received from the recipient is valid based on the
`
`comparison, and
`
`providing the data from the specified dead drop to the recipient in response to
`
`determining that the read token is valid.
`
`33
`
`
`
`5.
`
`The method of claim 2; wherein determining that the specified dead drop is on the
`
`second node comprises:
`
`comparing a DDID included in the write request with the DDID identifying the
`
`specified dead drop; and
`
`determining that the specified dead drop is on the second node based on the
`
`comparison.
`
`6.
`
`The method of claim 1; further comprising:
`
`evaluating a time-to-live (TTL) information for the specified dead drop at the second
`
`node of the dead drop domain;
`
`determining whether a duration for the specified dead drop indicated by the TTL
`
`information has been reached; and
`
`deleting the specified dead drop from the second node responsive to a determination
`
`that the duration for the dead drop indicated by the TTL information has been
`
`reached.
`
`7.
`
`The method of claim 1; further comprising:
`
`receiving; at the second node of the dead drop domain; a notification request for the
`
`specified dead drop;
`
`examining the notification request to identify a type of event for which a notification
`
`is requested and a notification address to which the notification is to be made;
`
`and
`
`creating a trigger that causes the notification to be sent to the notification address
`
`responsive to the identified type of event occurring at the specified dead drop.
`
`34
`
`
`
`8.
`
`A system for exchanging data between a sender and a recipient comprising:
`
`a processor for executing computer program instructions; and
`
`a non-transitory computer-readable storage medium storing computer program
`
`instructions executable by the processor to perform operations comprising:
`
`receiVing, at a second node of a plurality of nodes of a dead drop domain,
`
`from the sender Via a first node of the plurality of nodes of the
`
`dead drop domain, a write request to write data to a specified dead
`
`drop of a plurality of dead drops in the dead drop domain, wherein
`
`each dead drop of the plurality of dead drops is a distinct storage
`
`location on a node of the plurality of nodes and identified by a
`
`unique dead drop identifier (DDID), each node of the plurality of
`
`nodes comprising a processor and a memory and connected to one
`
`or more other nodes Via a network,
`
`determining that the specified dead drop is on the second node,
`
`writing the data to the specified dead drop on the second node,
`
`receiVing a read request to read data from the specified dead drop, the read
`
`request made by the recipient and received at the second node from
`
`a third node of the plurality of nodes of the dead drop domain, and
`
`providing the data from the specified dead drop to the recipient in
`
`response to the read request.
`
`9.
`
`The system of claim 8, the operations further comprising:
`
`receiVing, at the second node, a create request from the recipient,
`
`creating the specified dead drop at the second node in response to the create request,
`
`35
`
`
`
`generating a DDID identifying the specified dead drop, a write token associated with
`
`the specified dead drop, and a read token associated with the specified dead
`
`drop, and
`
`providing the DDID identifying the specified dead drop, the write token, and the read
`
`token to the recipient.
`
`10.
`
`The system of claim 9, wherein writing the data to the specified dead drop
`
`comprises:
`
`comparing a write token received from the sender as part of the write request with the
`
`write token associated with the specified dead drop,
`
`determining that the write token received from the sender is valid based on the
`
`comparison, and
`
`writing the data to the specified dead drop responsive to determining that the write
`
`token from the sender is valid.
`
`11.
`
`The system of claim 9, wherein providing the data from the specified dead drop to
`
`the recipient comprises:
`
`comparing a read token received from the recipient with the read token associated
`
`with the specified dead drop,
`
`determining that the read token received from the recipient is valid based on the
`
`comparison, and
`
`providing the data from the specified dead drop to the recipient in response to
`
`determining that the read token is valid.
`
`36
`
`
`
`12.
`
`The system of claim 9; wherein determining that the specified dead drop is on the
`
`second node comprises:
`
`comparing a DDID included in the write request with the DDID identifying the
`
`specified dead drop; and
`
`determining that the specified dead drop is on the second node based on the
`
`comparison.
`
`13.
`
`The system of claim 8; the operations further comprising:
`
`evaluating a time-to-live (TTL) information for the specified dead drop at the second
`
`node of the dead drop domain;
`
`determining whether a duration for the specified dead drop indicated by the TTL
`
`information has been reached; and
`
`deleting the specified dead drop from the second node responsive to a determination
`
`that the duration for the dead drop indicated by the TTL information has been
`
`reached.
`
`14.
`
`The system of claim 8; the operations further comprising:
`
`receiving; at the second node of the dead drop domain; a notification request for the
`
`specified dead drop;
`
`examining the notification request to identify a type of event for which a notification
`
`is requested and a notification address to which the notification is to be made;
`
`and
`
`creating a trigger that causes the notification to be sent to the notification address
`
`responsive to the identified type of event occurring at the specified dead drop.
`
`37
`
`
`
`15.
`
`A non-transitory computer-readable storage medium storing computer program
`
`instructions executable by a processor to perform operations for exchanging data between a
`
`sender and a recipient, the operations comprising:
`
`receiVing, at a second node of a plurality of nodes of a dead drop domain, from the
`
`sender Via a first node of the plurality of nodes of the dead drop domain, a
`
`write request to write data to a specified dead drop of a plurality of dead drops
`
`in the dead drop domain, wherein each dead drop of the plurality of dead
`
`drops is a distinct storage location on a node of the plurality of nodes and
`
`identified by a unique dead drop identifier (DDID), each node of the plurality
`
`of nodes comprising a processor and a memory and connected to one or more
`
`other nodes Via a network,
`
`determining that the specified dead drop is on the second node,
`
`writing the data to the specified dead drop on the second node,
`
`receiVing a read request to read data from the specified dead drop, the read request
`
`made by the recipient and received at the second node from a third node of the
`
`plurality of nodes of the dead drop domain, and
`
`providing the data from the specified dead drop to the recipient in response to the
`
`read request.
`
`16.
`
`The non-transitory computer-readable storage medium of claim 15, the operations
`
`further comprising:
`
`receiVing, at the second node, a create request from the recipient,
`
`creating the specified dead drop at the second node in response to the create request,
`
`38
`
`
`
`generating a DDID identifying the specified dead drop, a write token associated with
`
`the specified dead drop, and a read token associated with the specified dead
`
`drop, and
`
`providing the DDID identifying the specified dead drop, the write token, and the read
`
`token to the recipient.
`
`17.
`
`The non-transitory computer-readable storage medium of claim 16, the operations
`
`further comprising:
`
`comparing a write token received from the sender as part of the write request with the
`
`write token associated with the specified dead drop,
`
`determining that the write token received from the sender is valid based on the
`
`comparison, and
`
`writing the data to the specified dead drop responsive to determining that the write
`
`token from the sender is valid.
`
`18.
`
`The non-transitory computer-readable storage medium of claim 16, wherein
`
`providing the data from the specified dead drop to the recipient comprises:
`
`comparing a read token received from the recipient with the read token associated
`
`with the specified dead drop,
`
`determining that the read token received from the recipient is valid based on the
`
`comparison, and
`
`providing the data from the specified dead drop to the recipient in response to
`
`determining that the read token is valid.
`
`39
`
`
`
`19.
`
`The non-transitory computer-readable storage medium of claim 16, wherein
`
`determining that the specified dead drop is on the second node comprises:
`
`comparing a DDID included in the write request with the DDID identifying the
`
`specified dead drop; and
`
`determining that the specified dead drop is on the second node based on the
`
`comparison.
`
`20.
`
`The non-transitory computer-readable storage medium of claim 15, the operations further
`
`comprising:
`
`receiving, at the second node of the dead drop domain, a notification request for the
`
`specified dead drop,
`
`examining the notification request to identify a type of event for which a notification
`
`is requested and a notification address to which the notification is to be made,
`
`and
`
`creating a trigger that causes the notification to be sent to the notification address
`
`responsive to the identified type of event occurring at the specified dead drop.
`
`40
`
`
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ Charge
Still Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site
