Skip to main content

Modelling Peer-to-Peer Data Networks Under Complex System Theory

  • Conference paper
Databases in Networked Information Systems (DNIS 2005)

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

Included in the following conference series:

Abstract

A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to pool and share their data (or more generally, their resources represented by data) for mutual benefit. By an interesting analogy to a democratic human society, when nodes join the PDN society, while they agree to follow a restricted set of common rules in interaction with their peers (i.e., the social rules governing the PDN society), they preserve their autonomy as individuals. For example, as part of their social obligations all PDN nodes (or at least those who are good PDN citizens) create and maintain connection with a set of neighbor nodes and participate in cooperative query processing (e.g., forwarding search queries for data discovery). Aside from the social rules, the PDN leaves the behavior of the individual nodes unregulated and flexible, to be managed by their users based on their individual preferences and/or to allow for natural uncertainties and constraints. For instance, nodes may join and leave the PDN society as they decide (by user decision or due to unwanted node/link failure), they control their own resources, and they select their neighbors according to their own administrative policy or physical constraints (e.g., connecting to the nodes that are both accessible and physically close as neighbors). In this sense, individual nodes are self-governed, autonomous, and independent. There is a trade-off between the extent of the social rules and the autonomy of the individual PDN nodes; the more extensive and interfering the social rules, the autonomy of the nodes is more restricted.

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. Albert, R., Barabasi, A.L.: Topology of evolving networks: Local events and universality. Physical Review Letters 85, 5234–5237 (2000)

    Article  Google Scholar 

  2. Amaral, L.A.N., Scala, A., Brathéiémy, M.: Classes of small-world networks. Proceedings of National Academy of Science of the USA (PNAS) 97(21), 11149–11152 (2000)

    Article  Google Scholar 

  3. Banaei-Kashani, F., Shahabi, C.: Epidemic sampling for search in unstructured peer-to-peer networks (submitted for review)

    Google Scholar 

  4. Banaei-Kashani, F., Shahabi, C.: SWAM: A family of access methods for similarity-search in peer-to-peer data networks. In: Proceedings of the Thirteenth Conference on Information and Knowledge Management (CIKM 2004), November 2004, pp. 304–313 (2004)

    Google Scholar 

  5. Bar-Yam, Y.: Dynamics of Complex Systems. Westview Press (1997)

    Google Scholar 

  6. Hethcote, H.: The mathematics of infectious diseases. SIAM Review 42(4), 599–653 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC 2000), May 2000, pp. 163–170 (2000)

    Google Scholar 

  8. Ohira, T., Sawatari, R.: Phase transition in a computer network traffic model. Physical Review E 58, 193–195 (1998)

    Article  Google Scholar 

  9. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM 2001), August 2001, pp. 161–172 (2001)

    Google Scholar 

  10. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of ACM International Conference on Distributed Systems Platforms (Middleware 2001), November 2001, pp. 329–350 (2001)

    Google Scholar 

  11. Sornette, D.: Critical phenomena in natural sciences: chaos, fractals, self-organization and disorder. Springer, Heidelberg (2000)

    Google Scholar 

  12. Stauffer, D., Aharony, A.: Introduction to Percolation Theory, 2nd edn. Taylor and Francis, Abington (1992)

    Google Scholar 

  13. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM 2001), August 2001, pp. 149–160 (2001)

    Google Scholar 

  14. Watts, D.J., Dodds, P.S., Newman, M.E.J.: Identity and search in social networks. Science 296, 1302–1305 (2002)

    Article  Google Scholar 

  15. Watts, D.J., Strogatz, S.H.: Collective dynamics of small world networks. Nature 393(6684), 440–442 (1998)

    Article  Google Scholar 

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

Shahabi, C., Banaei-Kashani, F. (2005). Modelling Peer-to-Peer Data Networks Under Complex System Theory. In: Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2005. Lecture Notes in Computer Science, vol 3433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31970-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31970-2_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25361-7

  • Online ISBN: 978-3-540-31970-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics