Category talk:2011-O&C - Revision history

Hadi sajjadpour: /* Summary */

2011-04-04T18:06:27Z

Summary

← Older revision		Revision as of 18:06, 4 April 2011
Line 174:		Line 174:

	===== Summary =====		===== Summary =====
	~~This is about information observation, not what we want to do.~~
			Hadi


	Basically users install this plugin/extension on their browsers. This extension has some XML template for websites to specify their privacy policies.		Basically users install this plugin/extension on their browsers. This extension has some XML template for websites to specify their privacy policies.
Line 180:		Line 182:
	of how compatible/in what area the privacy policy of that website with respect to the preferences given by the user. The language they use to exchange (for the XML template) is called APPEL.		of how compatible/in what area the privacy policy of that website with respect to the preferences given by the user. The language they use to exchange (for the XML template) is called APPEL.
	It has been developed by the World Wide Web Consortium (W3C) and officially recommended on April 16, 2002. (from Wikipedia, http://en.wikipedia.org/wiki/P3p)		It has been developed by the World Wide Web Consortium (W3C) and officially recommended on April 16, 2002. (from Wikipedia, http://en.wikipedia.org/wiki/P3p)

			Hence this is not related to what we want to do, given that we narrowed observability to only observability in contracts.

	==== Gossiping in Distributed Systems ====		==== Gossiping in Distributed Systems ====

Hadi sajjadpour: /* Summary */

2011-04-04T18:05:33Z

Summary

← Older revision		Revision as of 18:05, 4 April 2011
Line 175:		Line 175:
	===== Summary =====		===== Summary =====
	This is about information observation, not what we want to do.		This is about information observation, not what we want to do.

			Basically users install this plugin/extension on their browsers. This extension has some XML template for websites to specify their privacy policies.
			Users on the other hand, on their browser, fill out a preference form. When a user visits a website that has this XML form on their side, then it reads it and informs the user
			of how compatible/in what area the privacy policy of that website with respect to the preferences given by the user. The language they use to exchange (for the XML template) is called APPEL.
			It has been developed by the World Wide Web Consortium (W3C) and officially recommended on April 16, 2002. (from Wikipedia, http://en.wikipedia.org/wiki/P3p)

	==== Gossiping in Distributed Systems ====		==== Gossiping in Distributed Systems ====
	[1] Paper: Gossiping in Distributed Systems, Anne-Marie Kermarrec, Maarten van Steen, ACM Sigops 2007		[1] Paper: Gossiping in Distributed Systems, Anne-Marie Kermarrec, Maarten van Steen, ACM Sigops 2007

Hadi sajjadpour: /* Summary */

2011-04-04T17:54:17Z

Summary

← Older revision		Revision as of 17:54, 4 April 2011
Line 207:		Line 207:
	In each, they update the framework thats mentioned above.		In each, they update the framework thats mentioned above.

	"1) Data Dissemination: "Traditionally, gossip-based solutions have been used for data dissemination purposes. A standard approach toward dissemination is to simply let peers forward messages to each other [1]". The framework for this section is as follows:		1) Data Dissemination: "Traditionally, gossip-based solutions have been used for data dissemination purposes. A standard approach toward dissemination is to simply let peers forward messages to each other [1]". The framework for this section is as follows:

	Peer Selection: Each peer selects a list of peers to send information to.		Peer Selection: Each peer selects a list of peers to send information to.
Line 213:		Line 213:
	Data Exchanged: Some message is selected and sent.		Data Exchanged: Some message is selected and sent.

	Data Processing: Receiving peer processes the data [1]"		Data Processing: Receiving peer processes the data [1]

	2) Peer Sampling:		2) Peer Sampling:

Hadi sajjadpour: /* Summary */

2011-04-04T17:53:44Z

Summary

← Older revision		Revision as of 17:53, 4 April 2011
Line 188:		Line 188:

	a) Peer selection: This is the process of selecting a list of peers, either uniformly at random, or based on some ranking criteria (e.g. proximity, need etc.) to send some data to.		a) Peer selection: This is the process of selecting a list of peers, either uniformly at random, or based on some ranking criteria (e.g. proximity, need etc.) to send some data to.

	b) Data Exchanged: Selecting information to pass on the peers selected.		b) Data Exchanged: Selecting information to pass on the peers selected.

	c) Data Processing: Processing a data received.		c) Data Processing: Processing a data received.

Line 194:		Line 196:

	The paper is then divided into a few categories:		The paper is then divided into a few categories:

	1) Dissemination		1) Dissemination

	2) Peer Sampling		2) Peer Sampling

	3) Topology Construction		3) Topology Construction

	4) Resource Management		4) Resource Management

Line 221:		Line 227:
	In this section, they mention the other use of gossiping, which is for resource management and monitoring such as failure detection. In this application, messages exchanged are about status information, such as "Are you alive?" or "I am alive" messages. These messages could be in the form of heartbeats.		In this section, they mention the other use of gossiping, which is for resource management and monitoring such as failure detection. In this application, messages exchanged are about status information, such as "Are you alive?" or "I am alive" messages. These messages could be in the form of heartbeats.

	In resource management, it could be used in resource allocation. They give an example of "a gossip-based approach to estimate which slice of a collection a node belongs has been proposed in."		In resource management, it could be used in resource allocation. They give an example of "a gossip-based approach to estimate which slice of a collection a node belongs has been proposed in."

	==Increasing Observability==		==Increasing Observability==

Hadi sajjadpour at 17:53, 4 April 2011

2011-04-04T17:53:17Z

← Older revision		Revision as of 17:53, 4 April 2011
Line 203:		Line 203:
	"1) Data Dissemination: "Traditionally, gossip-based solutions have been used for data dissemination purposes. A standard approach toward dissemination is to simply let peers forward messages to each other [1]". The framework for this section is as follows:		"1) Data Dissemination: "Traditionally, gossip-based solutions have been used for data dissemination purposes. A standard approach toward dissemination is to simply let peers forward messages to each other [1]". The framework for this section is as follows:

	Peer Selection: Each peer ~~P periodically chooses f >= 1 peers Q1, ... , Qf uniformly at random from the entire set~~ of ~~currently available~~ peers.		Peer Selection: Each peer selects a list of peers to send information to.

	Data Exchanged: A message is selected ~~from the local cache~~ and ~~copied from one peer to another. In a push model, P forwards messages to each Qi; in a pull model, each Qi sends a message to P. A combination of the two is also possible~~.		Data Exchanged: Some message is selected and sent.

	Data Processing: ~~Effectively, nothing special is done except storing~~ the ~~received message for a next iteration, or passing to a higher (application) layer.~~ [1]"		Data Processing: Receiving peer processes the data [1]"

	2) Peer Sampling:		2) Peer Sampling:

			Peer sampling assumes that the cost and latency of contacting each peer is the same. However, realistically this is not the case. In our system, we need to take into account cost/number of paths etc. as all other peers of a peer are not located next to a given peer.

			3) Topology Construction:

			Here they mention that each node/peer only maintains a partial view of the entire system for practical reasons.

			4) Resource Management

			In this section, they mention the other use of gossiping, which is for resource management and monitoring such as failure detection. In this application, messages exchanged are about status information, such as "Are you alive?" or "I am alive" messages. These messages could be in the form of heartbeats.

			In resource management, it could be used in resource allocation. They give an example of "a gossip-based approach to estimate which slice of a collection a node belongs has been proposed in."

	==Increasing Observability==		==Increasing Observability==

Hadi sajjadpour at 17:06, 4 April 2011

2011-04-04T17:06:26Z

@@ Line 175: / Line 175: @@
 ===== Summary =====
 This is about information observation, not what we want to do.
 ==== Gossiping in Distributed Systems ====
 [1] Paper: Gossiping in Distributed Systems, Anne-Marie Kermarrec, Maarten van Steen, ACM Sigops 2007
@@ Line 217: / Line 210: @@
 ) Peer Sampling:
 ===A Possible System for Increasing Observability of Contracts and Actions?===

Hadi sajjadpour at 17:05, 4 April 2011

2011-04-04T17:05:52Z

@@ Line 174: / Line 174: @@
 ===== Summary =====
-Hadi
+This is about information observation, not what we want to do.
 ==Increasing Observability==
@@ Line 181: / Line 181: @@
 As the possibility of being observed increases, behavior adjusts to encourage the positive reputation of the actor or to conform with laws and regulations. This is the main benefit we wish to obtain by increasing the observability of digital actions. While omnipresent observation is possible on a computer network, in terms of observing contracts it might be more efficient to impose the possibility of being observed.
 ===A Possible System for Increasing Observability of Contracts and Actions?===

Ajluczak: /* Summary */

2011-03-31T17:39:34Z

Summary

← Older revision		Revision as of 17:39, 31 March 2011
Line 163:		Line 163:
	*Expiration Condition		*Expiration Condition
	**The circumstances under which the clause no longer has force, parameterized by the variables specific to each instance.		**The circumstances under which the clause no longer has force, parameterized by the variables specific to each instance.

			This paper provides a nice, straight-forward definition of what a contract is, and provides the above schema for a contract.

	==== Web Privacy with P3P ====		==== Web Privacy with P3P ====

Ajluczak: /* Summary */

2011-03-31T17:37:52Z

Summary

@@ Line 150: / Line 150: @@
 ===== Summary =====
-Andrew
 ==== Web Privacy with P3P ====

Tkomal: /* Summary */

2011-03-31T15:10:11Z

Summary

@@ Line 76: / Line 76: @@
 ===== Summary =====
-TJ
+One key concept that we should take from this paper is the way they decided how to allocate the resources. Here is a brief but excellent point to consider:
 ==== Service Level Agreement in Cloud Computing ====