Comparative Analysis of Peer to Peer Networks

Int. J. Advanced Networking and Applications
Volume: 09 Issue: 04 Pages: 3477-3491(2018) ISSN: 0975-0290
3477
Comparative Analysis of Peer to Peer Networks
SalehaMasood
Department of Computer Science, Comsats Institute of Information technology WahCantt
[E-mail: salehamasood08@gmail.com]
Muhammad AlyasShahid
[E-mail: mashahid79@gmail.com]
Muhammad Sharif
[E-mail: muhammadsharifmalik@yahoo.com]
MussaratYasmin
[E-mail: mussaratabdullah@gmail.com]
-------------------------------------------------------------------ABSTRACT---------------------------------------------------------------
Today over the Internet, communication and computing environments are considerably and significantly
becoming more and more chaotic and complex than normal classical distributed systems that have some lacking of
any hierarchical control and some centralized organization. There in the emerging of Peer-to-Peer (P2P) networks
overlays has become of much interest because P2P networks provide a good quality substrate to create a large-
scale content distribution, data sharing, and multicast applications at the application-level. P2P networks are
commonly used as “file-swapping” in any network to provide support in sharing of distributed contents. For data
and file sharing, a number of P2P networks have been deployed and developed. Gnutella, Fast track and Napster
are three popular and commonly used P2P networking systems. In this research a broad overview of P2P networks
computing is presented. This research is focusing on content sharing technologies, networks and techniques. In this
research, it is also tried to emphasize on the study and analysis of popular P2P network topologies used in
networking systems. This research is also focuses, identifies and describes the most common architecture models of
P2P networks and compares different properties, characteristics and features of four P2P systems—Fast track,
Gnutella, Open FT and Napster. In P2P organization, every peer grosses mutually the parts of the server as well of
the client. By way of a client, it can demand and copy its required record ﬁles from additional peers, and in place
of a server, it can offer data ﬁles to additional peers. The survey basically analyzes and outlines the basic
structuring of P2P networks together with their analysis, comparison, applications, advantages, and
disadvantages. The survey presents numerous organized and unstructured P2P structures.
Keywords -Peer to Peer Networks, Centralized, Distributed, Structured, Unstructured.
---------------------------------------------------------------------------------------------------------------------------------------------------
Date of Submission: Nov 22, 2017 Date of Acceptance: Dec 08, 2017
---------------------------------------------------------------------------------------------------------------------------------------------------
I. INTRODUCTION
Groups of networks in which all the connected peers
have equal and comparable capabilities and
accountabilitiesP2P networks are. In P2P networks,
individual peers within the network tend to share data,
storage, distributed virtual storage [102] and CD-ROM
drives but on the contradictory side the structure of a client
and server exhibits a tendency in which clients have
accesses to data only through server [1] by using nay
operating system i.e windows, Linux, Unix, Mac or any
tinyOS[106].
P2Pis a communication model in which each party has the
same capabilities and either party can initiate a
communication session.
Other models with which it can be compared include the
client/server model and the master/slave model [2].
There has been a developing deliberation in P2P
organizations since the principal achievement of a typical
application comprised of content sharing including
Gnutella and Napster. The term “peer to peer” signifies to
an assembly of organizations that conquers distributed
possessions to achieve a risky operation in a dispersed
mundane. By means of the established propagation of
computers, P2P is gradually receiving attention in analysis
and progression, product enlargement, and estimation
clusters [3]. P2P organizations can be characterized based
on the setup above data background, situation, and
topology of the network. So taking this potential in mind,
the classification of P2P organizations comprises: loosely
structured, vastly structured and unstructured systems [4].
In an unstructured P2Psystem like Gnutella [5], no law
subsists which describes where data is stored and the
system topology is random. In a loosely organized system
like Freenet [6] and Symphony [7], the overlap
organization and the statistics position are not exactly
firm. In Freenet, mutually the overlap topology and the
statistics position are determined based on suggestions.
The system topology ultimately progresses into certain
projected arrangement. In Symphony, the intersection
topology is resolute probabilistically, however, the facts
locality is demarcated exactly [8].In an exceedingly
organized P2P system like Chord, both the system design
and the statistics location are exactly quantified. The
nationals of a peer are well-defined. The statistics are
stored in a clear position. P2Psystems can similarly be
characterized into centralized and decentralized categories
[9-11]. Within centralized P2P networks like Napster, a

3478
chief almanac of entity position, ID consignment is
preserved in a solo position. Peers discover the positions
of preferred files by enquiring the chief directory server.
P2P was initially used to define the interaction between
two nodes or peers in a network and is equivalent to a
telephone exchange. A phone exchange consists of two
individuals (peers or nodes) of equivalent rank, interaction
among a point to point construction [12].Peer to Peer
network can also be used in ANN Based Task Scheduling
Strategies in Heterogeneous Distributed Computing
Systems [107], Wireless USB Home Security System
using Internet Technology [108], password attacks and
comparative analysis on methods for secure authentication
[109], Priority based congestion control routing in wireless
mesh network [110], Protecting Users against Phishing
Attacks[111], Benchmarking of PVM and LAM/MPI
Using OSCAR, Rocks and Knoppix Clustering Tools
[112], Identification of a Lossy Channel in Wireless Mesh
Network using Conservation of flow [113], A Unified
Model for Computer Threat Protection (UMCTP) [114]
and in Virtualization tools and techniques [115]. P2P can
also be used in tracking a vehicle in any vehicular network
[116].
Later on, the concept of the internet was introduced. The
internet took place as a P2Porganization. The aim of the
novel ARPANET was to part computing possessions
nearby the USA. Its encounter was to attach a group or
pairs of dispersed assets, by means of diverse organization
connection, inside one mutual system construction [13].
After the late 1960s till 1994, the internet consumed single
prototype of connection among peers. Equipment’s or
machines were anticipated to be constantly swapped on,
permanently associated and allocated enduring internet
protocol (IP)discourses [14]. The novel DNS organization
was deliberated on behalf of this background, where a
modification in IP address was expected to be anomalous
and infrequent, and might yield days to broadcast through
the organization. Conversely, with the creation of Mosaic,
additional model originated to transpire in the arrangement
of consumers linking to the internet through dial-up
modems [15]. This formed an additional course of
connectivity for the reason that computers would pass in
and consent the system habitually and impulsively [16].
For a few years, considering computers as customers
functioned healthy [17]. Over the period, however, like
software and hardware enhanced, the vacant assets that
occurred behind this covering of second-course
connectivity took place to appear as somewhat value
receiving at. Provided with the massive collection of
presented computers cited previously, the software
communal society started to yield P2P solicitations
seriously [18]. Utmost prominently, P2P investigation is
related in talking few of the chief problems of existing
dispersed computing i.e. scalability, consistency, and
interoperability [19]. The summary of history of P2P
networks [20] can be analyzed below:
 July 1999: journal of Freenetprocedure.
 September 1999: formation of Napster.
 November 1999: principal discharge of Direct
Connect customer.
 March 14, 2000: principal discharge of Gnutella.
 September 6, 2000: principal discharge of
eDonkey2000.
 March 2001: outline of the Fast Track procedure.
 April 2001: the strategy of the Bit Torrent
procedure.
 July 2001: closure of Napster.
 November 6, 2001: chief relief of GNU net.
 November 2002: start of the Gnutella2scheme.
 After 2002, a number of different P2P networks are
developed.

3479
The roadmap of history of P2P networks is shown in Fig 1:
1
st
Stage 2
nd
Stage 3
rd
Stage
Prehistory C/S modelP2P term and applications widely used
Expands1
st
Generation 2
nd
Generation 3
rd
Generation
1969 1995 1999 2000 2001 2013
Fig 1: Roadmap of P2P networks history [118]
II. RELATED WORK
By analyzing the literature, one can say that huge work has
been done in the field of P2P networks. The enormous
growth of P2Pnetworks is proving the fact that they are
becoming the most important tool in the prospect of file
sharing [21]. Communication among the different nodes
and peers together with providing security and privacy is
another important prospect in this regard [22].
Configuration management of P2P networks is one of the
main concepts that can be applied to a number of different
systems one [23]. Distribution of live streaming among the
nodes or peers is another major field of P2P networks.
Tree management algorithm for this purpose is proposed
and developed in [24].Phoenix is another approach in P2P
networks that generates low-diameter irrepressible P2P
overlay network [25]. The service of lookup in P2P over
random topology can be analyzed in [26] that mainly
describe a search methodology deprived of obvious
control of overly systems. A system named zigzag in the
prospect of media streaming in P2P networks is another
important area in P2P systems [27]. Another application
includes evaluation of ascendable solicitation level
multicast built through the use of P2P networks [28]. File
sharing is the major functionality of P2Pnetworks.
Modeling P2P networks on a number of diverse systems
structure is presented in [29]. Evaluation and modeling of
the flexibility of P2P networks can be analyzed in [30].
The analysis technique for adaptive selection centered
procedures for the estimated replying of ad hoc, mobile ad
hoc and wireless ad hoc [103-105] combination inquiries
in P2P databases is presented in [31]. Analysis of file
sharing mechanism, its modeling and improvement in Bit
Torrent can be analyzed in [32]. Another technique
presents an estimated native system aimed at categorizing
upper liner products between sets of feature vectors in an
enormous asynchronous dispersed atmosphere like a P2P
network [33]. For firm standing accumulation in P2P
networks a new system named Gossip Trust is presented in
[34]. An approach proposes a new experimental weighting
method for picking the best-expected route to create a role
centered trust series. They put on past profound heuristics
to measure the route complication and to measure the
connecting competence [35]. Hybrid search in P2P
networks is presented in [36]. Range query processing is
one of the major applications in the domain of P2P
networks; an approach handling this prospect is presented
in [37]. An improved Hybrid P2P approach that proposes
and controls the concept of boot net in P2P networks and
the results showed that this approach is much harder to
shutdown [38]. The concept of clustering through the use
of k-mean approach in P2P networks is presented in
[39].Liu et al. in[40]offered a principal approach intended
for the topology discrepancy problem among unstructured
P2P systems. The problem of resolving the mismatch
problem can be analyzed [41].P2P streaming through a
distributed protocol is presented in [42]. Management of
multidimensional past data in unstructured P2P networks
procedure through a novel method is presented in [43].
The concept of probabilistic flooding in generalized form
in unstructured P2P networks is presented in [44].
Heterogeneous search in the P2P networks can be
analyzed in [45].The structured P2P networks show a
more efficient response to the fact of fault tolerance [46].
The design and analysis of a protocol named Ulysses can
be analyzed in [47]. The analysis of P2P network
properties through the use of a graph is presented in [48].
Analysis of P2Psystems in the prospect of error recovery
is another important factor in the prospect of P2P networks
[49]. The impact of free riding in P2P networks resulted
that, with the presence of free riding concept, P2P
networks operates more efficiently [50]. Routing or
direction finding with secure parameters in structured P2P
networks is presented in [51].The analysis of the
contribution of each peer in P2P networks is important, an
DNS
Usenet
ARPANE
T
FTP
Web
Napster
Gnutella
Kazaa
WASTE
Metanet
MUTE
MUTE
MUTE
Entropy
MUTE
Freenet
MUTE
MUTE
GNUnet
MUTE

3480
approach in this context is presented in [52]. Performance
analysis in P2P networks in the context of file sharing can
be analyzed in [53]. An approach presents a protocol
named PCoord, a dispersed system coordinate
organization aimed at overlap topology detection and
distance extrapolation [54]. The simulation of P2P
networks is another major field in the context of P2P
networks [55]. A comparison of P2P overlay networks can
be analyzed in [56]. Illegal data sharing including media
files in P2P networks is an important research domain
[57]. Content-based retrieval in hybrid P2P networks is
presented in [58]. A survey on the management of P2P
networks is presented in [59]. Distribution of data sharing
a resource in hybrid P2P networks can be analyzed in [60].
III. ARCHITECTURE OF P2P NETWORKS
The architecture of the P2P networks can be classified into
two broad categories. The networks are distributed on the
basis of its file sharing method and the way they are
connected. The P2P networks are distributed as centralized
and decentralized networks in the case of file sharing
schemes. P2P networks are distributed as structured and
unstructured networks on the basis of the way the nodes
are connected. The distribution of P2P networks
architecture can be analyzed in Fig 2:
Fig 2: Architecture of P2P systems
A. Based on the File Sharing:
If a P2P system is analyzed on the basis of file sharing
prospect then P2P networks can be classified into two
broad categories, which are centralized P2P networks and
decentralized P2P networks. Here is a brief overview of
each of the category.
1. Centralized:
In centralized P2P systems, all the files exist on a central
server. Peers are connected to this central server in order
to provide services [61]. An example of centralized P2P
network is shown in Fig 3.Examples: Napster, ICQ.
Fig 3: Centralized P2P Network [61]
2. Decentralized
Here in decentralized there exist no central server; instead
each peer or node is connected to a number of different
nodes to get the proper services. In other words they are
the pure peers or super peers [62]. In Fig 4, an example of
decentralized P2P network is shown. Examples: Gnutella,
Bit Torrent
Fig 4: Decentralized P2P Network [62]
B. Depending on how the nodes are connected
If P2P system is analyzed based on how the nodes are
connected then P2P networks can be classified into two
broad categories, which are structured P2P networks and
unstructured P2P networks. Here is a brief overview of
each of the category.
i. Structured
It uses to implement algorithms in order to provide
connection surely among the nodes. The structured
systems are complex in structure but provide efficiency
[63]. Examples: DHT and Hyper Cup. The architecture of
the structured P2P network is shown in Fig 5:
P2P
Architecture
Based on File
Sharing
Centralized
Decentralized
Based on Node
Connection
Structured
Unstructured

3481
Fig 5: Structured P2P Network [63]
2. Unstructured
It involves the arbitrary creation of nodes and each node
involved in this case has the ability to copy the
information on the link between other connected nodes
[64]. Examples in this regard involve Fast Track,
Gnutella. The architecture of the unstructured P2P
network is shown in Fig 6:
Fig 6: Architecture of Unstructured P2P Networks [64]
IV. TYPES OF P2P NETWORKS
There exist three categories of P2P networks as shown in
Fig 7:
Fig 7: Types of P2PNetworks
A. Pure P2P Networks
All nodes perform equally, it replies that there is no
devoted server, all nodes act likewise. It means that all the
participating peers or nodes in a pure P2P network are
equal in logic that each node or peer act as both i.e. as a
client andas a server. There exists no central server.
Examples of pure P2P networks are Gnutella and Freenet.
The concept of pure P2P network in the Freenet
architecture can be analyzed in the Fig8:
Fig 8: Freenet Architecture (Pure P2P Network) [117]
B. Hybrid P2P Networks
It performs as a client-server prototype as it has a chief
node or peer that performs as a server that retains statistics
on nodes and replies to entreaties on behalf of that
information. Chief server (node or peer) recognizes what
possessions are communal and what are allowed. They are
also accountable for accommodating of offered assets
[65]. The example of hybrid P2P network is Napster. In
Napster, there is a server that assists nodes to search for a
specific file and start a direct communication among the
clients. The server only contains available files on its
catalog. Another example in this prospect is of Bit Torrent
(BT). In BT, there is a central server named tracker that
coordinates interaction between the nodes accessing BT to
download a file. The hybrid concept in the Napster
architecture can be analyzed in the figure given below:
Types of P2P
Pure P2P Hybrid P2P Mix P2P

3482
Fig 9: Napster Architecture (Hybrid P2P) [65]
C. Mixed P2P
Has both pure and hybrid characteristics.
The main and fundamental difference between hybrid and
pure P2P network is that hybrid P2P networks have a
central entity and there is no server in pure P2P networks.
As compared to the hybrid P2P architecture, the pure P2P
design is simple with higher fault tolerance level. While,in
a hybrid P2P designfewer network resources are used. It is
also more scalable as compared to pure P2P network.
V. Types of P2P networks (Systems in P2P
Networks)
In P2P networks the systems that are mostly used are
unstructured and structured. In unstructured P2P no
specified structure of overlay is imposed while in
structured there is a specified structure of the network.
A. Unstructured Systems:
There are a number of P2P systems developed in this
prospect, some major systems in this context includes:
1. Napster
Napster was mainly developed by Sean Parker, John
Fanning, and Shawn Fanning. Initially, Napster was
proposed as aself-governingP2P file allocation facility
[66]. The provision functioned among June 1999 and July
2001.Its skills permitted individuals to effortlessly part
their MP3 stores with further members. Though the
innovative provision was closed down by law court
command, the Napster product endured after the
company's possessions were settled and acquired by other
corporations through insolvency measures [67].
i. Napster Clients
There are two main clients of Napster, which are shown in
Fig 10:
Fig 10: Napster Clients
2. Gnutella
Gnutella at the time of development was the largest
decentralized P2P network. The structure of Gnutella uses
ad-hoc topology where each peer is connected to each
other node or peer in the network. Its structure holds the
property that peers without affecting the performance of
the other peers can disconnect from the network, so it also
holds the property of dynamic network [68].
The population of Gnutella increased to about 1.81 million
in June 2005 which approached around 3 million in 2006.
And in 2007, it was considered among the utmost
widespread system of context sharing comprising 40% of
the market [69].
i. Gnutella Clients
The clients of Gnutella are shown in Fig 11:
Napster
Napigator
Napster
Clients

3483
Fig 11: Gnutella Clients
ii. Gnutella: Analysis and Improvement
 Tractability
 Enactment & Immovability
 Consistency
3. Fast Track
The structure of Fast Track is centered on Hybrid
architecture [70]. This P2P network is controlled using
two tiers which are first tier and second tier. The first tier
basically connects nodes or peer to the super peers
whereas in the second tier the super peers are connected to
each other. It provides the capability to download a file
from multiple users [71].
i. FastTrack Clients
The clients of Fast Track involve:
Fig 12: FastTrack Clients
4. eDonkey
It is centered on decentralized architecture [72]. It also
comprises of two tiers [73]. The first tier contains a central
server in order to maintain a list of files whereas the
second tier handles the file transfer property of the
network. EServer and MetaMachine are the two server
software’s supported by eDonkey [74].
i.eDonkey Protocol Features
 It uses the mechanism of Metadata in order to search
data or contents including the size of the file, the
available number of sources, bit rate, artist etc. [75].
 Provides the facility to download the same file from
numerous peers simultaneously.
 It is capable of partial data or files sharing together
with that handle and detects the corrupted data
contents within a file.
ii.eDonkey Clients
The clients of eDonley involve:
Fig 13: eDonkey Clients
5 Bit Torrent
The structure of BT is centered on decentralized
architecture [76]. The files in this structure are divided
into blocks or pieces where pieces size vary from 64 KB to
4MB and provides the way to further segment out these
sections into 16KB blocks[77].
The three major components of BT involve:
 Trackers –the responsibility of this component is
to track seeders, leechers and different pieces of
files from diverse users.
 Seeders – This component comprises files in
order to share with the other nodes or peers.
 Leechers – This unit has the responsibility for
downloading files from other nodes or peers.
i. Features of Bit Torrent
 Consumers take. Torrent files which comprise meta-
data evidence.
 Torrent collections can ensure one or numerous
followers.
 Files are taken in fragments or chunks.
 Outfits file allocation equality.
6. Skype
Skype was developed by a team of software developers
including Janus Friis and NiklasZennström [78]. This
structure of P2P network provides the facility of instant
messaging, chat, conferences, file sharing and transfer and
connects directly to the user [79].
7. Freenet
Freenet is a P2P podium intended for robust
communication. Its structure is decentralized and in order
to hold and store data files it works with a group of free
software. Jan Clarke designed the structure of Freenet
together with its basic tools and designed Freenet with the
objective of offering liberty of communication with robust
privacy safeguard [80].
8. Direct Connect
Direct Connect was basically written by Neo-Modus. It is
file allocation application. The major application used in
Direct Connect is today. It is a centralized structure where
in order to download a file users are connected to a central
hub and have the ability to download from one another.
Hubs offer a variety of clients that are connected to them
Gnutella
Clients
Cabos
Limewire Bearshare
Shareaza
FastTrack
Clients
Grokster
iMesh
Morpheus
Kazaa
eDonkey Clients
eDonkey
2000
MLDonkey
eMule
aMule

3484
[81]. Users here can chat and download files from the
other users connected to the central hub.
B. StructuredP2P networks
In structured P2P networks the overlay is organized into a
specific topology, and the protocol ensures that any node
can work efficiently. Some major systems are given
below.
1. Chord
Chord is a procedure and system designed
forP2P dispersed hash table. A distributed hash table
supplies fundamental consequence sets by conveying keys
to diverse PCs (nodes); a node will collect the principles
on behalf of all the keys for which it is accountable. Chord
postulates in what way keys are allotted to nodes, and by
what means a node may discern the worth aimed at a
specified key through first discovering the node
accountable on behalf of that key [82].
2. CAN (Content Addressable Network)
CAN is a dispersed and scattered P2P organization that
delivers the feature of the hash table on an Internet. CAN
was among the supreme innovative for dispersed hash
table suggestions, familiarized simultaneously by way
of Tapestry, CAD, and Pastry.
Similar further dispersed hash tables, CAN are intended to
be ascendable, error accepting, and self-establishing. The
structural scheme is a simulated Cartesian coordinate
cosmos with various dimensions and is a category of drape
system on a multi-torus [83].
3. Tapestry
Tapestry is a P2P overlay network which delivers
a dispersed hash table, direction-finding
and multicasting organization intended for dispersed
applications. The Tapestry P2P structure is proposal
effectual, ascendable, and self-mending, position
conscious and direction-finding to neighboring
possessions [84].
4.Kademlia
Kademlia is a dispersed hash counter on behalf of a
dispersed P2P computer systems intended by David
Mazières and PetarMaymounkov in 2002. It states the
assembly of the system and the interchange of statistics
through the peer lookups. Kademliapeers converse among
them by means of UDP. A simulated or overlap system is
molded through the contributing peers. Every peer is
recognized by a symbol or peer ID. The ID of the
peer assists not merely as identification; however the
Kademlia process utilizes the peer ID to trace standard. In
fact, the peer ID offers a straight plot to file hashes and
that peer accounts statistics on where to acquire the file or
resource [86].
5. Pastry
The pastry is a drape and direction-finding system aimed
at the enactment of a dispersed hash table (DHT)
like Chord. The key-value sets are deposited in a
terminated P2P network of linked internet masses [87].
The procedure is bootstrapped by means of providing it
through the IP discourse of a node previously in the
system and from then on via the direction-finding counter
which is animatedly constructed and renovated. For the
reason that of its dismissed and dispersed environment,
there is no solitary fact of disaster and any solo node can
dispense the system at any period deprived of cautioning
and with slight or no chance of statistics loss. The
procedure is similarly talented of consuming a direction-
finding metric provided by an external suite, such
as chick or smidgeon way, to regulate the finest ways to
collect in its routing table [88].
VI. APPLICATIONS OF P2P NETWORKS
There are a number of different P2P networks
applications. Some of the major application involves:
A. File Sharing
The exchange of contents, files and data are the major and
most supreme zones of P2P application areas. The peer
within the network provides the surety of file sharing
focusing on storing and retrieving data to and from other
peers within the network. Kazza and Emule are the
optimal examples in this context [89].
B. Distributed Computing
The major task is carried out by the member of the
network which offers the resources. The application works
by providing the idle cycles to the peer or node in the
network which requires extra time for the purpose of
computation. One of the best examples of such application
is SETI@home [90].
C. Communication and Collaboration
Another major application of P2P networks is the
collaboration and communication that aims at providing a
system for users to communicate with each other. The
application provides chat instant messaging, shared apps
and online games [91]. These applications can be used in
various domains including home atmosphere, industry,
and education. The major examples in this domain include
Jabber and Groove.
D. Network
This application provides a mechanism for networking
such as Dales which is a P2Pweb cache for LANs, Voice
Peering Fabric and Open Garden [92].
E. Science
The application of P2P networks in the category of
bioscience include biometrics and identification of drug
candidate lastly, there is a science net P2P search engine
as well [93].
F. Search
P2P also provides with some P2P architecture based
search engines which include yahoo, google, ask etc. [94].

3485
VII.PROS AND CONS OF P2P NETWORKS
There are many pros and cons of P2P network which are
given below.
A. ADVANTAGES OFP2P
 Easy to connect and organize.
 No devoted server needed.
 Consumers handle their specific assets.
 Economical to acquire and control.
 No professional software mandatory.
 No devoted supervisor to track the vital network.
 Nearly free.
 Profligate downloading.
 Malleable organization.
B. DISADVANTAGES OF P2P NETWORKS
 Not so secure.
 Viruses, spam, spyware, downloaded collections
might be septic, comprise an unsafe material, disrupt
confidentiality.
 Occasionally unlawful as copyrighted
collectionsinsideP2Pnetworks.
 Problematic to occupy a safety.
 More over numerous passwords for common
possessions.
 Backups are challenging to handle.
 No centralism.
VIII.CHALLENGES IN P2P
There are a number of challenges and problems that are
faced by P2P networks. The major challenges that
P2Psystems are facing are shown in Fig 10[94]:
Fig 14: Challenges in P2P Networks
A. Distribution of Copyrighted Files
P2Pnetworks are often sued by different organizations and
companies, eg(RIAA, MPAA, and ARIA). There are
chances that users can be targeted. Copyright laws are
limited to few countries only.
B. SECURITY ISSUES
There are a number of security issues that are faced by
P2P systems including malware, the spread of null files
and virus, spyware, steganography use and lastly peers can
be dispersed status principles[95].
C. BANDWIDTH CONSUMPTION
High bandwidth is essential [96].
IX.ANALYSIS AND DISCUSSION
Here in this section, the major principles of structured and
unstructured P2P networks will be analyzed and
compared.
Structured organizations provide an ascendable key for
rigorous match demands, i.e. inquiries in which the whole
identifier of the demanded statistics entity is recognized.
There are means to utilize rigorous match inquiries like a
substrate aimed at keyword interrogations [28].
Conversely, it is not clear how these methods can be
scaled in a dispersed background. The drawback of
structured organizations is that it is difficult to preserve the
arrangement essential for direction-finding in a brief peer
or node residents, in which peer or nodes are connecting
and separating to a great degree.
Unstructured P2P organizations can upkeep limited
keyword exploration. These organizations rely on sightless
exploration procedures, like random walk and flooding.
Therefore, the produced capacity of inquiry circulation
does not balance up with the development in network
dimension. Numerous exploration accomplishments are
intended towards enlightening the direction-finding
enactment of unstructured P2P organizations through
embracing suggestion centered direction-finding
approaches. Nodes or peers acquire from the consequences
of preceding direction-finding assessments, and prejudice
upcoming query direction-finding centered on this
information.
If unstructured P2P systems are looked into deeply, a
number of significant advantages offered by them can be
analyzed, which includes that it enforces minor requests
on the discrete peers or nodes. Most important feature is
that they permit its peer or nodes to leave the system or
network without having any effect on the performance of
the system. They also provide a better mechanism for
content-based retrieval. The varying power of peers and
nodes is also accommodated by unstructured P2P
networks.
Subsequently, they also scale to enormous proportions and
they propose supplementary strong enactment in the
existence of peer let downs and linking unpredictability.
Permitting to [97], if scalability apprehensions were
detached commencing P2P networks with unstructured
nature, they have the chance of getting preference in case
of file-sharing on any cloud computing [98], and other
environments. Other solicitations including keyword
searching, content replication at a reasonable division of
contributing spots and last but not the least the node
populace is extremely brief [99]. Table 1 presents a
comparison of certain convolutions of unstructured and
structured P2P networks. The table given below compares
the structured and unstructured P2P networks based on the
factor of fault tolerance, type, and the degree of
centralization, the cost of lookup, space complexity,
scalability and space complexity [100-101]. The
comparison of structured and unstructured P2P networks
and centralized and decentralized networks is shown in
Table 1 and Table 2 respectively.
Challenges in P2P
Depletion of
bandwidth
Safety and
security
concerns
The problem of
copyrighted
data and file
dissemination

3486
Table 1: Comparison of structured and unstructured P2P networks
Architecture Type Degree of
centralization
Cost lookup Space Complexity
Kademlia Structured Decentralized O(log(n)) O(log(n))
Pastry Structured Decentralized
Tapestry Structured Decntralized
CAN Structured Decentralized 2d
Chord Structured Decentralized O(log(n)) O(log(n))
Napster Unstructured Centralized O(1) O(n)
Gnutella Unstructured Decentralized O(n) O(n)
Freenet Unstructured Centralized Hops to Leave Hops to Leave
Direct
Connect
Unstructured Centralized O(n) O(n)
Skype Unstructured Centralized O(n) O(n)
BitTorrent Unstructured Centralized O(n) O(n)
eDonkey Unstructured Centralized O(n) O(n)
Table 2: Comparison of structured and unstructured P2P networks
Architecture Fault Tolerance Scalability Query Efficiency
Kademlia Random Fair Good
Pastry Random Fair Good
Tapestry Random Fair Good
CAN Random Fair Good
Chord Random Fair Good
Napster Good Fair Poor
Gnutella Good Good Poor
Freenet Good Good Poor
Direct Connect Random Good Average
Skype Random Good Average
BitTorrent Random Good Average
eDonkey Random Good Average
X. CONCLUSION
The survey basically presents an overview and comparison
of structured and unstructured P2P networks. The
comparison shows that each system under the domain of
P2P architecture has its own strengths and weaknesses.
The optimal P2P network can be chosen based on the
application and its essential task and performance metrics.
P2P can be designated centered on content distribution,
position facility, scalability, network routing enactment,
file sharing, and so on.
REFERENCES:
[1] Stoica, I., et al. Chord, "A scalable peer-to-peer
lookup service for internet applications". in
ACM SIGCOMM Computer Communication
Review. 2001: ACM.
[2] Sen, S., & Wang, J. "Analyzing peer-to-peer
traffic across large networks." IEEE/ACM
Transactions on Networking (ToN), 12(2), 219-
232.(2004).
[3] Yunhao, L., Xiao, L., & Ni, L. M. " Building a
scalable bipartite P2P overlay network. Parallel
and Distributed Systems", IEEE Transactions
on, 18(9), 1296-1306.(2007)
[4] Jones, M. B., Theimer, M., Wang, H., &
Wolman, A. " Unexpected complexity:
Experiences tuning and extending CAN."
Submitted for publication. (2002).
[5] Stoica, I., Morris, R., Karger, D., Kaashoek, M.
F., &Balakrishnan, H. " Chord: A scalable peer-
to-peer lookup service for internet applications".
Paper presented at the ACM SIGCOMM
Computer Communication Review. (2001).
[6] Saroiu, S., Gummadi, P. K., & Gribble, S. D. "A
measurement study of peer-to-peer file sharing
systems". In Electronic Imaging 2002 (pp. 156-
170). International Society for Optics and
Photonics. (2001, December).
[7] Kang, B. B., Chan-Tin, E., Lee, C. P., Tyra, J.,
Kang, H. J., Nunnery, C., ...& Kim, Y. "
Towards complete node enumeration in a peer-
to-peer botnet". In Proceedings of the 4th
International Symposium on Information,
Computer, and Communications Security (pp.
23-34). ACM. (2009, March).
[8] Kang, J., Zhang, J. Y., Li, Q., & Li, Z.
"Detecting new P2P botnet with multi-chart
CUSUM. In Networks Security, Wireless
Communications and Trusted Computing",
2009. NSWCTC'09. International Conference
on (Vol. 1, pp. 688-691). IEEE. (2009, April).
[9] Rossow, C., Dietrich, C. J., Bos, H., Cavallaro,
L., van Steen, M., Freiling, F. C., &Pohlmann,
N. "Sandnet: Network traffic analysis of
malicious software". In Proceedings of the First
Workshop on Building Analysis Datasets and
Gathering Experience Returns for Security (pp.
78-88). ACM. (2011, April).

3487
[10] Nazario, J., &Holz, T. "As the net churns: Fast-
flux botnet observations. In Malicious and
Unwanted Software", 2008. MALWARE 2008.
3rd International Conference on (pp. 24-31).
IEEE. (2008, October).
[11] Wang, Y., &Vassileva, J. "Trust-based
community formation in peer-to-peer file
sharing networks". In Proceedings of the 2004
IEEE/WIC/ACM International Conference on
Web Intelligence (pp. 341-348). IEEE Computer
Society. (2004, September).
[12] Rahbar, A. G. P., & Yang, O. "Powertrust: A
robust and scalable reputation system for trusted
peer-to-peer computing. Parallel and Distributed
Systems", IEEE Transactions on, 18(4), 460-
473. (2007).
[13] Zhou, R., & Hwang, K. "Gossip-based
reputation aggregation for unstructured peer-to-
peer networks". In Parallel and Distributed
Processing Symposium, 2007. IPDPS 2007.
IEEE International (pp. 1-10). IEEE. (2007,
March).
[14] Lou, X., & Hwang, K. "Proactive Content
Poisoning To Prevent Collusive Piracy in P2P
File Sharing" IEEE Transactions on Computers
TC 2008. (2008).
[15] J. Hu and R. Klefstad, “Decentralized Load
Balancing onUnstructured Peer-to-Peer
Computing Grids,”Proc. Fifth IEEEInt’lSymp.
Network Computing and Applications (NCA
’06), July 2006.
[16] Zhou, R., Hwang, K., &Cai, M. "Gossiptrust for
fast reputation aggregation in peer-to-peer
networks". Knowledge and Data Engineering,
IEEE Transactions on, 20(9), 1282-1295.
(2008).
[17] Antoniadis, P., & Le Grand, B."Incentives for
resource sharing in self-organized communities:
From economics to social psychology".
In Digital Information Management, 2007.
ICDIM'07. 2nd International Conference
on(Vol. 2, pp. 756-761). IEEE. (2007, October).
[18] Mislove, A., Marcon, M., Gummadi, K. P.,
Druschel, P., &Bhattacharjee, B. "Measurement
and analysis of online social networks".
InProceedings of the 7th ACM SIGCOMM
conference on Internet measurement(pp. 29-42).
ACM. (2007, October).
[19] Yang, S. J., Zhang, J., Lin, L., & Tsai, J. J. "
Improving peer-to-peer search performance
through intelligent social search". Expert
Systems with Applications, 36(7), 10312-10324.
(2009).
[20] Kourtellis, N., Finnis, J., Anderson, P.,
Blackburn, J., Borcea, C., &Iamnitchi, A.
"Prometheus: User-controlled P2P social data
management for socially-aware applications".
In Middleware 2010 (pp. 212-231). Springer
Berlin Heidelberg. (2010).
[21] Howe, A. J. "Napster and Gnutella: a
comparison of two popular Peer-to-Peer
protocols". Universidade de Victoria, 11.
(2000).
[22] Saboori, E., &Mohammadi, S. "Anonymous
Communication in Peer-to-Peer Networks for
providing more Privacy and Security". arXiv
preprint arXiv:1208.3192. (2012).
[23] Burgess, M., &Canright, G. "Scalability of peer
configuration management in partially reliable
and ad hoc networks". In Integrated Network
Management, 2003. IFIP/IEEE Eighth
International Symposium on (pp. 293-305). IEEE.
(2003, March).
[24] Padmanabhan, V. N., Wang, H. J., & Chou, P. A.
"Resilient peer-to-peer streaming". In Network
Protocols, 2003. Proceedings. 11th IEEE
International Conference on (pp. 16-27). IEEE.
(2003, November).
[25] Wouhaybi, R. H., & Campbell, A. T. "Phenix:
Supporting resilient low-diameter peer-to-peer
topologies". In INFOCOM 2004. Twenty-third
AnnualJoint Conference of the IEEE Computer
and Communications Societies(Vol. 1). IEEE.
(2004, March).
[26] Ganesan, P., Sun, Q., & Garcia-Molina, H.
"Yappers: A peer-to-peer lookup service over
arbitrary topology". In INFOCOM 2003. Twenty-
Second Annual Joint Conference of the IEEE
Computer and Communications. IEEE
Societies (Vol. 2, pp. 1250-1260). IEEE. (2003,
March).
[27] Tran, D. A., Hua, K. A., & Do, T. "Zigzag: An
efficient peer-to-peer scheme for media
streaming". In INFOCOM 2003. Twenty-Second
Annual Joint Conference of the IEEE Computer
and Communications. IEEE Societies (Vol. 2, pp.
1283-1292). IEEE. (2003, March).
[28] Castro, M., Jones, M. B., Kermarrec, A. M.,
Rowstron, A., Theimer, M., Wang, H., &
Wolman, A. (2003, April). An evaluation of
scalable application-level multicast built using
peer-to-peer overlays. In INFOCOM 2003.
Twenty-Second Annual Joint Conference of the
IEEE Computer and Communications. IEEE
Societies(Vol. 2, pp. 1510-1520). IEEE.
[29] Ge, Z., Figueiredo, D. R., Jaiswal, S., Kurose, J.,
&Towsley, D. (2003, March). Modeling peer-
peer file sharing systems. In INFOCOM 2003.
Twenty-Second Annual Joint Conference of the
IEEE Computer and Communications. IEEE
Societies (Vol. 3, pp. 2188-2198). IEEE.
[30] Van Ruitenbeek, E.; Sanders, W.H., "Modeling
Peer-to-Peer Botnets," Quantitative Evaluation
of Systems, 2008. QEST '08. Fifth International
Conference on , vol., no., pp.307,316, 14-17
Sept. 2008 doi: 10.1109/QEST.2008.43
[31] Arai, B., Das, G., Gunopulos, D., &Kalogeraki,
V. (2007). Efficient approximate query
processing in peer-to-peer networks. Knowledge
and Data Engineering, IEEE Transactions

3488
on, 19(7), 919-933.
[32] Li, M., Yu, J., & Wu, J. (2008). Free-riding on
bittorrent-like peer-to-peer file sharing systems:
Modeling analysis and improvement. Parallel
and Distributed Systems, IEEE Transactions
on, 19(7), 954-966.
[33] Das, K.; Bhaduri, K.; Kun Liu; Kargupta, H.,
"Distributed Identification of Top-l Inner
Product Elements and its Application in a Peer-
to-Peer Network," Knowledge and Data
Engineering, IEEE Transactions on , vol.20,
no.4, pp.475,488, April 2008
[34] Zhou, R., Hwang, K., &Cai, M. "Gossiptrust for
fast reputation aggregation in peer-to-peer
(2008).
[35] Chen, K., Hwang, K., & Chen, G. "Heuristic
discovery of role-based trust chains in peer-to-
peer networks". Parallel and Distributed
Systems, IEEE Transactions on, 20(1), 83-96.
(2009).
[36] Chen, H., Jin, H., Liu, Y., & Ni, L. M.
"Difficulty-aware hybrid search in peer-to-peer
networks". Parallel and Distributed Systems,
IEEE Transactions on,20(1), 71-82. (2009).
[37] Li, D., Cao, J., Lu, X., & Chen, K. " Efficient
range query processing in peer-to-peer
systems". Knowledge and Data Engineering,
IEEE Transactions on,21(1), 78-91. (2009).
[38] Ping Wang; Sparks, S.; Zou, C.C., "An
Advanced Hybrid Peer-to-Peer
Botnet," Dependable and Secure Computing,
IEEE Transactions on , vol.7, no.2, pp.113,127,
April-June 2010
[39] Datta, S., Giannella, C. R., &Kargupta, H.
"Approximate distributed k-means clustering
over a peer-to-peer network". Knowledge and
Data Engineering, IEEE Transactions
on, 21(10), 1372-1388. (2009).
[40] Datta, S., Giannella, C., &Kargupta, H. "K-
Means Clustering Over a Large, Dynamic
Network". In SDM. (2006, April).
[41] Hsiao, H. C., Liao, H., & Huang, C. C.
"Resolving the topology mismatch problem in
unstructured peer-to-peer networks". Parallel
and Distributed Systems, IEEE Transactions
on, 20(11), 1668-1681. (2009).
[42] Jin, X., Chan, S. H., Wong, W. C., &Begen, A.
C. "A distributed protocol to serve dynamic
groups for peer-to-peer streaming". Parallel and
Distributed Systems, IEEE Transactions
on, 21(2), 216-228. (2010).
[43] Furfaro, F., Mazzeo, G. M., &Pugliese, A.
"Managing multidimensional historical
aggregate data in unstructured P2P
(2010).
[44] Gaeta, R., &Sereno, M. "Generalized
probabilistic flooding in unstructured peer-to-
peer networks". Parallel and Distributed
Systems, IEEE Transactions on, 22(12), 2055-
2062. (2011).
[45] Bao, X., Fang, B., Hu, M., &Xu, B.
"Heterogeneous search in unstructured peer-to-
peer networks". Distributed Systems Online,
IEEE, 6(2). (2005).
[46] Zhao, B. Y., Huang, L., Stribling, J., Joseph, A.
D., &Kubiatowicz, J. D. "Exploiting routing
redundancy via structured peer-to-peer overlays".
In Network Protocols, 2003. Proceedings. 11th
IEEE International Conference on (pp. 246-257).
IEEE. (2003, November).
[47] Kumar, A., Merugu, S., Xu, J. J., Zegura, E. W.,
& Yu, X."Ulysses: a robust, low‐diameter,
low‐latency peer‐to‐peer network". European
transactions on telecommunications, 15(6), 571-
587. (2004).
[48] Kourtellis, N., &Iamnitchi, A. "Leveraging Peer
Centrality in the Design of Socially-Informed
Peer-to-Peer Systems". (2013).
[49] Weigle, E., Hiltunen, M., Schlichting, R.,
Vaishampayan, V. A., &Chien, A. A." Peer-to-
peer error recovery for hybrid satellite-terrestrial
networks". In Peer-to-Peer Computing, 2006. P2P
2006. Sixth IEEE International Conference
on (pp. 153-160). IEEE. (2006, September).
[50] Krishnan, R., Smith, M. D., Tang, Z., &Telang, R.
"The impact of free-riding on peer-to-peer
networks" In System Sciences, 2004. Proceedings
of the 37th Annual Hawaii International
Conference on (pp. 10-pp). IEEE. (2004,
January).
[51] Castro, M., Druschel, P., Ganesh, A., Rowstron,
A., & Wallach, D. S. "Secure routing for
structured peer-to-peer overlay networks". ACM
SIGOPS Operating Systems Review, 36(SI),
299-314. (2002).
[52] Gupta, M., Judge, P., &Ammar, M. "A
reputation system for peer-to-peer networks".
In Proceedings of the 13th international
workshop on Network and operating systems
support for digital audio and video (pp. 144-
152). ACM. (2003, June).
[53] Biersack, E. W., Rodriguez, P., &Felber, P.
"Performance analysis of peer-to-peer networks
for file distribution". In Quality of Service in the
Emerging Networking Panorama (pp. 1-10).
Springer Berlin Heidelberg. (2004).
[54] Lehman, L. W., &Lerman, S. "Pcoord: Network
position estimation using peer-to-peer
measurements". In Network Computing and
Applications, 2004.(NCA 2004). Proceedings.
Third IEEE International Symposium on (pp.
15-24). IEEE. (2004, August).
[55] Basu, A., Fleming, S., Stanier, J., Naicken, S.,
Wakeman, I., &Gurbani, V. K. "The state of
peer-to-peer network simulators". ACM

3489
Computing Surveys (CSUR), 45(4), 46. (2013).
[56] Lua, E. K., Crowcroft, J., Pias, M., Sharma, R.,
& Lim, S. "A survey and comparison of peer-to-
peer overlay network schemes". IEEE
Communications Surveys and Tutorials, 7(1-4),
72-93. (2005).
[57] Becker, J. U., & Clement, M. "Dynamics of
illegal participation in peer-to-peer networks—
why do people illegally share media
files?." Journal of Media Economics, 19(1), 7-
32. (2006).
[58] Lu, J., &Callan, J. "Content-based retrieval in
hybrid peer-to-peer networks." In Proceedings
of the twelfth international conference on
Information and knowledge management (pp.
199-206). ACM. (2003, November).
[59] Amad, M., Meddahi, A., &Aïssani, D. "Peer to
peer networks management survey". arXiv
preprint arXiv:1203.3351. (2012).
[60] Yang, M., & Yang, Y. "An efficient hybrid peer-
to-peer system for distributed data
sharing". Computers, IEEE Transactions
on, 59(9), 1158-1171. (2010).
[61] Maly, R. J., Mischke, J., Kurtansky, P., &
Stiller, B. "Comparison of Centralized (Client-
Server) and Decentralized (Peer-to-Peer)
Networking.Semester thesis", ETH Zurich,
Zurich, Switzerland, 1-12. (2003).
[62] Yao, Z. "Understanding Churn in Decentralized
Peer-to-Peer Networks", (Doctoral dissertation,
Texas A&M University). (2009).
[63] El-Ansary, S., &Haridi, S. "An overview of
structured P2P overlay networks." (2005).
[64] Fletcher, G. H., Sheth, H. A., &Börner, K.
"Unstructured peer-to-peer networks:
Topological properties and search performance".
In Agents and Peer-to-Peer Computing (pp. 14-
27). Springer Berlin Heidelberg. (2005).
[65] Ioannidis, S., &Marbach, P. "On the design of
hybrid peer-to-peer systems". ACM
SIGMETRICS Performance Evaluation
Review, 36(1), 157-168. (2008).
[66] Ripeanu, M. "Peer-to-peer architecture case
study: Gnutella network". In Peer-to-Peer
Computing, 2001. Proceedings. First
International Conference on (pp. 99-100). IEEE.
(2001, August).
[67] Bellovin, S. "Security aspects of Napster and
Gnutella". In 2001 Usenix Annual Technical
Conference. (2001, June).
[68] Clarke, I., Sandberg, O., Wiley, B., & Hong, T.
W." Freenet: A distributed anonymous
information storage and retrieval system".
In Designing Privacy Enhancing
Technologies (pp. 46-66). Springer Berlin
Heidelberg. (2001, January).
[69] Ripeanu, M., Foster, I., &Iamnitchi, A.
"Mapping the gnutella network: Properties of
large-scale peer-to-peer systems and
implications for system design". arXiv preprint
cs/0209028. (2002).
[70] Graffi, K., Gross, C., Stingl, D., Hartung, D.,
Kovacevic, A., & Steinmetz, R. " LifeSocial.
KOM: A secure and P2P-based solution for online
social networks". In Consumer Communications
and Networking Conference (CCNC), 2011
IEEE (pp. 554-558). IEEE. (2011, January).
[71] Cutillo, L. A., Molva, R., &Strufe, T. "Safebook:
A privacy-preserving online social network
leveraging on real-life trust". Communications
Magazine, IEEE, 47(12), 94-101. (2009).
[72] Suk, William. "ANTHROPOLOGY OF ICT:
CELLULAR INTERNET, SOCIAL MEDIA,
MOBILE MONEY, DECENTRALIZED
ARCHITECTURE, BIG DATA." In 2015 Annual
Meeting. Aaa, 2015.
[73] Maniatis, P., Roussopoulos, M., Giuli, T. J.,
Rosenthal, D. S., & Baker, M. "The LOCKSS
peer-to-peer digital preservation system". ACM
Transactions on Computer Systems
(TOCS), 23(1), 2-50. (2005).
[74] Pouwelse, J. A., Garbacki, P., Wang, J., Bakker,
A., Yang, J., Iosup, A., ...& Sips, H. J.
"TRIBLER: a social‐based peer‐to‐peer
system". Concurrency and Computation: Practice
and Experience, 20(2), 127-138. (2008).
[75] Toninelli, A., Pathak, A., &Issarny, V. "Yarta: A
middleware for managing mobile social
ecosystems". In Advances in Grid and Pervasive
Computing (pp. 209-220). Springer Berlin
Heidelberg. (2011).
[76] Shakimov, A., Varshavsky, A., Cox, L. P.,
&Cáceres, R. "Privacy, cost, and availability
tradeoffs in decentralized OSNs". In Proceedings
of the 2nd ACM workshop on Online social
networks (pp. 13-18). ACM. (2009, August).
[77] Kourtellis, N., Finnis, J., Anderson, P.,
Blackburn, J., Borcea, C., &Iamnitchi, A.
"Prometheus: User-controlled P2P social data
management for socially-aware applications".
In Middleware 2010 (pp. 212-231). Springer
Berlin Heidelberg. (2010).
[78] Kourtellis, N., &Iamnitchi, A. " Inferring peer
centrality in socially-informed peer-to-peer
systems". In Peer-to-Peer Computing (P2P),
2011 IEEE International Conference on (pp.
318-327). IEEE. (2011, August).
[79] Blackburn, J., Simha, R., Kourtellis, N., Zuo, X.,
Ripeanu, M., Skvoretz, J., &Iamnitchi, A. "
Branded with a scarlet C: cheaters in a gaming
social network". In Proceedings of the 21st
international conference on World Wide
Web (pp. 81-90). ACM.(2012, April).
[80] Scellato, S., Noulas, A., Lambiotte, R.,
&Mascolo, C."Socio-Spatial Properties of
Online Location-Based Social
Networks". ICWSM, 11, 329-336. (2011).
[81] Kourtellis, N., Alahakoon, T., Simha, R.,
Iamnitchi, A., &Tripathi, R. " Identifying high
betweenness centrality nodes in large social

3490
networks". Social Network Analysis and
Mining, 1-16. (2012).
[82] Zhao, B. Y., Huang, L., Stribling, J., Rhea, S.
C., Joseph, A. D., &Kubiatowicz, J. D.
"Tapestry: A resilient global-scale overlay for
service deployment".Selected Areas in
Communications, IEEE Journal on, 22(1), 41-
53. (2004).
[83] Stoica, I., Morris, R., Karger, D., Kaashoek, M.
F., &Balakrishnan, H. "Chord: A scalable peer-
to-peer lookup service for internet applications".
In ACM SIGCOMM Computer Communication
Review (Vol. 31, No. 4, pp. 149-160). ACM.
(2001, August).
[84] Foster, I., &Iamnitchi, A. " On death, taxes, and
the convergence of peer-to-peer and grid
computing". In Peer-to-Peer Systems II (pp.
118-128). Springer Berlin Heidelberg. (2003).
[85] Talia, D., &Trunfio, P. "Toward a synergy
between p2p and grids.Internet Computing",
IEEE, 7(4), 96-95. (2003).
[86] Zhao, S., Stutzbach, D., &Rejaie, R.
"Characterizing files in the modern gnutella
network: A measurement study". In Electronic
Imaging 2006 (pp. 60710M-60710M).
International Society for Optics and Photonics.
(2006, January).
[87] Backx, P., Wauters, T., Dhoedt, B.,
&Demeester, P. "A comparison of peer-to-peer
architectures". In Eurescom Summit (Vol.
2002). (2002, October).
[88] Saroiu, S., Gummadi, K. P., & Gribble, S. D.
"Measuring and analyzing the characteristics of
Napster and Gnutella hosts". Multimedia
systems, 9(2), 170-184. (2003).
[89] Gummadi, K. P., Dunn, R. J., Saroiu, S.,
Gribble, S. D., Levy, H. M., &Zahorjan, J.
"Measurement, modeling, and analysis of a
peer-to-peer file-sharing workload". In ACM
SIGOPS Operating Systems Review (Vol. 37,
No. 5, pp. 314-329). ACM. (2003, October).
[90] Sen, S., & Wang, J."Analyzing peer-to-peer
traffic across large networks". IEEE/ACM
Transactions on Networking (ToN), 12(2), 219-
232. (2004).
[91] Stutzbach, D., Rejaie, R., &Sen, S.
"Characterizing unstructured overlay topologies
in modern P2P file-sharing
systems". Networking, IEEE/ACM Transactions
on, 16(2), 267-280. (2008).
[92] Baset, S. A., &Schulzrinne, H. "An analysis of
the skype peer-to-peer internet telephony
protocol". arXiv preprint cs/0412017. (2004).
[93] Tewari, S., &Kleinrock, L. "Analysis of search
and replication in unstructured peer-to-peer
networks". In ACM SIGMETRICS Performance
Evaluation Review (Vol. 33, No. 1, pp. 404-
405). ACM. (2005, June).
[94] Ganesan, P., Bawa, M., & Garcia-Molina, H. "
Online balancing of range-partitioned data with
applications to peer-to-peer systems".
In Proceedings of the Thirtieth international
conference on Very large data bases-Volume
30(pp. 444-455). VLDB Endowment. (2004,
August).
[95] Zhang, C., Krishnamurthy, A., & Wang, R. Y.
"Skipindex: Towards a scalable peer-to-peer
index service for high dimensional
data". Department of Computer Science,
Princeton University, New Jersey, USA, Tech.
Rep, 703-04. (2004).
[96] Chi, H., Zhang, Q., Jia, J., &Shen, X. “Efficient
search and scheduling in P2P-based media-on-
demand streaming service." Selected Areas in
Communications, IEEE Journal on, 25(1), 119-
130. (2007).
[97] Do, T. T., Hua, K. A., &Tantaoui, M. A. "
P2VoD: Providing fault tolerant video-on-demand
streaming in peer-to-peer environment".
InCommunications, 2004 IEEE International
Conference on (Vol. 3, pp. 1467-1472). IEEE.
(2004, June).
[98] Shahid, Muhammad Alyas, and Muhammad
Sharif. "Cloud Computing Security Models,
Architectures, Issues and Challenges." SmartCR
5, no. 6 (2015): 602-616.
[99] Yiu, W. P., Wong, K. F., Chan, S. H., Wong, W.
C., Zhang, Q., Zhu, W. W., & Zhang, Y. Q. "
Lateral error recovery for media streaming in
application-level multicast". Multimedia, IEEE
Transactions on, 8(2), 219-232. (2006).
[100] Guo, Y., Suh, K., Kurose, J., &Towsley, D.
"P2Cast: peer-to-peer patching scheme for VoD
service". In Proceedings of the 12th international
conference on World Wide Web (pp. 301-309).
ACM. (2003, May).
[101] Jin, X., Cheng, K. L., & Gary Chan, S. H. "SIM:
Scalable island multicast for peer-to-peer media
streaming". In Multimedia and Expo, 2006 IEEE
International Conference on (pp. 913-916). IEEE,
(2006, July).
[102] Sharif, Muhammad, NasirMehmod Butt,
MudassarRaza, and Muhammad Arshad.
"Distributed Virtual Disk Storage System."
Control Theory and Informatics 2 (2012): 17-23.
[103] Sharif, Muhammad, Aisha Azeem, and
MudassarRazaWaqasHaider. "A Novel
Wormhole Detection Technique for Wireless Ad
Hoc Networks." International Journal of
Advanced Networking and Applications 3, no. 5
(2012): 1298.
[104] Imran, Noreen, SamiaRiaz, AsmaShaheen,
Muhammad Sharif, and MudassarRaza.
"COMPARATIVE ANALYSIS OF LINK
STATE AND DISTANCE VECTOR
ROUTING PROTOCOLS FOR MOBILE
ADHOC NETWORKS." Science International
26, no. 2 (2014).
[105] Hussain, Khalid, AkhtabHussain, Muhammad
Sharif, and JunaidAhsenaliChaudhry.

3491
"Throughput Incorporated Cluster Head Election
Technique for Mobile Ad Hoc Networks."
Journal of Computational and Theoretical
Nanoscience 13, no. 1 (2016): 736-742.
[106] Amjad, Muhammad, Muhammad Sharif,
Muhammad Khalil Afzal, and Sung Won Kim.
"TinyOS-new trends, comparative views, and
supported sensing applications: A review." IEEE
Sensors Journal 16, no. 9 (2016): 2865-2889.
[107] Hussain, Altaf, Faisal Azam, Muhammad Sharif,
MussaratYasmin, and SajjadMohsin. "A Survey
on ANN Based Task Scheduling Strategies in
Heterogeneous Distributed Computing
Systems." Nepal Journal of Science and
Technology 16, no. 1 (2016): 69-78.
[108] Shah, Jamal Hussain, Muhammad Sharif, and
MudassarRaza. "Wireless USB Home Security
System using Internet Technology." Research
Journal of Applied Sciences, Engineering and
Technology 7, no. 7 (2014): 1377-1380.
[109] Raza, Mudassar, Muhammad Iqbal, Muhammad
Sharif, and WaqasHaider. "A survey of
password attacks and comparative analysis on
methods for secure authentication." World
Applied Sciences Journal 19, no. 4 (2012): 439-
444.
[110] Sharif, Muhammad, MaryumMurtaza,
WaqasHaider, and MudassarRaza. "Priority
based congestion control routing in wireless
mesh network." International Journal of
Advanced Networking and Applications 3, no. 3
(2011): 1147.
[111] Ikram, Fahad, Muhammad Sharif, and
MudassarRaza. "Protecting Users against
Phishing Attacks." In 7th CIIT Workshop on
Research in Computing. 2008.
[112] Sharif, Muhammad, and AmanUllah Khan.
"Benchmarking of PVM and LAM/MPI Using
OSCAR, Rocks and Knoppix Clustering
Tools." World Academy of Science,
Engineering and Technology International
Journal of Computer, Information Science and
Engineering Vol 1 (2007).
[113] Ahsen, Faraz, Khalid Hussain, NylaKhadam,
Muhammad Sharif, and Noor Zaman.
"Identification of a Lossy Channel in Wireless
Mesh Network using Conservation of
flow."Journal of Information & Communication
Technology Vol 1 (2007): 60-70.
[114] Murtaza, Muhammad, Muhammad Sharif,
MudassarRaza, and AmanUllah Khan. "A
Unified Model for Computer Threat Protection
(UMCTP)."
[115] Masood, Anum, Muhammad Sharif,
MussaratYasmin, and MudassarRaza.
"Virtualization tools and techniques:
Survey." Nepal Journal of Science and
Technology 15, no. 2 (2015): 141-150.
[116] Shahid, Muhammad Alyas, and Aisha Azeem.
"Disseminating Traffic Information in Vehicular
Networks." International Journal of Advanced
Networking and Applications 7, no. 3 (2015):
2752.
[117] Taylor, Ian J., and Andrew Harrison. From P2P
and grids to services on the web: evolving
distributed communities. Springer Science &
Business Media, 2008.
[118] Ou, Zhonghong. "Structured peer-to-peer
networks: Hierarchical architecture and
performance evaluation." Dissertation (2010).
Authors Profiles
SalehaMasood, Lecturer, Department of Computer Science,
CIIT, Wah Campus, received her Master of Computer Sciences
and MS (CS) degree from COMSATS Institute of Information
Technology, WahCantt, is now serving as Lecturer, Department
of Computer Science, CIIT, Wah Campus. Her areas of interest
are Image Processing, Computer vision and Medical Imaging.
MuhammadAlyaShahid received his Master in
Computer Science degree in 2002. He received
his MS (CS) from COMSATS Institute of
Information Technology, WahCantt with
specialization in Image Processing. He is into teaching field
from 1998 till date. Currently he is serving as a Lecturer of
Computer Sciences in POF Institute of Technology, WahCantt.
His research interests are Image Processing, Multimedia
Processing, and Computer Networks & Security.
Muhammad Sharif, PhD, Associate Professor
COMSATS Institute of Information
Technology, WahCantt received his MSc in
Computer Science from Quaid-e-Azam
University, Islamabad. He received his MS(CS) and PhD(CS)
from COMSATS Islamabad with specialization in Image
Processing. He is into teaching field from 1995 till date. His
research interests are Image Processing, Computer Networks &
Security, Parallel and Distributed Computing (Cluster
Computing) and Algorithms Design and Analysis.
MussaratYasmin, Ph.D.is Assistant Professor
at COMSATS, WahCantt Pakistan. Her area of
specialization is Image Processing. She is in
the education field since 1993. She has so far
30 research publications in IF, SCI and ISI
journals as well as in national and international conferences. A
number of undergraduate projects are completed under her
supervision. She is currently supervising 5 Ph.D. (CS) students.
She is a gold medallist in MS (CS) from IQRA University,
Pakistan. She is continuously being awarded COMSATS
research productivity award since 2012. Her research interests
include Neural Network, Algorithms design and Analysis,
Machine Learning and Image processing.

Comparative Analysis of Peer to Peer Networks

More Related Content

Similar to Comparative Analysis of Peer to Peer Networks (20)

More from Eswar Publications (20)

Recently uploaded (20)

Comparative Analysis of Peer to Peer Networks