After a century of relative stability in the electricity sector,the widespread adoption of distributed energy resources,along with recent advancements in computing and communication technologies,has fundamentally alte...After a century of relative stability in the electricity sector,the widespread adoption of distributed energy resources,along with recent advancements in computing and communication technologies,has fundamentally altered how energy is consumed,traded,and utilized.This change signifies a crucial shift as the power system evolves from its traditional hierarchical organization to a more decentralized approach.At the heart of this transformation are innovative energy distribution models,like peer-to-peer(P2P)sharing,which enable communities to collaboratively manage their energy resources.The effectiveness of P2P sharing not only improves the economic prospects for prosumers,who generate and consume energy,but also enhances energy resilience and sustainability.This allows communities to better leverage local resources while fostering a sense of collective responsibility and collaboration in energy management.However,there is still no extensive implementation of such sharing models in today’s electricitymarkets.Research on distributed energy P2P trading is still in the exploratory stage,and it is particularly important to comprehensively understand and analyze the existing distributed energy P2P trading market.This paper contributes with an overview of the P2P markets that starts with the network framework,market structure,technical approach for trading mechanism,and blockchain technology,moving to the outlook in this field.展开更多
Peer-to-peer(P2P)energy trading refers to a type of decentralized transaction,where the energy from distributed energy resources is directly traded between peers.A key challenge in peer-to-peer energy trading is desig...Peer-to-peer(P2P)energy trading refers to a type of decentralized transaction,where the energy from distributed energy resources is directly traded between peers.A key challenge in peer-to-peer energy trading is designing a safe,efficient,and transparent trading model and operating mechanism.In this study,we consider a P2P trading environment based on blockchain technology,where prosumers can submit bids or offers without knowing the reports of others.We propose an Arrow-d’Aspremont-Gerard-Varet(AGV)-based mechanism to encourage prosumers to submit their real reserve price and determine the P2P transaction price.We demonstrate that the AGV mechanism can achieve Bayesian incentive compatibility and budget balance.Kernel density estimation(KDE)is used to derive the prior distribution from the historical bid/offer information of the agents.Case studies are carried out to analyze and evaluate the proposed mechanism.Simulation results verify the effectiveness of the proposed mechanism in guiding agents to report the true reserve price while maximizing social welfare.Moreover,we discuss the advantages of budget balance for decentralized trading by comparing the Vickrey-Clarke-Groves(VCG)and AGV mechanisms.展开更多
The rapid growth of distributed renewable energy penetration is promoting the evolution of the energy system toward decentralization and decentralized and digitized smart grids.This study was based on energy blockchai...The rapid growth of distributed renewable energy penetration is promoting the evolution of the energy system toward decentralization and decentralized and digitized smart grids.This study was based on energy blockchain,and developed a dual-biding mechanism based on the real-time energy surplus and demand in the local smart grid,which is expected to enable reliable,affordable,and clean energy supply in smart communities.In the proposed system,economic benefits could be achieved by replacing fossil-fuel-based electricity with the high penetration of affordable solar PV electricity.The reduction of energy surplus realized by distributed energy production and P2P energy trading,within the smart grid results in less transmission loss and lower requirements for costly upgrading of existing grids.By adopting energy blockchain and smart contract technologies,energy secure trading with a low risk of privacy leakage could be accommodated.The prototype is examined through a case study,and the feasibility and efficiency of the proposed mechanism are further validated by scenario analysis.展开更多
Peer-to-Peer （P2P） botnet has emerged as one of the most serious threats to lnternet security. To effectively elimi- nate P2P botnet, a delayed SEIR model is proposed,which can portray the formation process of P2P b...Peer-to-Peer （P2P） botnet has emerged as one of the most serious threats to lnternet security. To effectively elimi- nate P2P botnet, a delayed SEIR model is proposed,which can portray the formation process of P2P botnet. Then, the local stability at equilibria is carefully analyzed by considering the eigenvalues＇ distributed ranges of characteristic equations. Both mathematical analysis and numerical simulations show that the dynamical features of the proposed model rely on the basic re- production number and time delay r. The results can help us to better understand the propagation behaviors of P2P botnet and design effective counter-botnet methods.展开更多
One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying que...One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.展开更多
Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to...Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to support efficient resource location is a difficult and challenging problem. This paper provided a hybrid indexing architecture, which combines local indexing and global indexing. It uses community strategy and semantic routing strategy to organize key layer metadata element and uses DHT (distributed hash table) to index extensional layer metadata element. Compared with related system, this approach is more efficient in resource location and more scalable.展开更多
may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set ...may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously un- acceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites’ queries logs to improve performance of KSS system. Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.展开更多
Peer-to-peer (P2P) technology provides a cost-effective and scalable way to distribute video data. However, high heterogeneity of the P2P network, which rises not only from heterogeneous link capacity between peers bu...Peer-to-peer (P2P) technology provides a cost-effective and scalable way to distribute video data. However, high heterogeneity of the P2P network, which rises not only from heterogeneous link capacity between peers but also from dynamic variation of available bandwidth, brings forward great challenge to video streaming. To attack this problem, an adaptive scheme based on rate-distortion optimization (RDO) is proposed in this paper. While low complexity RDO based frame dropping is exploited to shape bitrate into available bandwidth in peers, the streamed bitstream is dynamically switched among multiple available versions in an RDO way by the streaming server. Simulation results show that the proposed scheme based on RDO achieves great gain in overall perceived quality over simple heuristic schemes.展开更多
A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a res...A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.展开更多
Free riding has a great influence on the expandability,robustness and availability of Peer-to-Peer(P2P) network.Controlling free riding has become a hot research issue both in academic and industrial communities.An in...Free riding has a great influence on the expandability,robustness and availability of Peer-to-Peer(P2P) network.Controlling free riding has become a hot research issue both in academic and industrial communities.An incentive scheme is proposed to overcoming free riding in P2P network in this paper.According to the behavior and function of nodes,the P2P network is abstracted to be a Distributed and Monitoring-based Hierarchical Structure Mechanism(DMHSM) model.A utility function based on several influencing factors is defined to determine the contribution of peers to the whole system.This paper also introduces reputation and permit mechanism into the scheme to guarantee the Quality of Service(QoS) and to reward or punish peers in the network.Finally,the simulation results verify the effectiveness and feasibility of this model.展开更多
HitPeers conotitute a scalable and highly efficient P2P file sharing system in which all the data file can be shared. The center of HitPeers is the Category Tree (CT). CT collects the published information with catego...HitPeers conotitute a scalable and highly efficient P2P file sharing system in which all the data file can be shared. The center of HitPeers is the Category Tree (CT). CT collects the published information with category. It is flexible enough to let users customize their own local CT. Its hierarchy helps users to find the information they desire most conveniently. To increase the robustness and retain the efficiency, HitPeers will divide the tree into disjoint parts. Every part is a subtree. Some special nodes named Onodes will take charge of the subtree and play the role of a service provider. HitPeers produce more and more Onodes to meet the service demands in the internet scale distributed environment. This paper will show the profile of the whole system.展开更多
IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this...IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.展开更多
The recent and unprecedented surge of public interest in peer-to-peer (P2P) file-sharing systems has led to a variety of interesting research questions. How to minimize threats in such an open community is an impor-ta...The recent and unprecedented surge of public interest in peer-to-peer (P2P) file-sharing systems has led to a variety of interesting research questions. How to minimize threats in such an open community is an impor-tant research topic. Trust models have been widely used in estimating the trustworthiness of peers in P2P file-sharing systems where peers can transact with each other without prior experience. However, current P2P trust models almost take no consideration for the nature of trust, fuzzy, complex and dynamic, which results in low efficiency in resisting the attacks of malicious nodes. In this paper, a new trust model named NatureTrust that can alleviate the shortage brought by the nature of trust is proposed. In order to cope with the fuzzy characteristic of trust, linguistic terms are used to express trust. Additionally, fuzzy inference rules are employed to evaluate trust of each transaction so as to handle the complex characteristic of trust. Fur-thermore, risk factor is deployed into NatureTrust to represent and reason with the dynamic characteristic of trust. Both risk and trust factors are considered in evaluating the trustworthiness of each peer. Experimental results show that the trust model analyzed here thus stands against malicious act effectively.展开更多
Peer-to-peer technologies have emerged as a powerful and scalable communication model for large scale content shar-ing. However, they are not yet provided with optimized heterogeneous aggregated content management fun...Peer-to-peer technologies have emerged as a powerful and scalable communication model for large scale content shar-ing. However, they are not yet provided with optimized heterogeneous aggregated content management functionality since they lack rich semantic specifications. To overcome these shortcomings, we elaborated a reference model of P2P architecture for a dynamic aggregation, sharing and retrieval of heterogeneous multimedia contents (simple or aggre-gated). This architecture was mainly developed under the CAM4Home European research project and is fully based on the CAM4Home semantic metadata model. This semantic model relies on RDF (Resource Description Framework) and is rich (but simple enough), extensible and dedicated for the description of any kind of multimedia content.In this paper, we detail and evaluate an original semantic-based community network architecture for heterogeneous multimedia con-tent sharing and retrieval. Within the presentedarchitecture, multimedia contents are managed according to their asso-ciated CAM4Home semantic metadata through a structured P2P topology. This topology relies on a semantically en-hanced DHT (Distributed Hash Table) and is also provided with an additional indexing system for offering semantic storage and search facilities and overcoming the problem of exact match keywords in DHTs.展开更多
Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P...Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.展开更多
基金funded by the National Natural Science Foundation of China(52167013)the Key Program of Natural Science Foundation of Gansu Province(24JRRA225)Natural Science Foundation of Gansu Province(23JRRA891).
文摘After a century of relative stability in the electricity sector,the widespread adoption of distributed energy resources,along with recent advancements in computing and communication technologies,has fundamentally altered how energy is consumed,traded,and utilized.This change signifies a crucial shift as the power system evolves from its traditional hierarchical organization to a more decentralized approach.At the heart of this transformation are innovative energy distribution models,like peer-to-peer(P2P)sharing,which enable communities to collaboratively manage their energy resources.The effectiveness of P2P sharing not only improves the economic prospects for prosumers,who generate and consume energy,but also enhances energy resilience and sustainability.This allows communities to better leverage local resources while fostering a sense of collective responsibility and collaboration in energy management.However,there is still no extensive implementation of such sharing models in today’s electricitymarkets.Research on distributed energy P2P trading is still in the exploratory stage,and it is particularly important to comprehensively understand and analyze the existing distributed energy P2P trading market.This paper contributes with an overview of the P2P markets that starts with the network framework,market structure,technical approach for trading mechanism,and blockchain technology,moving to the outlook in this field.
基金supported by National Natural Science Foundation of China(U2066211,52177124,52107134)the Institute of Electrical Engineering,CAS(E155610101)+1 种基金the DNL Cooperation Fund,CAS(DNL202023)the Youth Innovation Promotion Association of CAS(2019143).
文摘Peer-to-peer(P2P)energy trading refers to a type of decentralized transaction,where the energy from distributed energy resources is directly traded between peers.A key challenge in peer-to-peer energy trading is designing a safe,efficient,and transparent trading model and operating mechanism.In this study,we consider a P2P trading environment based on blockchain technology,where prosumers can submit bids or offers without knowing the reports of others.We propose an Arrow-d’Aspremont-Gerard-Varet(AGV)-based mechanism to encourage prosumers to submit their real reserve price and determine the P2P transaction price.We demonstrate that the AGV mechanism can achieve Bayesian incentive compatibility and budget balance.Kernel density estimation(KDE)is used to derive the prior distribution from the historical bid/offer information of the agents.Case studies are carried out to analyze and evaluate the proposed mechanism.Simulation results verify the effectiveness of the proposed mechanism in guiding agents to report the true reserve price while maximizing social welfare.Moreover,we discuss the advantages of budget balance for decentralized trading by comparing the Vickrey-Clarke-Groves(VCG)and AGV mechanisms.
基金Fundings that permitted this research were granted by Australia CRC for Low Carbon Living through the Project“Integrated Carbon Metrics(ICM)”(RP2007)the National Natural Science Foundation of China(51908064)the Natural Science Foundation of Hunan Province(2021JJ30717).
文摘The rapid growth of distributed renewable energy penetration is promoting the evolution of the energy system toward decentralization and decentralized and digitized smart grids.This study was based on energy blockchain,and developed a dual-biding mechanism based on the real-time energy surplus and demand in the local smart grid,which is expected to enable reliable,affordable,and clean energy supply in smart communities.In the proposed system,economic benefits could be achieved by replacing fossil-fuel-based electricity with the high penetration of affordable solar PV electricity.The reduction of energy surplus realized by distributed energy production and P2P energy trading,within the smart grid results in less transmission loss and lower requirements for costly upgrading of existing grids.By adopting energy blockchain and smart contract technologies,energy secure trading with a low risk of privacy leakage could be accommodated.The prototype is examined through a case study,and the feasibility and efficiency of the proposed mechanism are further validated by scenario analysis.
基金National Natural Science Foundation of China(No.61379125)Program for Basic Research of Shanxi Province(No.2012011015-3)Higher School of Science and Technology Innovation Project of Shanxi Province(No.2013148)
文摘Peer-to-Peer （P2P） botnet has emerged as one of the most serious threats to lnternet security. To effectively elimi- nate P2P botnet, a delayed SEIR model is proposed,which can portray the formation process of P2P botnet. Then, the local stability at equilibria is carefully analyzed by considering the eigenvalues＇ distributed ranges of characteristic equations. Both mathematical analysis and numerical simulations show that the dynamical features of the proposed model rely on the basic re- production number and time delay r. The results can help us to better understand the propagation behaviors of P2P botnet and design effective counter-botnet methods.
文摘One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.
文摘Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to support efficient resource location is a difficult and challenging problem. This paper provided a hybrid indexing architecture, which combines local indexing and global indexing. It uses community strategy and semantic routing strategy to organize key layer metadata element and uses DHT (distributed hash table) to index extensional layer metadata element. Compared with related system, this approach is more efficient in resource location and more scalable.
基金Project supported by the National Natural Science Foundation of China (No. 60221120145) and Science & Technology Committee of Shanghai Municipality Key Project (No. 02DJ14045), China
文摘may incur significant bandwidth for executing more com- plicated search queries such as multiple-attribute queries. In order to reduce query overhead, KSS (keyword-set search) by Gnawali partitions the index by a set of keywords. However, a KSS index is considerably larger than a standard inverted index, since there are more word sets than there are individual words. And the insert overhead and storage overhead are obviously un- acceptable for full-text search on a collection of documents even if KSS uses the distance window technology. In this paper, we extract the relationship information between query keywords from websites’ queries logs to improve performance of KSS system. Experiments results clearly demonstrated that the improved keyword-set search system based on keywords relationship (KRBKSS) is more efficient than KSS index in insert overhead and storage overhead, and a standard inverted index in terms of communication costs for query.
文摘Peer-to-peer (P2P) technology provides a cost-effective and scalable way to distribute video data. However, high heterogeneity of the P2P network, which rises not only from heterogeneous link capacity between peers but also from dynamic variation of available bandwidth, brings forward great challenge to video streaming. To attack this problem, an adaptive scheme based on rate-distortion optimization (RDO) is proposed in this paper. While low complexity RDO based frame dropping is exploited to shape bitrate into available bandwidth in peers, the streamed bitstream is dynamically switched among multiple available versions in an RDO way by the streaming server. Simulation results show that the proposed scheme based on RDO achieves great gain in overall perceived quality over simple heuristic schemes.
基金supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2012R1A1A4A0105777)supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (NIPA-2013-H030113-4007) supervised by the NIPA (National IT Industry Promotion Agency)
文摘A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.
基金Supported by the National Natural Science Foundation of China (No.60873203)the Natural Science Foundation of Hebei Province (No.F2008000646)the Guidance Program of the Department of Science and Technology in Hebei Province (No.072135192)
文摘Free riding has a great influence on the expandability,robustness and availability of Peer-to-Peer(P2P) network.Controlling free riding has become a hot research issue both in academic and industrial communities.An incentive scheme is proposed to overcoming free riding in P2P network in this paper.According to the behavior and function of nodes,the P2P network is abstracted to be a Distributed and Monitoring-based Hierarchical Structure Mechanism(DMHSM) model.A utility function based on several influencing factors is defined to determine the contribution of peers to the whole system.This paper also introduces reputation and permit mechanism into the scheme to guarantee the Quality of Service(QoS) and to reward or punish peers in the network.Finally,the simulation results verify the effectiveness and feasibility of this model.
文摘HitPeers conotitute a scalable and highly efficient P2P file sharing system in which all the data file can be shared. The center of HitPeers is the Category Tree (CT). CT collects the published information with category. It is flexible enough to let users customize their own local CT. Its hierarchy helps users to find the information they desire most conveniently. To increase the robustness and retain the efficiency, HitPeers will divide the tree into disjoint parts. Every part is a subtree. Some special nodes named Onodes will take charge of the subtree and play the role of a service provider. HitPeers produce more and more Onodes to meet the service demands in the internet scale distributed environment. This paper will show the profile of the whole system.
基金Sponsored by the National Natural Science Foundation of China(Grant No.60672124 and 60832009)Hi-Tech Research and Development Program(National 863 Program)(Grant No.2007AA01Z221)
文摘IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.
文摘The recent and unprecedented surge of public interest in peer-to-peer (P2P) file-sharing systems has led to a variety of interesting research questions. How to minimize threats in such an open community is an impor-tant research topic. Trust models have been widely used in estimating the trustworthiness of peers in P2P file-sharing systems where peers can transact with each other without prior experience. However, current P2P trust models almost take no consideration for the nature of trust, fuzzy, complex and dynamic, which results in low efficiency in resisting the attacks of malicious nodes. In this paper, a new trust model named NatureTrust that can alleviate the shortage brought by the nature of trust is proposed. In order to cope with the fuzzy characteristic of trust, linguistic terms are used to express trust. Additionally, fuzzy inference rules are employed to evaluate trust of each transaction so as to handle the complex characteristic of trust. Fur-thermore, risk factor is deployed into NatureTrust to represent and reason with the dynamic characteristic of trust. Both risk and trust factors are considered in evaluating the trustworthiness of each peer. Experimental results show that the trust model analyzed here thus stands against malicious act effectively.
文摘Peer-to-peer technologies have emerged as a powerful and scalable communication model for large scale content shar-ing. However, they are not yet provided with optimized heterogeneous aggregated content management functionality since they lack rich semantic specifications. To overcome these shortcomings, we elaborated a reference model of P2P architecture for a dynamic aggregation, sharing and retrieval of heterogeneous multimedia contents (simple or aggre-gated). This architecture was mainly developed under the CAM4Home European research project and is fully based on the CAM4Home semantic metadata model. This semantic model relies on RDF (Resource Description Framework) and is rich (but simple enough), extensible and dedicated for the description of any kind of multimedia content.In this paper, we detail and evaluate an original semantic-based community network architecture for heterogeneous multimedia con-tent sharing and retrieval. Within the presentedarchitecture, multimedia contents are managed according to their asso-ciated CAM4Home semantic metadata through a structured P2P topology. This topology relies on a semantically en-hanced DHT (Distributed Hash Table) and is also provided with an additional indexing system for offering semantic storage and search facilities and overcoming the problem of exact match keywords in DHTs.
文摘Peer-to-peer (P2P) networking is a distributed architecture that partitions tasks or data between peer nodes. In this paper, an efficient Hypercube Sequential Matrix Partition (HS-MP) for efficient data sharing in P2P Networks using tokenizer method is proposed to resolve the problems of the larger P2P networks. The availability of data is first measured by the tokenizer using Dynamic Hypercube Organization. By applying Dynamic Hypercube Organization, that efficiently coordinates and assists the peers in P2P network ensuring data availability at many locations. Each data in peer is then assigned with valid ID by the tokenizer using Sequential Self-Organizing (SSO) ID generation model. This ensures data sharing with other nodes in large P2P network at minimum time interval which is obtained through proximity of data availability. To validate the framework HS-MP, the performance is evaluated using traffic traces collected from data sharing applications. Simulations conducting using Network simulator-2 show that the proposed framework outperforms the conventional streaming models. The performance of the proposed system is analyzed using energy consumption, average latency and average data availability rate with respect to the number of peer nodes, data size, amount of data shared and execution time. The proposed method reduces the energy consumption 43.35% to transpose traffic, 35.29% to bitrev traffic and 25% to bitcomp traffic patterns.
