Peer-to-Peer-Netzwerke: Algorithmen und Methoden
of DHT routing geometry on resilience and proximity. In Feldmann, A., Zitter- bart, M., Crowcroft, J., Wetherall, D., eds.: Proceedings of the ACM SIGCOMM 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 25-29, 2003, Karlsruhe, Germany, ACM (2003) 381-394
41. Mullender, S.J., Vitanyi, P.M.B.: Distributed match-making. Algorithmica 3 (1988) 367-391
42. Guyton, J.D., Schwartz, M.F.: Locating nearby copies of replicated internet servers. In: SIGCOMM. (1995) 288-298
43. van Steen, M., Hauck, F.J., Tanenbaum, A.S.: A model for worldwide tracking of distributed objects. In: TINA '96, Conference, Heidelberg, Germany (1996) 203-212 http://www.cs.vu.nl/-steen/globe/publications.html.
44. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing, New York, NY, USA, ACM Press (2002) 183-192
45. Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, New York, NY, USA, ACM Press (2003) 50-59
46. Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: 2nd International Workshop on Peer-to-Peer Systems, Berkeley, California (2003)
47. Aberer, K.: P-Grid: A self-organizing access structure for P2P information systems. In Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M., eds.: Cooperative Information Systems, 9th International Conference, CoopIS 2001, Trento, Italy, September 57, 2001, Proceedings. Volume 2172 of Lecture Notes in Computer Science., Springer (2001) 179-194
48. Aberer, K., Cudre-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: A self-organizing structured P2P system. SIGMOD Record 32 (2003) 29-33
49. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Sixth Symposium on Principles of Distributed Computing, Vancouver, Canada (1987) 1-12
50. Aspnes, J., Shah, G.: Skip graphs. In: 14th Annual ACM-SIAM Symposium on Discrete Algorithms. (2003) 384-393
51. Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A scalable overlay network with practical locality properties. In: USENIX Symposium on Internet Technologies and Systems. (2003)
52. Aspnes, J., Wieder, U.: The expansion and mixing time of Skip graphs with applications. In Gibbons, P.B., Spirakis, P.G., eds.: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms, July 18-20, 2005, Las Vegas, Nevada, USA, ACM (2005)126-134
53. Harvey, N.J.A., Munro, J.I.: Deterministic SkipNet. Inf. Process. Lett. 90 (2004) 205208
54. Jovanovic, M.A.: Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella. University of Cincinnati/ OhioLINK (2001)
55. Ripeanu, M., Foster, I., lamnitchi, A.: Mapping the gnutella network: Properties of largescale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6 (2002)
56. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), New York, ACM Press (2000) 171-180
57. Pareto, V.: Cours d'economiepolitique. Rouge, Lausanne et Paris (1897)
58. Yule, G.: Statistical Study of Literary Vocabulary. Cambridge University Press (1944)
59. Zipf, G.: Human Behavior and the Principle of Least Effort. Addison Wesley (1949)
60. Pumain, D.: Scaling laws and urban systems. Technical report, Technical Report, http://www.santafe.edu/research/publications/workingpapers/04-02-002.pdf, University of Santa Fe (2003)
61. Pumain, D.: Settlement systems in the evolution. Geografiska Annaler 2 (2000) 73-87
62. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM. (1999) 251-262
63. Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286 (1999) 509-512
64. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. Computer Networks (Amsterdam, Netherlands: 1999) 33 (2000) 309-320
65. Kumar, R., Raghavan, P., Rajagopalan, S.,
Weitere Kostenlose Bücher