|
[1] Ellen Deleganes, Sara Bitan, “ DDP/RDMAP Security” January, 2005 www.ietf.org/proceedings/04aug/I-D/draft-ietf-rddp-security-02.txt [2] C. Greg Plaxton, Rajmohan Rajaraman, et al. “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,”ACM Symposium on Parallel Algorithms and Architectures,1997 [3] Sylvia Ratnasamy, Mark Handley,et al. “Topologically-Aware Overlay Construction and Server Selection,” Proceedings of IEEE INFOCOM''02 [4] Marcel Waldvogel, Roberto Rinaldi. “Efficient Topology-Aware Overlay Network,” ACM Computer Communication Review, 2001 [5] T.S. Eugene Ng, Hui Zhang,” Predicting Internet Network Distance with Coordinates-Based Approaches,” ACM Computer Communication Review, 2001 [6] Theilmann, Rothermel “Dynamic Distance Maps of the Internet,” in Series-Proceeding-Section-Article ACM Press, Pages:84-95, 2000. [7] TS Eugene Ng and Hui Zhang “Towards Global Network Positioning,” Department of Computer Science Carnegie Mellon University Pittsburgh, PA, 2000. [8] M Junginger. and Lee Yugyung, “The Multi-Ring Topology –High-Performance Group Communication in Peer-to-Peer Networks,” in Peer-to-Peer Computing, 2002. (P2P 2002). Proceedings, Pages: 49- 56, 2002. [9] James Aspnes, Zoë Diamadi and Gauri Shah, “Fault-tolerant in Routing in Peer-to-Peer System,” in ACM Series-Proceeding-Section-Article, Pages: 223 – 232, 2002. [10] .M Ripeanu, “Peer-to-Peer Architecture Case Study : Gnutalla Network,” in Peer-to-Peer Computing Proceeding, Pages: 99-100, 2001. [11] P. Francis, M. Handley, R. Karp and S. Shenker, “A scalable content-addressable network,” S. Ratnasamy, in Proc. ACM SIGCOMM, Pages: 161-172, 2001. [12] A. Rowstron and P. Druschel, ”Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems,” in Proc. 18th IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware 2001), Pages: 329-350, 2001. [13] B. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry:An infrastructure for fault-tolerant wide-area location and routing,” in Comput. Sci. Div., Univ. California, Berkeley, Tech. Rep. UCB/CSD-01-1141, 2001. [14] Das B. and Bharghavan V., “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” in IEEE International Conference on Communications, Volume: 1 , Pages: 376 -380, 1997. [15] Paul Francis, Yuri Pryadkin, et al. “YOID: Your Own Internet Distribution,” in http://www.icir.org/yoid/. ACIRI, April 2, 2000 [16] Ben Y. Zhao, Yitao Duan, et al. “Brocade: Landmark Routing on Overlay Networks” Kubiatowicz,2002 [17] Napster, http://www.napster.com [18] Hui Zhang, Rao S.G., et al.,”A Case for End System Multicast,” in IEEE J. Selected Areas Commun, Volume: 20, Pages: 1456 -1471, 2002. [19] Kwangwook Shin, Seunghak Lee, “Grapes: Topology-based Hierarchical Virtual Network for Peer-to-Peer Lookup Services,” in Parallel Processing Workshops Proceedings, Pages: 159 -164, 2002. [20] LimeWire. http://www.limewire.org. [21] Matei R., Iamnitchi A. and Foster P., “Mapping the Guntella Network,” in Internet Computing IEEE, Volume: 6, Pages: 50 -57, 2002. [22] L. Garcés-Erice, E.W. Biersack, P.A, “Hierarchical Peer-to-peer Systems,” Urvoy-Keller Proceedings of ACM/IFIP International Conference on Parallel and Distributed Computing (Euro-Par),2002 [23] Ion Stoica, Robert Morris, et al. “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications [24] Ben Y. Zhao, John Kubiatowicz, et al. “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing” , UC Berkeley ,2001 [25] Tasi H.P. Vuong and D.T. Huynh, ”Adapting D-hop Dominating Sets to Topology Changes in Ad Hoc Networks,” in Proceedings Ninth International Conference on Computer Communications and Networks, Pages: 348 -353, 2000 [26] Melander B, Bjorkman M. and Gunningberg P.,”A New End-to-End Probing and Analysis Method for Estimating Bandwidth Bottlenecks,” in IEEE Global Telecommunications Conference GLOBECOM ''00 , Volume: 1, Pages: 415 -420, 2000. [27] Lavian T. and Phil Yonghui Wang , “Active networking on a programmable networking platform,” in IEEE Open Architectures and Network Programming Proceedings, Pages: 95 -103, 2001.
|