Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3597))

Included in the following conference series:

Abstract

Social networks that are built on top of the web, e.g., orkut[9], have been proliferating among online communities. We propose social internetworks, where essential functions of social networks are implemented on top of peer-to-peer networks. Participants and communities are connected through attribute queries and reputation queries; reputation queries are applied to attributes with Secure EigenTrust algorithm[1].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The EigenTrust Algorithm for Reputation Management in P2P Networks. In: 12th International World Wide Web Conference (WWW 2003) (May 2003)

    Google Scholar 

  2. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Stoica, I., Morris, R., Karger, D.M., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (2001)

    Google Scholar 

  4. Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network. In: Proceedings of ACM SIGCOMM (2001)

    Google Scholar 

  5. Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-peer Information System Based on the XOR Metric. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (2002)

    Google Scholar 

  6. Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed Object Location in a Dynamic Network. In: Proceedings of 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA) (2002)

    Google Scholar 

  7. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of ACM Principles of Distributed Computing (PODC) (2002)

    Google Scholar 

  8. Iimura, T., Hazeyama, H., Kadobayashi, Y.: Zoned Federation of Game Servers: a Peer-to-Peer Approach to Scalable Multi-player Online games. In: Proc. of ACM SIGCOMM Workshop Network and System Support for Games (NetGames-2004) (2004)

    Google Scholar 

  9. Orkut, Website http://www.orkut.com/

  10. Mixi, Website http://mixi.jp/

  11. GREE, Website http://www.gree.jp/

  12. XOOPS, Website http://www.xoops.org/

  13. FINAL FANTASY, Website http://www.square-enix.co.jp/finalfantasy/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okada, Y., Masui, K., Kadobayashi, Y. (2005). Proposal of Social Internetworking. In: Shimojo, S., Ichii, S., Ling, TW., Song, KH. (eds) Web and Communication Technologies and Internet-Related Social Issues - HSI 2005. HSI 2005. Lecture Notes in Computer Science, vol 3597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527725_13

Download citation

  • DOI: https://doi.org/10.1007/11527725_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27830-6

  • Online ISBN: 978-3-540-31808-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics