Asynchronous resource discovery
暂无分享,去创建一个
[1] Shay Kutten,et al. New models and algorithms for future networks , 1995, IEEE Trans. Inf. Theory.
[2] Kai-Yeung Siu,et al. An O ( log n ) Randomized Resource Discovery Algorithm ( Extended , 2000 .
[3] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .
[4] Shay Kutten,et al. Asynchronous resource discovery in peer to peer networks , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..
[5] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[6] Uzi Vishkin,et al. Deterministic Resource Discovery in Distributed Networks , 2003, Theory of Computing Systems.
[7] Mor Harchol-Balter,et al. Resource discovery in distributed networks , 1999, PODC '99.
[8] Eli Upfal,et al. Building low-diameter P2P networks , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[9] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.
[10] Robert E. Tarjan,et al. A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..
[11] Ben Y. Zhao,et al. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .
[12] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[13] Jan van Leeuwen,et al. Worst-case Analysis of Set Union Algorithms , 1984, JACM.
[14] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.