[1] Czajkowski K, Fitzgerald S, Foster I, et al. Grid information services for distributed resource sharing[C]∥Proceedings of the 10th IEEE HPDC. Washington, DC: IEEE Computer Society Press, 2001:181-184.
[2] Raman R, Livny M, Solomon M. Matchmaking: distributed resource management for high throughput computing[C]∥Proc of the 7th IEEE HPDC. Washington,DC:IEEE Computer Society Press, 1998: 140-146.
[3] UDDI[DB/OL]. [2004-10-01]. http:∥ www. uddi. org.
[4] Apgar J, Grimshaw A, Harris S, et al. Secure grid naming protocol (SGNP). Global Grid Forum 4[M]. Toronto:[s.n.], 2002.
[5] Steen M, Homburg P. A tanenbaum globe: a widearea distributed system [J]. IEEE Concurrency, 1999,7(1):70-78.
[6] Yang B, Garcia-Molina H. Improving search in peer-to-peer networks[C]∥Proceedings of the 22nd International Conference on Distributed Computing Systems, IEEE Computer Society. Vienna:[s.n.], 2002: 5-14.
[7] Watts D J, Strogatz S H. Collective dynamics of small-world networks[J]. Nature, 1998,393:440-442.
[8] Kleinberg J. The small-world phenomenon: an algorithmic perspective[R]. 1999.
[9] Kempe D, Kleinberg J. A demers spatial gossip and resource location protocols[C]∥Proceedings of the 33rd ACM Symp on Theory of Computing. Crete:[s.n.], 2001:163-172.
[10] 周晋,路海明,李衍达. 用Small-World设计无组织P2P系统的路由算法[J]. 软件学报,2004, 15(6):915-923. |