This paper proposes a peer clustering scheme for unstructured Peer-to-Peer (P2P) systems. The proposed
scheme consists of an identification of critical links, local reconfiguration of incident links, and a
retaliation rule. The simulation result indicates that the proposed scheme improves the performance of
previous schemes and that a peer taking a cooperative action will receive a higher profit than selfish peers.
AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONSIJNSA Journal
- The document proposes a new type of authentication called group authentication that authenticates all users in a group at once, rather than authenticating users individually.
- A group manager is responsible for registering users and issuing unique tokens to each user based on a secret polynomial. During authentication, users present their tokens to prove they belong to the same group without revealing their identities.
- Two group authentication protocols are proposed: a basic one-time protocol where tokens are revealed, and an improved protocol that protects tokens by having each user generate shares of a random polynomial for others and releasing the sum of their token and shares received. This allows for authentication without revealing tokens or the secret.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
Link Prediction in (Partially) Aligned Heterogeneous Social NetworksSina Sajadmanesh
This document discusses link prediction in homogeneous and heterogeneous social networks. It begins by introducing the problem of link prediction and its applications. It then discusses various unsupervised and supervised methods for link prediction in homogeneous networks. Next, it covers relationship prediction and collective link prediction in heterogeneous networks. It also discusses link prediction in aligned heterogeneous networks using link transfer and anchor link inference. Finally, it outlines future work on this topic.
Probabilistic Relational Models for Link Prediction ProblemSina Sajadmanesh
This document discusses probabilistic relational models for link prediction. It introduces probabilistic relational networks, including relational Bayesian networks (RBNs) and relational Markov networks (RMNs). RBNs define a joint probability distribution over attributes and relations. RMNs focus on symmetric interactions using clique templates. Both approaches can be used for link prediction by modeling factors that affect relations between entities, such as attributes, structural properties, and complex patterns.
Scale-Free Networks to Search in Unstructured Peer-To-Peer NetworksIOSR Journals
This document discusses using scale-free networks to improve search efficiency in unstructured peer-to-peer networks. It proposes the EQUATOR architecture, which creates an overlay network topology based on the scale-free Barabasi-Albert model. Simulation results show that EQUATOR achieves good lookup performance comparable to the ideal Barabasi-Albert network, with low message overhead even under node churn. The scale-free topology allows random walks to efficiently locate resources by directing searches to high-degree "hub" nodes with greater knowledge of the network.
The document presents a compartmental model for characterizing the spread of malware in peer-to-peer (P2P) networks like Gnutella. The model partitions peers into compartments based on their state - those wishing to download (S), currently downloading (E), having downloaded (I), and no longer interested (R). Differential equations track changes between compartments over time. Simulation results show the model effectively captures the impact of parameters like peer online/offline switching rates and quarantine strategies on malware intensity. The model improves on prior work by incorporating user behavior dynamics and limiting malware spread to a node's time-to-live range.
LCF is a temporal approach to link prediction in dynamic social networks. It proposes a new predictor called Latest Common Friend (LCF) that incorporates temporal aspects. Social networks are modeled as sequences of snapshots over time periods. Each edge is assigned a weight based on timestamp. LCF score for node pairs is the cumulative weight of their common friends, giving more weight to friends with later timestamps. LCF outperforms traditional predictors like Common Neighbor, Adamic-Adar and Jaccard coefficient on 8 real-world dynamic network datasets based on average AUC scores. Modeling networks temporally and weighting edges by timestamp allows LCF to better predict future links in dynamic social networks.
This document discusses two approaches to peer-to-peer data mining: local algorithms and the Newscast model of computation. Local algorithms perform computations using only local communications between neighbors. The majority voting problem is presented as an example of an exact local algorithm. An approximate local algorithm for K-means clustering over a P2P network is also described. The Newscast model is then introduced as an alternative approach based on a gossip protocol that continuously rewires network connections, allowing data mining primitives to be computed in a decentralized manner even as the network dynamically changes.
AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONSIJNSA Journal
- The document proposes a new type of authentication called group authentication that authenticates all users in a group at once, rather than authenticating users individually.
- A group manager is responsible for registering users and issuing unique tokens to each user based on a secret polynomial. During authentication, users present their tokens to prove they belong to the same group without revealing their identities.
- Two group authentication protocols are proposed: a basic one-time protocol where tokens are revealed, and an improved protocol that protects tokens by having each user generate shares of a random polynomial for others and releasing the sum of their token and shares received. This allows for authentication without revealing tokens or the secret.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
Link Prediction in (Partially) Aligned Heterogeneous Social NetworksSina Sajadmanesh
This document discusses link prediction in homogeneous and heterogeneous social networks. It begins by introducing the problem of link prediction and its applications. It then discusses various unsupervised and supervised methods for link prediction in homogeneous networks. Next, it covers relationship prediction and collective link prediction in heterogeneous networks. It also discusses link prediction in aligned heterogeneous networks using link transfer and anchor link inference. Finally, it outlines future work on this topic.
Probabilistic Relational Models for Link Prediction ProblemSina Sajadmanesh
This document discusses probabilistic relational models for link prediction. It introduces probabilistic relational networks, including relational Bayesian networks (RBNs) and relational Markov networks (RMNs). RBNs define a joint probability distribution over attributes and relations. RMNs focus on symmetric interactions using clique templates. Both approaches can be used for link prediction by modeling factors that affect relations between entities, such as attributes, structural properties, and complex patterns.
Scale-Free Networks to Search in Unstructured Peer-To-Peer NetworksIOSR Journals
This document discusses using scale-free networks to improve search efficiency in unstructured peer-to-peer networks. It proposes the EQUATOR architecture, which creates an overlay network topology based on the scale-free Barabasi-Albert model. Simulation results show that EQUATOR achieves good lookup performance comparable to the ideal Barabasi-Albert network, with low message overhead even under node churn. The scale-free topology allows random walks to efficiently locate resources by directing searches to high-degree "hub" nodes with greater knowledge of the network.
The document presents a compartmental model for characterizing the spread of malware in peer-to-peer (P2P) networks like Gnutella. The model partitions peers into compartments based on their state - those wishing to download (S), currently downloading (E), having downloaded (I), and no longer interested (R). Differential equations track changes between compartments over time. Simulation results show the model effectively captures the impact of parameters like peer online/offline switching rates and quarantine strategies on malware intensity. The model improves on prior work by incorporating user behavior dynamics and limiting malware spread to a node's time-to-live range.
LCF is a temporal approach to link prediction in dynamic social networks. It proposes a new predictor called Latest Common Friend (LCF) that incorporates temporal aspects. Social networks are modeled as sequences of snapshots over time periods. Each edge is assigned a weight based on timestamp. LCF score for node pairs is the cumulative weight of their common friends, giving more weight to friends with later timestamps. LCF outperforms traditional predictors like Common Neighbor, Adamic-Adar and Jaccard coefficient on 8 real-world dynamic network datasets based on average AUC scores. Modeling networks temporally and weighting edges by timestamp allows LCF to better predict future links in dynamic social networks.
This document discusses two approaches to peer-to-peer data mining: local algorithms and the Newscast model of computation. Local algorithms perform computations using only local communications between neighbors. The majority voting problem is presented as an example of an exact local algorithm. An approximate local algorithm for K-means clustering over a P2P network is also described. The Newscast model is then introduced as an alternative approach based on a gossip protocol that continuously rewires network connections, allowing data mining primitives to be computed in a decentralized manner even as the network dynamically changes.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
This document provides an overview of social network analysis (SNA). SNA is not just a methodology but a unique perspective that focuses on relationships between individuals, groups, and institutions rather than individuals alone or macro social structures. Practical applications of SNA include improving communication in organizations, identifying criminal networks, and recommending friends in social networks. The document outlines key SNA concepts like representing networks as graphs, identifying strong/weak ties, central nodes, and measures of network structure such as cohesion, density, and clustering.
Using Networks to Measure Influence and ImpactYunhao Zhang
1. The document describes a network analysis model to measure influence in networks. It builds a co-authorship network of researchers who collaborated with mathematician Paul Erdos and analyzes its properties.
2. It proposes an Entropy-Weight-Based Gray Relational Analysis (EWGRA) model to quantitatively analyze correlations between subjects while avoiding human interference in weighting. This model combines centrality measures and PageRank to measure the most influential researcher.
3. The model also proposes a Food Chain Model to measure the significance of research papers by simulating how information spreads. By applying these models to different networks, the most influential researcher and research paper are identified.
Testing and Improving Local Adaptive Importance Sampling in LFJ Local-JT in M...csandit
Multiply Sectioned Bayesian Network (MSBN) provides
a model for probabilistic reasoning in
multi-agent systems. The exact inference is costly
and difficult to be applied in the context of
MSBNs as the size of problem domain becomes larger
and complex. So the approximate
techniques are used as an alternative in such cases
. Recently, for reasoning in MSBNs, LJF-
based Local Adaptive Importance Sampler (LLAIS) has
been developed for approximate
reasoning in MSBNs. However, the prototype of LLAIS
is tested only on Alarm Network (37
nodes). But further testing on larger networks has
not been reported yet, so the scalability and
reliability of algorithm remains questionable. Henc
e, we tested LLAIS on three large networks
(treated as local JTs) namely Hailfinder (56 nodes)
, Win95pts (76 nodes) and PathFinder(109
nodes). From the experiments done, it is seen that
LLAIS without parameters tuned shows good
convergence for Hailfinder and Win95pts but not for
Pathfinder network. Further when these
parameters are tuned the algorithm shows considerab
le improvement in its accuracy and
convergence for all the three networks tested.
MODELING SOCIAL GAUSS-MARKOV MOBILITY FOR OPPORTUNISTIC NETWORK csandit
Mobility is attracting more and more interests due to its importance for data forwarding
mechanisms in many networks such as mobile opportunistic network. In everyday life mobile
nodes are often carried by human. Thus, mobile nodes’ mobility pattern is inevitable affected by
human social character. This paper presents a novel mobility model (HNGM) which combines
social character and Gauss-Markov process together. The performance analysis on this
mobility model is given and one famous and widely used mobility model (RWP) is chosen to
make comparison..
THE NASH’S BALANCE IN THE THEORY OF GAMES FOR A SECURE MODEL MECHANISM IN ROU...ijcisjournal
The present work is dedicated to study attacks and countermeasure in MANET. After a short introduction to what the Mobile Ad hoc Networks (MANETs) are and network security we present a survey of various attacks in MANETs pertaining to fail routing protocols. We present the different tools used by these attacks and the mechanisms used by the secured routing protocols to counter them. We also study a mechanism of security, named the reputation, proposed for the MANETs and the protocol which implements it. We also propose a secure mechanism which is based on the reputation. Our work ends with a proposal analytical model to the modules of our mechanism and the equilibrium states of our model.
A Proposed Algorithm to Detect the Largest Community Based On Depth LevelEswar Publications
The incredible rising of online networks show that these networks are complex and involving massive data.Giving a very strong interest to set of techniques developed for mining these networks. The clique problem is a well known NP-Hard problem in graph mining. One of the fundamental applications for it is the community detection. It helps to understand and model the network structure which has been a fundamental problem in several fields. In literature, the exponentially increasing computation time of this problem make the quality of these solutions is limited and infeasible for massive graphs. Furthermore, most of the proposed approaches are able to detect only disjoint communities. In this paper, we present a new clique based approach for fast and efficient overlapping
community detection. The work overcomes the short falls of clique percolation method (CPM), one of most popular and commonly used methods in this area. The shortfalls occur due to brute force algorithm for enumerating maximal cliques and also the missing out many vertices thatleads to poor node coverage. The proposed work overcome these shortfalls producing NMC method for enumerating maximal cliques then detects overlapping communities using three different community scales based on three different depth levels to assure high nodes coverage and detects the largest communities. The clustering coefficient and cluster density are used to measure the quality. The work also provide experimental results on benchmark real world network to
demonstrate the efficiency and compare the new proposed algorithm with CPM method, The proposed algorithm is able to quickly discover the maximal cliques and detects overlapping community with interesting remarks and findings.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
Using content and interactions for discovering communities inmoresmile
1. The document proposes methods for discovering communities in social networks using content and interactions by modeling communities based on discussed topics and social connections between users. This allows discovering both user interests and popular topics within each community.
2. Bayesian models are used to extract latent communities from the network, assuming community relationships depend on user interests in topics and their links. Different models are proposed to handle different network structures like broadcast vs conversation networks.
3. The models aim to utilize both content and link information to discover communities in incomplete social networks with missing link information. A distance metric is learned using observed links and used for hierarchical clustering.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
This document presents two papers on analyzing bursty topics from microblogs and modeling latent topic transitions in social media. The first paper proposes using temporal information from microblog posts and users' interests to detect bursty topics. The second paper introduces TM-LDA, a topic model that captures latent topic transitions over time in sequentially posted documents and efficiently updates online. Both papers aim to model topics in a temporally-aware manner from streaming social media data.
IMPROVING HYBRID REPUTATION MODEL THROUGH DYNAMIC REGROUPINGijp2p
Peer-to-Peer (P2P) systems have the ability to bond with millions of clients in business and knowledge
scenario. The mechanism that leads users to distribute files without the need of centralized servers has
achieved wide recognition among internet users. This also permits for a range of applications further than
simple file sharing. he main problem lies in the fact that peers have to customarily intermingle with
mysterious peers in the absence of trusted third parties. Usually the lack of incentives often makes these
strange peers to act as freeriders and thus reduce the system performance. The trustworthiness among
peers is portrayed by applying the knowledge obtained as a result of reputation mechanisms. This paper
endows with a new reputation model in association with a detailed survey of diverse reputation models. The
proposed model suggests a hybrid reputation model through dynamic regrouping..
Preclusion Measures for Protecting P2P Networks from Malware SpreadIOSR Journals
The document presents a compartmental model for characterizing the spread of malware in peer-to-peer (P2P) networks like Gnutella. The model partitions peers into compartments based on their state - those wishing to download (S), currently downloading (E), having downloaded (I), and no longer interested (R). Differential equations track changes between compartments over time. Simulation results show the model effectively captures the impact of parameters like quarantine rate on malware intensity. The model accounts for realistic peer behaviors like transitioning between online/offline states.
Hamalt genetics based peer to-peer network architecture to encourage the coo...csandit
Since its inception, Internet has grown tremendously not only in the size of its customers but
also with the technology used behind to run it. For the well ex-istence and proper development
of Peer-to-Peer Networks, all nodes in the overlay must be cooperative and donate their
resources for any other peer. The paper dis-cusses the reason of peers being selfish, causes of
selfish peers and the methods used so far to resolve selfish peers problem. A Genetic Algorithm
based solution has been proposed in this paper that solves the selfish nodes problem in Peer-to-
Peer Networks and that also encourages the cooperation among all nodes in the overlay. An
architecture HAMALT is proposed in this paper for disseminating altruism among the peers.
HAMALT : GENETICS BASED PEER-TOPEER NETWORK ARCHITECTURE TO ENCOURAGE THE COO...cscpconf
Since its inception, Internet has grown tremendously not only in the size of its customers but also with the technology used behind to run it. For the well ex-istence and proper development
of Peer-to-Peer Networks, all nodes in the overlay must be cooperative and donate their resources for any other peer. The paper dis-cusses the reason of peers being selfish, causes of
selfish peers and the methods used so far to resolve selfish peers problem. A Genetic Algorithm based solution has been proposed in this paper that solves the selfish nodes problem in Peer-toPeer Networks and that also encourages the cooperation among all nodes in the overlay. An architecture HAMALT is proposed in this paper for disseminating altruism among the peers.
HAMALT : GENETICS BASED PEER-TOPEER NETWORK ARCHITECTURE TO ENCOURAGE THE COO...csandit
This document proposes a genetic algorithm-based peer-to-peer network architecture called HAMALT to address the problem of selfish nodes. HAMALT uses concepts from genetics such as kin selection and inclusive fitness to encourage cooperation among peers. It calculates an inclusive fitness value for each peer based on its own contributions and those of its neighbors. Peers that do not contribute have their fitness reduced. Closely related peers can encourage less altruistic peers to cooperate more. The goal is to evolve and spread altruism throughout the network over multiple generations of peers.
AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONSIJNSA Journal
- The document proposes a new type of authentication called group authentication that authenticates all users in a group at once.
- During registration with a group manager, each user obtains a unique token. Users can present their tokens to determine if they belong to the same group without revealing identities.
- Two group authentication protocols are proposed: 1) a basic one-time protocol where tokens are revealed, allowing single use, and 2) an improved protocol where tokens are not revealed by using properties of secret sharing to authenticate users multiple times.
The adaptation of the BitTorrent protocol to multimedia on-demand streaming systems essentially lies on
the modification of its two core algorithms, namely the piece and the peer selection policies, respectively.
Much more attention has though been given to the piece selection policy. Within this context, this article
proposes three novel peer selection policies for the design of BitTorrent-like protocols targeted at that type
of systems: Select Balanced Neighbour Policy (SBNP), Select Regular Neighbour Policy (SRNP), and
Select Optimistic Neighbour Policy (SONP). These proposals are validated through a competitive analysis
based on simulations which encompass a variety of multimedia scenarios, defined in function of important
characterization parameters such as content type, content size, and client´s interactivity profile. Service
time, number of clients served and efficiency retrieving coefficient are the performance metrics assessed in
the analysis. The final results mainly show that the novel proposals constitute scalable solutions that may
be considered for real project designs. Lastly, future work is included in the conclusion of this paper.
Alluding Communities in Social Networking Websites using Enhanced Quasi-cliqu...IJMTST Journal
1) The document proposes an enhanced technique to recommend communities to users in social networks based on the user's interests and their strong friends.
2) It identifies a user's area of interest by analyzing their posts and classifying keywords. It then determines the user's strong friends based on an enhanced quasi-clique technique, considering interaction strength.
3) Communities are recommended by considering both the user's interests and strong friends. This provides a more precise recommendation than only considering strong friends.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing
On client’s interactive behaviour to design peer selection policies for bitto...IJCNCJournal
Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet.
This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand
streaming system. The vast majority of these proposals focus on modifying the piece and peer selection
policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been
given to the piece selection policy rather than to the peer selection policy. Within this context, this article
proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols,
considering interactive scenarios. To this end, we analyze the client’s interactive behaviour when accessing
real multimedia systems. This analysis consists of looking into workloads of real content providers and
assessing three important metrics, namely temporal dispersion, spatial dispersion and object position
popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our
knowledge, this is the first time that the client’s interactive behaviour is specially considered to derive an
algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges
and possible future work in this research field.
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
This document provides an overview of social network analysis (SNA). SNA is not just a methodology but a unique perspective that focuses on relationships between individuals, groups, and institutions rather than individuals alone or macro social structures. Practical applications of SNA include improving communication in organizations, identifying criminal networks, and recommending friends in social networks. The document outlines key SNA concepts like representing networks as graphs, identifying strong/weak ties, central nodes, and measures of network structure such as cohesion, density, and clustering.
Using Networks to Measure Influence and ImpactYunhao Zhang
1. The document describes a network analysis model to measure influence in networks. It builds a co-authorship network of researchers who collaborated with mathematician Paul Erdos and analyzes its properties.
2. It proposes an Entropy-Weight-Based Gray Relational Analysis (EWGRA) model to quantitatively analyze correlations between subjects while avoiding human interference in weighting. This model combines centrality measures and PageRank to measure the most influential researcher.
3. The model also proposes a Food Chain Model to measure the significance of research papers by simulating how information spreads. By applying these models to different networks, the most influential researcher and research paper are identified.
Testing and Improving Local Adaptive Importance Sampling in LFJ Local-JT in M...csandit
Multiply Sectioned Bayesian Network (MSBN) provides
a model for probabilistic reasoning in
multi-agent systems. The exact inference is costly
and difficult to be applied in the context of
MSBNs as the size of problem domain becomes larger
and complex. So the approximate
techniques are used as an alternative in such cases
. Recently, for reasoning in MSBNs, LJF-
based Local Adaptive Importance Sampler (LLAIS) has
been developed for approximate
reasoning in MSBNs. However, the prototype of LLAIS
is tested only on Alarm Network (37
nodes). But further testing on larger networks has
not been reported yet, so the scalability and
reliability of algorithm remains questionable. Henc
e, we tested LLAIS on three large networks
(treated as local JTs) namely Hailfinder (56 nodes)
, Win95pts (76 nodes) and PathFinder(109
nodes). From the experiments done, it is seen that
LLAIS without parameters tuned shows good
convergence for Hailfinder and Win95pts but not for
Pathfinder network. Further when these
parameters are tuned the algorithm shows considerab
le improvement in its accuracy and
convergence for all the three networks tested.
MODELING SOCIAL GAUSS-MARKOV MOBILITY FOR OPPORTUNISTIC NETWORK csandit
Mobility is attracting more and more interests due to its importance for data forwarding
mechanisms in many networks such as mobile opportunistic network. In everyday life mobile
nodes are often carried by human. Thus, mobile nodes’ mobility pattern is inevitable affected by
human social character. This paper presents a novel mobility model (HNGM) which combines
social character and Gauss-Markov process together. The performance analysis on this
mobility model is given and one famous and widely used mobility model (RWP) is chosen to
make comparison..
THE NASH’S BALANCE IN THE THEORY OF GAMES FOR A SECURE MODEL MECHANISM IN ROU...ijcisjournal
The present work is dedicated to study attacks and countermeasure in MANET. After a short introduction to what the Mobile Ad hoc Networks (MANETs) are and network security we present a survey of various attacks in MANETs pertaining to fail routing protocols. We present the different tools used by these attacks and the mechanisms used by the secured routing protocols to counter them. We also study a mechanism of security, named the reputation, proposed for the MANETs and the protocol which implements it. We also propose a secure mechanism which is based on the reputation. Our work ends with a proposal analytical model to the modules of our mechanism and the equilibrium states of our model.
A Proposed Algorithm to Detect the Largest Community Based On Depth LevelEswar Publications
The incredible rising of online networks show that these networks are complex and involving massive data.Giving a very strong interest to set of techniques developed for mining these networks. The clique problem is a well known NP-Hard problem in graph mining. One of the fundamental applications for it is the community detection. It helps to understand and model the network structure which has been a fundamental problem in several fields. In literature, the exponentially increasing computation time of this problem make the quality of these solutions is limited and infeasible for massive graphs. Furthermore, most of the proposed approaches are able to detect only disjoint communities. In this paper, we present a new clique based approach for fast and efficient overlapping
community detection. The work overcomes the short falls of clique percolation method (CPM), one of most popular and commonly used methods in this area. The shortfalls occur due to brute force algorithm for enumerating maximal cliques and also the missing out many vertices thatleads to poor node coverage. The proposed work overcome these shortfalls producing NMC method for enumerating maximal cliques then detects overlapping communities using three different community scales based on three different depth levels to assure high nodes coverage and detects the largest communities. The clustering coefficient and cluster density are used to measure the quality. The work also provide experimental results on benchmark real world network to
demonstrate the efficiency and compare the new proposed algorithm with CPM method, The proposed algorithm is able to quickly discover the maximal cliques and detects overlapping community with interesting remarks and findings.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
Using content and interactions for discovering communities inmoresmile
1. The document proposes methods for discovering communities in social networks using content and interactions by modeling communities based on discussed topics and social connections between users. This allows discovering both user interests and popular topics within each community.
2. Bayesian models are used to extract latent communities from the network, assuming community relationships depend on user interests in topics and their links. Different models are proposed to handle different network structures like broadcast vs conversation networks.
3. The models aim to utilize both content and link information to discover communities in incomplete social networks with missing link information. A distance metric is learned using observed links and used for hierarchical clustering.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
This document presents two papers on analyzing bursty topics from microblogs and modeling latent topic transitions in social media. The first paper proposes using temporal information from microblog posts and users' interests to detect bursty topics. The second paper introduces TM-LDA, a topic model that captures latent topic transitions over time in sequentially posted documents and efficiently updates online. Both papers aim to model topics in a temporally-aware manner from streaming social media data.
IMPROVING HYBRID REPUTATION MODEL THROUGH DYNAMIC REGROUPINGijp2p
Peer-to-Peer (P2P) systems have the ability to bond with millions of clients in business and knowledge
scenario. The mechanism that leads users to distribute files without the need of centralized servers has
achieved wide recognition among internet users. This also permits for a range of applications further than
simple file sharing. he main problem lies in the fact that peers have to customarily intermingle with
mysterious peers in the absence of trusted third parties. Usually the lack of incentives often makes these
strange peers to act as freeriders and thus reduce the system performance. The trustworthiness among
peers is portrayed by applying the knowledge obtained as a result of reputation mechanisms. This paper
endows with a new reputation model in association with a detailed survey of diverse reputation models. The
proposed model suggests a hybrid reputation model through dynamic regrouping..
Preclusion Measures for Protecting P2P Networks from Malware SpreadIOSR Journals
The document presents a compartmental model for characterizing the spread of malware in peer-to-peer (P2P) networks like Gnutella. The model partitions peers into compartments based on their state - those wishing to download (S), currently downloading (E), having downloaded (I), and no longer interested (R). Differential equations track changes between compartments over time. Simulation results show the model effectively captures the impact of parameters like quarantine rate on malware intensity. The model accounts for realistic peer behaviors like transitioning between online/offline states.
Hamalt genetics based peer to-peer network architecture to encourage the coo...csandit
Since its inception, Internet has grown tremendously not only in the size of its customers but
also with the technology used behind to run it. For the well ex-istence and proper development
of Peer-to-Peer Networks, all nodes in the overlay must be cooperative and donate their
resources for any other peer. The paper dis-cusses the reason of peers being selfish, causes of
selfish peers and the methods used so far to resolve selfish peers problem. A Genetic Algorithm
based solution has been proposed in this paper that solves the selfish nodes problem in Peer-to-
Peer Networks and that also encourages the cooperation among all nodes in the overlay. An
architecture HAMALT is proposed in this paper for disseminating altruism among the peers.
HAMALT : GENETICS BASED PEER-TOPEER NETWORK ARCHITECTURE TO ENCOURAGE THE COO...cscpconf
Since its inception, Internet has grown tremendously not only in the size of its customers but also with the technology used behind to run it. For the well ex-istence and proper development
of Peer-to-Peer Networks, all nodes in the overlay must be cooperative and donate their resources for any other peer. The paper dis-cusses the reason of peers being selfish, causes of
selfish peers and the methods used so far to resolve selfish peers problem. A Genetic Algorithm based solution has been proposed in this paper that solves the selfish nodes problem in Peer-toPeer Networks and that also encourages the cooperation among all nodes in the overlay. An architecture HAMALT is proposed in this paper for disseminating altruism among the peers.
HAMALT : GENETICS BASED PEER-TOPEER NETWORK ARCHITECTURE TO ENCOURAGE THE COO...csandit
This document proposes a genetic algorithm-based peer-to-peer network architecture called HAMALT to address the problem of selfish nodes. HAMALT uses concepts from genetics such as kin selection and inclusive fitness to encourage cooperation among peers. It calculates an inclusive fitness value for each peer based on its own contributions and those of its neighbors. Peers that do not contribute have their fitness reduced. Closely related peers can encourage less altruistic peers to cooperate more. The goal is to evolve and spread altruism throughout the network over multiple generations of peers.
AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONSIJNSA Journal
- The document proposes a new type of authentication called group authentication that authenticates all users in a group at once.
- During registration with a group manager, each user obtains a unique token. Users can present their tokens to determine if they belong to the same group without revealing identities.
- Two group authentication protocols are proposed: 1) a basic one-time protocol where tokens are revealed, allowing single use, and 2) an improved protocol where tokens are not revealed by using properties of secret sharing to authenticate users multiple times.
The adaptation of the BitTorrent protocol to multimedia on-demand streaming systems essentially lies on
the modification of its two core algorithms, namely the piece and the peer selection policies, respectively.
Much more attention has though been given to the piece selection policy. Within this context, this article
proposes three novel peer selection policies for the design of BitTorrent-like protocols targeted at that type
of systems: Select Balanced Neighbour Policy (SBNP), Select Regular Neighbour Policy (SRNP), and
Select Optimistic Neighbour Policy (SONP). These proposals are validated through a competitive analysis
based on simulations which encompass a variety of multimedia scenarios, defined in function of important
characterization parameters such as content type, content size, and client´s interactivity profile. Service
time, number of clients served and efficiency retrieving coefficient are the performance metrics assessed in
the analysis. The final results mainly show that the novel proposals constitute scalable solutions that may
be considered for real project designs. Lastly, future work is included in the conclusion of this paper.
Alluding Communities in Social Networking Websites using Enhanced Quasi-cliqu...IJMTST Journal
1) The document proposes an enhanced technique to recommend communities to users in social networks based on the user's interests and their strong friends.
2) It identifies a user's area of interest by analyzing their posts and classifying keywords. It then determines the user's strong friends based on an enhanced quasi-clique technique, considering interaction strength.
3) Communities are recommended by considering both the user's interests and strong friends. This provides a more precise recommendation than only considering strong friends.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing.
A NOVEL APPROACH TOWARDS COST EFFECTIVE REGION-BASED GROUP KEY AGREEMENT PROT...ijp2p
Peer-to-peer systems have gained a lot of attention as information sharing systems for the widespread exchange of resources and voluminous information that is easily accessible among thousands of
users. However, current peer-to-peer information sharing systems work mostly on wired networks. With
the growing number of communication-equipped mobile devices that can self-organize into
infrastructure-less communication platform, namely mobile ad hoc networks (MANETs), peer-to-peer
information sharing over MANETs becomes a promising research area. In this paper, we propose a
Region-Based structure that enables efficient and secure peer-to-peer information sharing over MANETs.
The implementation shows that the proposed scheme is Secure, scalable, efficient, and adaptive to node
mobility and provides Reliable information sharing
On client’s interactive behaviour to design peer selection policies for bitto...IJCNCJournal
Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet.
This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand
streaming system. The vast majority of these proposals focus on modifying the piece and peer selection
policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been
given to the piece selection policy rather than to the peer selection policy. Within this context, this article
proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols,
considering interactive scenarios. To this end, we analyze the client’s interactive behaviour when accessing
real multimedia systems. This analysis consists of looking into workloads of real content providers and
assessing three important metrics, namely temporal dispersion, spatial dispersion and object position
popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our
knowledge, this is the first time that the client’s interactive behaviour is specially considered to derive an
algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges
and possible future work in this research field.
The emerging widespread use of Peer-to-Peer computing is making the P2P Data Mining a
natural choice when data sets are distributed over such kind of systems. The huge amount of
data stored within the nodes of P2P networks and the bigger and bigger number of applications
dealing with them as p2p file-sharing, p2p chatting, p2p electronic commerce etc.., is moving
the spotlight on this challenging field. In this paper we give an overview of two different
approaches for implementing primitives for P2P Data Mining, trying then to show differences
and similarities. The first one is based on the definition of Local algorithms; the second one
relies on the Newscast model of computation.
A MOBILE AGENT-BASED P2P E-LEARNING SYSTEM
Takao KAWAMURA, Shin KINOSHITA and Kazunori SUGAHARA
Department of Information and Knowledge Engineering
Tottori University
4–101, Koyama-Minami
Tottori, JAPAN
ABSTRACT
In this paper, we present a novel framework for asynchronous WBT. The proposed system has two distinguishing features. Firstly, it is based on P2P architecture for scalability and robustness. Secondly, all contents in the system are not only data but also agents so that they can mark
user’s answers, tell the correct answers, and show some extra information without human instruction. We also present
a prototype implementation of the proposed system on Maglog that is a Prolog-based framework for building mobile
multi-agent systems we have developed. Performance simulations demonstrate the effectiveness of the proposed system.
DISTRIBUTED E-LEARNING SYSTEM USING AN HYBRID P2P-BASED CONTENT ADDRESSABLE ...ijdpsjournal
We have developed a distributed asynchronous web-based training system. In order to improve the
scalability and robustness of this system, all the content and a function are realized on mobile agents.
These agents are distributed to computers, and they can use a Peer to Peer network that modifies the DHT
Content Addressable Network (CAN). In this system, all computers offer the function and exercise by
themselves. However, the system that all computers do the same behavior is not realistic. In this paper, we
present an e-learning system composed of computers with different types of participation as a solution to
this problem. Activating computers of different types of participation will improve the convenience of the
system.
EFFECTIVE TOPOLOGY-AWARE PEER SELECTION IN UNSTRUCTURED PEER-TO-PEER SYSTEMSijp2p
Peer-to-Peer systems form logical overlay networks on top of the Internet. Essentially, peers randomly
choose logical neighbours without any knowledge about underlying physical topology. This may cause
inefficient communications among peers. This topology mismatch problem may result in poor
performance and scalability for Peer-to-Peer systems. A possible way to improve the performance of
Peer-to-Peer systems is the overlay network construction based on the knowledge of the physical network
topology. In this paper, we will propose the use of the “Record Route” and “Timestamp” options
supported in the IP protocol to explore the paths between peers. By the topology-aware peer selection,
our approach outperforms traditional P2P systems using random peer selection. Our approach only
incurs a low overhead and can be deployed easily in various P2P systems.
EFFECTIVE TOPOLOGY-AWARE PEER SELECTION IN UNSTRUCTURED PEER-TO-PEER SYSTEMSijp2p
Peer-to-Peer systems form logical overlay networks on top of the Internet. Essentially, peers randomly
choose logical neighbours without any knowledge about underlying physical topology. This may cause
inefficient communications among peers. This topology mismatch problem may result in poor
performance and scalability for Peer-to-Peer systems. A possible way to improve the performance of
Peer-to-Peer systems is the overlay network construction based on the knowledge of the physical network
topology. In this paper, we will propose the use of the “Record Route” and “Timestamp” options
supported in the IP protocol to explore the paths between peers. By the topology-aware peer selection,
our approach outperforms traditional P2P systems using random peer selection. Our approach only
incurs a low overhead and can be deployed easily in various P2P systems.
EFFECTIVE TOPOLOGY-AWARE PEER SELECTION IN UNSTRUCTURED PEER-TO-PEER SYSTEMS ijp2p
Peer-to-Peer systems form logical overlay networks on top of the Internet. Essentially, peers randomly choose logical neighbours without any knowledge about underlying physical topology. This may cause inefficient communications among peers. This topology mismatch problem may result in poor performance and scalability for Peer-to-Peer systems. A possible way to improve the performance of Peer-to-Peer systems is the overlay network construction based on the knowledge of the physical network topology. In this paper, we will propose the use of the “Record Route” and “Timestamp” options supported in the IP protocol to explore the paths between peers. By the topology-aware peer selection, our approach outperforms traditional P2P systems using random peer selection. Our approach only incurs a low overhead and can be deployed easily in various P2P systems.
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONSIJCNC
The trust and reputation models were introduced to restrain the impacts caused by rational but selfish
peers in P2P streaming systems. However, these models face with two major challenges from dishonest
feedback and strategic altering behaviors. To answer these challenges, we present a global trust model
based on network community, evaluation correlations, and punishment mechanism. We also propose a
two-layered overlay to provide the function of peers’ behaviors collection and malicious detection.
Furthermore, we analysis several security threats in P2P streaming systems, and discuss how to defend
with them by our trust mechanism. The simulation results show that our trust framework can successfully
filter out dishonest feedbacks by using correlation coefficients. It can effectively defend against the
security threats with good load balance as well.
Social Friend Overlying Communities Based on Social Network ContextIRJET Journal
This document discusses algorithms for detecting overlapping communities in social networks. It begins with an introduction to social networks and community detection. It then reviews various algorithms that have been proposed for detecting overlapping communities, including clique percolation methods, fuzzy detection algorithms, agent-based and dynamic algorithms, and more. It also discusses using these algorithms to recommend friends and locations to users based on their behaviors and communities within social networks. The document presents results from applying these algorithms and concludes by discussing opportunities for future work improving recommendation performance.
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies’ solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.
Similar to A Cooperative Peer Clustering Scheme for Unstructured Peer-to-Peer Systems (20)
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTSijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally.
International Journal of Peer to Peer Networks .docxijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of P2P networks.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results
in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best
practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems,
large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety
of fields can exchange ideas to further research and improve practices in all areas of P2P.
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022)ijp2p
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022) will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the areas of Big Data, Internet of Things (IoT) and Machine Learning. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of Big Data, IoT and Machine Learning.
7th International Conference on Networks, Communications, Wireless and Mobile...ijp2p
7th International Conference on Networks, Communications, Wireless and Mobile Computing (NCWMC 2022) looks for significant contributions to the Computer Networks, Communications, wireless and mobile computing for wired and wireless networks in theoretical and practical aspects. Original papers are invited on computer Networks, network protocols and wireless networks, Data communication Technologies, network security and mobile computing. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
4th International Conference on Internet of Things (CIoT 2022)ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
11th International conference on Parallel, Distributed Computing and Applicat...ijp2p
11th International conference on Parallel, Distributed Computing and Applications (IPDCA 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Parallel, Distributed Computing. Original papers are invited on Algorithms and Applications, computer Networks, Cyber trust and security, Wireless networks and mobile Computing and Bioinformatics. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022)ijp2p
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Cloud computing. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
4th International Conference on Internet of Things (CIoT 2022) ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
3rd International Conference on Networks, Blockchain and Internet of Things (...ijp2p
3rd International Conference on Networks, Blockchain and Internet of Things (NBIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Networks, Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Networks, Blockchain and Internet of Things in theoretical and practical aspects.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas but are not limited to:
3rd International Conference on NLP & Information Retrieval (NLPI 2022)ijp2p
3rd International Conference on NLP & Information Retrieval (NLPI 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Natural Language Computing and Information Retrieval.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to.
CALL FOR PAPERS - 14th International Conference on Wireless & Mobile Networks...ijp2p
14th International Conference on Wireless & Mobile Networks (WiMoNe 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Wireless & Mobile computing Environment. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Wireless, Mobile Networks & its applications had received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PUBLISH YOUR PAPER - INTERNATIONAL JOURNAL OF PEER-TO-PEER NETWORKS (IJP2P)ijp2p
Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of P2P networks.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
3rd International Conference on Blockchain and Internet of Things (BIoT 2022)ijp2p
3rd International Conference on Blockchain and Internet of Things (BIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and
applications of Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Blockchain and Internet of Things in theoretical and
practical aspects. Authors are solicited to contribute to the conference by submitting articles that illustrate research
results, projects, surveying works and industrial experiences that describe significant advances in the areas of Blockchain and Internet of Things.
International Journal of peer-to-peer networks (IJP2P)ijp2p
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.
CALL FOR PAPERS - 4th International Conference on Internet of Things (CIoT 2022)ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of Internet of Things.
Meet up Milano 14 _ Axpo Italia_ Migration from Mule3 (On-prem) to.pdfFlorence Consulting
Quattordicesimo Meetup di Milano, tenutosi a Milano il 23 Maggio 2024 dalle ore 17:00 alle ore 18:30 in presenza e da remoto.
Abbiamo parlato di come Axpo Italia S.p.A. ha ridotto il technical debt migrando le proprie APIs da Mule 3.9 a Mule 4.4 passando anche da on-premises a CloudHub 1.0.
Ready to Unlock the Power of Blockchain!Toptal Tech
Imagine a world where data flows freely, yet remains secure. A world where trust is built into the fabric of every transaction. This is the promise of blockchain, a revolutionary technology poised to reshape our digital landscape.
Toptal Tech is at the forefront of this innovation, connecting you with the brightest minds in blockchain development. Together, we can unlock the potential of this transformative technology, building a future of transparency, security, and endless possibilities.
Discover the benefits of outsourcing SEO to Indiadavidjhones387
"Discover the benefits of outsourcing SEO to India! From cost-effective services and expert professionals to round-the-clock work advantages, learn how your business can achieve digital success with Indian SEO solutions.
Understanding User Behavior with Google Analytics.pdfSEO Article Boost
Unlocking the full potential of Google Analytics is crucial for understanding and optimizing your website’s performance. This guide dives deep into the essential aspects of Google Analytics, from analyzing traffic sources to understanding user demographics and tracking user engagement.
Traffic Sources Analysis:
Discover where your website traffic originates. By examining the Acquisition section, you can identify whether visitors come from organic search, paid campaigns, direct visits, social media, or referral links. This knowledge helps in refining marketing strategies and optimizing resource allocation.
User Demographics Insights:
Gain a comprehensive view of your audience by exploring demographic data in the Audience section. Understand age, gender, and interests to tailor your marketing strategies effectively. Leverage this information to create personalized content and improve user engagement and conversion rates.
Tracking User Engagement:
Learn how to measure user interaction with your site through key metrics like bounce rate, average session duration, and pages per session. Enhance user experience by analyzing engagement metrics and implementing strategies to keep visitors engaged.
Conversion Rate Optimization:
Understand the importance of conversion rates and how to track them using Google Analytics. Set up Goals, analyze conversion funnels, segment your audience, and employ A/B testing to optimize your website for higher conversions. Utilize ecommerce tracking and multi-channel funnels for a detailed view of your sales performance and marketing channel contributions.
Custom Reports and Dashboards:
Create custom reports and dashboards to visualize and interpret data relevant to your business goals. Use advanced filters, segments, and visualization options to gain deeper insights. Incorporate custom dimensions and metrics for tailored data analysis. Integrate external data sources to enrich your analytics and make well-informed decisions.
This guide is designed to help you harness the power of Google Analytics for making data-driven decisions that enhance website performance and achieve your digital marketing objectives. Whether you are looking to improve SEO, refine your social media strategy, or boost conversion rates, understanding and utilizing Google Analytics is essential for your success.
Instagram has become one of the most popular social media platforms, allowing people to share photos, videos, and stories with their followers. Sometimes, though, you might want to view someone's story without them knowing.
Gen Z and the marketplaces - let's translate their needsLaura Szabó
The product workshop focused on exploring the requirements of Generation Z in relation to marketplace dynamics. We delved into their specific needs, examined the specifics in their shopping preferences, and analyzed their preferred methods for accessing information and making purchases within a marketplace. Through the study of real-life cases , we tried to gain valuable insights into enhancing the marketplace experience for Generation Z.
The workshop was held on the DMA Conference in Vienna June 2024.
A Cooperative Peer Clustering Scheme for Unstructured Peer-to-Peer Systems
1. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
DOI : 10.5121/ijp2p.2013.4201 1
A Cooperative Peer Clustering Scheme for
Unstructured Peer-to-Peer Systems
Satoshi Fujita1
1
Department of Information Engineering, Hiroshima University, Japan
fujita@se.hiroshima-u.ac.jp
ABSTRACT
This paper proposes a peer clustering scheme for unstructured Peer-to-Peer (P2P) systems. The proposed
scheme consists of an identification of critical links, local reconfiguration of incident links, and a
retaliation rule. The simulation result indicates that the proposed scheme improves the performance of
previous schemes and that a peer taking a cooperative action will receive a higher profit than selfish peers.
KEYWORDS
Unstructured P2P, Peer Clustering, Local Reconfiguration, Retaliation Rule
1. INTRODUCTION
Peer clustering is a key operation for fully distributed systems such as wireless ad hoc networks
and unstructured Peer-to-Peer (P2P) systems [4,7,8,9,10,11]. The objective of peer clustering is to
reconfigure the structure of an overlay network in such a way that the specific peers becomes
closer without increasing the total number of links in the network.
The performance of peer clustering schemes in unstructured P2Ps is generally measured by the hit
rate of a search task and/or the cost required for specific tasks such as message routing, streaming,
and others. Although there are several peer clustering schemes proposed in the literature [1,5,6],
the performance of those schemes is severely affected by the “criticalness” of links in the overlay.
For example, in unstructured P2Ps, a file search is realized by flooding a query message through
an overlay by setting an appropriate TTL (Time-to-Live) to each query. Hence, the removal of a
critical link would cause an unreachability of queries to their destination, which significantly
degrades the hit rate of the overall search process. On the other hand, many of existing clustering
schemes could not tolerate a situation in which a peer which fully utilizes its incident links
refuses an additional request for a connection even if it has a neighbor to have enough capacity.
Such observations motivate us to develop a peer clustering scheme in which participating peers
wish to cooperate with each other, in such a way that the profit of all peers are kept sufficiently
high, important links will be given a high priority, and a peer with high capacity could support the
connection of other low-capacity peers.
In this paper, we propose a peer clustering scheme to attain such goals. More concretely, after
reviewing related work in Section 2, we will propose a cooperative peer clustering scheme for
unstructured P2Ps. The basic idea of the scheme is to use the notion of retaliation similar to Tit-
for-Tat strategy which has been widely used in many P2P systems including BitTorrent. The
performance of the proposed scheme is evaluated by simulation. The result of simulations
2. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
2
indicates that the proposed scheme certainly improves the performance of previous schemes with
respect to the hit rate and a peer taking a cooperative action will receive a higher profit than
selfish peers.
Figure 1.Reconfiguration of overlay network.
2. RELATED WORK
Cholvi et al. [1]proposed a clustering scheme in which two peers are connected by a link when
they mutually recognize their counterpart as an acquaintance, where peer “a” recognizes peer “b”
as an acquaintance if “b” provides “a” a file requested by “a.”Raftpoulou and Petrakis proposed a
scheme based on the similarity of interest [5], where interest of users is defined as the type of files,
and is represented by a characteristic vector in an appropriate vector space. Sripanidkulchai et al.
proposed a scheme based on the notion of shortcuts which are temporally established between
peers while conducting a file search [6]. The reader should note that in all of the above three
schemes, each peer conducts a (re)establishment of links in a selfish manner and does not
consider the benefit of other peers while conducting such a (re)establishment.
Tit-for-tat (TFT) is a common strategy used in two-players games, which is informally described
as follows: Unless provoked, the player will always cooperate, and if provoked, the player will
retaliate. It is widely recognized that under such an equivalent retaliation strategy, a selfish player
could not obtain enough profit compared with a cooperative player who tries to keep the profit of
the other players while trying to increase its own profit. TFT strategy has already been used in
many P2P applications. For example, in BitTorrent [2], each shared file is divided into small
fragments called pieces, and is downloaded from the network by repeating an exchange of pieces
among nearby peers, where TFT is used in such a way that a peer who uploaded a piece to other
peers is granted a right to download necessary pieces from other peers. As another example, in
Garbacki’s protocol [3], a peer is granted to use the communication bandwidth of other peers if it
contributes to those peers by providing its communication bandwidth.
3. PROPOSED METHOD
3.1. Critical Links
In this paper, for simplicity, we assume that each peer belongs to exactly one community sharing
the same interest1
. As for the definition of interest and community, we adopt a simple model in
1
We also assume that such a community is constructed merely implicitly and it is not possible to register all such
communities to a centralized computer such as tracker and index server used in many existing P2P systems.
3. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
3
order to concentrate on the effect of the retaliation in peer clustering (see Section 4.1 for the detail
of simulation model). In addition, we assume that each peer wants to collect as many peers
belonging to the same community within a predetermined “visible” region as possible, and regard
the number of such visible peers as the profit received through a peer clustering. More concretely,
peers in each community are initially distributed over an overlay network in an arbitrary manner,
and during a clustering, they try to reconfigure the network in such a way that the number of
visible peers is maximized, without increasing the total number of links and without reducing the
number of visible peers for the other peers. See Figure 1 for illustration. The left figure shows the
initial overlay in which two blue peers are not visible with each other with TTL one and the right
figure shows the overlay after conducting a reconfiguration so that two blue peers are visible with
each other.
Let t be an integer representing the limit for such a visible region, i.e., t corresponds to the TTL of
queries issued by each peer. Let A be a community. As a formal definition of the criticalness of
links, the notion of t-criticalness is now defined as follows:
Definition1LetubeapeerincommunityAandebealinkinG. eis said to be t-critical for u if there is a
peer v in community A such that: 1) the distance between u and v in G = (V,E) is at most t, and 2)
the distance between u and v in G’= (V,E −{e}) is at least t+1.
In what follows, a t-critical link for some peer is simply referred to as t-critical, and we often omit
parameter t if it is clear from the context.
3.2. Recognition of Critical Links
In the proposed scheme, query and query response play an important role to recognize critical
links. Before issuing a query, the originator of the query attaches its interest to the query. It then
broadcasts the query to all peers within a fixed TTL, where each copy of the query records: 1) the
length of a shortest path from the originator (i.e., hop count) and 2) ID of peers existing on the
forwarding path. Suppose that peer u receives a query from an adjacent peer. If it satisfies one of
the following two conditions, u returns a query response to the originator, and otherwise, it
simply forwards a copy of the received query to its neighbors as long as it did not exhaust the
TTL:
• If it holds a file matching the given query, or
• If it has a similar interest to the originator of the query.
Query response is returned to the originator through the forwarding path in a reverse direction. By
analyzing query responses received from adjacent peers, the originator can identify a peer which
has a similar interest to the originator and is located at distance t from him.
After identifying such critical links in the network, each peer notifies it to all peers in its range of
TTL by attaching it to the queries issued in the succeeding steps. By this notification, each peer
can recognize the criticalness of links incident to the peer.
3.3. Recognition Rule
In the proposed clustering scheme, the notion of mate plays an important role. Two peers “a” and
“b” sharing the same interest are said to be mate if “a” is incident on a critical link for “b,” and “b”
is incident on a critical link for “a.” The proposed reconfiguration rule is designed in such a way
that each peer tries to keep critical links for its mates. More concretely, each peer can remove its
incident links according to the following rule:
4. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
4
1. A link which is not critical for any mate can always be removed.
2. If all incident links are critical for some mate, then with probability 1/k for some integer k (≥
1), it can remove one of such links.
In the evaluation shown in the next section, we will fix parameter k to 20 according to the result
of preliminary experiments.
3.4. Retaliation
In order to realize an effective retaliation to a treachery, in the proposed scheme, we use a tracker
to keep the history of reconfigurations conducted by the participant peers2
. Concrete procedure is
described as follows.
Step 1: Suppose that peer “a” removes an incident link connecting to peer“b.” After completing
such a removal, peer “a” notifies the fact of removal to the tracker with the following
information: 1) address of “a,” 2) address of “b,” and 3) interests of “b.” In the following, we call
it an update information. Received update information is stored at the tracker for a predetermined
time period.
Step 2: Each peer “c” periodically requests the tracker to send back a list of update information.
After receiving it, “c” identifies a set of peers which removed a critical link for “c” (the set may
be empty if all peers are cooperative). Let “d” be a peer contained in the identified set. If the
number of critical links for “c” which are removed by peer “d” exceeds a predetermined threshold,
“c” reports the fact to the tracker. If the number of reports concerned with peer “d” exceeds
another threshold, the tracker appends “d” to the black list.
Step 3: Each peer periodically requests the tracker to send back the black list. Then, for each
peer “d” contained in the list, the link connecting to “d” is forced to be removed (if any), and any
request received from “d” will be refused.
4. EVALUATION
4.1. Setup
Fix a set of 20 communities, and associate each peer with a random subset of four communities.
We say that two peers are friends if their corresponding subsets have a non-empty intersection (by
definition, a mate is a friend, but the reverse is not true). The number of peers is fixed to 1000.
Each peer has a file associated with each community in the subset, and each query issued by the
peers designates a community concerned with the requested file.
The performance of a clustering scheme is evaluated by using the following two metrics:
(1) The number of friends within t hops from the examined peer (Measure 1), and
(2) The number of friends weighted by an inverse of the distance from the examined peer
(Measure 2),
2
Note that it is reasonable to assume the existence of such a centralized computer, since many P2P systems such as
BitTorrent rely on the tracker to realize a join of new peers to the network.
5. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
5
where by letting N(h) be the number of friends at distance h, the latter metric is formally
described as
( )
In the following, we assume that each peer follows a predetermined clustering scheme in
establishing a link. More concretely, in Section 4.2, we will use a simple clustering scheme which
tries to establish a link to a friend discovered during a flooding of queries, and in Section 4.3, we
examine several clustering schemes proposed in the literature. On the other hand, as for the
removal of links, we will distinguish two cases, i.e., whether it follows the proposed
disconnection rule or not. A peer which follows the rule is called Type 1, and a peer which does
not follow the rule is called Type 2. In the simulation, we assume that x % of peers are of Type 1
and the remaining peers are of Type 2, where parameter x varies from 10 to 100. The retaliation
rule is uniformly applied to both types of peers. Thus, it is expected that although peer of Type 2
could receive a high profit within a short time period, as the elapsed time increases, the profit of
Type 1 peers becomes higher than the profit of Type 2 peers. In the simulation, we fix the
simulation time to 5 min. During this time period, each peer repeats the issue of a query and a
reconfiguration of incident links about 150 times.
(a) Measure 1.
(b) Measure 2.
Figure 2.Performance of the proposed scheme.
6. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
6
(a) Measure 1.
(b) Measure 2.
Figure 3.Comparison with previous schemes.
4.2. Effect of Proposed Disconnection Rule
At first, we evaluate the effect of the proposed cooperative disconnection rule. Figure 2
summarizes the result for k = 20 and t = 3, where the horizontal axis is the percentage x of Type 1
peers. As shown in the figure, in both metrics, the profit of Type 1 decreases as x decreases, while
that of Type 2 increases as x decreases. Two curves cross around x = 40% in Measure 1 and 10%
in Measure 2, where in general, Measure 2 evaluates the schemes more accurately than Measure 1,
since it reflects the distribution of friends beyond TTL.
Thus, although a detailed game theoretic analysis is left as a future work, if there are more Type 1
peers than the crossing point, a reasonable peer should take a cooperative action to increase its
own profit since it provides the peer a higher profit. In addition, peers at the crossing point should
7. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
7
take a cooperative action since it increases the chance of obtaining a higher profit, where the
badness of Type 2 peers is apparently due to the retaliation process and selfish behavior
conducted by other Type 2 peers.
4.3. Effect of Cooperative Disconnection in Other Schemes
Next, we evaluate the impact of the proposed disconnection rule in existing clustering schemes
described in Section 2. Figure 3 summarizes the result for k = 20 and t = 3, where the horizontal
axis is the percentage of Type 1 peers and the vertical axis is the profit averaged over all peers
including Type 1 and Type 2.
In Cholvi’s scheme, two peers are connected by a link if they mutually recognize their
counterpart as an acquaintance. In other words, the criteria for establishing a connection is much
higher than the random scheme examined in the last subsection although the possibility of
removing a link by an incident peer is rather small. As a result, although it beats the randomized
scheme with respect to Measure 1 for small x’s, the profit does not glow as rapidly as the
randomized scheme for larger x’s. In addition, as for Measure 2, the profit of the randomized
scheme is almost twice of the Cholvi’s scheme.
The heuristic adopted in the Raftpolou’s scheme conflicts with the cooperative behavior of Type
1 peers. In Raftpoulou’s scheme, each peer acquires the information of remote peers through
long-range links, i.e., it uses those links in keeping the scope of the participant peers, while it
reconfigures the overlay based on the similarity of their interest. Thus the effect of
reconfigurations becomes small if many peers act cooperatively. In fact, as shown in the figure,
the randomized scheme outperforms the Raftpolou’s scheme for large x’s; e.g., the amount of
improvement is 12% for Measure 1 and 21% for Measure 2.
The superiority of the randomized scheme can also be observed in a comparison with the
Sripanidkulchai’s scheme; e.g., the amount of improvement is 69% for Measure 1 and 74% for
Measure 2. The key idea of the Sripanidkulchai’s scheme is to use shortcuts in realizing effective
reconfigurations, where shortcut is a tentative link established during a file exploration and will
be removed after completing the exploration. Thus, even if it would be t-critical for some peer, a
shortcut is easily removed in many cases, and such a selfish behavior increases the frequency of
invocations of the retaliations, which degrades the performance of the overall scheme.
5. CONCLUDING REMARKS
This paper proposed a cooperative peer clustering scheme for unstructured P2Ps based on the
notion of retaliation. The performance of the proposed scheme is evaluated by simulation, and the
result of simulations indicates that it certainly improves the performance of conventional schemes
particularly when the percentage of cooperative peers is large. A future work is to provide a
theoretical analysis of the proposed scheme, including the analysis of the convergence speed.
ACKNOWLEDGEMENTS
The author would like to thank Mr. Aoki for his contribution to conduct simulations.
8. International Journal of Peer to Peer Networks (IJP2P) Vol.4, No 2, May 2013
8
REFERENCES
[1] V. Cholvi, P. Felberand E. Biersack, (2004) “Efficient Search in Unstructured Peer-to-Peer
Networks,”Proc. 16th Annual ACM Symp.on Parallelism in Algorithms and Architectures, pp.271-
272.
[2] B. Cohen, (2003) “Incentives Build Robustness in BitTorrent,”bittorrent.org.
[3] P.Garbacki,D.H.J.EpemaandM.V.Steen, (2007) “AnAmortizedTit-For-Tat Protocol for Exchanging
Bandwidth instead of Content in P2P Networks,” Proc. 1st International Conference on Self-
Adaptive and Self-OrganizingSystems, pp.119-128.
[4] Available at http://en.wikipedia.org/wiki/Gnutella.
[5] P. Raftopoulou and E. G. M. Petrakis, (2008) “iCluster: A Self-organizing OverlayNetwork for P2P
Information Retrieval,”Advances in Information Retrieval:Springer, pp.65-76.
[6] K.Sripanidkulchai,B.MaggsandH.Zhang, (2003) “Efficientcontentlocationusing interest-based locality
in peer-to-peer systems,”Proc. INFOCOM, pp.2166-2176.
[7] M. Xu, G.-Z. Liu, (2011) “Building self-adaptive Peer-to-Peer overlay networks with dynamic cluster
structure,” Proc. 13th International Conference on Communication Technology (ICCT), IEEE,
pp.520-525.
[8] D. B.Khedher, (2012) “A Peer-to-Peer Self-Organizing Scheme for Multiparty
Session,”Proc. International Conference on Communication (ICC 2012), IEEE, pp. 6535-6539.
[9] H.-C.Jang, L.-J.Tzeng, (2012) “Affinity Propagation with File Similarity based Clustering for P2P
File Sharing in VANET,”Proc. the 15th International Symposium on Wireless Personal Multimedia
Communications (WPMC 2012), pp.70-74.
[10] Z.-J. Deng, W. Song, X.-F.Zheng, (2010) “P2PKMM: A Hybrid Clustering Algorithm over P2P
Network,”Proc. the3rd International Symposium on Intelligent Information Technology and Security
Informatics (IITSI 2010), pp. 450-454.
[11] S. Aslam, I. Kazmi, M. Y. Javed, M.S. Anwar, (2010) “Cluster based peers configuration with
multiple physical parameters using HCNP in Peer-to-Peer overlay networks,” Proc.2010 International
Conference on Computer Applications and Industrial Electronics (ICCAIE), pp.142-147.
AUTHOR
Dr. Satoshi Fujita received the B.E. degree in electrical engineering, M.E. degree in systems engineering, and
Dr.E. degree in information engineering from Hiroshima University in 1985, 1987, and 1990, respectively.
Currently, he is a Professor at the Institute of Engineering, Hiroshima University. His research interests include
communication algorithms in interconnection networks, parallel algorithms, graph algorithms, and parallel and
distributed computer systems. He is a member of the IEICE, IPSJ, SIAM Japan, IEEE Computer Society, and
SIAM.