基于文件复制的对等网络搭便车抑制技术研究
|
摘要
过于严重的搭便车行为会降低对等网络的健壮性、服务响应速度、可用性、生命周期等，如何抑制自私节点的搭便车行为是对等网络研究的重要问题。然而，现有对等网络搭便车抑制机制存在公平性欠佳、计算复杂性较高、工程实现难度大等问题。因此，对等网络搭便车抑制技术研究需设计新型搭便车抑制机制，模型化分析新型搭便车抑制机制的效率以及对网络服务性能的影响，并在真实对等网络系统中测试新型抑制机制的可用性和效率。
基于文件复制的搭便车抑制机制通过复制过载节点中的高频访问文件到邻接搭便车节点，迫使搭便车节点为对等网络作贡献，提高对等网络的健壮性、文件服务的可用性等。提出复杂对等网络图定量描述对等网络的拓扑结构、节点状态和共享文件分布特征，分析搭便车抑制机制对搭便车节点比率、对等网络健壮性、文件共享服务可用性等的影响规律。通过在基于语义的对等网络科技文献共享系统SemreX中的应用，测试了基于文件复制的搭便车抑制机制的实用性和效率。
针对各节点都期望享受高质量服务，又维持对等网络稳定运营的需求，提出了一种通过共享文件复制和负载均衡的搭便车抑制机制FRWBBA(File Replication andWorkload Balancing based Approach)。FRWBBA的思路是：各节点周期性监视自身资源利用率，判断节点是否过载；若节点过载，则主动向邻接搭便车节点透明地复制少数高频访问文件；更新共享文件信息，文件接收节点开始为对等网络提供更多服务。FRWBBA在不降低搭便车者所享受的服务质量前提下，迫使一些搭便车节点参与对等网络服务，保护了过载节点。
过载节点如何实现高效的文件复制操作，是实现搭便车抑制机制FRWBBA的关键。根据对等网络文件访问次数分布近似服从齐普夫定律的特征，提出将过载节点中被访问次数最高的少量文件复制到邻接搭便车节点，该方案以较低对等网络通信开销、快速降低了过载节点的工作负载。提出将高频访问文件复制到邻接搭便车节点中负载最轻的部分节点，或根据文件访问路径规律，将热点文件复制到高频服务请求转发节点。仿真表明，最低负载优先策略和基于访问路径的目标节点选择策略，均是高效的文件复制目标节点选择策略。前者能快速消除对等网络中的过载节点，后者能显著降低文件查询服务的平均访问跳数。
为了客观比较不同搭便车抑制机制的效率差异，归纳出搭便车抑制机制的效率评价核心指标集；提出复杂对等网络图来定量描述搭便车抑制机制对对等网络状态的影响。复杂对等网络图描述了对等网络的拓扑结构、节点异质性和共享文件分布状态等特征，定义了搭便车抑制机制的效率评价核心指标集。应用复杂对等网络图和无标度网络理论，分析了FRWBBA对搭便车节点比率、服务可用性、对等网络健壮性等的影响规律；比较了FRWBBA和基于激励的搭便车抑制机制的效率差异，得出FRWBBA是更受节点用户和对等网络运营者欢迎的搭便车抑制机制。
为了测试FRWBBA的工程可行性和效率，用Java实现了FRWBBA，并封装为AntifreeridingWare软件包。基于语义的对等网络科技文献共享系统SemreX采用AntifreeridingWare抑制对等网络中的搭便车行为。该应用实例表明AntifreeridingWare有效、可行，且易于在第三方对等网络文件共享系统中应用。
与基于激励的对等网络搭便车抑制机制相比，FRWBBA维护了对等网络服务的公平性、保证了对等网络尽力为全体用户提供服务；与基于博弈论的搭便车抑制机制相比，FRWBBA无需对等网络节点行为的全局信息，易于实现且可扩展性强；与采用社会网络和经济模型的搭便车抑制机制相比，FRWBBA更具工程可行性。
Most of peers in Peer-to-Peer (P2P) networks merely take what they need from others,and only a few altruistic peers provide services. These selfish behaviors are regarded asfree riding, and selfish peers are referred to as free riders. Free riding is a great challengefor P2P networks because it impairs robustness, availability, and lifetime of P2P systems.Some anti-free riding mechanisms are proposed, among which, the incentive mechanismsnot only degrade the Quality of Service (QoS) of free riders, but also decrease the numberof online users; the game theoretical approaches are too complicated to implement inlarge-scale P2P networks; the employment of social network/economic models in practiceis not fully investigated yet. Thus, a feasible, scalable and simple anti-free ridingmechanism is required.
This thesis is dedicated to a distributed anti-free riding mechanism. The salient featureof our research is that peer's heterogeneity and inherent selfishness is given greatconsideration. P2P network is described with a novel model, which includes the networktopology, peers status, and files distribution. The efficiency criteria are defined formallyand clearly with the novel P2P network model, and different anti-free riding mechanismsare compared. Finally, the novel anti-free riding mechanism is employed in a scientificreferences sharing system, which shows that it is feasible and efficient.
A file replication and workload balancing based anti-free riding mechanism (FRWBBA)is proposed in Chapter 2. The basic idea of FRWBBA is as follows. Every peer monitorsits workload status periodically and independently. If the workload is too heavy, theoverloaded peer transfers some frequently accessed files to neighbored free ridersproactively and transparently. As a result, these neighbored free riders share more popularfiles and make more contributions to P2P systems. The number of free rider is reduced,while the overloaded peers are well protected. Extensive simulations are carried out toverify the efficiency of FRWBBA. The results show that FRWBBA makes the whole P2Pnetwork robust and the shared files distributed appropriately.
The strategies of file replication from overloaded peer to neighbored free riders areinvestigated in Chapter 3. As Zipf's law is suitable for modeling P2P file-accessedfrequencies, replicating the most popular files from overloaded peer to neighbored freeriders can decrease the workload effectively. Three strategies of target peers selection in terms of workload are proposed. Simulation results indicate that popular files should bereplicated to the least workload neighbors, which can eliminate overloaded peers rapidly.As an alternative, overloaded peer can transfer popular files to the ones near the serviceconsumers to reduce the hops of file access.
P2P network modeling is important to evaluate anti-free riding mechanisms, which isdiscussed in Chapter 4. The essential metrics for P2P networks with respect to free ridingare identified. On this basis, a complex P2P graph is proposed, which can describe the P2Pnetwork topology, the heterogeneity of peers, and the relationship between shared filesdistributed in peers and the network topology. Since P2P networks are scale-free, theirrobustness and crispness is analyzed. The efficiency of FRWBBA and incentivemechanisms is evaluated by using the complex P2P graph and properties of scale-freenetworks. FRWBBA is shown superior to incentive mechanisms from the perspectives ofboth P2P users and suppliers.
FRWBBA is implemented in JAVA and packaged as AntifreeridingWare. The softwaredevelopment methods of AntifreeridngWare are presented in Chapter 5. To illustrate theusage of the package, it is integrated into Semrex, a P2P scientific references sharingsystem, to deal with free riding. The development experiences suggest that anti-free ridingmethod cannot be separated from P2P applications completely, because it needs thesupports from P2P programs.
The model analysis, Simulations, and applications in real P2P system all validate thatFRWBBA is an efficient anti-free riding approach. FRWBBA reduces the number of freeriders, and makes P2P networks provide services to all peers in best efforts. The abundantfiles in P2P network are maintained and distributed properly after anti-free riding control.Compared to the incentive mechanisms, FRWBBA offers better fairness to those peersbehind firewall and Network Address Translations, or peers with low speed Internetconnections. The software development experiences of FRWBBA help it be integrated intodifferent P2P applications quickly.
基于文件复制的搭便车抑制机制通过复制过载节点中的高频访问文件到邻接搭便车节点，迫使搭便车节点为对等网络作贡献，提高对等网络的健壮性、文件服务的可用性等。提出复杂对等网络图定量描述对等网络的拓扑结构、节点状态和共享文件分布特征，分析搭便车抑制机制对搭便车节点比率、对等网络健壮性、文件共享服务可用性等的影响规律。通过在基于语义的对等网络科技文献共享系统SemreX中的应用，测试了基于文件复制的搭便车抑制机制的实用性和效率。
针对各节点都期望享受高质量服务，又维持对等网络稳定运营的需求，提出了一种通过共享文件复制和负载均衡的搭便车抑制机制FRWBBA(File Replication andWorkload Balancing based Approach)。FRWBBA的思路是：各节点周期性监视自身资源利用率，判断节点是否过载；若节点过载，则主动向邻接搭便车节点透明地复制少数高频访问文件；更新共享文件信息，文件接收节点开始为对等网络提供更多服务。FRWBBA在不降低搭便车者所享受的服务质量前提下，迫使一些搭便车节点参与对等网络服务，保护了过载节点。
过载节点如何实现高效的文件复制操作，是实现搭便车抑制机制FRWBBA的关键。根据对等网络文件访问次数分布近似服从齐普夫定律的特征，提出将过载节点中被访问次数最高的少量文件复制到邻接搭便车节点，该方案以较低对等网络通信开销、快速降低了过载节点的工作负载。提出将高频访问文件复制到邻接搭便车节点中负载最轻的部分节点，或根据文件访问路径规律，将热点文件复制到高频服务请求转发节点。仿真表明，最低负载优先策略和基于访问路径的目标节点选择策略，均是高效的文件复制目标节点选择策略。前者能快速消除对等网络中的过载节点，后者能显著降低文件查询服务的平均访问跳数。
为了客观比较不同搭便车抑制机制的效率差异，归纳出搭便车抑制机制的效率评价核心指标集；提出复杂对等网络图来定量描述搭便车抑制机制对对等网络状态的影响。复杂对等网络图描述了对等网络的拓扑结构、节点异质性和共享文件分布状态等特征，定义了搭便车抑制机制的效率评价核心指标集。应用复杂对等网络图和无标度网络理论，分析了FRWBBA对搭便车节点比率、服务可用性、对等网络健壮性等的影响规律；比较了FRWBBA和基于激励的搭便车抑制机制的效率差异，得出FRWBBA是更受节点用户和对等网络运营者欢迎的搭便车抑制机制。
为了测试FRWBBA的工程可行性和效率，用Java实现了FRWBBA，并封装为AntifreeridingWare软件包。基于语义的对等网络科技文献共享系统SemreX采用AntifreeridingWare抑制对等网络中的搭便车行为。该应用实例表明AntifreeridingWare有效、可行，且易于在第三方对等网络文件共享系统中应用。
与基于激励的对等网络搭便车抑制机制相比，FRWBBA维护了对等网络服务的公平性、保证了对等网络尽力为全体用户提供服务；与基于博弈论的搭便车抑制机制相比，FRWBBA无需对等网络节点行为的全局信息，易于实现且可扩展性强；与采用社会网络和经济模型的搭便车抑制机制相比，FRWBBA更具工程可行性。
Most of peers in Peer-to-Peer (P2P) networks merely take what they need from others,and only a few altruistic peers provide services. These selfish behaviors are regarded asfree riding, and selfish peers are referred to as free riders. Free riding is a great challengefor P2P networks because it impairs robustness, availability, and lifetime of P2P systems.Some anti-free riding mechanisms are proposed, among which, the incentive mechanismsnot only degrade the Quality of Service (QoS) of free riders, but also decrease the numberof online users; the game theoretical approaches are too complicated to implement inlarge-scale P2P networks; the employment of social network/economic models in practiceis not fully investigated yet. Thus, a feasible, scalable and simple anti-free ridingmechanism is required.
This thesis is dedicated to a distributed anti-free riding mechanism. The salient featureof our research is that peer's heterogeneity and inherent selfishness is given greatconsideration. P2P network is described with a novel model, which includes the networktopology, peers status, and files distribution. The efficiency criteria are defined formallyand clearly with the novel P2P network model, and different anti-free riding mechanismsare compared. Finally, the novel anti-free riding mechanism is employed in a scientificreferences sharing system, which shows that it is feasible and efficient.
A file replication and workload balancing based anti-free riding mechanism (FRWBBA)is proposed in Chapter 2. The basic idea of FRWBBA is as follows. Every peer monitorsits workload status periodically and independently. If the workload is too heavy, theoverloaded peer transfers some frequently accessed files to neighbored free ridersproactively and transparently. As a result, these neighbored free riders share more popularfiles and make more contributions to P2P systems. The number of free rider is reduced,while the overloaded peers are well protected. Extensive simulations are carried out toverify the efficiency of FRWBBA. The results show that FRWBBA makes the whole P2Pnetwork robust and the shared files distributed appropriately.
The strategies of file replication from overloaded peer to neighbored free riders areinvestigated in Chapter 3. As Zipf's law is suitable for modeling P2P file-accessedfrequencies, replicating the most popular files from overloaded peer to neighbored freeriders can decrease the workload effectively. Three strategies of target peers selection in terms of workload are proposed. Simulation results indicate that popular files should bereplicated to the least workload neighbors, which can eliminate overloaded peers rapidly.As an alternative, overloaded peer can transfer popular files to the ones near the serviceconsumers to reduce the hops of file access.
P2P network modeling is important to evaluate anti-free riding mechanisms, which isdiscussed in Chapter 4. The essential metrics for P2P networks with respect to free ridingare identified. On this basis, a complex P2P graph is proposed, which can describe the P2Pnetwork topology, the heterogeneity of peers, and the relationship between shared filesdistributed in peers and the network topology. Since P2P networks are scale-free, theirrobustness and crispness is analyzed. The efficiency of FRWBBA and incentivemechanisms is evaluated by using the complex P2P graph and properties of scale-freenetworks. FRWBBA is shown superior to incentive mechanisms from the perspectives ofboth P2P users and suppliers.
FRWBBA is implemented in JAVA and packaged as AntifreeridingWare. The softwaredevelopment methods of AntifreeridngWare are presented in Chapter 5. To illustrate theusage of the package, it is integrated into Semrex, a P2P scientific references sharingsystem, to deal with free riding. The development experiences suggest that anti-free ridingmethod cannot be separated from P2P applications completely, because it needs thesupports from P2P programs.
The model analysis, Simulations, and applications in real P2P system all validate thatFRWBBA is an efficient anti-free riding approach. FRWBBA reduces the number of freeriders, and makes P2P networks provide services to all peers in best efforts. The abundantfiles in P2P network are maintained and distributed properly after anti-free riding control.Compared to the incentive mechanisms, FRWBBA offers better fairness to those peersbehind firewall and Network Address Translations, or peers with low speed Internetconnections. The software development experiences of FRWBBA help it be integrated intodifferent P2P applications quickly.
引文
[1] Oram Andy, "PEER-TO-PEER: Harnessing the Power of Disruptive Technologies," Sebastopol: O'REILLY, 2001, pp. 3-20
[2] Lee Jintae, "An end user perspective on file sharing system," Communications of the ACM, 2003, Vol. 46, No. 2, pp. 49-53
[3] Adar Eytan and Huberman Bemardo A., "Free Riding on Gnutella," First Monday, 2000, Vol. 5, No. 10, pp. 32-35
[4] Ramaswamy Lakshmish and Liu Ling, "Free Riding: A New Challenge to Peer-to-Peer File Sharing Systems," In Proceeding of the 36th Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2003, pp. 220-229
[5] Courcoubetis Costas and Weber Richard R., "Incentive for Large Peer-to-Peer Systems," IEEE Journal of Selected Areas in Communications, 2006, Vol. 24, No. 5, pp. 1034-1050
[6] Ripeanu Matei, Foster Ian, and Iamnitchi Adriana, "Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System," IEEE Internet Computing, 2002, Vol. 6, No. 2, pp. 50-57
[7] Sen Subhabrata and Wang Jia, "Analyzing Peer-to-Peer Traffic Across Large Networks," IEEE/ACM Transactions on Networking, 2004, Vol. 12, No. 2, pp. 219-232
[8] Karagiannis Thomas, Broido Andre, Brownlee Nevil, Claffy Kc, and Faloutsos Michalis, "Is P2P Dying or Just Hiding?" In Proceeding of the Globecom 2004, Washington: IEEE Communication Society, 2004, pp. 1532-1537
[9] Hughes Daniel, Coulson Geoff, and James Walkerdine, "Free Riding on Gnutella Revisited: The Bell Tolls?" IEEE Distributed Systems Online, 2005, Vol. 6, No. 6, pp. 1-18
[10] Daniel Stutzbach and Reza Rejaie, "Capturing Accurate Snapshots of the Gnutella Network", In Proceedings of the Global Internet Symposium 2005, Washington: IEEE Communication Society, 2005, pp. 127-132
[11] Meng Shicong, Shi Cong, Han Dingyi, Zhu Xing, and Yu Yong, "A Statistical Study of Today's Gnutella," In Proceeding of APWeb 2006, (Xiaofang Zhou, Jianzhong Li, Heng Tao Shen, et al., Editors), Berlin: Springer-Verlag, 2006, pp. 437-448
[12] Andrew Roczniak and Abdulmotaleb El Saddik, "Impact of Incentive Mechanisms on Quality of Experience," In Proceedings of the 13th ACM International Conference on Multimedia, 2005, (Zhang HongJiang, Chua Tat-Seng, Steinmetz Ralf, et al., Editors), New York: ACM Press, 2005, pp. 311-314
[13] Ma Richard T. B, Lee C. M., Lui John C. S., and Yau David K. Y., "Incentive P2P Networks: A Protocol to Encourage Information Sharing and Contribution," SIGMETRICS Performance Evaluation Review, 2003, Vol. 31, No. 2, pp. 23-25
[14] Ma Richard T. B., Lee Sam C. M., Lui John C. S., and Yau David K. Y., "An Incentive Mechanism for P2P Networks," In Proceedings of the 2 4th International Conference on Distributed Computing Systems, Washington: IEEE Computer Society, 2004, pp. 516-523
[15] Anceaume Emmanuelle, Gradinariu Maria, and Ravoajia Aina, "Incentive for P2P Fair Resource Sharing," In Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, (Caronni Germano, Weiler Nathalie, Waldvogel Marcel, Shahmehri Nahid, Editors), Washington: IEEE Computer Society, 2005, pp. 253-260
[16] Figueiredo Daniel, Shapiro Jonathan, and Towsley Don, "Incentives to Promote Availability in Peer-to-Peer Anonymity Systems," In Proceedings of the 13th IEEE International Conference on Network Protocols, Washington: IEEE Computer Society, 2005, pp. 110-121
[17] Lui S. M., Lang Karl R., and Kwok S. H., "Participation Incentive Mechanisms in Peer-to-Peer Subscription Systems," In Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2002, pp. 3925-3931
[18] Guan Zhitao, Durad Muhammad Hanif, Cao Yuanda, and Zhu Liehuang, "An Efficient Hybrid P2P Incentive Scheme," In Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, (Feng Wenying, Gao Feng, Editors), Washington: IEEE Computer Society, 2007, pp. 377-382
[19] DeFigueiredo Dimitri, Venkatachalam Balaji, and Wu S. Felix, "Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies," In Proceedings of the 7th IEEE International Conference on Peer-to-Peer Computing, Washington: IEEE Computer Society, 2007, pp. 11-18
[20] Karakaya Murat, Korpeouglu Ibrahim, and Ulusoy Ozgur, "A Distributed and Measurement-based Framework Against Free Riding in Peer-to-Peer Networks," In Proceedings of the 4th International Conference on Peer-to-Peer Computing, (Germano Caronni, Nathalie Weiler, and Nahid Shahmehri, Editors), Washington: IEEE Computer Society, 2004, pp. 276-277
[21] Karakaya Murat, Korpeoglu Ibrahim, and Ulusoy Ozgur, "A connection management protocol for promoting cooperation in Peer-to-Peer networks," Computer Communications, 2008, Vol. 31, No. 2, pp. 240-256
[22] Karakaya Murat, Korpeoglu Ibrahim, and Ozgur Ulnsoy, "Counteracting free riding in Peer-to-Peer networks," Computer Networks, 2008, Vol. 52, No. 3, pp. 675-694
[23] Gupta Rohit and Somani Arun K., "Game Theory As a Tool to Strategize As Well As Predict Nodes' Behavior in Peer-to-Peer Networks," In Proceedings of the 11th International Conference on Parallel and Distributed Systems, Washington: IEEE Computer Society, 2005, pp. 244-249
[24] Golle Philippe, Kevin Leyton-Brown and Mironov Iiya, "Incentive for Sharing in Peer-to-Peer Networks," In Proceedings of the ACM Conference on Electronic Commerce 2001, New York: ACM Press, 2001, pp. 264-267
[25] Ma T. B., Lee C. M., Lui John C. S., and Yau David K. Y., "Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach," IEEE/ACM Transactions on Networking, 2006, Vol. 14, No. 5, pp. 978-991
[26] Feldman Michal, Lai Kevin, Stoica Ion, and Chuang John, "Robust Incentive Techniques for Peer-to-Peer Networks," In Proceedings of Electronic Commerce 2004, (Jack S. Breese, Joan Feigenbaum and Margo I. Seltzer, Editors), New York: ACM Press, 2004, pp. 102-111
[27] Klemens Bohm and Erik Buchmann, "Free riding-aware forwarding in Content-Addressable Networks," The VLDB Journal, 2007, Vol.16, No.4, pp.463-482
[28] Schosser Stephan, Bohm Klemens, Schmidt Rainer, and Vogt Bodo, "Strategic Properties of Peer-to-Peer Data Structures and Behaviour of Human Peers in Economic Experiments," In Proceedings of the 22nd International Conference on Data Engineering Workshops, (Barga Roger S. and Zhou Xiaofang, Editors), Washington: IEEE Computer Society, 2006, pp.1-9
[29] Schosser Stephan, Bohm Klemens, Schmidt Rainer, and Vogt Bodo, "Incentives Engineering for Structured P2P Systems -A Feasibility Demonstration Using Economic Experiments," In Poceedings of Electronic Commerce 2006, (Feigenbaum Joan, Chuang John C.I., and Pennock David M., Editors), New York: ACM Press, 2006, pp.280-289
[30] Schosser Stephan, Bohm Klemens, and Vogt Bodo, "Indirect Partner Interaction in Peer-to-Peer Networks-Stimulating Cooperation by Means of Structure," In Proceedings of Electronic Commerce 2007, (MacKie-Mason Jeffrey K., Parkes David C., and Resnick Paul, Editor), New York: ACM Press, 2007, pp.124-133
[31] Hardin Garrett, "The Tragedy of the Commons," Science, 1968, Vol.162, No.3859, pp.1243-1248
[32] Krishnan Ramayya, Smith Michael D., Tang Zhulei, and Telang Rahul, "The Impact of Free-Riding on Peer-to-Peer Networks," In Proceeding of the 37th Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2004, pp. 199-208
[33] Ben Strulo, Alan Smith, and Jeff Farr, "An architecture for peer-to-peer economies," In Proceedings of the 3rd International Conference on Peer-to-Peer Computing, (Shahmehri Nahid, Graham Ross Lee, and Caronni Germano, Editors), Washington: IEEE Computer Society, 2003, pp.208-209
[34] Xavier Percival, Cai Wentong, and Lee Bu-Sung, "Employing Economics to Achieve Fairness in Usage Policing of Cooperatively Shared Computing Resources," In Proceedings of 2005 IEEE International Symposium on Cluster Computing and Grid, Washington: IEEE Computer Society, 2005, pp.326-333
[35] Gupta Rohit and Somani Amn K., "Pricing Strategy for Incentive Selfish Nodes to Share Resources in Peer-to-Peer (P2P) Networks," In Proceedings of the 12th IEEE International Conference on Networks, Washington: IEEE Press, 2004, pp.624-629
[36] Aperjis Christina and Johari Ramesh, "A Peer-to-Peer System as an Exchange Economy," In Proceeding from the 2006 workshop on Game theory for communications and networks, 2006, New York: ACM Press, pp. 1-10
[37] Banerjee Dipyaman, Saha Sabyasachi, Sen Sandip, and Dasghpta Pdthviraj, "Reciprocal Resource Sharing in P2P Environments," In Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems, (Frank Dignum, Virginia Dignnm, Sven Koenig, et al., Editors), New York: ACM Press, 2005, pp.853-859
[38] Lang Karl Reiner and Vragov Roumen, "A Pricing Mechanism for Digital Content Distribution Over Peer-to-Peer Networks," In Proceedings of the 38th Annual Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2005, pp.211-221
[39] Hausheer David, Liebau Nicolas C., Mauthe Andreas, Steinmetz Ralf, and Stiller Burkhard, "Token-based accounting and distributed pricing to introduce market mechanisms in a peer-to-peer file sharing scenario," In Proceedings of the 3rd International Conference on Peer-to-Peer Computing, (Shahmehri Nahid, Graham Ross Lee, and Caronni Germano, Editors), Washington: IEEE Computer Society, 2003, pp.200-201
[40] David Hales and Bruce Edmonds, "Applying a Socially Inspired Technique (Tags) to Improve Cooperation in P2P Networks," IEEE Transactions on Systems, Man and Cybernetics-Part A:System and Humans, 2005, Vol.35, No.3, pp.385-395
[41] Ham MyungJoo and Agha Gul, "ARA: A Robust Audit to Prevent Free-Riding in P2P Networks," In Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, (Caronni Germano, Weiler Nathalie,Waldvogel Marcel, and Shahmehri Nahid, Editors), Washington: IEEE Computer Society, 2005, pp.125-132
[42] Andrade Nazareno, Mowbray Miranda, Cime Walfredo, and Brasileiro Francisco, "When can an autonomous reputation scheme discourage free-riding in a peer-to-peer system?" In Proceedings of the 4th IEEE International Symposium on Cluster Computing and the Grid, Washington: IEEE Computer Society, 2004, pp. 440-448
[43] Wang Wenjie, Chang Hyunseok, Zeitoun Amgad, and Jamin Sugih, "Characterizing Guarded Hosts in Peer-to-Peer File Sharing Systems," In Proceedings of Globecom 2004, Washington: IEEE Communication Society,2004, pp. 1539-1543
[44] Feldman M., Papadimitriou C., Chuang J., and Stoica I., "Free-Riding and Whitewashing in Peer-to-Peer Systems," IEEE Journal of Selected Areas in Communications, 2006, Vol.24, No.5,' pp. 1010-1019
[45] 余一娇，金海．对等网络中的搭便车行为分析与抑制机制综述，计算机学报，2008，Vol．31，No．1，pp．1-15
[46] Feldman Michal and Chuang John, "Overcoming Free-Riding Behavior in Peer-to-Peer Systems," ACM SIGecom Exchanges, 2005, Vol. 5, No.4, PP.41-50
[47] Nazareno Andrade, Miranda Mowbray, Aliandro Lima, Gustavo Wagner, and Matei Ripeanu, "Influences on Cooperation in BitTorrent Communities," In Proceedings of SIGCOMM'05 Workshops. New York: ACM Press, 2005, Available at http://www.sigcomm.org/sigcomm2005/w2-p2p-econ.html
[48] Jun Seung and Ahamad Mustaque, "Incentives in BitTorrent Induce Free Riding," In Proceedings of SIGCOMM'05 Workshops, New York: ACM Press, 2005, Available at http://www.sigcomm.org/sigcomm2005/w2-p2p-econ.html
[49] Pouwelse Johan, Garbacki Pawel, Epema Dick, and Sips Henk, "The Bittorrent P2P File-Sharing System: Measurements and Analysis," In Proceedings of the 4th, International Workshop on Peer-to-Peer Systems, (Castro Miguel, Renesse Robbert van, Editors.), Berlin: Springer-Verlag, 2005, pp.205-216
[50] Li Minglu, Yu Jiadi, and Wu Jie, "Free-Riding on BitTorrent-Like Peer-to-Peer File Sharing Systems: Modeling Analysis and Improvement," IEEE Transactions on Parallel and Distributed System, 2008, Vol. 19, No.7, pp.954-966
[51] Qiu Dongyu, and Srikant R., "Modeling and performance analysis of BitTorrent-like poor-to-peer networks," In Proceedings of SIGCOMM 2004, (Yavatkar Raj, Zegura Ellen W., and Rexford Jennifer, Editors), New York: ACM Press, 2004, pp.367-378
[52] Yue Yao, Lin Chuang, and Tan Zhangxi, "Analyzing the performance and fairness of BitTorrent-like networks using a general fluid model," Computer Communications, 2006, Vol.29, No.18, pp.3946-3956
[53] Yang Mao, Zhang Zheng, Li Xiaoming, and Dai Yafei, "An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System," In Proceedings of the 4th International Workshop on Peer-to-Peer Systems, (Castro Miguel, Renesse Robbert van, Editors.), Berlin: Springer-Verlag, 2005, pp. 182-192
[54] Yang Zhao, Hou Xiaoxiao, Yang Mao, and Dai Yafei, "Measurement Study and Application of Social Network in the Maze P2P File-Sharing System," In Proceedings of the First International Conference on Scalable Information Systems, (Jia Xiaohua, Editor), New York: ACM Press, 2006, pp.5,7
[55] Miguel Castro, Manuel Costa and Antony Rowstron, "Should We Build Gnutella on a Structured Overlay?" ACM Sigcomm Computer Communications Review, 2004, Vol.34, No.1, pp.131-136
[56] Hartmann Bjom-Oliver, Bohm Klemens, Khachatryan Andranik, and Schosser Stephan, "The Dangers of Poorly Connected Peers in Structured P2P Networks and a Solution Based on Incentives," In Proceedings of IEEE/WIC/ACM International Conference on Web Intelligence 2007, Washington: IEEE Computer Society, 2007, pp.500-508
[57] Moscibroda Thomas, Schmid Stefan, and Wattenhofer Roger, "On the Topologies Formed by Selfish Peers," In Proceedings of the Peer-to-Peer-Systems and Applications, (Joseph Anthony D., Steinmetz Ralf, and Wehrle Klaus, Editors), Schloss Dagstuhl: International Begegnungs and Forschungszentrum fuer Informatik, 2006, pp.1-6
[58] Veciana Gustavo de and Yang Xiangying, "Fairness, incentives and performance in peer-to-peer networks," In Proceedings of the 41st Annual Allerton Conference on Communication, Control and Computing, 2003, pp.749-958
[59] Yang Xiangying and Veciana Gustavo de, "Service Capacity of Peer to Peer networks," In Proceedings of IEEE INFOCOM 2004, Washington: IEEE Communications Society, 2004, pp.2242-2252
[60] MacManus Richard, "Trend Watch: P2P Traffic Much Bigger Than Web Traffic," available at: www.readwriteweb.com/archives/p2p_growth_trend_watch.php
[61] Yu Yijiao and Jin Hai, "A Workload Balancing based Approach to Discourage Free Riding in Peer-to-Peer Network," In Proceedings of APWEB/WAIM 2007 Workshop on Database Management and Application over Networks, (Chang Kevin Chen-Chuan, Wang Wei, and Chen Lei, et al., Editors), Berlin: Springer-Verlag, 2007, pp.141-152
[62] Yu Yijiao and Jin Hai, "Discourage Free Riding in Peer-to-Peer File Sharing Systems with File Migration and Workload Balancing Approach," Frontiers of Computer Science in China, High Education Press & Springer-Verlag, 2007, Vol.1, No.4, pp.436-449
[63] Liu Hanyn, Peng Yu, Yang Mao, and Dai Yafei, "Characterization of P2P File-Sharing System," In Proceedings of International Workshop on Applications and Economics of Peer-to-Peer Systems 2005, (Chen Guihai, Pan Yi, Guo Minyi, and Lu Jian, Editors), Berlin: Springer-Verlag, 2005, pp.27-34
[64] Gummadi Krishna P., Dunn Richard J., Saroiu Stefan, Gribble Steven D., Levy Henry M., and Zahorjan John, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," In Proceedings of the 19th ACM Symposium on Operating Systems Principles, New York: ACM Press, 2003, pp.314-329
[65] Michael Sipser, Introduction to the Theory of Computation, Thomson, 2006
[66] Ge Zihui, Figueiredo Daniel R., Jaiswall Sharad, Kurose Jim, and Towsley Don, "Modeling Peer-Peer File sharing system," In Proceedings of IEEE INFOCOM 2003, Washington: IEEE Communication Society, 2003, pp.2188-2198
[67] P2P Simulator, Available at http://fada.sourceforge.net/p2psim
[68] Eger Kolja, Hoβfeld Tobias, and BinT.enhofer Andreas, "Efficient Simulation of Large-Scale P2P Networks: Packet-level vs. Flow-level Simulations," In Proceedings of UPGRADE-CN'07, (Fortino Giancarlo, Mastroianni Carlo, and Pierre Guillaume, Editors), New York: ACM Press, 2007, pp.9-15
[69] Pajek, Available at http://vlado.fmf.uni-lj.si/pub/network s/pajek/
[70] Cohen Edith and Shenker Scott, "Replication strategies in unstructured peer-to-peer networks," In Processings of the ACM SIGCOMM 2002, New York: ACM Press, 2002, pp.177-190
[71] 冯国富，张金城，顾庆，陆桑璐，陈道蓄．一种基于覆盖网络拓扑的无结构P2P主动复制策略，软件学报，2007，Vol．18，No．9，pp．2226-2234
[72] 左翠华，卢正鼎，李瑞轩．针对负载均衡的P2P动态副本策略，小型微型计算机系统，2007，Vol．28，No．11，pp．2020-2023
[73] Tanenbaum Andrew S., "Computer Networks," Essex: Person Education, 2003, pp.706
[74] Adamic Lada A., and Huberman Bernardo A., "Zipf's law and the Internet," Glottometrics, 2002, Vol.3, pp. 143-150
[75] Saroiu S., Gummadi P. K., and Gribble S. D., "A measurement study of peer-to-peer file sharing systems," Multimedia Systems Journal, 2002, Vol.8, No.5, pp. 156-170
[76] 冯国富，张金城，姜玉泉，顾庆，陆桑璐，陈道蓄．无结构P2P覆盖网络的拓扑优化，软件学报，2007，Vol．18，No．11，pp．2819-2829
[77] Lv Qin Cao Pei, Cohen Edith, Li Kai, and Shenker Scott, "Search and Replication in Unstructured Peer-to-Peer Networks," In Proceedings of the 2002 International Conference on Supercomputing, New York: ACM Press, 2002, pp.84-95
[78] Wang Jia, "A survey of web caching schemes for the Internet," ACM SIGCOMM Computer Communication Review, 1999, Vol. 29, No.5, pp.36-46
[79] Barish Greg and Obraczke Katia, "World Wide Web caching: trends and techniques," IEEE Communications Magazine, 2000, Vol.38, No.5, pp.178-184
[80] Hales David, "Self-organising, Open and Cooperative P2P Societies-From Tags to Networks," In Proceedings of ESOA 2004, (Brueckner Sven, Giovanna Di Marzo Serugendo, Karageorgos Anthony, and Nagpal Radhika, Editors), Berlin: Springer-Verlag, 2004, pp. 123-137
[81] Bretzkel Helen and Vassileva Julita, "Motivating Cooperation on Peer to Peer Networks," In Proceedings of User Modeling 2003, (Brusilovsky Peter, Corbett Albert T., and Rosis Fiorella de, Editors), Berlin: Springer-Verlag, 2003, pp. 218-227
[82] Buchmann Erik and Bohm Klemens, "FairNet-How to Counter Free Riding in Peer-to-Peer Data Structures," In Proceedings of CoopIS/DOA/ODBASE 2004, (Meersman Robert, Tari Zahir, Editors), Berlin: Springer-Verlag, 2004, pp.337-354
[83] Mannak Ronald, Ridder Huib de, and Keyson David V., "The Human Side of Sharing in Peer-to-Peer Networks," In Proceedings of the 2nd European Union symposium on Ambient intelligence, New York: ACM Press, 2004, pp.59-64
[84] Watts Duncan J. and Strogatz Steven H., "Collective dynamics of 'small-world' networks," Nature, 1998, Vol.393, pp.440-442
[85] Strogatz Steven H., "Exploring complex networks," Nature, 2001, Vol.410, pp.268-276
[86] Albert R. and Barabasi Albert-Laszlo, "Statistical mechanics of complex networks," Review Modern Physics, 2002, Vol.74, No.1, pp.47-97
[87] Dorogovtsev S. N. and Mendes J.F.F., "Evolution of networks," Advances in Physics, 2002, Vol.51, No.4, pp.1079-1187
[88] Barabasi Albert-Laszlo and Albert Reka. "Emergence of scaling in random networks". Science, 1999, Vol.286, No.5439, pp. 509-512
[89] Barabasi Albert-Laszlo, "Scale-Free Networks," Scientific American, 2003, Vol. 288, pp.60-69
[90] Albert R., Jeong H. and Barabasi Albert-Laszlo, "Attack and error tolerance in complex networks," Nature, 2000, Vol. 406, pp.387-482
[91] 李治军，廖明宏．对等网络拓扑结构调整的图论分析，哈尔滨工业大学学报，2007，Vol．39，No．7，pp．1110-1113
[92] Wang Xiaofan, and Chen Guanrong, "Pinning control of scale-flee dynamical networks," Physica A, 2002, Vol.310, No.3, pp.521-531
[93] 王磊，周淑华，袁坚，任勇，山秀明．虚拟网络行为对互联网整体特性的影响，物理学报，2007，Vol．56，No．1，pp．36-42
[94] Xia Yongxiang, Tse Chi K., Tam Wai M., Lau Francis C. M., and Small Michael, "Scale-free user-network approach to telephone network traffic analysis," PHYSICAL REVIEWE, 2005, Vol. 72, 026116
[95] 王勇，云晓春，李奕飞．对等网络拓扑测量与特征分析，软件学报，2008，Vol．19， No．4，pp．981-992
[96] Buckley Fred, Lewinter Marry, "A Friendly Introduction to Graph Theoy," Being: Person Education and Tsinghua University Press, 2005, pp. 114
[97] Rodrigues Rodrigo and Liskov Barbara, "High Availability in DHTs: Erasure Coding vs. Replication," In Proceedings of IPTPS 2005, (Castro Miguel, Renesse van Robbert, Editors), Berlin: Springer-Verlag, 2005, pp. 226-239
[98] Christin EE Nicolas, Weigend Andreas S., Chuang John, "Content availability, pollution and poisoning in file shadng peer-to-peer networks," In Proceedings of ACM Conference on Electronic Commerce 2005, (Riedl John, Keams Michael J., and Reiter Michael K., Editors), New York: ACM Press, 2001, pp.68-77
[99] Yu Yijiao, Liu Qin, and Tan Liansheng, "Application Server Performance Control with Simple Network Management Protocol. In Proceedings of the Grid and Cooperative Computing 2003, (Li Minglu, Sun Xian-He, Deng Qianni and Ni Jun, Editors), Berlin: Springer-Verlag, 2003, pp.352-359
[100] McCloghrie K., and Rose M., Request for Comments 1213: "Management Information Base for Network Management of TCP/IP-based internets: MIB-Ⅱ," 1991, Available at: http://www.ietf.org/rfc/rfc1213.txt
[101] Grillo P. and Waldbusser S., Request for Comments: 1514: Host Resoures MIB, 1993, Available at: http://www.ietf.org/rfc/rfc1514.txt
[102] Lua Eng Keong, Crowcroft Jon, Pias Marceio, Sharma Ravi, and Lim Steven, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes," IEEE Communications Survey and Tutorial, 2005, Vol.7, No.2, pp.1-22
[103] Stoica Ion, Morris Robert, Karger David R., Kaashoek M. Frans, and Balakrishnan Hari, "Chord: A scalable peer-to-peer lookup service for internet applications," In Processings of the ACM SIGCOMM 2001, New York: ACM Press, 2001, pp. 149-160
[104] Ratnasamy Sylvia, Francis Paul, Handley Mark, Karp Richard, and Shenker Scott, "A scalable content addressable network," In Processings of the ACM SIGCOMM 2001, New York: ACM Press, 2001, pp.161-172
[105]Zhao Ben Y., Huang Ling, Stribling Jeremy, Rhea Sean C., Joseph Anthony D., and Kubiatowicz John D., "Tapestry:. A Resilient Global-Scale Overlay for Service Deployment," IEEE Journal on Selected Areas in Communications, 2004, Vol. 22, No. 1, pp.41-53
[106]Jin Hai and Yu Yijiao, "SemreX: a Semantic Peer-to-Peer Scientific References Sharing System," In Proceedings of the International Conference on Internet and Web Applications and Services (ICIW'06), Washington: IEEE Computer Society, 2006, pp.97-102
[107]Wu Hao and Jin Hal, "Semantic Metadata Models in References Sharing and Retrieval System SemreX," In Proceedings of GPC 2006, (Chung Yeh-Ching, Moreira Jose E., Editors), Berlin: Springer-Verlag, 2006, pp.437-446
[108]Yu Yijiao and Jin Hai, "Building a Semantic P2P Scientific References Sharing System with JXTA," In Proceedings of APWeb 2006, (Zhou Xiaofang, Li Jianzhong, Shen Heng Tao, et al., Editors), Berlin: Springer-Verlag, 2006, pp.937-942
[2] Lee Jintae, "An end user perspective on file sharing system," Communications of the ACM, 2003, Vol. 46, No. 2, pp. 49-53
[3] Adar Eytan and Huberman Bemardo A., "Free Riding on Gnutella," First Monday, 2000, Vol. 5, No. 10, pp. 32-35
[4] Ramaswamy Lakshmish and Liu Ling, "Free Riding: A New Challenge to Peer-to-Peer File Sharing Systems," In Proceeding of the 36th Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2003, pp. 220-229
[5] Courcoubetis Costas and Weber Richard R., "Incentive for Large Peer-to-Peer Systems," IEEE Journal of Selected Areas in Communications, 2006, Vol. 24, No. 5, pp. 1034-1050
[6] Ripeanu Matei, Foster Ian, and Iamnitchi Adriana, "Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System," IEEE Internet Computing, 2002, Vol. 6, No. 2, pp. 50-57
[7] Sen Subhabrata and Wang Jia, "Analyzing Peer-to-Peer Traffic Across Large Networks," IEEE/ACM Transactions on Networking, 2004, Vol. 12, No. 2, pp. 219-232
[8] Karagiannis Thomas, Broido Andre, Brownlee Nevil, Claffy Kc, and Faloutsos Michalis, "Is P2P Dying or Just Hiding?" In Proceeding of the Globecom 2004, Washington: IEEE Communication Society, 2004, pp. 1532-1537
[9] Hughes Daniel, Coulson Geoff, and James Walkerdine, "Free Riding on Gnutella Revisited: The Bell Tolls?" IEEE Distributed Systems Online, 2005, Vol. 6, No. 6, pp. 1-18
[10] Daniel Stutzbach and Reza Rejaie, "Capturing Accurate Snapshots of the Gnutella Network", In Proceedings of the Global Internet Symposium 2005, Washington: IEEE Communication Society, 2005, pp. 127-132
[11] Meng Shicong, Shi Cong, Han Dingyi, Zhu Xing, and Yu Yong, "A Statistical Study of Today's Gnutella," In Proceeding of APWeb 2006, (Xiaofang Zhou, Jianzhong Li, Heng Tao Shen, et al., Editors), Berlin: Springer-Verlag, 2006, pp. 437-448
[12] Andrew Roczniak and Abdulmotaleb El Saddik, "Impact of Incentive Mechanisms on Quality of Experience," In Proceedings of the 13th ACM International Conference on Multimedia, 2005, (Zhang HongJiang, Chua Tat-Seng, Steinmetz Ralf, et al., Editors), New York: ACM Press, 2005, pp. 311-314
[13] Ma Richard T. B, Lee C. M., Lui John C. S., and Yau David K. Y., "Incentive P2P Networks: A Protocol to Encourage Information Sharing and Contribution," SIGMETRICS Performance Evaluation Review, 2003, Vol. 31, No. 2, pp. 23-25
[14] Ma Richard T. B., Lee Sam C. M., Lui John C. S., and Yau David K. Y., "An Incentive Mechanism for P2P Networks," In Proceedings of the 2 4th International Conference on Distributed Computing Systems, Washington: IEEE Computer Society, 2004, pp. 516-523
[15] Anceaume Emmanuelle, Gradinariu Maria, and Ravoajia Aina, "Incentive for P2P Fair Resource Sharing," In Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, (Caronni Germano, Weiler Nathalie, Waldvogel Marcel, Shahmehri Nahid, Editors), Washington: IEEE Computer Society, 2005, pp. 253-260
[16] Figueiredo Daniel, Shapiro Jonathan, and Towsley Don, "Incentives to Promote Availability in Peer-to-Peer Anonymity Systems," In Proceedings of the 13th IEEE International Conference on Network Protocols, Washington: IEEE Computer Society, 2005, pp. 110-121
[17] Lui S. M., Lang Karl R., and Kwok S. H., "Participation Incentive Mechanisms in Peer-to-Peer Subscription Systems," In Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2002, pp. 3925-3931
[18] Guan Zhitao, Durad Muhammad Hanif, Cao Yuanda, and Zhu Liehuang, "An Efficient Hybrid P2P Incentive Scheme," In Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, (Feng Wenying, Gao Feng, Editors), Washington: IEEE Computer Society, 2007, pp. 377-382
[19] DeFigueiredo Dimitri, Venkatachalam Balaji, and Wu S. Felix, "Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies," In Proceedings of the 7th IEEE International Conference on Peer-to-Peer Computing, Washington: IEEE Computer Society, 2007, pp. 11-18
[20] Karakaya Murat, Korpeouglu Ibrahim, and Ulusoy Ozgur, "A Distributed and Measurement-based Framework Against Free Riding in Peer-to-Peer Networks," In Proceedings of the 4th International Conference on Peer-to-Peer Computing, (Germano Caronni, Nathalie Weiler, and Nahid Shahmehri, Editors), Washington: IEEE Computer Society, 2004, pp. 276-277
[21] Karakaya Murat, Korpeoglu Ibrahim, and Ulusoy Ozgur, "A connection management protocol for promoting cooperation in Peer-to-Peer networks," Computer Communications, 2008, Vol. 31, No. 2, pp. 240-256
[22] Karakaya Murat, Korpeoglu Ibrahim, and Ozgur Ulnsoy, "Counteracting free riding in Peer-to-Peer networks," Computer Networks, 2008, Vol. 52, No. 3, pp. 675-694
[23] Gupta Rohit and Somani Arun K., "Game Theory As a Tool to Strategize As Well As Predict Nodes' Behavior in Peer-to-Peer Networks," In Proceedings of the 11th International Conference on Parallel and Distributed Systems, Washington: IEEE Computer Society, 2005, pp. 244-249
[24] Golle Philippe, Kevin Leyton-Brown and Mironov Iiya, "Incentive for Sharing in Peer-to-Peer Networks," In Proceedings of the ACM Conference on Electronic Commerce 2001, New York: ACM Press, 2001, pp. 264-267
[25] Ma T. B., Lee C. M., Lui John C. S., and Yau David K. Y., "Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach," IEEE/ACM Transactions on Networking, 2006, Vol. 14, No. 5, pp. 978-991
[26] Feldman Michal, Lai Kevin, Stoica Ion, and Chuang John, "Robust Incentive Techniques for Peer-to-Peer Networks," In Proceedings of Electronic Commerce 2004, (Jack S. Breese, Joan Feigenbaum and Margo I. Seltzer, Editors), New York: ACM Press, 2004, pp. 102-111
[27] Klemens Bohm and Erik Buchmann, "Free riding-aware forwarding in Content-Addressable Networks," The VLDB Journal, 2007, Vol.16, No.4, pp.463-482
[28] Schosser Stephan, Bohm Klemens, Schmidt Rainer, and Vogt Bodo, "Strategic Properties of Peer-to-Peer Data Structures and Behaviour of Human Peers in Economic Experiments," In Proceedings of the 22nd International Conference on Data Engineering Workshops, (Barga Roger S. and Zhou Xiaofang, Editors), Washington: IEEE Computer Society, 2006, pp.1-9
[29] Schosser Stephan, Bohm Klemens, Schmidt Rainer, and Vogt Bodo, "Incentives Engineering for Structured P2P Systems -A Feasibility Demonstration Using Economic Experiments," In Poceedings of Electronic Commerce 2006, (Feigenbaum Joan, Chuang John C.I., and Pennock David M., Editors), New York: ACM Press, 2006, pp.280-289
[30] Schosser Stephan, Bohm Klemens, and Vogt Bodo, "Indirect Partner Interaction in Peer-to-Peer Networks-Stimulating Cooperation by Means of Structure," In Proceedings of Electronic Commerce 2007, (MacKie-Mason Jeffrey K., Parkes David C., and Resnick Paul, Editor), New York: ACM Press, 2007, pp.124-133
[31] Hardin Garrett, "The Tragedy of the Commons," Science, 1968, Vol.162, No.3859, pp.1243-1248
[32] Krishnan Ramayya, Smith Michael D., Tang Zhulei, and Telang Rahul, "The Impact of Free-Riding on Peer-to-Peer Networks," In Proceeding of the 37th Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2004, pp. 199-208
[33] Ben Strulo, Alan Smith, and Jeff Farr, "An architecture for peer-to-peer economies," In Proceedings of the 3rd International Conference on Peer-to-Peer Computing, (Shahmehri Nahid, Graham Ross Lee, and Caronni Germano, Editors), Washington: IEEE Computer Society, 2003, pp.208-209
[34] Xavier Percival, Cai Wentong, and Lee Bu-Sung, "Employing Economics to Achieve Fairness in Usage Policing of Cooperatively Shared Computing Resources," In Proceedings of 2005 IEEE International Symposium on Cluster Computing and Grid, Washington: IEEE Computer Society, 2005, pp.326-333
[35] Gupta Rohit and Somani Amn K., "Pricing Strategy for Incentive Selfish Nodes to Share Resources in Peer-to-Peer (P2P) Networks," In Proceedings of the 12th IEEE International Conference on Networks, Washington: IEEE Press, 2004, pp.624-629
[36] Aperjis Christina and Johari Ramesh, "A Peer-to-Peer System as an Exchange Economy," In Proceeding from the 2006 workshop on Game theory for communications and networks, 2006, New York: ACM Press, pp. 1-10
[37] Banerjee Dipyaman, Saha Sabyasachi, Sen Sandip, and Dasghpta Pdthviraj, "Reciprocal Resource Sharing in P2P Environments," In Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems, (Frank Dignum, Virginia Dignnm, Sven Koenig, et al., Editors), New York: ACM Press, 2005, pp.853-859
[38] Lang Karl Reiner and Vragov Roumen, "A Pricing Mechanism for Digital Content Distribution Over Peer-to-Peer Networks," In Proceedings of the 38th Annual Hawaii International Conference on System Sciences, Washington: IEEE Computer Society, 2005, pp.211-221
[39] Hausheer David, Liebau Nicolas C., Mauthe Andreas, Steinmetz Ralf, and Stiller Burkhard, "Token-based accounting and distributed pricing to introduce market mechanisms in a peer-to-peer file sharing scenario," In Proceedings of the 3rd International Conference on Peer-to-Peer Computing, (Shahmehri Nahid, Graham Ross Lee, and Caronni Germano, Editors), Washington: IEEE Computer Society, 2003, pp.200-201
[40] David Hales and Bruce Edmonds, "Applying a Socially Inspired Technique (Tags) to Improve Cooperation in P2P Networks," IEEE Transactions on Systems, Man and Cybernetics-Part A:System and Humans, 2005, Vol.35, No.3, pp.385-395
[41] Ham MyungJoo and Agha Gul, "ARA: A Robust Audit to Prevent Free-Riding in P2P Networks," In Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, (Caronni Germano, Weiler Nathalie,Waldvogel Marcel, and Shahmehri Nahid, Editors), Washington: IEEE Computer Society, 2005, pp.125-132
[42] Andrade Nazareno, Mowbray Miranda, Cime Walfredo, and Brasileiro Francisco, "When can an autonomous reputation scheme discourage free-riding in a peer-to-peer system?" In Proceedings of the 4th IEEE International Symposium on Cluster Computing and the Grid, Washington: IEEE Computer Society, 2004, pp. 440-448
[43] Wang Wenjie, Chang Hyunseok, Zeitoun Amgad, and Jamin Sugih, "Characterizing Guarded Hosts in Peer-to-Peer File Sharing Systems," In Proceedings of Globecom 2004, Washington: IEEE Communication Society,2004, pp. 1539-1543
[44] Feldman M., Papadimitriou C., Chuang J., and Stoica I., "Free-Riding and Whitewashing in Peer-to-Peer Systems," IEEE Journal of Selected Areas in Communications, 2006, Vol.24, No.5,' pp. 1010-1019
[45] 余一娇，金海．对等网络中的搭便车行为分析与抑制机制综述，计算机学报，2008，Vol．31，No．1，pp．1-15
[46] Feldman Michal and Chuang John, "Overcoming Free-Riding Behavior in Peer-to-Peer Systems," ACM SIGecom Exchanges, 2005, Vol. 5, No.4, PP.41-50
[47] Nazareno Andrade, Miranda Mowbray, Aliandro Lima, Gustavo Wagner, and Matei Ripeanu, "Influences on Cooperation in BitTorrent Communities," In Proceedings of SIGCOMM'05 Workshops. New York: ACM Press, 2005, Available at http://www.sigcomm.org/sigcomm2005/w2-p2p-econ.html
[48] Jun Seung and Ahamad Mustaque, "Incentives in BitTorrent Induce Free Riding," In Proceedings of SIGCOMM'05 Workshops, New York: ACM Press, 2005, Available at http://www.sigcomm.org/sigcomm2005/w2-p2p-econ.html
[49] Pouwelse Johan, Garbacki Pawel, Epema Dick, and Sips Henk, "The Bittorrent P2P File-Sharing System: Measurements and Analysis," In Proceedings of the 4th, International Workshop on Peer-to-Peer Systems, (Castro Miguel, Renesse Robbert van, Editors.), Berlin: Springer-Verlag, 2005, pp.205-216
[50] Li Minglu, Yu Jiadi, and Wu Jie, "Free-Riding on BitTorrent-Like Peer-to-Peer File Sharing Systems: Modeling Analysis and Improvement," IEEE Transactions on Parallel and Distributed System, 2008, Vol. 19, No.7, pp.954-966
[51] Qiu Dongyu, and Srikant R., "Modeling and performance analysis of BitTorrent-like poor-to-peer networks," In Proceedings of SIGCOMM 2004, (Yavatkar Raj, Zegura Ellen W., and Rexford Jennifer, Editors), New York: ACM Press, 2004, pp.367-378
[52] Yue Yao, Lin Chuang, and Tan Zhangxi, "Analyzing the performance and fairness of BitTorrent-like networks using a general fluid model," Computer Communications, 2006, Vol.29, No.18, pp.3946-3956
[53] Yang Mao, Zhang Zheng, Li Xiaoming, and Dai Yafei, "An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System," In Proceedings of the 4th International Workshop on Peer-to-Peer Systems, (Castro Miguel, Renesse Robbert van, Editors.), Berlin: Springer-Verlag, 2005, pp. 182-192
[54] Yang Zhao, Hou Xiaoxiao, Yang Mao, and Dai Yafei, "Measurement Study and Application of Social Network in the Maze P2P File-Sharing System," In Proceedings of the First International Conference on Scalable Information Systems, (Jia Xiaohua, Editor), New York: ACM Press, 2006, pp.5,7
[55] Miguel Castro, Manuel Costa and Antony Rowstron, "Should We Build Gnutella on a Structured Overlay?" ACM Sigcomm Computer Communications Review, 2004, Vol.34, No.1, pp.131-136
[56] Hartmann Bjom-Oliver, Bohm Klemens, Khachatryan Andranik, and Schosser Stephan, "The Dangers of Poorly Connected Peers in Structured P2P Networks and a Solution Based on Incentives," In Proceedings of IEEE/WIC/ACM International Conference on Web Intelligence 2007, Washington: IEEE Computer Society, 2007, pp.500-508
[57] Moscibroda Thomas, Schmid Stefan, and Wattenhofer Roger, "On the Topologies Formed by Selfish Peers," In Proceedings of the Peer-to-Peer-Systems and Applications, (Joseph Anthony D., Steinmetz Ralf, and Wehrle Klaus, Editors), Schloss Dagstuhl: International Begegnungs and Forschungszentrum fuer Informatik, 2006, pp.1-6
[58] Veciana Gustavo de and Yang Xiangying, "Fairness, incentives and performance in peer-to-peer networks," In Proceedings of the 41st Annual Allerton Conference on Communication, Control and Computing, 2003, pp.749-958
[59] Yang Xiangying and Veciana Gustavo de, "Service Capacity of Peer to Peer networks," In Proceedings of IEEE INFOCOM 2004, Washington: IEEE Communications Society, 2004, pp.2242-2252
[60] MacManus Richard, "Trend Watch: P2P Traffic Much Bigger Than Web Traffic," available at: www.readwriteweb.com/archives/p2p_growth_trend_watch.php
[61] Yu Yijiao and Jin Hai, "A Workload Balancing based Approach to Discourage Free Riding in Peer-to-Peer Network," In Proceedings of APWEB/WAIM 2007 Workshop on Database Management and Application over Networks, (Chang Kevin Chen-Chuan, Wang Wei, and Chen Lei, et al., Editors), Berlin: Springer-Verlag, 2007, pp.141-152
[62] Yu Yijiao and Jin Hai, "Discourage Free Riding in Peer-to-Peer File Sharing Systems with File Migration and Workload Balancing Approach," Frontiers of Computer Science in China, High Education Press & Springer-Verlag, 2007, Vol.1, No.4, pp.436-449
[63] Liu Hanyn, Peng Yu, Yang Mao, and Dai Yafei, "Characterization of P2P File-Sharing System," In Proceedings of International Workshop on Applications and Economics of Peer-to-Peer Systems 2005, (Chen Guihai, Pan Yi, Guo Minyi, and Lu Jian, Editors), Berlin: Springer-Verlag, 2005, pp.27-34
[64] Gummadi Krishna P., Dunn Richard J., Saroiu Stefan, Gribble Steven D., Levy Henry M., and Zahorjan John, "Measurement, modeling, and analysis of a peer-to-peer file-sharing workload," In Proceedings of the 19th ACM Symposium on Operating Systems Principles, New York: ACM Press, 2003, pp.314-329
[65] Michael Sipser, Introduction to the Theory of Computation, Thomson, 2006
[66] Ge Zihui, Figueiredo Daniel R., Jaiswall Sharad, Kurose Jim, and Towsley Don, "Modeling Peer-Peer File sharing system," In Proceedings of IEEE INFOCOM 2003, Washington: IEEE Communication Society, 2003, pp.2188-2198
[67] P2P Simulator, Available at http://fada.sourceforge.net/p2psim
[68] Eger Kolja, Hoβfeld Tobias, and BinT.enhofer Andreas, "Efficient Simulation of Large-Scale P2P Networks: Packet-level vs. Flow-level Simulations," In Proceedings of UPGRADE-CN'07, (Fortino Giancarlo, Mastroianni Carlo, and Pierre Guillaume, Editors), New York: ACM Press, 2007, pp.9-15
[69] Pajek, Available at http://vlado.fmf.uni-lj.si/pub/network s/pajek/
[70] Cohen Edith and Shenker Scott, "Replication strategies in unstructured peer-to-peer networks," In Processings of the ACM SIGCOMM 2002, New York: ACM Press, 2002, pp.177-190
[71] 冯国富，张金城，顾庆，陆桑璐，陈道蓄．一种基于覆盖网络拓扑的无结构P2P主动复制策略，软件学报，2007，Vol．18，No．9，pp．2226-2234
[72] 左翠华，卢正鼎，李瑞轩．针对负载均衡的P2P动态副本策略，小型微型计算机系统，2007，Vol．28，No．11，pp．2020-2023
[73] Tanenbaum Andrew S., "Computer Networks," Essex: Person Education, 2003, pp.706
[74] Adamic Lada A., and Huberman Bernardo A., "Zipf's law and the Internet," Glottometrics, 2002, Vol.3, pp. 143-150
[75] Saroiu S., Gummadi P. K., and Gribble S. D., "A measurement study of peer-to-peer file sharing systems," Multimedia Systems Journal, 2002, Vol.8, No.5, pp. 156-170
[76] 冯国富，张金城，姜玉泉，顾庆，陆桑璐，陈道蓄．无结构P2P覆盖网络的拓扑优化，软件学报，2007，Vol．18，No．11，pp．2819-2829
[77] Lv Qin Cao Pei, Cohen Edith, Li Kai, and Shenker Scott, "Search and Replication in Unstructured Peer-to-Peer Networks," In Proceedings of the 2002 International Conference on Supercomputing, New York: ACM Press, 2002, pp.84-95
[78] Wang Jia, "A survey of web caching schemes for the Internet," ACM SIGCOMM Computer Communication Review, 1999, Vol. 29, No.5, pp.36-46
[79] Barish Greg and Obraczke Katia, "World Wide Web caching: trends and techniques," IEEE Communications Magazine, 2000, Vol.38, No.5, pp.178-184
[80] Hales David, "Self-organising, Open and Cooperative P2P Societies-From Tags to Networks," In Proceedings of ESOA 2004, (Brueckner Sven, Giovanna Di Marzo Serugendo, Karageorgos Anthony, and Nagpal Radhika, Editors), Berlin: Springer-Verlag, 2004, pp. 123-137
[81] Bretzkel Helen and Vassileva Julita, "Motivating Cooperation on Peer to Peer Networks," In Proceedings of User Modeling 2003, (Brusilovsky Peter, Corbett Albert T., and Rosis Fiorella de, Editors), Berlin: Springer-Verlag, 2003, pp. 218-227
[82] Buchmann Erik and Bohm Klemens, "FairNet-How to Counter Free Riding in Peer-to-Peer Data Structures," In Proceedings of CoopIS/DOA/ODBASE 2004, (Meersman Robert, Tari Zahir, Editors), Berlin: Springer-Verlag, 2004, pp.337-354
[83] Mannak Ronald, Ridder Huib de, and Keyson David V., "The Human Side of Sharing in Peer-to-Peer Networks," In Proceedings of the 2nd European Union symposium on Ambient intelligence, New York: ACM Press, 2004, pp.59-64
[84] Watts Duncan J. and Strogatz Steven H., "Collective dynamics of 'small-world' networks," Nature, 1998, Vol.393, pp.440-442
[85] Strogatz Steven H., "Exploring complex networks," Nature, 2001, Vol.410, pp.268-276
[86] Albert R. and Barabasi Albert-Laszlo, "Statistical mechanics of complex networks," Review Modern Physics, 2002, Vol.74, No.1, pp.47-97
[87] Dorogovtsev S. N. and Mendes J.F.F., "Evolution of networks," Advances in Physics, 2002, Vol.51, No.4, pp.1079-1187
[88] Barabasi Albert-Laszlo and Albert Reka. "Emergence of scaling in random networks". Science, 1999, Vol.286, No.5439, pp. 509-512
[89] Barabasi Albert-Laszlo, "Scale-Free Networks," Scientific American, 2003, Vol. 288, pp.60-69
[90] Albert R., Jeong H. and Barabasi Albert-Laszlo, "Attack and error tolerance in complex networks," Nature, 2000, Vol. 406, pp.387-482
[91] 李治军，廖明宏．对等网络拓扑结构调整的图论分析，哈尔滨工业大学学报，2007，Vol．39，No．7，pp．1110-1113
[92] Wang Xiaofan, and Chen Guanrong, "Pinning control of scale-flee dynamical networks," Physica A, 2002, Vol.310, No.3, pp.521-531
[93] 王磊，周淑华，袁坚，任勇，山秀明．虚拟网络行为对互联网整体特性的影响，物理学报，2007，Vol．56，No．1，pp．36-42
[94] Xia Yongxiang, Tse Chi K., Tam Wai M., Lau Francis C. M., and Small Michael, "Scale-free user-network approach to telephone network traffic analysis," PHYSICAL REVIEWE, 2005, Vol. 72, 026116
[95] 王勇，云晓春，李奕飞．对等网络拓扑测量与特征分析，软件学报，2008，Vol．19， No．4，pp．981-992
[96] Buckley Fred, Lewinter Marry, "A Friendly Introduction to Graph Theoy," Being: Person Education and Tsinghua University Press, 2005, pp. 114
[97] Rodrigues Rodrigo and Liskov Barbara, "High Availability in DHTs: Erasure Coding vs. Replication," In Proceedings of IPTPS 2005, (Castro Miguel, Renesse van Robbert, Editors), Berlin: Springer-Verlag, 2005, pp. 226-239
[98] Christin EE Nicolas, Weigend Andreas S., Chuang John, "Content availability, pollution and poisoning in file shadng peer-to-peer networks," In Proceedings of ACM Conference on Electronic Commerce 2005, (Riedl John, Keams Michael J., and Reiter Michael K., Editors), New York: ACM Press, 2001, pp.68-77
[99] Yu Yijiao, Liu Qin, and Tan Liansheng, "Application Server Performance Control with Simple Network Management Protocol. In Proceedings of the Grid and Cooperative Computing 2003, (Li Minglu, Sun Xian-He, Deng Qianni and Ni Jun, Editors), Berlin: Springer-Verlag, 2003, pp.352-359
[100] McCloghrie K., and Rose M., Request for Comments 1213: "Management Information Base for Network Management of TCP/IP-based internets: MIB-Ⅱ," 1991, Available at: http://www.ietf.org/rfc/rfc1213.txt
[101] Grillo P. and Waldbusser S., Request for Comments: 1514: Host Resoures MIB, 1993, Available at: http://www.ietf.org/rfc/rfc1514.txt
[102] Lua Eng Keong, Crowcroft Jon, Pias Marceio, Sharma Ravi, and Lim Steven, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes," IEEE Communications Survey and Tutorial, 2005, Vol.7, No.2, pp.1-22
[103] Stoica Ion, Morris Robert, Karger David R., Kaashoek M. Frans, and Balakrishnan Hari, "Chord: A scalable peer-to-peer lookup service for internet applications," In Processings of the ACM SIGCOMM 2001, New York: ACM Press, 2001, pp. 149-160
[104] Ratnasamy Sylvia, Francis Paul, Handley Mark, Karp Richard, and Shenker Scott, "A scalable content addressable network," In Processings of the ACM SIGCOMM 2001, New York: ACM Press, 2001, pp.161-172
[105]Zhao Ben Y., Huang Ling, Stribling Jeremy, Rhea Sean C., Joseph Anthony D., and Kubiatowicz John D., "Tapestry:. A Resilient Global-Scale Overlay for Service Deployment," IEEE Journal on Selected Areas in Communications, 2004, Vol. 22, No. 1, pp.41-53
[106]Jin Hai and Yu Yijiao, "SemreX: a Semantic Peer-to-Peer Scientific References Sharing System," In Proceedings of the International Conference on Internet and Web Applications and Services (ICIW'06), Washington: IEEE Computer Society, 2006, pp.97-102
[107]Wu Hao and Jin Hal, "Semantic Metadata Models in References Sharing and Retrieval System SemreX," In Proceedings of GPC 2006, (Chung Yeh-Ching, Moreira Jose E., Editors), Berlin: Springer-Verlag, 2006, pp.437-446
[108]Yu Yijiao and Jin Hai, "Building a Semantic P2P Scientific References Sharing System with JXTA," In Proceedings of APWeb 2006, (Zhou Xiaofang, Li Jianzhong, Shen Heng Tao, et al., Editors), Berlin: Springer-Verlag, 2006, pp.937-942