有结构P2P网络中一跳路由机制的研究
|
摘要
目前互联网中的数据信息资源分布在各个独立的节点上,如何高效、快速地索引、查找、定位以及访问这些资源是一个需要关注的重要问题。随着计算机网络的发展和计算机性能的提高,以维护全局状态为基础的一跳路由机制在资源的发现和定位方面显出特有的优势,正越来越受到关注和研究。
基于对现有的应用一跳路由机制的资源定位和发现方法的分析,本文认为,目前的一跳路由机制在资源的定位和发现方面仍有众多的问题尚未得到关注及有效解决,尤其是涉及到更新消息分发拓扑结构、错误控制以及适用网络规模方面的问题。因此,本文对基于一跳路由机制的资源的定位和发现方法中一系列关键问题进行了深入研究,取得如下成果：
1.提出了一跳路由机制中利用节点空闲资源来提高分发效率的算法。本研究点从节点的网络能力出发,充分利用网络中节点的空闲资源,改进一跳路由机制的分发拓扑,使节点能够实时的动态调整更新消息的分发任务负载。有效的提高了更新消息的分发效率,并实现了异构节点的负载均衡。
2.分析了一跳路由机制中拓扑错误对系统的影响问题,进而提出了相应的错误检测算法。本研究点针对由于一跳路由机制中资源的路由信息和拓扑的维护信息记录在同一个表内,导致系统拓扑信息发生错误及错误的积累不能够被及时感知和修正致使系统发生崩溃的问题进行了分析,在此基础上提出了针对目前基于树状分发拓扑结构的错误检测算法,使得应用一跳路由机制的系统中产生的错误能够被及时被发现和修正。
3.针对一跳路由机制因系统维护开销过大而不适合于大规模网络的问题,提出了一种采用消息融合机制来减少系统网络开销的算法。本研究点从系统实现角度出发,使用消息融合机制,合并同路径更新消息来减少系统的维护开销,实现了消息更新过程中的资源开销优化。
Nowadays, the internet resources are separately distributed in different peers. How to index, locate and access these data resource quickly and efficiently is a concerned issue. And with the development of computer networks and performances, the one-hop routing mechanism which maintains the global state of all peers shows great advantages in resources discovery and location, so it attracts more and more attention and study.
According to analysis of current one-hop routing mechanisms, we find that the dissemination topology for updating messages and the system maintenance overhead is the mainly referred aspect. But there are still lots of problems which have not been resolved or even concerned. Based on current one-hop routing optimization methods, we address several critical problems. The contribution of this dissertation includes:
1. Proposed an algorithm that improves the topology dissemination performance by using the idle resources in peers. This algorithm improves the dissemination topology for one-hop mechanism, makes peers building dissemination trees based on peers'real-time network environments and resources dynamically. With these enhancements, the algorithm improves the dissemination performance of updating messages and achieves loading balance in different peers.
2. Analyzed the topology dissemination errors in one-hop routing mechanisms and further proposed a topology errors detection and recovery schema. We analyzed the characteristics of the system errors and proposed the errors detection method for the tree topology. The simulation shows that the schema can identify and fix topology errors, and also reduces the system maintenance overhead.
3. Each peer in one-hop routing mechanisms has to maintain a big routing table, making it unsuitable for large networks due to the upsurge of the traffic maintenance with inflation of network scale. To fill this gap, we proposed a message-merging mechanism to reduce the maintenance consumption. We studied the messages dissemination structure and introduced the traffic reduction schema by merging the same route messages into one. Furthermore, the approach is evaluated in the simulation and the result shows good experimental performance.
基于对现有的应用一跳路由机制的资源定位和发现方法的分析,本文认为,目前的一跳路由机制在资源的定位和发现方面仍有众多的问题尚未得到关注及有效解决,尤其是涉及到更新消息分发拓扑结构、错误控制以及适用网络规模方面的问题。因此,本文对基于一跳路由机制的资源的定位和发现方法中一系列关键问题进行了深入研究,取得如下成果：
1.提出了一跳路由机制中利用节点空闲资源来提高分发效率的算法。本研究点从节点的网络能力出发,充分利用网络中节点的空闲资源,改进一跳路由机制的分发拓扑,使节点能够实时的动态调整更新消息的分发任务负载。有效的提高了更新消息的分发效率,并实现了异构节点的负载均衡。
2.分析了一跳路由机制中拓扑错误对系统的影响问题,进而提出了相应的错误检测算法。本研究点针对由于一跳路由机制中资源的路由信息和拓扑的维护信息记录在同一个表内,导致系统拓扑信息发生错误及错误的积累不能够被及时感知和修正致使系统发生崩溃的问题进行了分析,在此基础上提出了针对目前基于树状分发拓扑结构的错误检测算法,使得应用一跳路由机制的系统中产生的错误能够被及时被发现和修正。
3.针对一跳路由机制因系统维护开销过大而不适合于大规模网络的问题,提出了一种采用消息融合机制来减少系统网络开销的算法。本研究点从系统实现角度出发,使用消息融合机制,合并同路径更新消息来减少系统的维护开销,实现了消息更新过程中的资源开销优化。
Nowadays, the internet resources are separately distributed in different peers. How to index, locate and access these data resource quickly and efficiently is a concerned issue. And with the development of computer networks and performances, the one-hop routing mechanism which maintains the global state of all peers shows great advantages in resources discovery and location, so it attracts more and more attention and study.
According to analysis of current one-hop routing mechanisms, we find that the dissemination topology for updating messages and the system maintenance overhead is the mainly referred aspect. But there are still lots of problems which have not been resolved or even concerned. Based on current one-hop routing optimization methods, we address several critical problems. The contribution of this dissertation includes:
1. Proposed an algorithm that improves the topology dissemination performance by using the idle resources in peers. This algorithm improves the dissemination topology for one-hop mechanism, makes peers building dissemination trees based on peers'real-time network environments and resources dynamically. With these enhancements, the algorithm improves the dissemination performance of updating messages and achieves loading balance in different peers.
2. Analyzed the topology dissemination errors in one-hop routing mechanisms and further proposed a topology errors detection and recovery schema. We analyzed the characteristics of the system errors and proposed the errors detection method for the tree topology. The simulation shows that the schema can identify and fix topology errors, and also reduces the system maintenance overhead.
3. Each peer in one-hop routing mechanisms has to maintain a big routing table, making it unsuitable for large networks due to the upsurge of the traffic maintenance with inflation of network scale. To fill this gap, we proposed a message-merging mechanism to reduce the maintenance consumption. We studied the messages dissemination structure and introduced the traffic reduction schema by merging the same route messages into one. Furthermore, the approach is evaluated in the simulation and the result shows good experimental performance.
引文
1. Moore's law, URL http://en.wikipedia.org/wiki/Moore's_law
2. Jakob Nielsen, Nielsen's Law of Internet Bandwidth, URL http://www.useit.com/alertbox/980405.html
3. P. Fonseca, R. Rodrigues, A. Gupta, and B. Liskov, Full information lookups for peer-to-peer overlays, IEEE Transactions on Parallel and Distributed Systems, Sep 2009.
4. A. Gupta, B. Liskov, and R. Rodrigues. Efficient Routing for Peer-to-Peer Overlays, Proc. First Symp. Networked Systems Design and Implementation (NSDI'04), Mar 2004.
5. L. R. Monnerat and C. L. Amorim. D1HT: A Distributed One Hop Hash Table. Proc. of the 20th IEEE Intl Parallel & Distributed Processing Symp. (IPDPS), April 2006.
6. Chunqiang Tang, Melissa J. Buco, Rong N. Chang, Sandhya Dwarkadas, Laura Z. Luan, Edward So, and Christopher Ward. Low Traffic Overlay Networks with Large Routing Tables. ACM SIGMETRICS, June 2005.
7. G.DeCandia, D.Hastorum, M.Jampani, G.Kakulapati, A.Lakshman, A.Pilchin, S.Sivasubramanian, P.Vosshall, and W.Vogels. Dynamo:Amazons highly available key value store, Proc. of 21st ACM Symp. On Operating Systems Principles (SOSP), Oct,2007.
8. V. K. Dejan S. Milojicic, Rajan Lukose. Peer-to-Peer Computing, HL Laboratories Research Report,2002.
9. S. Saroiu, K. Gummadi. Exploring the Design Space of Distributed and Peer-to-Peer Systems:Comparing the Web, TRIAD, and Chord/CFS,1st International Workshop on Peer-to-Peer Systems, March 2002.
10. M. Panti, L. Penserini. A P2P Approach to Land Warriors Coordination, International Symp. On Collaborative Technologies and Systems in conjunction with the 2003 Western Multi Conferences, Jan 2003.
11. Napster, the Napster Homepage. http://www.napster.com/.
12. D.P. Anderson. SETI@home:An Experiment in Public Resource Computing, Communications of the ACM,2002.
13. R. Bayya. Economic Models for Management of Resources in P2P Environments, SPIE International Conference on Commercial Applications for High-Performance Computing, Denver, USA, Computational Economics Press, Aug 2001.
14. R. Kazman, W. Hung, and M.Mantei. Dynamic Meeting Annotation and Indexing, In Proc. of the 1995 Pacific Workshop on Distributed Multimedia Systems (Honolulu, HI).1995.
15. A. Oram, editor. PEER-TO-PEER:Harnessing the Power of Disruptive Technologies. O'Reilly & Associates, Inc., CA 95472, USA, March 2001.
16. Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, Roger P. Wattenhofer. Farsite:federated, available, and reliable storage for an incompletely trusted environment, ACM SIGOPS Operating Systems Review-OSDI '02:Proc. of the 5th symposium on Operating systems design and implementation,2002.
17. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, C. Wells, B. Zhao. OceanStore:An architecture for global-scale persistent storage, Proc. of the 9th international conference on Architectural support for programming languages and operating systems, Dec 2000.
18. Buyya, Rajkumar, Steve Chapin, and David DiNucci.2000. Architectural Models for Resource Management in the Grid. In First IEEE/ACM International Workshop on Grid Computing (GRID 2000), De 2000.
19. IBM GRID Computing Project. http://www.research.ibm.com/autonomic/
20. A. Kallio, T. Jauhiainen. A new syndrome of ophthalmoplegia, hypoacusis, ataxia, hypotonia and athetosis (OHAHA), Advances in audiology,1985.
21. Billpoint Homepage. https://www.billpoint.com/
22. R. Dingledine, M. J. Freedman and D. Molnar. The free haven project: Distributed anonymous storage service, Lecture Notes in Computer Science, 2001.
23. Munindar P. Singh, "Peering at Peer-to-Peer Computing", IEEE Internet Computing, Jan 2001.
24. J. Pouwelse, P. Garbacki, D. Epema, and H. Sips. The Bittorrent P2P File-Sharing System:Measurements and Analysis, Lecture Notes in Computer Science,2005.
25. M. Ripeanu. Peer-to-peer architecture case study: Gnutella network, Proceedings of First International Conference on Peer-to-Peer Computing,2001.
26. S. Jose. Deconstructing the Kazaa Network, the Third IEEE Workshop on Internet Applications, June 2003.
27. I. Clarke, O. Sandberg, B. WILEY, and T. HONG. Freenet:A Distributed Anonymous Information Storage and Retrieval System. ICSI Workshop on Design Issues in Anonymity and Unobservability, July 2000.
28. S. Saroiu, P. Gummadi, and S. Gribble. A Measurement Study of Peer-To-Peer File Sharing Systems. In Proc. Of SPIE/ACM MMCN, Jan 2002.
29. Ion Stoica, Robert Morris and David Karger. Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications. Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications,2001.
30. S. Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker. A Scalable Content-Addressable Network, Proceeding of ACM SIGCOMM, Aug 2001.
31. B. Y Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry:An Infrastructure for Fault-Resilient Wide-area Location and Routing. Technical Report:UCB//C SD-011141, U. C. Berkeley,2001.
32. P. Druschel, A. Rowstron. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems, IFIP/ACM International Conference on Distributed Systems Platforms, Jan 2001.
33. B. Leong, B. Liskov and E. D. Demaine. EpiChord:Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. Technical Report MIT-LCS-TR-963.
34. S Anily. A class of Euclidean routing problems with general route cost functions. Mathematics of operations research,1990
35. Petar Maymounkov and David Mazieres. Kademlia:A Peer-to-Peer Information System Based on the XOR Metric. Proceedings of IPTPS, Jan 2002.
36. M. Frans Kaashoek and David R. Karger. Koorde:A Simple Degree-Optimal Distributed Hash Table, Lecture Notes in Computer Science,2003.
37. W. Nejdl, B. Wolf, C. Qu, S Decker,M. Sintek, A.Naeve, Mikael Nilsson, M. Palmer, T.Risch. EDUTELLA:a P2P networking infrastructure based on RDF, Proceedings of the 11th international conference on World Wide Web,2002.
38. Dahlia Malkhi, Moni Naor, and David Ratajczak. Viceroy:A scalable and dynamic emulation of the butterfly, in Proc. of the 21st ACM PODC,2002.
39. Haiying Shena, Cheng-Zhong Xua, and Guihai Chen. Cycloid:a constant-degree and lookup-efficient P2P overlay network, P2P Computing Systems, March 2006.
40. Roger M. Needham. Denial of service, Proceedings of the 1st ACM conference on Computer and communications security,1993.
41. C. Jennings, B. Lowekamp, E. Rescorla, S. A. Baset and H. Schulzrinne. REsource LOcation and Discovery (RELOAD)" 2009.
42. J. Risson, S. Qazi, T. Moors, and A. Harwood. A dependable global location service using rendezvous on hierarchic distributed hash tables, Proc. of the 5th IEEE Conference on Networking. Apr 2006.
43. P.V.Mockapetris, Telephony's next act, IEEE Spectrum,2006.
44. T.Koponen, M.Chawla, B.Chun, A.Ermolinskiy, K.Y.Kim, S. Shenker, and I. Stoica. A data oriented (and beyond) network architecture, Proc. of the 2007 conf. on Applications, technologies, architectures and protocols for computer communications (SIGCOMM07), Aug 2007.
45. Jun Xu. On the fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks, IEEE Journal on Selected Areas in Communications. Jan 2004.
46. J. Risson, A. Harwood, and T. Moors, Stable high-capacity one-hop distributed hash tables, in Proc. of ISCC, Jun 2006.
47. W. Chen, L. Xiao. An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity. IEEE Transactions on Parallel and Distributed Systems,2007.
48. J. Buford, A. Brown and M. KolBerg. Analysis of an Active Maintenance Algorithm for an O (1)-Hop Overlay. Global Telecommunications Conference.(GLOBECOM), Nov 2007.
49. J.Risson, A.Harwood, and T. Moors. Topology Dissemination for Reliable One-Hop Distributed Hash Tables, IEEE transactions on parallel and distributed systems,2008.
50. K.Birman, M.Hayden, O.Ozkasap, Z.Xiao, and M.Budiu. Bimodal Multicast, ACM Trans. On Computer Systems,1999.
51. M.J.Lin, K.Marzullo, and S.Masini. Gossip versus deterministically constrained flooding on small networks, Proc. of the 14th international Conf. on Distrib. Computer (DISC2000), Oct 2000.
52. Indranil Gupta, Ken Birman and Prakash Linga. Kelips:Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead. Oct 2003.
53. A.Browm, J.Nuford and M.Kolberg. Tork:A Variable-Hop Overlay for Heterogeneous Networks, Proc. of the fifth annual IEEE international Conf. on Pervasive Computing and Communications Workshops(PerComW'07),2007.
54. Jinyang Li, Jeremy Stribling, Robert Morris and M. Frans Kaashoek. Bandwidth-efficient management of DHT routing tables. Proc. of the 2nd conference on Symposium on Networked Systems Design & Implementation, 2005.
55. V. Ramasubramanian and E. Sirer, Beehive:O (1) lookup per formance for power law query distributions in peer-to-peer overlays, Proc.of the 1st Symp. On Networked Systems Designand Implementation (NSDI04), Mar 2004.
56. Gang Peng. CDN:Content Distribution Network, Technical Report TR-125 of Experimental Computer Systems Lab in Stony Brook University, Nov 2004.
57. DSN, Distributed Service Network, http://labs.chinamobile.com/dsn/
58. GK Zipf. Human behavior and the principle of least effort.1949. URL: http://en.wikipedia.org/wiki/Zipf slaw
59. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of the Symposium on Theory of Computing, May 1997.
60. SHA-1(Secure Hash Algorithm), http://www.itl.nist.gov/
61. J. Risson, K. Robinson, and T. Moors. Fault tolerant active rings for structured peer-to-peer overlays, Proc. of the 30th Ann. IEEE Conf. on Local Computer Networks (LCN), Nov,2005.
62. G Shafer. Amathematical theory of evidence. In Princeton, NJ., Princeton University Press,1976.
63. AW Marshall. A multivariate exponential distribution. Journal of the American Statistical Association,1967.
64. FA Haight. Handbook of the Poisson distribution,1967.
65. M. Jelasity, A. Montresor, GP Jesi. PeerSim:A peer-to-peer simulator,2004. URL:http://peersim.sourceforge.net
66. D.R. Choffnes and F.E. Bustamante.Taming the Torrent, A Practical Approach to Reducing Cross-ISP Traffic in Peer-to-Peer Systems. ACM SIGCOMM Computer Communication Review, Oct 2008.
67. P2P technical research (CCSA). http://www.ccsa.org.cn
68. P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge. Incentives for Sharing in Peer-to-Peer Networks, in Electronic Commerce,2001
69. S. G. M. Koo and C. S. G. Lee. An incentive-compatible mechanism for efficient distribution of bulk contents on peer-to-peer networks, Telecommunication Systems, Feb 2007.
70. A. Habib and J. Chuang. Service differentiated peer selection:An incentive mechanism for peer-to-peer media streaming. Ieee Transactions on Multimedia, Jun 2006.
71. L. C. S. J. ZHAO Qiao, CHIU Dah Ming. Analysis of Adaptive Incentive Protocols for P2P Networks, INFOCOM 2009.28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies,2009.
72. G. Iosifidis and I. Koutsopoulos. Reputation-Assisted Utility Maximization Algorithmsfor Peer-to-Peer Networks, in Quality of Service,2008. IWQoS 2008.
73. R Mahajan, M Castro. Controlling the cost of reliability in peer-to-peer overlays. Peer-to-Peer Systems Ⅱ,2003
74. L Kuipers. Uniform distribution of sequences.1974. URL: http://en.wikipedia.org/wiki/Uniform_distribution
75. I F Akyildiz, W Su, Y Sankarasubramaniam, E Cayirci. Wireless sensor networks: a survey. Computer Networks(1389-1286),2002.
76. L.Monnerat and C.Amorim. Peer-to-Peer Single Hop Distributed Hash Tables, Global Telecommunications Conference.(GLOBECOM),2009.
77. Chunqiang Tang, Melissa J. Buco, Rong N. Chang, Sandhya Dwarkadas, Laura Z. Luan, Edward So, and Christopher Ward. Low Traffic Overlay Networks with Large Routing Tables. ACM SIGMETRICS, june 2005.
2. Jakob Nielsen, Nielsen's Law of Internet Bandwidth, URL http://www.useit.com/alertbox/980405.html
3. P. Fonseca, R. Rodrigues, A. Gupta, and B. Liskov, Full information lookups for peer-to-peer overlays, IEEE Transactions on Parallel and Distributed Systems, Sep 2009.
4. A. Gupta, B. Liskov, and R. Rodrigues. Efficient Routing for Peer-to-Peer Overlays, Proc. First Symp. Networked Systems Design and Implementation (NSDI'04), Mar 2004.
5. L. R. Monnerat and C. L. Amorim. D1HT: A Distributed One Hop Hash Table. Proc. of the 20th IEEE Intl Parallel & Distributed Processing Symp. (IPDPS), April 2006.
6. Chunqiang Tang, Melissa J. Buco, Rong N. Chang, Sandhya Dwarkadas, Laura Z. Luan, Edward So, and Christopher Ward. Low Traffic Overlay Networks with Large Routing Tables. ACM SIGMETRICS, June 2005.
7. G.DeCandia, D.Hastorum, M.Jampani, G.Kakulapati, A.Lakshman, A.Pilchin, S.Sivasubramanian, P.Vosshall, and W.Vogels. Dynamo:Amazons highly available key value store, Proc. of 21st ACM Symp. On Operating Systems Principles (SOSP), Oct,2007.
8. V. K. Dejan S. Milojicic, Rajan Lukose. Peer-to-Peer Computing, HL Laboratories Research Report,2002.
9. S. Saroiu, K. Gummadi. Exploring the Design Space of Distributed and Peer-to-Peer Systems:Comparing the Web, TRIAD, and Chord/CFS,1st International Workshop on Peer-to-Peer Systems, March 2002.
10. M. Panti, L. Penserini. A P2P Approach to Land Warriors Coordination, International Symp. On Collaborative Technologies and Systems in conjunction with the 2003 Western Multi Conferences, Jan 2003.
11. Napster, the Napster Homepage. http://www.napster.com/.
12. D.P. Anderson. SETI@home:An Experiment in Public Resource Computing, Communications of the ACM,2002.
13. R. Bayya. Economic Models for Management of Resources in P2P Environments, SPIE International Conference on Commercial Applications for High-Performance Computing, Denver, USA, Computational Economics Press, Aug 2001.
14. R. Kazman, W. Hung, and M.Mantei. Dynamic Meeting Annotation and Indexing, In Proc. of the 1995 Pacific Workshop on Distributed Multimedia Systems (Honolulu, HI).1995.
15. A. Oram, editor. PEER-TO-PEER:Harnessing the Power of Disruptive Technologies. O'Reilly & Associates, Inc., CA 95472, USA, March 2001.
16. Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, Roger P. Wattenhofer. Farsite:federated, available, and reliable storage for an incompletely trusted environment, ACM SIGOPS Operating Systems Review-OSDI '02:Proc. of the 5th symposium on Operating systems design and implementation,2002.
17. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, C. Wells, B. Zhao. OceanStore:An architecture for global-scale persistent storage, Proc. of the 9th international conference on Architectural support for programming languages and operating systems, Dec 2000.
18. Buyya, Rajkumar, Steve Chapin, and David DiNucci.2000. Architectural Models for Resource Management in the Grid. In First IEEE/ACM International Workshop on Grid Computing (GRID 2000), De 2000.
19. IBM GRID Computing Project. http://www.research.ibm.com/autonomic/
20. A. Kallio, T. Jauhiainen. A new syndrome of ophthalmoplegia, hypoacusis, ataxia, hypotonia and athetosis (OHAHA), Advances in audiology,1985.
21. Billpoint Homepage. https://www.billpoint.com/
22. R. Dingledine, M. J. Freedman and D. Molnar. The free haven project: Distributed anonymous storage service, Lecture Notes in Computer Science, 2001.
23. Munindar P. Singh, "Peering at Peer-to-Peer Computing", IEEE Internet Computing, Jan 2001.
24. J. Pouwelse, P. Garbacki, D. Epema, and H. Sips. The Bittorrent P2P File-Sharing System:Measurements and Analysis, Lecture Notes in Computer Science,2005.
25. M. Ripeanu. Peer-to-peer architecture case study: Gnutella network, Proceedings of First International Conference on Peer-to-Peer Computing,2001.
26. S. Jose. Deconstructing the Kazaa Network, the Third IEEE Workshop on Internet Applications, June 2003.
27. I. Clarke, O. Sandberg, B. WILEY, and T. HONG. Freenet:A Distributed Anonymous Information Storage and Retrieval System. ICSI Workshop on Design Issues in Anonymity and Unobservability, July 2000.
28. S. Saroiu, P. Gummadi, and S. Gribble. A Measurement Study of Peer-To-Peer File Sharing Systems. In Proc. Of SPIE/ACM MMCN, Jan 2002.
29. Ion Stoica, Robert Morris and David Karger. Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications. Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications,2001.
30. S. Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker. A Scalable Content-Addressable Network, Proceeding of ACM SIGCOMM, Aug 2001.
31. B. Y Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry:An Infrastructure for Fault-Resilient Wide-area Location and Routing. Technical Report:UCB//C SD-011141, U. C. Berkeley,2001.
32. P. Druschel, A. Rowstron. Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems, IFIP/ACM International Conference on Distributed Systems Platforms, Jan 2001.
33. B. Leong, B. Liskov and E. D. Demaine. EpiChord:Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management. Technical Report MIT-LCS-TR-963.
34. S Anily. A class of Euclidean routing problems with general route cost functions. Mathematics of operations research,1990
35. Petar Maymounkov and David Mazieres. Kademlia:A Peer-to-Peer Information System Based on the XOR Metric. Proceedings of IPTPS, Jan 2002.
36. M. Frans Kaashoek and David R. Karger. Koorde:A Simple Degree-Optimal Distributed Hash Table, Lecture Notes in Computer Science,2003.
37. W. Nejdl, B. Wolf, C. Qu, S Decker,M. Sintek, A.Naeve, Mikael Nilsson, M. Palmer, T.Risch. EDUTELLA:a P2P networking infrastructure based on RDF, Proceedings of the 11th international conference on World Wide Web,2002.
38. Dahlia Malkhi, Moni Naor, and David Ratajczak. Viceroy:A scalable and dynamic emulation of the butterfly, in Proc. of the 21st ACM PODC,2002.
39. Haiying Shena, Cheng-Zhong Xua, and Guihai Chen. Cycloid:a constant-degree and lookup-efficient P2P overlay network, P2P Computing Systems, March 2006.
40. Roger M. Needham. Denial of service, Proceedings of the 1st ACM conference on Computer and communications security,1993.
41. C. Jennings, B. Lowekamp, E. Rescorla, S. A. Baset and H. Schulzrinne. REsource LOcation and Discovery (RELOAD)
42. J. Risson, S. Qazi, T. Moors, and A. Harwood. A dependable global location service using rendezvous on hierarchic distributed hash tables, Proc. of the 5th IEEE Conference on Networking. Apr 2006.
43. P.V.Mockapetris, Telephony's next act, IEEE Spectrum,2006.
44. T.Koponen, M.Chawla, B.Chun, A.Ermolinskiy, K.Y.Kim, S. Shenker, and I. Stoica. A data oriented (and beyond) network architecture, Proc. of the 2007 conf. on Applications, technologies, architectures and protocols for computer communications (SIGCOMM07), Aug 2007.
45. Jun Xu. On the fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks, IEEE Journal on Selected Areas in Communications. Jan 2004.
46. J. Risson, A. Harwood, and T. Moors, Stable high-capacity one-hop distributed hash tables, in Proc. of ISCC, Jun 2006.
47. W. Chen, L. Xiao. An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity. IEEE Transactions on Parallel and Distributed Systems,2007.
48. J. Buford, A. Brown and M. KolBerg. Analysis of an Active Maintenance Algorithm for an O (1)-Hop Overlay. Global Telecommunications Conference.(GLOBECOM), Nov 2007.
49. J.Risson, A.Harwood, and T. Moors. Topology Dissemination for Reliable One-Hop Distributed Hash Tables, IEEE transactions on parallel and distributed systems,2008.
50. K.Birman, M.Hayden, O.Ozkasap, Z.Xiao, and M.Budiu. Bimodal Multicast, ACM Trans. On Computer Systems,1999.
51. M.J.Lin, K.Marzullo, and S.Masini. Gossip versus deterministically constrained flooding on small networks, Proc. of the 14th international Conf. on Distrib. Computer (DISC2000), Oct 2000.
52. Indranil Gupta, Ken Birman and Prakash Linga. Kelips:Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead. Oct 2003.
53. A.Browm, J.Nuford and M.Kolberg. Tork:A Variable-Hop Overlay for Heterogeneous Networks, Proc. of the fifth annual IEEE international Conf. on Pervasive Computing and Communications Workshops(PerComW'07),2007.
54. Jinyang Li, Jeremy Stribling, Robert Morris and M. Frans Kaashoek. Bandwidth-efficient management of DHT routing tables. Proc. of the 2nd conference on Symposium on Networked Systems Design & Implementation, 2005.
55. V. Ramasubramanian and E. Sirer, Beehive:O (1) lookup per formance for power law query distributions in peer-to-peer overlays, Proc.of the 1st Symp. On Networked Systems Designand Implementation (NSDI04), Mar 2004.
56. Gang Peng. CDN:Content Distribution Network, Technical Report TR-125 of Experimental Computer Systems Lab in Stony Brook University, Nov 2004.
57. DSN, Distributed Service Network, http://labs.chinamobile.com/dsn/
58. GK Zipf. Human behavior and the principle of least effort.1949. URL: http://en.wikipedia.org/wiki/Zipf slaw
59. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees:Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of the Symposium on Theory of Computing, May 1997.
60. SHA-1(Secure Hash Algorithm), http://www.itl.nist.gov/
61. J. Risson, K. Robinson, and T. Moors. Fault tolerant active rings for structured peer-to-peer overlays, Proc. of the 30th Ann. IEEE Conf. on Local Computer Networks (LCN), Nov,2005.
62. G Shafer. Amathematical theory of evidence. In Princeton, NJ., Princeton University Press,1976.
63. AW Marshall. A multivariate exponential distribution. Journal of the American Statistical Association,1967.
64. FA Haight. Handbook of the Poisson distribution,1967.
65. M. Jelasity, A. Montresor, GP Jesi. PeerSim:A peer-to-peer simulator,2004. URL:http://peersim.sourceforge.net
66. D.R. Choffnes and F.E. Bustamante.Taming the Torrent, A Practical Approach to Reducing Cross-ISP Traffic in Peer-to-Peer Systems. ACM SIGCOMM Computer Communication Review, Oct 2008.
67. P2P technical research (CCSA). http://www.ccsa.org.cn
68. P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge. Incentives for Sharing in Peer-to-Peer Networks, in Electronic Commerce,2001
69. S. G. M. Koo and C. S. G. Lee. An incentive-compatible mechanism for efficient distribution of bulk contents on peer-to-peer networks, Telecommunication Systems, Feb 2007.
70. A. Habib and J. Chuang. Service differentiated peer selection:An incentive mechanism for peer-to-peer media streaming. Ieee Transactions on Multimedia, Jun 2006.
71. L. C. S. J. ZHAO Qiao, CHIU Dah Ming. Analysis of Adaptive Incentive Protocols for P2P Networks, INFOCOM 2009.28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies,2009.
72. G. Iosifidis and I. Koutsopoulos. Reputation-Assisted Utility Maximization Algorithmsfor Peer-to-Peer Networks, in Quality of Service,2008. IWQoS 2008.
73. R Mahajan, M Castro. Controlling the cost of reliability in peer-to-peer overlays. Peer-to-Peer Systems Ⅱ,2003
74. L Kuipers. Uniform distribution of sequences.1974. URL: http://en.wikipedia.org/wiki/Uniform_distribution
75. I F Akyildiz, W Su, Y Sankarasubramaniam, E Cayirci. Wireless sensor networks: a survey. Computer Networks(1389-1286),2002.
76. L.Monnerat and C.Amorim. Peer-to-Peer Single Hop Distributed Hash Tables, Global Telecommunications Conference.(GLOBECOM),2009.
77. Chunqiang Tang, Melissa J. Buco, Rong N. Chang, Sandhya Dwarkadas, Laura Z. Luan, Edward So, and Christopher Ward. Low Traffic Overlay Networks with Large Routing Tables. ACM SIGMETRICS, june 2005.