Interoperable systems and methods for peer-to-peer service orchestration

Abstract

Systems and methods are described for performing policy-managed, peer-to-peer service orchestration in a manner that supports the formation of self-organizing service networks that enable rich media experiences. In one embodiment, services are distributed across peer-to-peer communicating nodes, and each node provides message routing and orchestration using a message pump and workflow collator. Distributed policy management of service interfaces helps to provide trust and security, supporting commercial exchange of value. Peer-to-peer messaging and workflow collation allow services to be dynamically created from a heterogeneous set of primitive services. The shared resources are services of many different types, using different service interface bindings beyond those typically supported in a web service deployments built on UDDI, SOAP, and WSDL. In a preferred embodiment, a media services framework is provided that enables nodes to find one another, interact, exchange value, and cooperate across tiers of networks from WANs to PANs.

1 .- 20 . (canceled) 
   
   
       21 . A method of authorizing a given action to be performed on a piece of electronic content, the method comprising:
 executing a control program using a virtual machine running on a first digital rights management engine, the control program being operable to determine whether the given action can be performed on the piece of electronic content, wherein the control program is operable to evaluate a set of one or more conditions that must be satisfied in order for performance of the given action to be authorized, and wherein at least a first condition in the set of one or more conditions comprises a requirement that a first node representing a first entity be reachable from a second node representing a second entity; and   evaluating one or more link objects available to the digital rights management engine to determine if the first node is reachable from the second node, each link objects expressing a relationship between two entities.   
   
   
       22 . The method of  claim 21 , wherein at least a second condition in the set of one or more conditions comprises a requirement that a third node representing a third entity be reachable from the second node. 
   
   
       23 . The method of  claim 21 , further comprising:
 deriving a first cryptographic key from the one or more link objects, the first cryptographic key being capable of decrypting a second cryptographic key, the second cryptographic key being capable of decrypting the piece of electronic content.   
   
   
       24 . The method of  claim 21 , wherein the control program is contained in a control object. 
   
   
       25 . The method of  claim 24 , wherein the control object is cryptographically bound to a content key object, the content key object comprising an encrypted cryptographic key, the cryptographic key being capable of decrypting the piece of electronic content.