Protocol Layers. From Conversations to Agreements In the following, we consider a conversation between two need owners, o1 and o2 that connects their needs n1 and n2 via their connections c1 and c2. The conversation is the union of all messages that are accessible to o1 in the conversation with o2, at the point in time when m is the last message seen by o1. This point in time is defined as either the reception of the remote response if o1 is the sender of m. If o1 is the recipient, the point is defined as the time the response to m in c1 is sent. The set of all possible conversations is defined as the powerset of all possible messages C = P(M) (which, as stated earlier, is equal to P(I × G)). We define the raw conversation dataset Cr(o1, o2, m) as the union of all messages in the 4 Note that the current implementation of WoN is not based on LDP, it only uses the paging interface of LDP containers. event containers of n1, n2 and c1. As we will regard o1 and o2 as fixed for the remainder of the paper, describing the situation from the point of view of o1, we will write Cr(m) instead of Cr(o1, o2, m). The raw conversation dataset consists of all messages exchanged, or at- tempted to be exchanged. It is used to verify the integrity of the message history based on the chain of message signatures. It can be seen as a monotonically grow- ing RDF store that the participants can only manipulate by adding messages. In the context of WoN, this dataset is intended to be used as a device that allows users to coordinate, that is, to build a shared, and at least partly agreed-upon model of their relationship. In order to allow for the latter, we define higher-level conversation protocols based on Cr. For doing this, we first make some auxiliary definitions: The function iri : M → I gives the IRI of the input message.
Protocol Layers. From Conversations to Agreements In the following, we consider a conversation between two need owners, o1 and o2 that connects their needs n1 and n2 via their connections c1 and c2. The conversation is the union of all messages that are accessible to o1 in the conversation with o2, at the point in time when m is the last message seen by o1. This point in time is defined as either the reception of the remote response if o1 is the sender of m. If o1 is the recipient, the point is defined as the time the response to m in c1 is sent. The set of all possible conversations is defined as the poweset of all possible messages C = P(M) (which, as stated earlier, is equal to P(I × G)). We define the raw conversation dataset Cr(o1, o2, m) as the union of all messages in the event containers of n1, n2 and c1. As we will regard o1 and o2 as fixed for the remainder of the paper, describing the situation from the point of view of o1, we will write Cr(m) instead of Cr(o1, o2, m). The raw conversation dataset consists of all messages exchanged, or at- tempted to be exchanged. It is used to verify the integrity of the message history based on the chain of message signatures. It can be seen as a monotonically grow- ing RDF store that the participants can only manipulate by adding messages. In the context of WoN, this dataset is intended to be used as a device that allows users to coordinate, that is, to build a shared, and at least partly agreed-upon model of their relationship. In order to allow for the latter, we define higher-level conversation protocols based on Cr. For doing this, we first make some auxiliary definitions: The function iri : M → I gives the IRI of the input message.
Protocol Layers. In data networks, the term ‘protocol’ refers to the set of rules and tasks that the source, destination and any possible intermediate devices (relays) should Router Router Cloud data Sensor Sensor Cloud Storage Cloud Computing Actuator Smart Phone
