System and method for distributing content in a video surveillance network

• US 9,489,827 B2
• Filed: 03/12/2012
• Issued: 11/08/2016
• Est. Priority Date: 03/12/2012
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Quinn, Paul, Zhu, Jiang
• Primary Examiner(s): Bailey, Frederick
• Assistant Examiner(s): Mahmud, Farhan
• Application Number:
  US13/417,827
• Publication Number:
  US 20130235192A1
• Time in Patent Office: 1,702 Days
• Field of Search: 348/143
• US Class Current: 1/1
• CPC Class Codes: G08B 13/19645 Multiple cameras, each having view on one of a plurality of scenes, e.g. multiple cameras for multi-room surveillance or for tracking an object by view hand-over
• CPC Class Codes: G08B 13/19656 Network used to communicate with a camera, e.g. WAN, LAN, Internet
• CPC Class Codes: G08B 13/19669 Event triggers storage or change of storage policy
• CPC Class Codes: G08B 29/16 Security signalling or alarm systems, e.g. redundant systems
• CPC Class Codes: H04N 21/8586 by using a URL processing chained hypermedia data for information retrieval G06F16/94; information retrieval from the Internet by using URLs G06F16/955; URL in broadcast information H04H20/93; Web-based protocols H04L67/02
• CPC Class Codes: H04N 7/18 Closed-circuit television [CCTV] systems, i.e. systems in which the video signal is not broadcast

Abstract

A method is provided in one example embodiment and includes creating a key from a hash of a resource identifier associated with a video object; storing the video object in a distributed hash table with the key; and replicating the video object in the distributed hash table based on a redundancy factor associated with the video object. In more particular embodiments, the method can include fragmenting the video object into segments; creating sub-keys with a hash of resource identifiers associated with each of the segments; storing the segments in the distributed hash table with the sub-keys; and replicating the segments in the distributed hash table based on the redundancy factor.

Claims

1. A method for redundant storage of video objects, comprising:

creating a key from a hash of a resource identifier associated with a video object;

storing the video object, associated with the key, in a root node of a distributed hash table; and

replicating the video object in the distributed hash table based on a redundancy factor associated with the video object by storing the video object in at least one further node of the distributed hash table,

wherein the distributed hash table is a decentralized distributed system comprising a plurality of storage nodes, the plurality of storage nodes including the root node and the at least one further node, and wherein the plurality of storage nodes are logically arranged in a ring so that each storage node is communicatively connected to two neighbor storage nodes in that each storage node can forward data to the two neighbor storage nodes.

2. The method of claim 1, further comprising:

fragmenting the video object into segments;

creating sub-keys with a hash of resource identifiers associated with each of the segments;

storing the segments in the distributed hash table with the sub-keys; and

replicating the segments in the distributed hash table based on the redundancy factor.

3. The method of claim 1, further comprising:

fragmenting the video object into segments, wherein sizing of the segments is determined based on an overhead factor, and wherein the overhead factor is based, at least, on a storage capacity associated with a particular network element that received the video object, and a size associated with the video object.

4. The method of claim 1, wherein the resource identifier is an extensible resource identifier.

5. The method of claim 1, further comprising:

storing the key and the resource identifier in a descriptor that is provided in the distributed hash table.

6. The method of claim 1, further comprising:

fragmenting the video object into segments;

encoding an offset of each of the segments into a plurality of extensible resource identifiers;

creating sub-keys with a hash of the plurality of extensible resource identifiers associated with each of the segments;

storing the segments in the distributed hash table with the sub-keys; and

replicating the segments in the distributed hash table based on the redundancy factor.

7. The method of claim 6, further comprising:

storing the key, the sub-keys, and the extensible resource identifiers in a descriptor that is provided in the distributed hash table.

8. The method of claim 1, further comprising:

fragmenting the video object into segments, wherein sizing of the segments is determined based on an overhead factor;

creating sub-keys from a hash of resource identifiers associated with each of the segments;

storing the segments in the distributed hash table with the sub-keys; and

replicating the segments in the distributed hash table based on the redundancy factor.

9. The method of claim 1, further comprising:

providing a storage policy for a plurality of video objects propagating in a network, wherein the storage policy defines storage activities for particular content, and wherein the storage policy can be adjusted based on properties associated with the plurality of video objects.

10. The method according to claim 1, further comprising determining the redundancy factor for the video object based on a property of the video object.

11. The method according to claim 1, further comprising identifying the root node as a storage node in the plurality of storage nodes associated with an identifier that is closer to the created key than identifiers of its two neighbor nodes.

12. Logic encoded in one or more non-transitory media that includes code for execution and when executed by one or more processors is operable to perform operations for redundant storage of video objects, the operations comprising:

creating a key from a hash of a resource identifier associated with a video object;

storing the video object, associated with the key, in a root node of a distributed hash table; and

replicating the video object in the distributed hash table based on a redundancy factor associated with the video object by storing the video object in at least one further node of the distributed hash table,

wherein the distributed hash table is a decentralized distributed system comprising a plurality of storage nodes, the plurality of storage nodes including the root node and the at least one further node, and wherein the plurality of storage nodes are logically arranged in a ring so that each storage node is communicatively connected to two neighbor storage nodes in that each storage node can forward data to the two neighbor storage nodes.

13. The logic of claim 12, the operations further comprising:

fragmenting the video object into segments;

creating sub-keys with a hash of resource identifiers associated with each of the segments;

storing the segments in the distributed hash table with the sub-keys; and

replicating the segments in the distributed hash table based on the redundancy factor.

14. The logic of claim 12, the operations further comprising:

fragmenting the video object into segments, wherein sizing of the segments is determined based on an overhead factor, and wherein the overhead factor is based, at least, on a storage capacity associated with a particular network element that received the video object, and a size associated with the video object.

15. The logic of claim 12, wherein the resource identifier is an extensible resource identifier.

16. The logic of claim 12, the operations further comprising:

storing the key and the resource identifier in a descriptor that is provided in the distributed hash table.

17. The logic of claim 12, the operations further comprising:

fragmenting the video object into segments;

encoding an offset of each of the segments into a plurality of extensible resource identifiers;

creating sub-keys with a hash of the plurality of extensible resource identifiers associated with each of the segments;

storing the segments in the distributed hash table with the sub-keys; and

replicating the segments in the distributed hash table based on the redundancy factor.

18. The logic of claim 17, the operations further comprising:

storing the key, the sub-keys, and the extensible resource identifiers in a descriptor that is provided in the distributed hash table.

19. The logic of claim 12, the operations further comprising:

fragmenting the video object into segments, wherein sizing of the segments is determined based on an overhead factor;

creating sub-keys from a hash of resource identifiers associated with each of the segments;

storing the segments in the distributed hash table with the sub-keys; and

replicating the segments in the distributed hash table based on the redundancy factor.

20. The logic of claim 12, the operations further comprising:

providing a storage policy for a plurality of video objects propagating in a network, wherein the storage policy defines storage activities for particular content, and wherein the storage policy can be adjusted based on properties associated with the plurality of video objects.

21. An apparatus for redundant storage of video objects, comprising:

a processor; and

a memory coupled to the processor, wherein the processor is configured to execute instructions associated with a host function, a forwarding function, and a routing function such that the apparatus is configured for;

creating a key from a hash of a resource identifier associated with a video object;

storing the video object, associated with the key, in a root node of a distributed hash table; and

replicating the video object in the distributed hash table based on a redundancy factor associated with the video object by storing the video object in at least one further node of the distributed hash table,

wherein the distributed hash table is a decentralized distributed system comprising a plurality of storage nodes, the plurality of storage nodes including the root node and the at least one further node, and wherein the plurality of storage nodes are logically arranged in a ring so that each storage node is communicatively connected to two neighbor storage nodes in that each storage node can forward data to the two neighbor storage nodes.

22. The apparatus of claim 21, wherein the apparatus is further configured for:

fragmenting the video object into segments, wherein sizing of the segments is determined based on an overhead factor, and wherein the overhead factor is based, at least, on a storage capacity associated with a particular network element that received the video object, and a size associated with the video object.