Modelling P2P data networks under complex system theory
暂无分享,去创建一个
[1] Albert,et al. Topology of evolving networks: local events and universality , 2000, Physical review letters.
[2] Ricardo A. Baeza-Yates,et al. Searching in metric spaces , 2001, CSUR.
[3] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[4] Yaneer Bar-Yam,et al. Dynamics Of Complex Systems , 2019 .
[5] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[6] Pedro M. Domingos,et al. Reconciling schemas of disparate data sources: a machine-learning approach , 2001, SIGMOD '01.
[7] Toru Ohira,et al. PHASE TRANSITION IN A COMPUTER NETWORK TRAFFIC MODEL , 1998 .
[8] D. Sornette. Critical Phenomena in Natural Sciences: Chaos, Fractals, Selforganization and Disorder: Concepts and Tools , 2000 .
[9] Sergey Brin,et al. Near Neighbor Search in Large Metric Spaces , 1995, VLDB.
[10] Farnoush Banaei Kashani,et al. SWAM: a family of access methods for similarity-search in peer-to-peer data networks , 2004, CIKM '04.
[11] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[12] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.
[13] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.
[14] Farnoush Banaei Kashani,et al. Searchable Querical Data Networks , 2003, DBISP2P.
[15] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.