C. Schmidt and M. Parashar, “Flexible Information Discovery in Decentralized Distributed Systems:’ in HPDC ‘03: Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing. IEEE Computer Society, 2003, p. 226.
D. Spence, J. Cmwcroft, S. Hand, and T. Hanis, “Location based placement of whole distributed systems:’ in CoNEXT ‘05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology. ACM, 2005, pp. 124—134.
H. V. Jagadish, B. C. Ooi, and Q. H. Vu, “BATON: a balanced tree structure for peer-to-peer networks:’ in VLDB ‘05: Proceedings of the 31st International Conference on Very Large Data Bases. VLDB Endowment, 200S,pp. 661—672.
M. Cai, M. Fmnk, J. Chen, and P. Szekely, “MAAN: A Multi-Attribute Addressable Network for Grid Information Services;’ in GRID ‘03: Proceedings of the 4th International Workshop on Grid Computing. IEEE Computer Society, 2003, p. 184.
D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat, “Distributed resource discovery on PlanetLab with SWORD’ in WORDLS’04: Proceedings of First Workslwp on Real, Large Distributed Systems, 2004.
G. Pierre, T. Schutt, J. Domaschka, and M. Coppola, “Highly available and scalable grid services;’ in WDDM ‘09: Proceedings of the Third Workshop on Dependable Distributed Data Management. New York, NY, USA: ACM, 2009, pp. 18-20.
A. S. Cheema, M. Muhammad, and I. Gupta, “Peer-to-Peer Discovery of Computational Resources for Grid Applications;’ in GRID ‘05: Proceedings of the 6th IEEE/ACM International Workslwp on Grid Computing. IEEE Computer Society, 2005, pp. 179—185.
E. Caron, E Desprez, and C. Tedeschi, “A Dynamic Prefix Tree for Service Discovery within Large Scale Grids;’ in P2P ‘06: Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing. IEEE Computer Society, 2006, pp. 106—116.
J. Gao, “A distributed and scalable peer-to-peer content discovery system supporting complex queues;’ Ph.D. dissertation, Carnegie Mellon University, 2004.
R. Rodrigues and B. Liskov, “High Availability in DHTs: Erasure Coding vs. Replication;’ in IPTPS ‘05: Proc.s of the 4th Intnl. Workshop on Peer-to-Peer Systems, Ithaca, New York, 2005.
M. Roussopoulos and M. Baker, “CUP: Controlled Update Propagation in Peer-to-Peer Networks;’ CoRR, vol. cs.NI/0202008, 2002.
K. Tati and G. M. Voelker, “ShortCuts: Using Soft State to Improve DHT Routing;’ in WCW’04 : Proceedings of 9th International Workslwp on web content caching and distribution. Springer, 2004, pp. 44—62.
I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse, “Keips: Building an efficient and stable P2P DHT through increased memory and background overhead,” in IPTPS ‘03: Proc.s of the 2nd International Workshop on Peer-to-Peer Systems, 2003.
A. Gupta, B. Liskov, and R. Rodrigues, “Efficient routing for peer-to-peer overlays;’ in NSDI’04: Proc.s of the 1st Symposium on Networked Systems Design and Implementation. USENIX Association, 2004, pp. 9—9.
D. Liben-Nowell, H. Balakrishnan, and D. Karger, “Observations on the Dynamic Evolution of Peer-to-Peer Networks;’ in IPTPS ‘01: Revised Papers from the First International Workshop onPeer-to-PeerSystems. Springer, 2002,pp. 22—33.
I. Stoica, R. Morris,D. Liben-Nowell, D. R. Karger, M. E Kaashoek, E Dabek, andH. Balakrishnan, “Chord: a scalable peer-to-peer lookup protocol for internet applications;’ IEEE/ACM Trans. Netw.,pp. 17—32, 2003.
K. Shudo, Y. Tanaka, and S. Sekiguchi, “Overlay Weaver: An overlay construction toolkit;’ Computer Communications, vol. 31, pp. 402—412, 2008.
E Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, “Towards a Common API for Structured Peer-to-Peer Overlays’ in Peer-to-Peer Systems II. Springer, 2003, pp. 33—44.
A. Bavier, M. Bowman, B. Chun, D. Culler, S. Karlin, S. Muir, L. Peterson, T. Roscoe, T. Spalink, and M. Wawrzoniak, “Operating System Support for Planetary-Scale Network Services,” in NSDI’04: Proceedings of the 1st conference on Network Systems Design and Implementation. USENIX, 2004, pp. 253—266.
L. Wang, K. S. Park, R. Pang, V. Pai, and L. Peterson, “Reliability and security in the CoDeeN content distribution network;’ inATEC ‘04: Proceedings of the annual conference on USENIX Annual Technical Conference. USENIX Association, 2004, pp. 14—14.
K. Park and V. S. Pal, “CoMon: a mostly-scalable monitoring system for PlanetLab’ ACM SIGOPS Operating Systems Review, vol. 40, pp. 65—74, 2006.
M. E. J. Newman, “Power laws, Pareto distributions and Zipf’s law;’ Contemporary Physics, vol. 46, p.323,2005.
R. Bhagwan, S. Savage, and G. Voelker, “Understanding Availability;’ in IPTPS ‘03: Proc. of the 2ndlnt. Workshop on Peer-to-Peer Systems. Springer, 2003, pp. 256—267.