The design and evaluation of accelerated transmission （AT） systems in peer-to-peer networks for data transmission are introduced. Based on transfer control protocol （TCP） and peer-to-peer （P2P） substrate network...The design and evaluation of accelerated transmission （AT） systems in peer-to-peer networks for data transmission are introduced. Based on transfer control protocol （TCP） and peer-to-peer （P2P） substrate networks, AT can select peers of high performance quality, monitor the transfer status of each peer, dynamically adjust the transmission velocity and react to connection degradation with high accuracy and low overhead. The system performance is evaluated by simulations, and the interrelationship between network flow, bandwidth utilities and network throughput is analyzed. Owing to the collaborative operation of neighboring peers, AT accelerates the process of data transmission and the collective network performance is much more satisfactory.展开更多
Edge devices in Internet of Things(IoT)applications can form peers to communicate in peer-to-peer(P2P)networks over P2P protocols.Using P2P networks ensures scalability and removes the need for centralized management....Edge devices in Internet of Things(IoT)applications can form peers to communicate in peer-to-peer(P2P)networks over P2P protocols.Using P2P networks ensures scalability and removes the need for centralized management.However,due to the open nature of P2P networks,they often suffer from the existence of malicious peers,especially malicious peers that unite in groups to raise each other’s ratings.This compromises users’safety and makes them lose their confidence about the files or services they are receiving.To address these challenges,we propose a neural networkbased algorithm,which uses the advantages of a machine learning algorithm to identify whether or not a peer is malicious.In this paper,a neural network(NN)was chosen as the machine learning algorithm due to its efficiency in classification.The experiments showed that the NNTrust algorithm is more effective and has a higher potential of reducing the number of invalid files and increasing success rates than other well-known trust management systems.展开更多
Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distrib...Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer to Peer routing.展开更多
Trust has become an increasingly important issue given society’s growing reliance on electronic transactions.Peer-to-peer(P2P)networks are among the main electronic transaction environments affected by trust issues d...Trust has become an increasingly important issue given society’s growing reliance on electronic transactions.Peer-to-peer(P2P)networks are among the main electronic transaction environments affected by trust issues due to the freedom and anonymity of peers(users)and the inherent openness of these networks.A malicious peer can easily join a P2P network and abuse its peers and resources,resulting in a large-scale failure that might shut down the entire network.Therefore,a plethora of researchers have proposed trust management systems to mitigate the impact of the problem.However,due to the problem’s scale and complexity,more research is necessary.The algorithm proposed here,HierarchTrust,attempts to create a more reliable environment in which the selection of a peer provider of a file or other resource is based on several trust values represented in hierarchical form.The values at the top of the hierarchical form are more trusted than those at the lower end of the hierarchy.Trust,in HierarchTrust,is generally calculated based on the standard deviation.Evaluation via simulation showed that HierarchTrust produced a better success rate than the well-established EigenTrust algorithm.展开更多
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.展开更多
In this paper, we propose a clustered multihop cellular network （cMCN） architecture and study its performance using fixed channel assignment （FCA） scheme for uplink transmission. The proposed cMCN using FCA can be...In this paper, we propose a clustered multihop cellular network （cMCN） architecture and study its performance using fixed channel assignment （FCA） scheme for uplink transmission. The proposed cMCN using FCA can be applied with some reuse factors. An analytical model based on Markov chain is developed to analyze its performance and validated through computer simulation. And then, we implement direct peer-to-peer communication （DC） in cMCN by considering more reasonable conditions in practice. DC means that two calls communicate directly instead of going through base stations. The results show that cMCN with FCA can reduce the call blocking probability significantly as compared with the traditional single-hop cellular networks with FCA and can be further reduced by using DC.展开更多
The Peer-to-Peer(P2P)network traffic identification technology includes Transport Layer Identification(TLI)and Deep Packet Inspection(DPI)methods.By analyzing packets of the transport layer and the traffic characteris...The Peer-to-Peer(P2P)network traffic identification technology includes Transport Layer Identification(TLI)and Deep Packet Inspection(DPI)methods.By analyzing packets of the transport layer and the traffic characteristic in the P2P system,TLI can identify whether or not the network data flow belongs to the P2P system.The DPI method adopts protocol analysis technology and reverting technology.It picks up data from the P2P application layer and analyzes the characteristics of the payload to judge if the network traffic belongs to P2P applications.Due to its accuracy,robustness and classifying ability,DPI is the main method used to identify P2P traffic.Adopting the advantages of TLI and DPI,a precise and efficient technology for P2P network traffic identification can be designed.展开更多
Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which pe...Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which peers enter and leave the system, i.e. the churn, is often high. A user that is obtaining content from a selected peer is frequently informed that particular peer is not available anymore, and is asked to select another peer, or will have another peer assigned, often without enough checks to confirm that the content provided by the new peer presents the same quality of the previous peer. In this work we present a strategy based on group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. This group of peers, called PCG (Peer Content Group) provides reliable content access in sense that even as members of the group crash or leave the system, users continue to receive the content if at least one group member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer is serving request crashes, another group member is elected to continue providing the service. The PCG and a P2P file sharing applications were implemented in the JXTA platform. Evaluation results are presented showing the latency of group operations and system components.展开更多
This research studied the concept of enacted peer support during adolescence by means of the Harry Potter Series. A network approach was used. Results indicated the importance of reciprocity and transitivity for enact...This research studied the concept of enacted peer support during adolescence by means of the Harry Potter Series. A network approach was used. Results indicated the importance of reciprocity and transitivity for enacted peer support during adolescence. Contrary to our expectations, gender, age and personality traits did not affect enacted peer support. No homophily effects based on gender and age were detected. However, students were found to be more supportive of students with similar personality traits. We hope this study adds to the current knowledge on peer support in adolescence and promotes the use of social theories and methods in literacy research.展开更多
Due to minimum consideration of an actual network topology, the existing peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, will lead to high latency and low efficiency. In TaChord, a topolo...Due to minimum consideration of an actual network topology, the existing peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, will lead to high latency and low efficiency. In TaChord, a topology-aware routing approach in P2P overlays and an improved design in Chord are presented. TaChord and other algorithms are evaluated by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. Experimental results demonstrate that TaChord has the drastic improvement in routing performance where average physical hop is half that of chord, and the impact of cache management strategies in the TaChord overlay cannot be neglected.展开更多
Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的...Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的3个周期性尖峰群、不同主机发送或接收流量的重尾分布、p2p流量的长相关特性以及提出了ADTE的估计方法来区分信令和数据流量。本文的研究也显示出Napster在p2p流中占大部分,这暗示着超级节点和阶层式拓扑较纯p2p结构潜在的优势。同时,观察到在我国p2p的流量仅占Internet总流量的1%弱,这个值跟国外的数据有很大区别。我们分析了其中的原因并希望该结论为我国p2p软件的发展提供参考。展开更多
基金The National Natural Science Foundation of China(No60573133)the National Basic Research Program of China (973Program) (No2003CB314801)
文摘The design and evaluation of accelerated transmission （AT） systems in peer-to-peer networks for data transmission are introduced. Based on transfer control protocol （TCP） and peer-to-peer （P2P） substrate networks, AT can select peers of high performance quality, monitor the transfer status of each peer, dynamically adjust the transmission velocity and react to connection degradation with high accuracy and low overhead. The system performance is evaluated by simulations, and the interrelationship between network flow, bandwidth utilities and network throughput is analyzed. Owing to the collaborative operation of neighboring peers, AT accelerates the process of data transmission and the collective network performance is much more satisfactory.
文摘Edge devices in Internet of Things(IoT)applications can form peers to communicate in peer-to-peer(P2P)networks over P2P protocols.Using P2P networks ensures scalability and removes the need for centralized management.However,due to the open nature of P2P networks,they often suffer from the existence of malicious peers,especially malicious peers that unite in groups to raise each other’s ratings.This compromises users’safety and makes them lose their confidence about the files or services they are receiving.To address these challenges,we propose a neural networkbased algorithm,which uses the advantages of a machine learning algorithm to identify whether or not a peer is malicious.In this paper,a neural network(NN)was chosen as the machine learning algorithm due to its efficiency in classification.The experiments showed that the NNTrust algorithm is more effective and has a higher potential of reducing the number of invalid files and increasing success rates than other well-known trust management systems.
文摘Peer to Peer systems are emerging as one of the most popular Internet applications. Structured Peer to Peer overlay networks use identifier based routing algorithms to allow robustness, load balancing, and distributed lookup needed in this environment. However, identifier based routing that is independent of Internet topology tends to be of low efficiency. Aimed at improving the routing efficiency, the super proximity routing algorithms presented in this paper combine Internet topology and overlay routing table in choosing the next hop. Experimental results showed that the algorithms greatly improve the efficiency of Peer to Peer routing.
文摘Trust has become an increasingly important issue given society’s growing reliance on electronic transactions.Peer-to-peer(P2P)networks are among the main electronic transaction environments affected by trust issues due to the freedom and anonymity of peers(users)and the inherent openness of these networks.A malicious peer can easily join a P2P network and abuse its peers and resources,resulting in a large-scale failure that might shut down the entire network.Therefore,a plethora of researchers have proposed trust management systems to mitigate the impact of the problem.However,due to the problem’s scale and complexity,more research is necessary.The algorithm proposed here,HierarchTrust,attempts to create a more reliable environment in which the selection of a peer provider of a file or other resource is based on several trust values represented in hierarchical form.The values at the top of the hierarchical form are more trusted than those at the lower end of the hierarchy.Trust,in HierarchTrust,is generally calculated based on the standard deviation.Evaluation via simulation showed that HierarchTrust produced a better success rate than the well-established EigenTrust algorithm.
文摘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.
文摘In this paper, we propose a clustered multihop cellular network （cMCN） architecture and study its performance using fixed channel assignment （FCA） scheme for uplink transmission. The proposed cMCN using FCA can be applied with some reuse factors. An analytical model based on Markov chain is developed to analyze its performance and validated through computer simulation. And then, we implement direct peer-to-peer communication （DC） in cMCN by considering more reasonable conditions in practice. DC means that two calls communicate directly instead of going through base stations. The results show that cMCN with FCA can reduce the call blocking probability significantly as compared with the traditional single-hop cellular networks with FCA and can be further reduced by using DC.
基金This work was funded by the National Natural Science Foundation of China under Grant60473090.
文摘The Peer-to-Peer(P2P)network traffic identification technology includes Transport Layer Identification(TLI)and Deep Packet Inspection(DPI)methods.By analyzing packets of the transport layer and the traffic characteristic in the P2P system,TLI can identify whether or not the network data flow belongs to the P2P system.The DPI method adopts protocol analysis technology and reverting technology.It picks up data from the P2P application layer and analyzes the characteristics of the payload to judge if the network traffic belongs to P2P applications.Due to its accuracy,robustness and classifying ability,DPI is the main method used to identify P2P traffic.Adopting the advantages of TLI and DPI,a precise and efficient technology for P2P network traffic identification can be designed.
文摘Peer-to-Peer (P2P) networks are highly dynamic systems which are very popular for content distribution in the Internet. A single peer remains in the system for an unpredictable amount of time, and the rate in which peers enter and leave the system, i.e. the churn, is often high. A user that is obtaining content from a selected peer is frequently informed that particular peer is not available anymore, and is asked to select another peer, or will have another peer assigned, often without enough checks to confirm that the content provided by the new peer presents the same quality of the previous peer. In this work we present a strategy based on group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. This group of peers, called PCG (Peer Content Group) provides reliable content access in sense that even as members of the group crash or leave the system, users continue to receive the content if at least one group member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer is serving request crashes, another group member is elected to continue providing the service. The PCG and a P2P file sharing applications were implemented in the JXTA platform. Evaluation results are presented showing the latency of group operations and system components.
文摘This research studied the concept of enacted peer support during adolescence by means of the Harry Potter Series. A network approach was used. Results indicated the importance of reciprocity and transitivity for enacted peer support during adolescence. Contrary to our expectations, gender, age and personality traits did not affect enacted peer support. No homophily effects based on gender and age were detected. However, students were found to be more supportive of students with similar personality traits. We hope this study adds to the current knowledge on peer support in adolescence and promotes the use of social theories and methods in literacy research.
文摘Due to minimum consideration of an actual network topology, the existing peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, will lead to high latency and low efficiency. In TaChord, a topology-aware routing approach in P2P overlays and an improved design in Chord are presented. TaChord and other algorithms are evaluated by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. Experimental results demonstrate that TaChord has the drastic improvement in routing performance where average physical hop is half that of chord, and the impact of cache management strategies in the TaChord overlay cannot be neglected.
文摘Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的3个周期性尖峰群、不同主机发送或接收流量的重尾分布、p2p流量的长相关特性以及提出了ADTE的估计方法来区分信令和数据流量。本文的研究也显示出Napster在p2p流中占大部分,这暗示着超级节点和阶层式拓扑较纯p2p结构潜在的优势。同时,观察到在我国p2p的流量仅占Internet总流量的1%弱,这个值跟国外的数据有很大区别。我们分析了其中的原因并希望该结论为我国p2p软件的发展提供参考。
