Title :
Specifying data sharing agreements
Author :
Swamp, V. ; Seligman, Len ; Rosenthal, Arnon
Author_Institution :
MITRE Corp., McLean, VA
Abstract :
When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph´s nodes are principals with local stores, and its edges are (typed) channels along which dataflows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model
Keywords :
data flow graphs; information dissemination; information management; supply chain management; temporal logic; data dissemination; data protection; data resources; data sharing agreements; dataflow graphs; distributed temporal logic predicates; information supply chain management; value-added services; Availability; Delay; Flow graphs; Information management; Logic; Protection; Resource management; Supply chain management; Supply chains; Throughput;
Conference_Titel :
Policies for Distributed Systems and Networks, 2006. Policy 2006. Seventh IEEE International Workshop on
Conference_Location :
London, Ont.
Print_ISBN :
0-7695-2598-9
DOI :
10.1109/POLICY.2006.34
