DECLUSTERING THE ITRUST SEARCH AND RETRIEVAL NETWORK TO INCREASE TRUSTWORTHINESS

Christopher M. Badger, Louise E. Moser, P. Michael Melliar-Smith, Isai Michel Lombera, Yung-Ting Chuang

2012

Abstract

The iTrust search and retrieval network aims to provide trustworthy access to information on theWeb by making it difficult to censor or filter information. The declustering algorithm, presented in this paper, randomizes the network in a manner that reduces the clustering, or cliquishness, of the network. This randomization also reduces the necessary amount of cooperation between nodes by ensuring that a connection to any node is short-lived and can be replaced with a connection to another node from a large pool of known peers. Thus, the declustering algorithm reduces the expectation of cooperation among peers, which represents the degree to which the nodes rely on, or act on, information provided by their peers. In general, the smaller the expectation of cooperation, the less susceptible the network is to malicious attacks. Simulation results demonstrate that the declustering algorithm succeeds in randomizing the neighbors of a node in the network and, thus, in reducing the likelihood of malicious attacks.

References

  1. Adamic, L. A., Lukose, R. M., Puniyani, A. R., and Huberman, B. A. (2001). Search in power-law networks. Physical Review E, 64(046135):046135-1-046135-8.
  2. Adamic, L. A., Lukose, R. M., Puniyani, A. R., and Huberman, B. A. (2001). Search in power-law networks. Physical Review E, 64(046135):046135-1-046135-8.
  3. Albert, R., Hawoong, J., and Barabási, A. (2000). Error and attack tolerance of complex networks. Nature, 406(6794):378-382.
  4. Albert, R., Hawoong, J., and Barabási, A. (2000). Error and attack tolerance of complex networks. Nature, 406(6794):378-382.
  5. Banaei-Kashani, F. and Shahabi, C. (2003). Criticalitybased analysis and design of unstructured peer-to-peer networks as complex systems. In Proceedings of the IEEE International Symposium on Cluster Computing and the Grid, page 351.
  6. Banaei-Kashani, F. and Shahabi, C. (2003). Criticalitybased analysis and design of unstructured peer-to-peer networks as complex systems. In Proceedings of the IEEE International Symposium on Cluster Computing and the Grid, page 351.
  7. Barabási, A. and Albert, R. (1999). Emergence of scaling in random networks. Science, 286:509-512.
  8. Barabási, A. and Albert, R. (1999). Emergence of scaling in random networks. Science, 286:509-512.
  9. Bertier, M., Frey, D., Guerraoui, R., Kermarrec, A. M., and Leroy, V. (2010). The Gossple anonymous social network. In Proceedings of the ACM/IFIP/USENIX 11th Middleware Conference, pages 191-211.
  10. Bertier, M., Frey, D., Guerraoui, R., Kermarrec, A. M., and Leroy, V. (2010). The Gossple anonymous social network. In Proceedings of the ACM/IFIP/USENIX 11th Middleware Conference, pages 191-211.
  11. Chuang, Y. T., Michel Lombera, I., Moser, L. E., and Melliar-Smith, P. M. (2011). Trustworthy distributed search and retrieval over the Internet. In Proceedings of the 2011 International Conference on Internet Computing, pages 169-175.
  12. Chuang, Y. T., Michel Lombera, I., Moser, L. E., and Melliar-Smith, P. M. (2011). Trustworthy distributed search and retrieval over the Internet. In Proceedings of the 2011 International Conference on Internet Computing, pages 169-175.
  13. Clarke, I., Sandberg, O., Wiley, B., and Hong, T. (2000). Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the International Workshop on Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability, pages 46-66.
  14. Clarke, I., Sandberg, O., Wiley, B., and Hong, T. (2000). Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the International Workshop on Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability, pages 46-66.
  15. Erdo?s, P. and Rényi, A. (1960). On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5:17-61.
  16. Erdo?s, P. and Rényi, A. (1960). On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5:17-61.
  17. Gnutella (2000). http://gnutella.wego.com/.
  18. Gnutella (2000). http://gnutella.wego.com/.
  19. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A. M., and van Steen, M. (2007). Gossip-based peer sampling. ACM Transactions on Computer Systems, 25(8).
  20. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A. M., and van Steen, M. (2007). Gossip-based peer sampling. ACM Transactions on Computer Systems, 25(8).
  21. Makowiec, D. (2005). Evolving network-simulation study. The European Physical Journal B-Condensed Matter and Complex Systems, 48:547-555.
  22. Makowiec, D. (2005). Evolving network-simulation study. The European Physical Journal B-Condensed Matter and Complex Systems, 48:547-555.
  23. Michel Lombera, I., Chuang, Y. T., Melliar-Smith, P. M., and Moser, L. E. (2011). Trustworthy distribution and retrieval of information over HTTP and the Internet. In Proceedings of the Third International Conference on the Evolving Internet, pages 7-13.
  24. Michel Lombera, I., Chuang, Y. T., Melliar-Smith, P. M., and Moser, L. E. (2011). Trustworthy distribution and retrieval of information over HTTP and the Internet. In Proceedings of the Third International Conference on the Evolving Internet, pages 7-13.
  25. Milgram, S. (1967). The small world problem. Psychology Today, 2:60-67.
  26. Milgram, S. (1967). The small world problem. Psychology Today, 2:60-67.
  27. Price, D. D. S. (1976). A general theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science, pages 292-306.
  28. Price, D. D. S. (1976). A general theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science, pages 292-306.
  29. Rasti, A. H., Stutzbach, D., and Rejaie, R. (2006). On the long-term evolution of the two-tier Gnutella overlay. In Proceedings of the 25th IEEE International Conference on Computer Communications, pages 1-6.
  30. Rasti, A. H., Stutzbach, D., and Rejaie, R. (2006). On the long-term evolution of the two-tier Gnutella overlay. In Proceedings of the 25th IEEE International Conference on Computer Communications, pages 1-6.
  31. Ree, S. (2006). Power-law distributions from additive preferential redistributions. Physical Review E, 73:026115.
  32. Ree, S. (2006). Power-law distributions from additive preferential redistributions. Physical Review E, 73:026115.
  33. Stoica, I., Morris, R., Karger, D., Kaashoek, F. M., and Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of the 2001 ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, pages 149-160.
  34. Stoica, I., Morris, R., Karger, D., Kaashoek, F. M., and Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of the 2001 ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, pages 149-160.
  35. Travers, J. and Milgram, S. (1969). An experimental study of the small world problem. Sociometry, 32(4):425- 443.
  36. Travers, J. and Milgram, S. (1969). An experimental study of the small world problem. Sociometry, 32(4):425- 443.
  37. Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of 'small-world' networks. Nature, 393(6684):440- 442.
  38. Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of 'small-world' networks. Nature, 393(6684):440- 442.
  39. Wikipedia (2011a). Peer-to-peer networks. http://en.wikipe dia.org/wiki/peer-to-peer.
  40. Wikipedia (2011a). Peer-to-peer networks. http://en.wikipe dia.org/wiki/peer-to-peer.
  41. Wikipedia (2011b). Power law networks. http://en.wikiped ia.org/wiki/power law.
  42. Wikipedia (2011b). Power law networks. http://en.wikiped ia.org/wiki/power law.
Download


Paper Citation


in Harvard Style

M. Badger C., E. Moser L., Michael Melliar-Smith P., Michel Lombera I. and Chuang Y. (2012). DECLUSTERING THE ITRUST SEARCH AND RETRIEVAL NETWORK TO INCREASE TRUSTWORTHINESS . In Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-8565-08-2, pages 312-322. DOI: 10.5220/0003908503120322


in Harvard Style

M. Badger C., E. Moser L., Michael Melliar-Smith P., Michel Lombera I. and Chuang Y. (2012). DECLUSTERING THE ITRUST SEARCH AND RETRIEVAL NETWORK TO INCREASE TRUSTWORTHINESS . In Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-8565-08-2, pages 312-322. DOI: 10.5220/0003908503120322


in Bibtex Style

@conference{webist12,
author={Christopher M. Badger and Louise E. Moser and P. Michael Melliar-Smith and Isai Michel Lombera and Yung-Ting Chuang},
title={DECLUSTERING THE ITRUST SEARCH AND RETRIEVAL NETWORK TO INCREASE TRUSTWORTHINESS},
booktitle={Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2012},
pages={312-322},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003908503120322},
isbn={978-989-8565-08-2},
}


in Bibtex Style

@conference{webist12,
author={Christopher M. Badger and Louise E. Moser and P. Michael Melliar-Smith and Isai Michel Lombera and Yung-Ting Chuang},
title={DECLUSTERING THE ITRUST SEARCH AND RETRIEVAL NETWORK TO INCREASE TRUSTWORTHINESS},
booktitle={Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2012},
pages={312-322},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003908503120322},
isbn={978-989-8565-08-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - DECLUSTERING THE ITRUST SEARCH AND RETRIEVAL NETWORK TO INCREASE TRUSTWORTHINESS
SN - 978-989-8565-08-2
AU - M. Badger C.
AU - E. Moser L.
AU - Michael Melliar-Smith P.
AU - Michel Lombera I.
AU - Chuang Y.
PY - 2012
SP - 312
EP - 322
DO - 10.5220/0003908503120322


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - DECLUSTERING THE ITRUST SEARCH AND RETRIEVAL NETWORK TO INCREASE TRUSTWORTHINESS
SN - 978-989-8565-08-2
AU - M. Badger C.
AU - E. Moser L.
AU - Michael Melliar-Smith P.
AU - Michel Lombera I.
AU - Chuang Y.
PY - 2012
SP - 312
EP - 322
DO - 10.5220/0003908503120322