Looking up data in P2P systems Export

@article{citeulike:2240570, abstract = {The main challenge in P2P computing is to design and implement a robust and scalable distributed system composed of inexpensive, individually unreliable computers in unrelated administrative domains. The participants in a typical P2P system might include computers at homes, schools, and businesses, and can grow to several million concurrent participants.}, address = {New York, NY, USA}, author = {Balakrishnan, Hari and Kaashoek, M. Frans and Karger, David and Morris, Robert and Stoica, Ion}, citeulike-article-id = {2240570}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=606299}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/606272.606299}, doi = {10.1145/606272.606299}, issn = {0001-0782}, journal = {Commun. ACM}, keywords = {2004, cacm, p2p, search}, month = {February}, number = {2}, pages = {43--48}, posted-at = {2009-11-06 02:22:47}, priority = {2}, publisher = {ACM}, title = {Looking up data in P2P systems}, url = {http://dx.doi.org/10.1145/606272.606299}, volume = {46}, year = {2003} }

TY - JOUR ID - citeulike:2240570 L3 - citeulike-article-id:2240570 N2 - The main challenge in P2P computing is to design and implement a robust and scalable distributed system composed of inexpensive, individually unreliable computers in unrelated administrative domains. The participants in a typical P2P system might include computers at homes, schools, and businesses, and can grow to several million concurrent participants. IS - 2 JF - Commun. ACM SN - 0001-0782 AD - New York, NY, USA EP - 48 TI - Looking up data in P2P systems PB - ACM VL - 46 SP - 43 KW - 2004 KW - cacm KW - p2p KW - search AU - Balakrishnan, Hari AU - Kaashoek, Frans AU - Karger, David AU - Morris, Robert AU - Stoica, Ion PY - 2003/02// UR - http://dx.doi.org/10.1145/606272.606299 ER -