-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Proposed addition to the SoC work: simulate selfish nodes that prioritise requests over inserts (but will still process inserts if there are no requests waiting). Compare the rate at which selfish nodes and obedient nodes respond to requests. Simulate networks with different proportions of selfish nodes, from 0% to 100%.
Selfish nodes might be able to answer more requests by saving bandwidth. On the other hand obedient nodes might be able to answer more requests because they'll be making proper use of their neighbours' datastores. Two questions: 1. Does the reliability of the network decrease as the proportion of selfish nodes increases? (Maybe it will turn out counter-intuitively that prioritising requests is harmless.) 2. For a given proportion of selfish nodes, can a selfish node respond to more requests on average than an obedient node? In other words, would tit for tat give obedient nodes an incentive to become selfish? Repeat the experiments with selfish nodes that don't forward inserts at all. Any thoughts? Cheers, Michael -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.3 (GNU/Linux) iD8DBQFEdhfmyua14OQlJ3sRAqlVAKDLFUlm4JDlE8VOVCa1JIn682GfFQCdGukN XcymV48H/my4D41KSwrAjUs= =THOq -----END PGP SIGNATURE-----
