This document analyzes the performance issues faced by mobile hosts participating in peer-to-peer (P2P) data networks like BitTorrent. It finds that the design of P2P networks is incompatible with the characteristics of wireless networks, causing poor performance for mobile users. It then presents a solution called wireless P2P (wP2P) that addresses these issues through techniques only applied on mobile hosts, improving performance for both mobile and fixed peers. An evaluation shows wP2P provides significant gains over existing P2P applications on mobile networks.
Mobile Hosts Participating in Peer-to-Peer Data Networks: Challenges and Solu...Zhenyun Zhuang
Wireless Networks (2010)
http://dl.acm.org/citation.cfm?id=1873504
Peer-to-peer (P2P) data networks dominate
Internet traffic, accounting for over 60% of the overall
traffic in a recent study. In this work, we study the
problems that arise when mobile hosts participate in
P2P networks. We primarily focus on the performance
issues as experienced by the mobile host, but also study
the impact on other fixed peers. Using BitTorrent as a
key example, we identify several unique problems that
arise due to the design aspects of P2P networks being
incompatible with typical characteristics of wireless
and mobile environments. Using the insights gained
through our study, we present a wireless P2P (wP2P)
client application that is backward compatible with existing
fixed-peer client applications, but when used on
mobile hosts can provide significant performance improvements.
ipoque has analyzed the Internet traffic in five regions of the world between August and September 2007. Comprehensive statistics about user behavior provide a unique overview of the Internet’s current state. While the emphasis of last year’s ipoque sur- vey was on peer-to-peer (P2P) file sharing, this study also includes data about Internet telephony (VoIP), Skype, video streaming, instant messaging (IM), file hosting and encrypted P2P protocols. Three petabytes of anonymous data representing over one million users in Australia, Eastern Europe, Germany, the Middle East and Southern Europe have been analyzed. The results for these different regions vary considerably. P2P produces, on average, between 49 and 83 percent of all Internet traffic with nighttime peaks of over 95 percent. About 20 percent of P2P traffic is already encryp- ted. Skype is by far the most popular Internet telephony service.
IMPROVING BITTORRENT’S PEER SELECTION FOR MULTIMEDIA CONTENT ON-DEMAND DELIVERYIJCNCJournal
The great efficiency achieved by the BitTorrent protocol for the distribution of large amounts of data inspired its adoption to provide multimedia content on-demand delivery over the Internet. As it is not designed for this purpose, some adjustments have been proposed in order to meet the related QoS requirements like low startup delay and smooth playback continuity. Accordingly, this paper introduces a BitTorrent-like proposal named as Quota-Based Peer Selection (QBPS). This proposal is mainly based on the adaptation of the original peer-selection policy of the BitTorrent protocol. Its validation is achieved by means of simulations and competitive analysis. The final results show that QBPS outperforms other recent proposals of the literature. For instance, it achieves a throughput optimization of up to 48.0% in low-provision capacity scenarios where users are very interactive.
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.
Adaptive Sliding Piece Selection Window for BitTorrent SystemsWaqas Tariq
Peer to peer BitTorrent (P2P BT) systems are used for video-on-Demand (VoD) services. Scalability problem could face this system and would cause media servers not to be able to respond to the users’ requests on time. Current sliding window methods face problems like waiting for the window pieces to be totally downloaded before sliding to the next pieces and determining the window size that affects the video streaming performance. In this paper, a modification is developed for BT systems to select video files based on sliding window method. Developed system proposes using two sliding windows, High and Low, running simultaneously. Each window collects video pieces based on the user available bandwidth, video bit rate and a parameter that determines media player buffered seconds. System performance is measured and evaluated against other piece selection sliding window methods. Results show that our method outperforms the benchmarked sliding window methods
This paper provides a comparison of the current Internet architecture based on TCP/IP and the proposed future Internet architecture of Named Data Networking (NDN). It discusses key differences in their approaches, components, packet formats, and security implementations. The TCP/IP model uses IP addresses and has a client-server request model, while NDN is information-centric, names content directly, and uses an interest-initiated model. NDN aims to more efficiently distribute popular content, optimize bandwidth usage, and reduce congestion compared to the TCP/IP architecture.
Final Project Report - Real-Time Media AppsJigisha Aryya
Streaming media and real-time communication over the Internet are very popular now-a-days. Users under different network conditions access these applications for their regular use. It is
important that we observe the nature of these applications in terms of network resource consumption and underlying protocols that determine their behavior.
This paper is a culmination of the series of experiments on two streaming and two real-time multimedia applications, to study the actual protocols that come into play when running these applications on a particular type of hardware and network setup. We compare and contrast the streaming and real-time media applications to see the differences in the protocols and data
exchange patterns. The obtained results and insights can guide in building better network applications that deal with data streams. We do not provide an alternative design for any
multimedia application based on these results.
Mobile Hosts Participating in Peer-to-Peer Data Networks: Challenges and Solu...Zhenyun Zhuang
Wireless Networks (2010)
http://dl.acm.org/citation.cfm?id=1873504
Peer-to-peer (P2P) data networks dominate
Internet traffic, accounting for over 60% of the overall
traffic in a recent study. In this work, we study the
problems that arise when mobile hosts participate in
P2P networks. We primarily focus on the performance
issues as experienced by the mobile host, but also study
the impact on other fixed peers. Using BitTorrent as a
key example, we identify several unique problems that
arise due to the design aspects of P2P networks being
incompatible with typical characteristics of wireless
and mobile environments. Using the insights gained
through our study, we present a wireless P2P (wP2P)
client application that is backward compatible with existing
fixed-peer client applications, but when used on
mobile hosts can provide significant performance improvements.
ipoque has analyzed the Internet traffic in five regions of the world between August and September 2007. Comprehensive statistics about user behavior provide a unique overview of the Internet’s current state. While the emphasis of last year’s ipoque sur- vey was on peer-to-peer (P2P) file sharing, this study also includes data about Internet telephony (VoIP), Skype, video streaming, instant messaging (IM), file hosting and encrypted P2P protocols. Three petabytes of anonymous data representing over one million users in Australia, Eastern Europe, Germany, the Middle East and Southern Europe have been analyzed. The results for these different regions vary considerably. P2P produces, on average, between 49 and 83 percent of all Internet traffic with nighttime peaks of over 95 percent. About 20 percent of P2P traffic is already encryp- ted. Skype is by far the most popular Internet telephony service.
IMPROVING BITTORRENT’S PEER SELECTION FOR MULTIMEDIA CONTENT ON-DEMAND DELIVERYIJCNCJournal
The great efficiency achieved by the BitTorrent protocol for the distribution of large amounts of data inspired its adoption to provide multimedia content on-demand delivery over the Internet. As it is not designed for this purpose, some adjustments have been proposed in order to meet the related QoS requirements like low startup delay and smooth playback continuity. Accordingly, this paper introduces a BitTorrent-like proposal named as Quota-Based Peer Selection (QBPS). This proposal is mainly based on the adaptation of the original peer-selection policy of the BitTorrent protocol. Its validation is achieved by means of simulations and competitive analysis. The final results show that QBPS outperforms other recent proposals of the literature. For instance, it achieves a throughput optimization of up to 48.0% in low-provision capacity scenarios where users are very interactive.
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.
Adaptive Sliding Piece Selection Window for BitTorrent SystemsWaqas Tariq
Peer to peer BitTorrent (P2P BT) systems are used for video-on-Demand (VoD) services. Scalability problem could face this system and would cause media servers not to be able to respond to the users’ requests on time. Current sliding window methods face problems like waiting for the window pieces to be totally downloaded before sliding to the next pieces and determining the window size that affects the video streaming performance. In this paper, a modification is developed for BT systems to select video files based on sliding window method. Developed system proposes using two sliding windows, High and Low, running simultaneously. Each window collects video pieces based on the user available bandwidth, video bit rate and a parameter that determines media player buffered seconds. System performance is measured and evaluated against other piece selection sliding window methods. Results show that our method outperforms the benchmarked sliding window methods
This paper provides a comparison of the current Internet architecture based on TCP/IP and the proposed future Internet architecture of Named Data Networking (NDN). It discusses key differences in their approaches, components, packet formats, and security implementations. The TCP/IP model uses IP addresses and has a client-server request model, while NDN is information-centric, names content directly, and uses an interest-initiated model. NDN aims to more efficiently distribute popular content, optimize bandwidth usage, and reduce congestion compared to the TCP/IP architecture.
Final Project Report - Real-Time Media AppsJigisha Aryya
Streaming media and real-time communication over the Internet are very popular now-a-days. Users under different network conditions access these applications for their regular use. It is
important that we observe the nature of these applications in terms of network resource consumption and underlying protocols that determine their behavior.
This paper is a culmination of the series of experiments on two streaming and two real-time multimedia applications, to study the actual protocols that come into play when running these applications on a particular type of hardware and network setup. We compare and contrast the streaming and real-time media applications to see the differences in the protocols and data
exchange patterns. The obtained results and insights can guide in building better network applications that deal with data streams. We do not provide an alternative design for any
multimedia application based on these results.
Node selection in p2 p content sharing service in mobile cellular networks wi...Uvaraj Shan
This document discusses node selection algorithms for peer-to-peer content sharing over mobile cellular networks that consider downlink bandwidth limitations. It proposes two novel algorithms (DBaT-B and DBaT-N) that select peer nodes to maximize load balancing across cells while meeting the requesting peer's bandwidth needs. DBaT-B selects peers to satisfy the requesting peer's minimum bandwidth requirement, while DBaT-N selects a certain number of peers as requested. Both algorithms first choose peers in the least busy cell to improve load balancing.
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.
This document discusses a study of BitTorrent characteristics through packet analysis. It provides background on BitTorrent, including how it works, key terminology, and the basic structure of torrent files. The study captured packet traces of BitTorrent files from different scenarios to analyze characteristics like peer connections and bandwidth usage over time.
Effective Approach For Content Based Image Retrieval In Peer-Peer To NetworksIRJET Journal
The document describes a proposed approach for content-based image retrieval in peer-to-peer networks. Existing methods represent images as high-dimensional feature vectors and index them using distributed high-dimensional indexes or locality sensitive hashing over distributed hash tables. However, these approaches have high network costs and workload imbalances. The proposed approach uses the bag-of-visual-words model to represent images, building inverted indexes of visual codewords over the distributed hash table. It also develops a dynamic codebook updating method to optimize the mutual information between the codebook and relevance information, balancing the workload among nodes as the peer-to-peer network and data evolve dynamically.
Analytical Modelling of Localized P2P Streaming Systems under NAT ConsiderationIJCNCJournal
This document summarizes an analytical model for localized peer-to-peer (P2P) streaming systems that considers the impact of network address translation (NAT). It introduces theoretical boundaries for the number of peers that may be expelled from the system due to NAT incompatibility. It also presents a mathematical model for startup delay in P2P streaming that accounts for peers' NAT types. The document proposes a new neighbor selection algorithm that considers both autonomous system numbers and NAT types to improve connectivity while reducing transit traffic and startup delays.
This document describes a peer-to-peer messaging system built using the JXTA platform. The system allows instant messages to be sent between peers in a decentralized JXTA network. JXTA defines protocols for peer-to-peer communication, where all peers have equal status and can request or provide services. The system includes a JXTA relay that receives commands from J2ME clients, performs actions on their behalf, and represents the clients on the JXTA network by discovering peers and routing messages. The goal of the project is to enable instant messaging between peers in a peer-to-peer manner without a centralized server.
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.
P2P DOMAIN CLASSIFICATION USING DECISION TREE ijp2p
The increasing interest in Peer-to-Peer systems (such as Gnutella) has inspired many research activities
in this area. Although many demonstrations have been performed that show that the performance of a
Peer-to-Peer system is highly dependent on the underlying network characteristics, much of the
evaluation of Peer-to-Peer proposals has used simplified models that fail to include a detailed model of
the underlying network. This can be largely attributed to the complexity in experimenting with a scalable
Peer-to-Peer system simulator built on top of a scalable network simulator. A major problem of
unstructured P2P systems is their heavy network traffic. In Peer-to-Peer context, a challenging problem
is how to find the appropriate peer to deal with a given query without overly consuming bandwidth?
Different methods proposed routing strategies of queries taking into account the P2P network at hand.
This paper considers an unstructured P2P system based on an organization of peers around Super-Peers
that are connected to Super-Super-Peer according to their semantic domains; in addition to integrating
Decision Trees in P2P architectures to produce Query-Suitable Super-Peers, representing a community
of peers where one among them is able to answer the given query. By analyzing the queries log file, a
predictive model that avoids flooding queries in the P2P network is constructed after predicting the
appropriate Super-Peer, and hence the peer to answer the query. A challenging problem in a schemabased Peer-to-Peer (P2P) system is how to locate peers that are relevant to a given query. In this paper,
architecture, based on (Super-)Peers is proposed, focusing on query routing. The approach to be
implemented, groups together (Super-)Peers that have similar interests for an efficient query routing
method. In such groups, called Super-Super-Peers (SSP), Super-Peers submit queries that are often
processed by members of this group. A SSP is a specific Super-Peer which contains knowledge about: 1.
its Super-Peers and 2. The other SSP. Knowledge is extracted by using data mining techniques (e.g.
Decision Tree algorithms) starting from queries of peers that transit on the network. The advantage of
this distributed knowledge is that, it avoids making semantic mapping between heterogeneous data
sources owned by (Super-)Peers, each time the system decides to route query to other (Super-) Peers.
The set of SSP improves the robustness in queries routing mechanism, and the scalability in P2P
Network. Compared with a baseline approach,the proposal architecture shows the effect of the data
mining with better performance in respect to response time and precision.
This document summarizes a study on the performance of LTE networks. The researchers conducted passive and active measurements on a commercial LTE network with over 300,000 users to analyze network characteristics and resource utilization. They found that while LTE provides higher bandwidth than 3G, TCP flows often underutilize available bandwidth due to factors like limited receive windows. On average, flows used only 52% of available bandwidth, lengthening transfers and wasting energy. The researchers developed techniques to estimate bandwidth and identify inefficient application behaviors to recommend protocol and design improvements.
Ontology-Based Routing for Large-Scale Unstructured P2P Publish/Subscribe Systemtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
What is P2P networks, history, architecture, advantages and weaknesses, Legal issues, Security and Privacy issues, Economic issues, Applications of use and Future developments (April, 2010).
The document provides an overview of different peer-to-peer network principles including unstructured and structured networks. Unstructured networks include centralized networks with a single index server, distributed networks without indexes, and hybrid networks that combine centralized servers and distributed indexing. Structured networks organize peers and objects into distributed hash tables (DHTs) to allow lookups to find objects in logarithmic time.
A Multipath Connection Model for Traffic MatricesIJERA Editor
Peer-to-Peer (P2P) applications have witnessed an increasing popularity in recent years, which brings new challenges to network management and traffic engineering (TE). As basic input information, P2P traffic matrices are of significant importance for TE. Because of the excessively high cost of direct measurement. In this paper,A multipath connection model for traffic matrices in operational networks. Media files can share the peer to peer, the localization ratio of peer to peer traffic. This evaluates its performance using traffic traces collected from both the real peer to peer video-on-demand and file-sharing applications. The estimation of the general traffic matrices (TM) then used for sending the media file without traffic. Share the media file, source to destination traffic is not occur. So it give high performance and short time process.
The document discusses peer-to-peer (P2P) networking. It defines P2P networking as allowing computers and software to function without special servers by directly connecting to other peers. It then discusses the history and basic concepts of P2P, including definitions, overlay networks, typical problems faced, and some popular P2P applications like file sharing using Napster, Gnutella, Kazaa, and BitTorrent. It also briefly discusses P2P for voice over IP using Skype and efforts to implement P2P on mobile devices.
Textual based retrieval system with bloom in unstructured Peer-to-Peer networksUvaraj Shan
This document summarizes a research article about a textual retrieval system using Bloom filters in unstructured peer-to-peer networks. It discusses how Bloom Cast replicates document content across the network using Bloom filters to encode documents. This allows for efficient full-text searches with guaranteed recall rates while reducing communication costs compared to replicating raw documents. The system samples nodes randomly using a lightweight distributed hash table to support searches in an unstructured P2P network where the network size is unknown.
P2P file sharing over GPRS network using Motorola RAZR2Ritul Sonania
This document discusses peer-to-peer (P2P) file sharing over GPRS networks on mobile phones. It describes how P2P networks allow for direct sharing between users without a central server. The document outlines existing P2P platforms and applications for mobile devices, as well as the benefits of P2P sharing like increased network usage and cheaper costs compared to client-server models. Key challenges with mobile P2P include technical limitations of devices and supporting various network access types. The document proposes a P2P application for Java-enabled phones using a client-server architecture over GPRS networks.
Hazard avoidance in wireless sensor and actor networksZhenyun Zhuang
This document discusses hazards that can occur in wireless sensor and actor networks due to out-of-order execution of queries and commands. It identifies three types of hazards:
1) Command-after-command (CAC) hazard occurs when the order of two sequential commands is reversed.
2) Query-after-command (QAC) hazard occurs when a query is executed before the corresponding command.
3) Command-after-query (CAQ) hazard is the reverse of QAC, where a command is executed before its preceding query.
The document uses an example of a fire detection and suppression system to illustrate these hazards and their undesirable consequences. It also discusses challenges in addressing hazards such as parallel
PAIDS: A Proximity-Assisted Intrusion Detection System for Unidentified WormsZhenyun Zhuang
This document proposes a new intrusion detection system called PAIDS (Proximity-Assisted Intrusion Detection System) to identify unknown worms. Existing signature-based and anomaly-based detection systems are ineffective against new worms that spread quickly. PAIDS takes advantage of the clustered spread of worms among nearby hosts, especially in the early stages, rather than relying on signatures. It aims to detect worm outbreaks when they first begin spreading to limit their propagation. Preliminary simulations show PAIDS has a high detection rate and low false positive rate.
AOTO: Adaptive overlay topology optimization in unstructured P2P systemsZhenyun Zhuang
IEEE GLOBECOM 2003
Peer-to-Peer (P2P) systems are self-organized and
decentralized. However, the mechanism of a peer randomly
joining and leaving a P2P network causes topology mismatch-
ing between the P2P logical overlay network and the physical
underlying network. The topology mismatching problem brings
great stress on the Internet infrastructure and seriously limits
the performance gain from various search or routing tech-
niques. We propose the Adaptive Overlay Topology Optimiza-
tion (AOTO) technique, an algorithm of building an overlay
multicast tree among each source node and its direct logical
neighbors so as to alleviate the mismatching problem by choos-
ing closer nodes as logical neighbors, while providing a larger
query coverage range. AOTO is scalable and completely dis-
tributed in the sense that it does not require global knowledge
of the whole overlay network when each node is optimizing the
organization of its logical neighbors. The simulation shows that
AOTO can effectively solve the mismatching problem and re-
duce more than 55% of the traffic generated by the P2P system itself.
A3: application-aware acceleration for wireless data networksZhenyun Zhuang
This document discusses application-aware acceleration (A3) for improving application performance over wireless networks. It presents results showing that while enhanced transport protocols improve performance for FTP, they provide little benefit for other popular applications like CIFS, SMTP, and HTTP. This is because the behavior of these applications, designed for reliable LANs, negatively impacts their performance over lossy wireless links. The document proposes A3 as a middleware solution that offsets these behavioral problems through application-specific design principles, while remaining transparent to applications.
Optimizing Streaming Server Selection for CDN-delivered Live StreamingZhenyun Zhuang
LNCS 2012
Content Delivery Networks (CDNs) have been widely used to deliver
web contents on today’s Internet. Gaining tremendous popularity, live streaming
is also increasingly being delivered by CDNs. Compared to conventional static
or dynamic web contents, the new application type of live streaming exposes
unique characteristics that pose challenges to the underlying CDN infrastructure.
Unlike traditional web-objects fetching, which allows Edge Servers to cache contents
and thus typically only involves Edge Servers for delivering contents, live
streaming requires real-time full CDN-streaming paths that span across Ingest
Servers, Origin Servers and Edge Servers.
DNS is the standard practice for enabling dynamic assignment of servers. GeoDNS,
a specialized DNS system, provides DNS resolution by taking into account the
geographical locations of end-users and CDN servers. Though GeoDNS effectively
redirects users to nearest CDN Edge Servers, it may not be able to select
the optimal Origin Server for relaying a live stream to Edge Servers due to the
unique characteristics of live streaming. In this work, we consider the requirements
of delivering live streaming with CDN, and propose advanced design for
selecting optimal Origin Streaming Servers in order to reduce network transit
cost and increase viewers’ experience. We further propose a live-streaming specific
GeoDNS design for selecting optimal Origin Servers to serve Edge Servers.
Node selection in p2 p content sharing service in mobile cellular networks wi...Uvaraj Shan
This document discusses node selection algorithms for peer-to-peer content sharing over mobile cellular networks that consider downlink bandwidth limitations. It proposes two novel algorithms (DBaT-B and DBaT-N) that select peer nodes to maximize load balancing across cells while meeting the requesting peer's bandwidth needs. DBaT-B selects peers to satisfy the requesting peer's minimum bandwidth requirement, while DBaT-N selects a certain number of peers as requested. Both algorithms first choose peers in the least busy cell to improve load balancing.
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.
This document discusses a study of BitTorrent characteristics through packet analysis. It provides background on BitTorrent, including how it works, key terminology, and the basic structure of torrent files. The study captured packet traces of BitTorrent files from different scenarios to analyze characteristics like peer connections and bandwidth usage over time.
Effective Approach For Content Based Image Retrieval In Peer-Peer To NetworksIRJET Journal
The document describes a proposed approach for content-based image retrieval in peer-to-peer networks. Existing methods represent images as high-dimensional feature vectors and index them using distributed high-dimensional indexes or locality sensitive hashing over distributed hash tables. However, these approaches have high network costs and workload imbalances. The proposed approach uses the bag-of-visual-words model to represent images, building inverted indexes of visual codewords over the distributed hash table. It also develops a dynamic codebook updating method to optimize the mutual information between the codebook and relevance information, balancing the workload among nodes as the peer-to-peer network and data evolve dynamically.
Analytical Modelling of Localized P2P Streaming Systems under NAT ConsiderationIJCNCJournal
This document summarizes an analytical model for localized peer-to-peer (P2P) streaming systems that considers the impact of network address translation (NAT). It introduces theoretical boundaries for the number of peers that may be expelled from the system due to NAT incompatibility. It also presents a mathematical model for startup delay in P2P streaming that accounts for peers' NAT types. The document proposes a new neighbor selection algorithm that considers both autonomous system numbers and NAT types to improve connectivity while reducing transit traffic and startup delays.
This document describes a peer-to-peer messaging system built using the JXTA platform. The system allows instant messages to be sent between peers in a decentralized JXTA network. JXTA defines protocols for peer-to-peer communication, where all peers have equal status and can request or provide services. The system includes a JXTA relay that receives commands from J2ME clients, performs actions on their behalf, and represents the clients on the JXTA network by discovering peers and routing messages. The goal of the project is to enable instant messaging between peers in a peer-to-peer manner without a centralized server.
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.
P2P DOMAIN CLASSIFICATION USING DECISION TREE ijp2p
The increasing interest in Peer-to-Peer systems (such as Gnutella) has inspired many research activities
in this area. Although many demonstrations have been performed that show that the performance of a
Peer-to-Peer system is highly dependent on the underlying network characteristics, much of the
evaluation of Peer-to-Peer proposals has used simplified models that fail to include a detailed model of
the underlying network. This can be largely attributed to the complexity in experimenting with a scalable
Peer-to-Peer system simulator built on top of a scalable network simulator. A major problem of
unstructured P2P systems is their heavy network traffic. In Peer-to-Peer context, a challenging problem
is how to find the appropriate peer to deal with a given query without overly consuming bandwidth?
Different methods proposed routing strategies of queries taking into account the P2P network at hand.
This paper considers an unstructured P2P system based on an organization of peers around Super-Peers
that are connected to Super-Super-Peer according to their semantic domains; in addition to integrating
Decision Trees in P2P architectures to produce Query-Suitable Super-Peers, representing a community
of peers where one among them is able to answer the given query. By analyzing the queries log file, a
predictive model that avoids flooding queries in the P2P network is constructed after predicting the
appropriate Super-Peer, and hence the peer to answer the query. A challenging problem in a schemabased Peer-to-Peer (P2P) system is how to locate peers that are relevant to a given query. In this paper,
architecture, based on (Super-)Peers is proposed, focusing on query routing. The approach to be
implemented, groups together (Super-)Peers that have similar interests for an efficient query routing
method. In such groups, called Super-Super-Peers (SSP), Super-Peers submit queries that are often
processed by members of this group. A SSP is a specific Super-Peer which contains knowledge about: 1.
its Super-Peers and 2. The other SSP. Knowledge is extracted by using data mining techniques (e.g.
Decision Tree algorithms) starting from queries of peers that transit on the network. The advantage of
this distributed knowledge is that, it avoids making semantic mapping between heterogeneous data
sources owned by (Super-)Peers, each time the system decides to route query to other (Super-) Peers.
The set of SSP improves the robustness in queries routing mechanism, and the scalability in P2P
Network. Compared with a baseline approach,the proposal architecture shows the effect of the data
mining with better performance in respect to response time and precision.
This document summarizes a study on the performance of LTE networks. The researchers conducted passive and active measurements on a commercial LTE network with over 300,000 users to analyze network characteristics and resource utilization. They found that while LTE provides higher bandwidth than 3G, TCP flows often underutilize available bandwidth due to factors like limited receive windows. On average, flows used only 52% of available bandwidth, lengthening transfers and wasting energy. The researchers developed techniques to estimate bandwidth and identify inefficient application behaviors to recommend protocol and design improvements.
Ontology-Based Routing for Large-Scale Unstructured P2P Publish/Subscribe Systemtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
What is P2P networks, history, architecture, advantages and weaknesses, Legal issues, Security and Privacy issues, Economic issues, Applications of use and Future developments (April, 2010).
The document provides an overview of different peer-to-peer network principles including unstructured and structured networks. Unstructured networks include centralized networks with a single index server, distributed networks without indexes, and hybrid networks that combine centralized servers and distributed indexing. Structured networks organize peers and objects into distributed hash tables (DHTs) to allow lookups to find objects in logarithmic time.
A Multipath Connection Model for Traffic MatricesIJERA Editor
Peer-to-Peer (P2P) applications have witnessed an increasing popularity in recent years, which brings new challenges to network management and traffic engineering (TE). As basic input information, P2P traffic matrices are of significant importance for TE. Because of the excessively high cost of direct measurement. In this paper,A multipath connection model for traffic matrices in operational networks. Media files can share the peer to peer, the localization ratio of peer to peer traffic. This evaluates its performance using traffic traces collected from both the real peer to peer video-on-demand and file-sharing applications. The estimation of the general traffic matrices (TM) then used for sending the media file without traffic. Share the media file, source to destination traffic is not occur. So it give high performance and short time process.
The document discusses peer-to-peer (P2P) networking. It defines P2P networking as allowing computers and software to function without special servers by directly connecting to other peers. It then discusses the history and basic concepts of P2P, including definitions, overlay networks, typical problems faced, and some popular P2P applications like file sharing using Napster, Gnutella, Kazaa, and BitTorrent. It also briefly discusses P2P for voice over IP using Skype and efforts to implement P2P on mobile devices.
Textual based retrieval system with bloom in unstructured Peer-to-Peer networksUvaraj Shan
This document summarizes a research article about a textual retrieval system using Bloom filters in unstructured peer-to-peer networks. It discusses how Bloom Cast replicates document content across the network using Bloom filters to encode documents. This allows for efficient full-text searches with guaranteed recall rates while reducing communication costs compared to replicating raw documents. The system samples nodes randomly using a lightweight distributed hash table to support searches in an unstructured P2P network where the network size is unknown.
P2P file sharing over GPRS network using Motorola RAZR2Ritul Sonania
This document discusses peer-to-peer (P2P) file sharing over GPRS networks on mobile phones. It describes how P2P networks allow for direct sharing between users without a central server. The document outlines existing P2P platforms and applications for mobile devices, as well as the benefits of P2P sharing like increased network usage and cheaper costs compared to client-server models. Key challenges with mobile P2P include technical limitations of devices and supporting various network access types. The document proposes a P2P application for Java-enabled phones using a client-server architecture over GPRS networks.
Hazard avoidance in wireless sensor and actor networksZhenyun Zhuang
This document discusses hazards that can occur in wireless sensor and actor networks due to out-of-order execution of queries and commands. It identifies three types of hazards:
1) Command-after-command (CAC) hazard occurs when the order of two sequential commands is reversed.
2) Query-after-command (QAC) hazard occurs when a query is executed before the corresponding command.
3) Command-after-query (CAQ) hazard is the reverse of QAC, where a command is executed before its preceding query.
The document uses an example of a fire detection and suppression system to illustrate these hazards and their undesirable consequences. It also discusses challenges in addressing hazards such as parallel
PAIDS: A Proximity-Assisted Intrusion Detection System for Unidentified WormsZhenyun Zhuang
This document proposes a new intrusion detection system called PAIDS (Proximity-Assisted Intrusion Detection System) to identify unknown worms. Existing signature-based and anomaly-based detection systems are ineffective against new worms that spread quickly. PAIDS takes advantage of the clustered spread of worms among nearby hosts, especially in the early stages, rather than relying on signatures. It aims to detect worm outbreaks when they first begin spreading to limit their propagation. Preliminary simulations show PAIDS has a high detection rate and low false positive rate.
AOTO: Adaptive overlay topology optimization in unstructured P2P systemsZhenyun Zhuang
IEEE GLOBECOM 2003
Peer-to-Peer (P2P) systems are self-organized and
decentralized. However, the mechanism of a peer randomly
joining and leaving a P2P network causes topology mismatch-
ing between the P2P logical overlay network and the physical
underlying network. The topology mismatching problem brings
great stress on the Internet infrastructure and seriously limits
the performance gain from various search or routing tech-
niques. We propose the Adaptive Overlay Topology Optimiza-
tion (AOTO) technique, an algorithm of building an overlay
multicast tree among each source node and its direct logical
neighbors so as to alleviate the mismatching problem by choos-
ing closer nodes as logical neighbors, while providing a larger
query coverage range. AOTO is scalable and completely dis-
tributed in the sense that it does not require global knowledge
of the whole overlay network when each node is optimizing the
organization of its logical neighbors. The simulation shows that
AOTO can effectively solve the mismatching problem and re-
duce more than 55% of the traffic generated by the P2P system itself.
A3: application-aware acceleration for wireless data networksZhenyun Zhuang
This document discusses application-aware acceleration (A3) for improving application performance over wireless networks. It presents results showing that while enhanced transport protocols improve performance for FTP, they provide little benefit for other popular applications like CIFS, SMTP, and HTTP. This is because the behavior of these applications, designed for reliable LANs, negatively impacts their performance over lossy wireless links. The document proposes A3 as a middleware solution that offsets these behavioral problems through application-specific design principles, while remaining transparent to applications.
Optimizing Streaming Server Selection for CDN-delivered Live StreamingZhenyun Zhuang
LNCS 2012
Content Delivery Networks (CDNs) have been widely used to deliver
web contents on today’s Internet. Gaining tremendous popularity, live streaming
is also increasingly being delivered by CDNs. Compared to conventional static
or dynamic web contents, the new application type of live streaming exposes
unique characteristics that pose challenges to the underlying CDN infrastructure.
Unlike traditional web-objects fetching, which allows Edge Servers to cache contents
and thus typically only involves Edge Servers for delivering contents, live
streaming requires real-time full CDN-streaming paths that span across Ingest
Servers, Origin Servers and Edge Servers.
DNS is the standard practice for enabling dynamic assignment of servers. GeoDNS,
a specialized DNS system, provides DNS resolution by taking into account the
geographical locations of end-users and CDN servers. Though GeoDNS effectively
redirects users to nearest CDN Edge Servers, it may not be able to select
the optimal Origin Server for relaying a live stream to Edge Servers due to the
unique characteristics of live streaming. In this work, we consider the requirements
of delivering live streaming with CDN, and propose advanced design for
selecting optimal Origin Streaming Servers in order to reduce network transit
cost and increase viewers’ experience. We further propose a live-streaming specific
GeoDNS design for selecting optimal Origin Servers to serve Edge Servers.
Client-side web acceleration for low-bandwidth hostsZhenyun Zhuang
This document proposes client-side optimizations to reduce web page load times for users on low-bandwidth networks. It analyzes problems with how current web browsers fetch entire pages greedily without prioritizing visible content. This wastes bandwidth and increases load times. The document proposes three browser-side mechanisms: 1) prioritizing the fetching of objects visible on the initial screen over other objects, 2) reordering object fetching to better utilize bandwidth, and 3) improving connection management. Simulations show these techniques can significantly reduce user-perceived response times compared to current browsers for low-bandwidth conditions.
Ensuring High-performance of Mission-critical Java Applications in Multi-tena...Zhenyun Zhuang
The document discusses problems with ensuring high performance of mission-critical Java applications in multi-tenant cloud environments. It identifies issues caused by resource sharing between applications on the same platform, such as memory pressure triggering page swapping and direct reclaiming, which can severely degrade Java application performance through increased garbage collection pauses and reduced throughput. The authors investigate two scenarios in a production environment and determine that transparent huge pages, memory pressure from other applications, and interactions between the JVM and Linux memory management are key factors impacting Java application performance in multi-tenant cloud setups.
Programmatic Right Here, Right Now ( English Version )Xavier Garrido
Presentation done at II Forum Programmatic during March the 1rst 2016 in Madrid.
In this presentation, i tried to bring closer programmatic in a simple way to the audience emphasizing that we are facing a paradigm shift in the advertising industry.
Legal aspects of religion in the workplaceRonald Brown
1. Managing religion in the workplace is challenging as people have strong spiritual beliefs but companies must also avoid religious discrimination. While some firms welcome religious expressions, others keep religion out of the workplace.
2. A survey found 20% of workers reported experiencing religious prejudice or knew of others facing discriminatory treatment. This has led to lawsuits against companies over religious discrimination or failure to accommodate religious practices.
3. Employers must strive to balance religious expression with inclusion of all beliefs to avoid lawsuits. They should provide religious accommodations when possible without causing undue hardship. Anti-harassment policies and training can help prevent problems related to religion in the workplace.
The document discusses definitions of leadership and what makes a good leader. It provides several definitions:
1) "Leadership [is] creating the conditions in organizational systems so that people can do their best work" and "Leaders define or clarify goals for a group, which can be as small as a seminar or as large as a nation-state and mobilize the energies of members of the group to pursue those goals."
2) "Problem solving is the core of leadership" and "the art of accomplishing more than the science of management says is possible."
3) Leadership "is about coping with change", about "motivating and inspiring---keeping people moving in the right direction, despite major obstacles
What makes a leader and what is leadershpRonald Brown
Leadership is defined in multiple ways in the document. It involves creating conditions for people to do their best work, defining goals for a group, and motivating people to pursue those goals. It also involves problem solving and accomplishing more than what seems possible. Effective leadership requires vision, managing change, and having a clear sense of direction.
The document discusses biometrics, which uses physiological or behavioral human characteristics to identify individuals. It defines biometrics and describes a generic biometric system involving enrollment, sensors, feature extraction, and matching. The document outlines several types of biometrics including face recognition, fingerprints, hand geometry, iris/retina scans, DNA, keystrokes, and voice. It also discusses vulnerabilities in biometric systems such as spoofing attacks, template database leaks, and intrinsic limitations like false matches. The document proposes security approaches like feature transformations and cryptosystems to enhance biometric security.
Mutual Exclusion in Wireless Sensor and Actor NetworksZhenyun Zhuang
This document discusses mutual exclusion in wireless sensor and actor networks. It begins by introducing wireless sensor networks and how they have evolved into wireless sensor and actor networks which can both sense and act on their environments. This introduces new challenges around resource utilization that must be addressed. Specifically, the document identifies the problem of mutual exclusion - ensuring only a minimum necessary subset of actors take action for a given event to avoid issues like inefficient resource usage. It defines different types of mutual exclusion and proposes both a greedy centralized approach and a distributed localized approach to address this problem efficiently while meeting application-specific delay bounds and fully covering the event region.
OCPA: An Algorithm for Fast and Effective Virtual Machine Placement and Assig...Zhenyun Zhuang
This document proposes a method called Constrained Server Chaining (CSC) to optimize CDN infrastructure for live streaming. CSC allows CDN streaming servers to dynamically select upstream servers to pull live streams from, rather than only pulling from fixed ingest servers. This can reduce transit costs for CDN providers by creating more direct paths between servers. However, CSC also imposes a delivery length cap to avoid compromising end user experience with longer paths. The document describes the problem CSC addresses, an illustrative example of how CSC works, and the key components of CSC including cost determination, length cap determination, and server connection monitoring.
Guarding Fast Data Delivery in Cloud: an Effective Approach to Isolating Perf...Zhenyun Zhuang
LNCS 2015
Cloud-based products heavily rely on the fast data
delivery between data centers and remote users - when data
delivery is slow, the products’ performance is crippled. When
slow data delivery occurs, engineers need to investigate the issue
and find the root cause. The investigation requires experience
and time, as data delivery involves multiple playing parts
including sender/receiver/network.
To facilitate the investigations, we propose an algorithm
to automatically identify the performance bottleneck. The
algorithm aggregates information from multiple layers of
data sender and receiver. It helps to automatically isolate
the problem type by identifying which component of
sender/receiver/network is the bottleneck. After isolation, successive
efforts can be taken to root cause the exact problem.
We also build a prototype to demonstrate the effectiveness of
the algorithm.
Eliminating OS-caused Large JVM Pauses for Latency-sensitive Java-based Cloud...Zhenyun Zhuang
For PaaS-deployed (Platform as a Service)
customer-facing applications (e.g., online gaming and online
chatting), ensuring low latencies is not just a preferred feature,
but a must-have feature. Given the popularity and powerful-
ness of Java platforms, a significant portion of today’s PaaS
platforms run Java. JVM (Java Virtual Machine) manages a
heap space to hold application objects. The heap space can be
frequently GC-ed (Garbage Collected), and applications can be
occasionally stopped for long time during some GC and JVM
activities.
In this work, we investigated the JVM pause problem.
We found out that there are some (and large) JVM STW
pauses cannot be explained by application-level activities and
JVM activities during GC; instead, they are caused by OS
mechanisms. We successfully reproduced such problems and
root-cause-ed the reasons. The findings can be used to enhance
JVM implementation. We also proposed a set of solutions to
mitigate and eliminate these large STW pauses. We share the
knowledge and experiences in this writing.
Building Cloud-ready Video Transcoding System for Content Delivery Networks (...Zhenyun Zhuang
GLOBECOM 2012
Video streaming traffic of both VoD (Video on
Demand) and Live is exploding. Various types of businesses
and many people are relying on video streaming to attract
customers/users and for other purposes. Given the vast number
of video stream formats (e.g., MP4, FLV) and transmission
protocols (e.g., HTTP, RTMP, RTSP) for supporting varying
types of playback terminals (particularly mobile devices such as
iphone/ipad and Android phones), video content providers often
need to transcode videos to multiple formats in order to stream
to different types of users.
Being time-sensitive and requiring high bandwidth, video
streaming exerts high pressure on underlying delivery networks.
Content Delivery Network (CDN) providers can help their
customers quickly and reliably distribute stream contents to end
users. In addition to distributing video streams, CDN providers
typically allow their customers to perform video transcoding on
CDN platforms. With the high volume of video streams and the
bursty transcoding workload, CDN providers are eager to deploy
elastic and optimized cloud-based transcoding platforms.
Optimizing CDN Infrastructure for Live Streaming with Constrained Server Chai...Zhenyun Zhuang
This document proposes a method called Constrained Server Chaining (CSC) to optimize CDN infrastructure for live streaming. CSC allows CDN streaming servers to dynamically select upstream servers to pull live streams from, rather than only pulling from fixed ingest servers. This allows streaming servers to form constrained chains to minimize total transit costs for the CDN provider while ensuring end user experience is not compromised by capping delivery path lengths. The document outlines the problem definition, design overview, and software architecture of CSC and provides an example to motivate how CSC can reduce costs compared to traditional layered CDN structures.
Bandwidth Management Solutions for Network Operatorsipoque
Bandwidth management using deep packet inspection (DPI) is a relatively new field for network operators. This white paper uses a challenge-solution approach to explain how this technology can help to solve many of the issues that arise from growing user numbers generating ever more traffic with a large variety of new applications. The challenges are illustrated with real-world numbers taken from ipoque's Internet Study 2007. A selection of possible solutions helps network operators to pick the most ap- propriate ones based on their specific requirements.
Node selection in p2 p content sharing service in mobile cellular networks wi...Uvaraj Shan
This document discusses node selection algorithms for peer-to-peer content sharing over mobile cellular networks that consider downlink bandwidth limitations. It proposes two novel algorithms (DBaT-B and DBaT-N) that select peer nodes to maximize load balancing across cells while meeting the requesting peer's bandwidth needs. DBaT-B selects peers to satisfy the requesting peer's minimum bandwidth requirement, while DBaT-N selects a certain number of peers as requested. Both algorithms first choose peers in the least busy cell to improve load balancing.
Node selection in p2 p content sharing service in mobile cellular networks wi...Uvaraj Shan
The document discusses node selection algorithms for peer-to-peer content sharing over mobile cellular networks that consider downlink bandwidth limitations. It proposes two algorithms: DBaT-B selects peers to meet a minimum requested bandwidth sum, prioritizing load balancing across cells. DBaT-N selects a requested number of peers where the bandwidth sum exceeds the downlink limit, again balancing cell loads. Both aim to satisfy bandwidth demands while distributing traffic evenly across the network. The paper then evaluates the algorithms' performance through simulation.
A Brief Note On Peer And Peer ( P2P ) Applications Have No...Brenda Thomas
The document discusses peer-to-peer (P2P) networks and server-based client/server networks. In a P2P network, all computers have equal privileges to share and access information directly without restrictions. P2P networks are easier to set up but provide less security. In a client/server network, file storage and management is centralized on a server. This provides better security but is more complex to set up and manage. The document explores the advantages and disadvantages of each type of network for different usage contexts.
Service Based Content Sharing in the Environment of Mobile Ad-hoc NetworksIOSR Journals
This document discusses service-based content sharing in mobile ad-hoc networks. It proposes a peer-to-peer file sharing system that allows efficient content distribution using low-cost Bluetooth links. Peers discover each other via scanning and share subscribed content in segments over Bluetooth. The system was implemented on Blackberry and Windows Mobile smartphones to test feasibility. Tests showed file transfers were practical between mobile devices using this approach, with segment size having little effect on performance.
This document presents two novel peer selection algorithms, DBaT-B and DBaT-N, for peer-to-peer content sharing over mobile cellular networks. DBaT-B selects peers to satisfy the requesting peer's minimum downlink bandwidth requirement, while balancing traffic load across cells. DBaT-N selects a specified number of peers such that the total uplink bandwidth exceeds the requester's downlink limit, again balancing loads. Both algorithms first choose the least busy cell and then select peers based on uplink bandwidth and service ability to meet the requester's needs while improving load balancing performance compared to traditional algorithms.
International Journal of Peer to Peer Networks (IJP2P) Vol.6, No.2, August 20...ijp2p
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure
This document summarizes a research paper that proposes a congestion control protocol for peer-to-peer live streaming systems. The protocol is designed to handle sequential traffic heading to multiple destinations efficiently, measure available bandwidth accurately, avoid network congestion, and be friendly to traditional TCP traffic. It was implemented and evaluated on a testbed. The key aspects of the proposed protocol are that it controls transmission rates based on acknowledgments from receivers to keep bottleneck queue sizes stable, and aims to fully utilize bandwidth while avoiding bufferbloat.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the development of distributed P2P block schedulers for content exchange among the participating peers and on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed monitoring and control architectures that use resources from the cloud in order to enhance QoS and achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network congestion, and v) is friendly to traditional TCP generated traffic.The proposed P2P congestion control has been implemented, tested and evaluated through a series of real experiments powered across the BonFIRE infrastructure.
In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live
Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the
development of distributed P2P block schedulers for content exchange among the participating peers and
on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these peers.
Currently, researchers try to combine peer-to-peer systems with cloud infrastructures. They developed
monitoring and control architectures that use resources from the cloud in order to enhance QoS and
achieve an attractive trade-off between stability and low cost operation. However, there is a lack of
research effort on the congestion control of these systems and the existing congestion control architectures
are not suitable for P2P live streaming traffic (small sequential non persistent traffic towards multiple
network locations). This paper proposes a P2P live streaming traffic aware congestion control protocol
that: i) is capable to manage sequential traffic heading to multiple network destinations , ii) efficiently
exploits the available bandwidth, iii) accurately measures the idle peer resources, iv) avoids network
congestion, and v) is friendly to traditional TCP generated traffic. The proposed P2P congestion control
has been implemented, tested and evaluated through a series of real experiments powered across the
BonFIRE infrastructure.
Peer to Peer Network with its Architecture, Types, and Examples!!DigitalThinkerHelp
Today, here we are going to cover all possible things about is peer to peer network with its architecture and types; involving with several examples of peer to peer network with ease.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
FUTURE OF PEER-TO-PEER TECHNOLOGY WITH THE RISE OF CLOUD COMPUTINGijp2p
Peer-to-Peer (P2P) networking emerged as a disruptive business model displacing the server based
networks within a point in time.P2P technologies are on the edge of becoming all-purpose in developing
several applications for social networking. In the past seventeen years, research on P2P computing and
systems has received enormous amount of attention in the areas of academia and the industry. P2P rose to
triumphant profit-making systems in the internet. It represents the best incarnation of the end to end
argument, the frequently disputed design philosophies that guided the design of the internet. The doubting
factor then is why is research on P2P computing now fading from the spotlight and suffering a nose dive
fall as dramatic as its rise to its popularity. This paper is going to capture a quick look at past results in
peer-to-peer computing with focus on understanding what led to its rise, what contributed to its commercial
success and what has led to its lack of interest. The insight of this paper introduces cloud computing as a
paradigm to peer-to-peer computing.
FUTURE OF PEER-TO-PEER TECHNOLOGY WITH THE RISE OF CLOUD COMPUTINGijp2p
Peer-to-Peer (P2P) networking emerged as a disruptive business model displacing the server based
networks within a point in time.P2P technologies are on the edge of becoming all-purpose in developing
several applications for social networking. In the past seventeen years, research on P2P computing and
systems has received enormous amount of attention in the areas of academia and the industry. P2P rose to
triumphant profit-making systems in the internet. It represents the best incarnation of the end to end
argument, the frequently disputed design philosophies that guided the design of the internet. The doubting
factor then is why is research on P2P computing now fading from the spotlight and suffering a nose dive
fall as dramatic as its rise to its popularity. This paper is going to capture a quick look at past results in
peer-to-peer computing with focus on understanding what led to its rise, what contributed to its commercial
success and what has led to its lack of interest. The insight of this paper introduces cloud computing as a
paradigm to peer-to-peer computing.
Give to-get algorithm-for_p2_p_video_on_demandjayanthi_2009
This document proposes a peer-to-peer video-on-demand (P2P VoD) algorithm called "Give-to-Get" that discourages free-riding. Give-to-Get works by having peers favor uploading video chunks to other peers who have proven to be good uploaders. This incentivizes sharing and excludes free-riders who consume bandwidth without contributing uploads of their own. The algorithm aims to provide good performance even if 20% of peers are free-riding, as long as there is spare system capacity. It is best suited for distributing short videos using this P2P approach.
Peer-to-Peer Architecture Case Study Gnutella NetworkMate.docxherbertwilson5999
Peer-to-Peer Architecture Case Study: Gnutella Network
Matei Ripeanu
Computer Science Department,
The University of Chicago
[email protected]
Abstract
Despite recent excitement generated by the P2P
paradigm and despite surprisingly fast deployment of
some P2P applications, there are few quantitative
evaluations of P2P systems behavior. Due to its open
architecture and achieved scale, Gnutella is an
interesting P2P architecture case study. Gnutella, like
most other P2P applications, builds at the application
level a virtual network with its own routing mechanisms.
The topology of this overlay network and the routing
mechanisms used have a significant influence on
application properties such as performance, reliability,
and scalability. We built a ‘crawler’ to extract the
topology of Gnutella’s application level network, we
analyze the topology graph and evaluate generated
network traffic. We find that although Gnutella is not a
pure power-law network, its current configuration has the
benefits and drawbacks of a power-law structure. These
findings lead us to propose changes to Gnutella protocol
and implementations that bring significant performance
and scalability improvements.
1. Introduction
Peer-to-peer systems (P2P) have emerged as a
significant social and technical phenomenon over the last
year. P2P systems provide infrastructure for communities
that share CPU cycles (e.g., Entropia, [email protected])
and/or, storage space (e.g., FreeNet, Gnutella), or that
support interpersonal collaborative environments. Two
factors have fostered the recent explosive growth of such
systems: first, the low cost and high availability of huge
computing and storage resources, and second, increased
network connectivity. As these trends continue, the P2P
paradigm can be expected to become more popular.
Peer-to-peer networks allow individual computers to
communicate directly with each other and to share
information and resources without using specialized
‘servers’. A common characteristic of this new breed of
applications is that they build, at the application level, a
virtual network with its own routing mechanisms. The
topology of this virtual network and the routing
mechanisms used have a significant influence on
application properties such as performance, reliability,
and, in some cases, anonymity. The virtual topology also
determines the communication costs incurred when
running the P2P application.
These considerations have motivated us to conduct a
detailed study of the topology and protocol of a popular
P2P system, Gnutella. In this study, we benefited from
Gnutella’s large existing user base and open architecture,
and, in effect, use the public Gnutella network as a large-
scale, if uncontrolled, testbed. We capture the network
topology, the generated traffic, and the resources’
dynamic behavior. We use our findings to evaluate costs
and benefits of the P2P approach and to investigate
possible improvements to the routing protocol that would
a.
This document introduces pWeb, a peer-to-peer web hosting framework that aims to distribute web content storage and hosting across various internet-connected devices. It discusses challenges with using traditional client-server and P2P models for web hosting, including issues with location-based naming, content availability, and protocols. The goals of pWeb are to design location-independent and persistent naming, ensure 24/7 content availability through replication, and develop a lightweight software architecture for hosting static and dynamic web content on low-resource devices in a P2P network.
Peer To Peer Content Sharing On Wi-Fi Network For Smart PhonesIOSR Journals
This document summarizes a research paper on peer-to-peer content sharing on Wi-Fi networks for smart phones. It discusses using a peer-to-peer model to allow smart phones to share content like videos and photos over Wi-Fi networks without using cellular data or requiring a central server. The proposed system would allow phones to discover each other on the local network, search for files, and download content directly from other peers. This approach aims to reduce costs and bandwidth usage compared to uploading content through cellular networks or wired connections.
Similar to On the Impact of Mobile Hosts in Peer-to-Peer Data Networks (20)
Designing SSD-friendly Applications for Better Application Performance and Hi...Zhenyun Zhuang
This document discusses how applications can be designed to take advantage of the unique characteristics of solid state drives (SSDs) in order to improve application performance, storage input/output (IO) efficiency, and SSD lifespan. It proposes nine SSD-friendly application design changes and explains how they can result in better application performance by fully utilizing SSDs' internal parallelism, more efficient storage IO by reducing write amplification, and longer SSD lifespan by decreasing write amplification.
Optimized Selection of Streaming Servers with GeoDNS for CDN Delivered Live S...Zhenyun Zhuang
This document proposes a new DNS design called Sticky-DNS to optimize server selection for CDN-delivered live streaming. Sticky-DNS aims to minimize CDN transit costs while maintaining good viewer experience. Unlike traditional GeoDNS which selects the nearest origin server to an edge server, Sticky-DNS considers the full ingest-origin and origin-edge paths to potentially select a non-nearest origin server that results in lower overall transit costs. It does this by maintaining cost values for all server pairs and selecting origins to serve edges in a way that minimizes total path costs. For less popular streams, origins are chosen based on end-to-end path lengths, while for popular streams Sticky-DNS adapts to encourage reuse
Application-Aware Acceleration for Wireless Data Networks: Design Elements an...Zhenyun Zhuang
This document discusses an approach called Application-Aware Acceleration (A3) to improve application performance over wireless networks. It finds that while transport layer protocols improve performance for FTP, they provide little benefit for other applications like CIFS, SMTP, and HTTP due to the applications' behaviors. A3 addresses this by using principles like transaction prediction, prioritized fetching, and redundant transmissions to offset applications' typical problems when used over wireless networks. The document presents the motivation and design of A3, and evaluates its effectiveness through emulations and a proof-of-concept prototype using NetFilter.
WebAccel: Accelerating Web access for low-bandwidth hostsZhenyun Zhuang
The document describes problems with how current web browsers access web pages in low-bandwidth environments. It analyzes factors that cause large response times, such as properties of typical web pages, interactions between HTTP and TCP protocols, and impact of server-side optimizations. It proposes a new solution called WebAccel that uses three browser-side mechanisms - prioritized fetching, object reordering, and connection management - to reduce user response time in an easy-to-deploy way. Simulation results and a prototype implementation show that WebAccel brings significant performance benefits over current browsers.
A Distributed Approach to Solving Overlay Mismatching ProblemZhenyun Zhuang
This document proposes an algorithm called Adaptive Connection Establishment (ACE) to address the topology mismatch problem between the logical overlay network and physical underlying network in unstructured peer-to-peer systems. ACE builds a minimum spanning tree among each source node and its neighbors within a certain diameter, optimizes connections not on the tree to reduce redundant traffic, while retaining search scope. It evaluates tradeoffs between topology optimization and information exchange overhead by changing the diameter. Simulation results show ACE can significantly reduce unnecessary P2P traffic by efficiently matching the overlay and physical network topologies.
Hybrid Periodical Flooding in Unstructured Peer-to-Peer NetworksZhenyun Zhuang
This document proposes a new search mechanism called Hybrid Periodical Flooding (HPF) for unstructured peer-to-peer networks. HPF aims to reduce unnecessary traffic like blind flooding while also addressing the "partial coverage problem" of some statistics-based search mechanisms. It introduces the concept of Periodical Flooding (PF), which controls the number of neighbors a query is forwarded to based on the time-to-live value. This allows the forwarding behavior to change periodically over the query's lifetime. HPF then combines PF with weighted selection of neighbors based on multiple metrics to guide queries towards potentially relevant results while exploring more of the network.
Enhancing Intrusion Detection System with Proximity InformationZhenyun Zhuang
This document proposes PAIDS, a Proximity-Assisted Intrusion Detection System that identifies unknown worm outbreaks by leveraging proximity information of compromised hosts. PAIDS operates independently from existing signature-based and anomaly-based IDS approaches. It observes that compromised hosts tend to cluster geographically and remain active for long periods, allowing proximity to infected machines to indicate higher infection risk. The document motivates PAIDS based on limitations of other IDSes and clustered/long-term nature of worm spread. It then outlines PAIDS design, deployment model, software architecture, and key components for detecting outbreaks using proximity information.
SLA-aware Dynamic CPU Scaling in Business Cloud Computing EnvironmentsZhenyun Zhuang
IEEE CLOUD 2015
Modern cloud computing platforms (e.g. Linux
on Intel CPUs) feature ACPI-based (Advanced Configuration
and Power Interface) mechanism, which dynamically scales
CPU frequencies/voltages to adjust the CPU frequencies based
on the workload intensity. With this feature, CPU frequency
is reduced when the workload is relatively light in order to
save energy; while increased when the workload intensity is
relatively high.
In business cloud computing environments, software products/
services often need to “scale out” to multiple machines to
form a cluster to achieve a pre-defined aggregated performance
goal (e.g., SLA-devised throughput). To reduce business operation
cost, minimizing the provisioned cluster size is critical.
However, as we show in this work, the working of ACPI
in today’s modern OS may result in more machines being
provisioned, hence higher business operation cost,
To deal with this problem, we propose a SLA-aware CPU
scaling algorithm based on business SLA (Service Level Agreement
aware). The proposed design rational and algorithm are
a fundamental rethinking of how ACPI mechanisms should be
implemented in business cloud computing environments. Contrary
to the current forms of ACPI which simply adapt CPU
power levels only based on workload intensity, the proposed
SLA-aware algorithm is primarily based on current application
performance relative to the pre-defined SLA. Specifically, the
algorithm targets at achieving the pre-defined SLA as the toplevel
goal, while saving energy as the second-level goal.
Optimizing JMS Performance for Cloud-based Application ServersZhenyun Zhuang
IEEE CLOUD 2012
http://dl.acm.org/citation.cfm?id=2353798
Many business-oriented services will be gradually
offered in the Cloud. Java Message Service (JMS) is a critical
messaging technology in Java-based business applications, particularly
to those that are based on the Java Enterprise Edition
(Java EE) open standard. Maintaining high performance in
the horizontally scaled, and elastic, cloud environment is
critical to the success of the business applications. In this
paper, we present practical considerations in optimizing JMS
performance for the cloud deployment, where some of the
findings may also serve to improve the design of JMS container
so it adapts well to cloud computing. Our work also includes
performance evaluation on the proposed strategies.
Capacity Planning and Headroom Analysis for Taming Database Replication LatencyZhenyun Zhuang
ACM ICPE 2015
http://dl.acm.org/citation.cfm?id=2688054
Internet companies like LinkedIn handle a large amount of
incoming web traffic. Events generated in response to user
input or actions are stored in a source database. These
database events feature the typical characteristics of Big
Data: high volume, high velocity and high variability. Data-
base events are replicated to isolate source database and
form a consistent view across data centers. Ensuring a low
replication latency of database events is critical to business
values. Given the inherent characteristics of Big Data, min-
imizing the replication latency is a challenging task.
In this work we study the problem of taming the database
replication latency by effective capacity planning. Based
on our observations into LinkedIn’s production traffic and
various playing parts, we develop a practical and effective
model to answer a set of business-critical questions related
to capacity planning. These questions include: future traffic
rate forecasting, replication latency prediction, replication
capacity determination, replication headroom determination
and SLA determination.
OS caused Large JVM pauses: Deep dive and solutionsZhenyun Zhuang
We have found many large JVM GC pauses are not caused by application itself, but by the interactions between JVM and OS. We characterize these issues into 3 scenarios: (1) application startup state; (2) application steady state with memory pressure; and (3) application steady state with heavy IO. The root causes are quite complicated, so we share our experiences about this.
//This slide deck is for Qcon Beijing 2016 talk.
Wireless memory: Eliminating communication redundancy in Wi-Fi networksZhenyun Zhuang
This document describes a proposed system called Wireless Memory (WM) to eliminate communication redundancy in Wi-Fi networks. The authors first analyze real Wi-Fi traces from multiple buildings and observe significant redundancy both between users and over time for individual users. Based on these insights, they propose WM, which equips access points and clients with memory to store transmitted data. When sending new data, the access point can retrieve stored data from the client's memory by sending a reference rather than the full data, reducing transmission size. The authors evaluate WM through simulations using the collected traces and find it can improve network throughput by up to 93% in some scenarios by eliminating redundancy.
Improving energy efficiency of location sensing on smartphonesZhenyun Zhuang
The document proposes an adaptive location-sensing framework to improve energy efficiency on smartphones running location-based applications. The framework uses four design principles: substitution replaces GPS with less power-intensive location services when possible; suppression avoids unnecessary GPS use through sensors like accelerometers; piggybacking synchronizes location requests from multiple apps; and adaptation adjusts location sensing based on battery level. An implementation on Android phones reduces GPS use by up to 98% and improves battery life by up to 75%.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
On the Impact of Mobile Hosts in Peer-to-Peer Data Networks
1. On the Impact of Mobile Hosts in Peer-to-Peer Data Networks
Zhenyun Zhuang†
, Sandeep Kakumanu†
, Yeonsik Jeong†
, Raghupathy Sivakumar†
, Aravind Velayutham§
†
{zhenyun, ksandeep, ysjeong, siva}@ece.gatech.edu, Georgia Tech, Atlanta, GA 30332
§
vel@asankya.com, 75 5th Street NW, Suite 212, Asankya Inc., Atlanta, GA 30308
Abstract
Peer-to-peer (P2P) data networks dominate Internet
traffic, accounting for over 60% of the overall traffic in a
recent study. In this work, we study the problems that arise
when mobile hosts participate in P2P networks. We pri-
marily focus on the performance issues as experienced by
the mobile host, but also study the impact on other fixed
peers. Using BitTorrent as a key example, we identify sev-
eral unique problems that arise due to the design aspects
of P2P networks being incompatible with typical charac-
teristics of wireless and mobile environments. Using the
insights gained through our study, we present a wireless
P2P (wP2P) client application that is backward compati-
ble with existing fixed peer client applications, but when
used on mobile hosts can provide significant performance
improvements.
1 Introduction
Over the last few years, peer-to-peer (P2P) data sharing
applications have experienced an explosive growth. By the
end of 2005, a staggering 60% of the Internet data traffic
constituted of P2P file sharing [5]. While copyright con-
cerns had earlier brought down popular P2P applications
such as Napster, several content owners and providers have
of late started embracing what is being seen as a technology
that has come to stay [1].
With P2P data sharing applications securing a dominant
position in the Internet landscape, an interesting question is
to ask is: what is the performance of mobile users when par-
ticipating in P2P data sharing? The question is significant
because of two reasons: (a) as with any Internet applica-
tion with emerging or established popularity, wireless and
mobile users are increasingly adopting P2P data sharing ap-
plications on devices such as laptops and PDAs [9]; And (b)
there are several efforts underway to deliver P2P data shar-
ing as the next killer application for mobile devices [17, 16].
Initial instantiations of such efforts focus on sharing of ring-
tones and music files, but are expected to evolve into other
types of content including video.
Thus, in this work, we first investigate the following
question: what is the performance of a mobile user in a
wireless environment using a P2P data sharing applica-
tion? As a corollary, we also investigate the following ques-
tion: what is the performance of a fixed peer in a P2P net-
work when using a mobile host as a corresponding peer?
In answering the above questions, we find that several of
the fundamental design principles and peculiarities used in
P2P data sharing applications are inconsistent with the key
limiting characteristics of typical wireless and mobile en-
vironments. Briefly, some of these issues include: (i) P2P
applications, unlike in typical scenarios where a mobile host
functions as a client, creates a scenario requiring the mobile
host to function as a server. This raises several implica-
tions that we discuss later in the paper. (ii) P2P data sharing
uniquely involve simultaneous bi-directional data transfer.
This consequently results in the use of bi-directional TCP,
a form of TCP not studied extensively for wireless environ-
ments. (iii) P2P data networks, by virtue of being almost en-
tirely supported by end-hosts, typically use incentives based
performance delivery. In other words, a mobile host that has
uploaded more data is provided with higher performance.
Such a mechanism exposes issues when applied as-is to a
wireless and mobile environment. (iv) While incentives en-
courage P2P users to share data longer, P2P data fetching is
also adapted to increase the uniquely shareable data avail-
able at a user. One such approach is performing random or
rarest-first fetching. However, such techniques have severe
implications to the mobile user, especially during discon-
nections. Using experiments on a real-life P2P data sharing
network, we profile the performance of a mobile user with
respect to the above issues.
Using insights gained through the aforementioned study,
we present a deployable solution suite called wireless P2P
(wP2P) that addresses the issues using changes only to the
P2P application at the mobile host. wP2P uses techniques
transparent to the fixed peer, but uniquely relevant to the
specific issues pertaining to wireless and mobile hosts func-
tioning in a P2P data network. While we elaborate on
the specifics of the solutions later in the paper, wP2P uses
a combination of multiple proposed techniques in tandem
including age based manipulation, incentive aware opera-
tions, and mobility aware fetches. We evaluate wP2P with
2. an implemented prototype, and show that significant perfor-
mance improvements can be achieved for mobile hosts and
fixed peers when using wP2P at the mobile hosts. Thus, the
contributions of this work are twofold:
• We consider the specific scenario of mobile hosts par-
ticipating in P2P data sharing applications, and investigate
performance issues such hosts face due to the unique design
elements embedded in typical P2P applications. Using real-
life experiments on a P2P data sharing network, we identify
these design elements that when combined with the unique
characteristics of wireless environments render the perfor-
mance delivered to mobile users sub-par.
• We present a deployable solution called wP2P that is
required to be instantiated only at the mobile host. And,
when deployed thus, wP2P addresses the issues identified
above to deliver enhanced P2P data sharing performance to
mobile users. Using a prototype implementation, we char-
acterize the performance of wP2P and show that consider-
able improvements can indeed be achieved.
The rest of the paper is organized as follows: Section
2 presents the scope of this work and describes key back-
ground material. Section 3 presents in detail the motivation
results that show the limiting performance existing P2P ap-
plication design impose on mobile users. Section 4 outlines
the key design basis and describes the wP2P solution in de-
tail, while Section 5 presents the performance evaluation of
wP2P. Finally, Sections 6 and 7 discuss related-work and
conclusions respectively.
2 Scope and Background
We now briefly present the scope of this work and outline
some of the key elements of the BitTorrent protocol relevant
to the focus of this work.
2.1 Scope of this work
• P2P Networks: While there are several forms of P2P
networks ranging from those that help in computing (grids)
to those that help in communication (e.g. skype) to those
that help in data-sharing, this work is entirely focused on
P2P data sharing networks. Data sharing P2P networks are
primarily used for sharing files containing audio (e.g. mp3
files), video (e.g. mpeg2 files), or data (e.g. linux distribu-
tions). Examples of such networks include BitTorrent [1],
eDonkey, Gnutella, and FastTrack. Recent study show that
P2P traffic is dominating Internet traffic and specifically, the
BitTorrent [1] P2P network accounts for 30% of the overall
Internet traffic [5]. Of this, video files account for more than
62% of the P2P traffic. Measurement studies conducted re-
cently observe far more wireless and mobile users on the
network than ever before [9].
• BitTorrent: In this work, while we identify character-
istics of P2P networks that are generically applicable to all
four of the above networks, we use BitTorrent as the pri-
mary example for all discussions, experiments, and trials.
However, as necessary we also step back and investigate rel-
evance of our discussions and interpretations for the other
networks as well. We believe that this choice of BitTorrent
as the key representative is justifiable from multiple stand-
points including its dominance in terms of traffic carried,
and its relative sophistication.
• Wireless Technologies and Mobile Devices: While mo-
bile users with any type of wireless access can participate in
P2P networks, the access technology typically used is wire-
less LANs (WLANs). This is both because of the higher
bandwidths available on WLANs, and the relatively lower
or no cost models associated with such networks. Hence,
we consider WLANs for the wireless environment in this
paper. Similarly, while other mobile devices such as PDAs
and IP enabled cellphones are fair game for assuming mem-
bership in P2P networks, we primarily consider laptops as
the mobile device in this work.
• Metrics: We consider throughput performance as the
main metric in our evaluation and optimization considera-
tions. The focus is more on the question: what is the per-
formance of a mobile host when it participates in a P2P
network? In addition, we also consider a corollary ques-
tion: what is the performance of a fixed peer when it uses a
mobile host as a peer to download data from?
2.2 BitTorrent
BitTorrent, like other P2P data sharing protocols, uses
peers that have downloaded a certain content as the sources
for the content subsequently for other peers that need the
same content. In the rest of this section, we outline some of
the key elements of the BitTorrent protocol relevant to the
focus of this work.
• Torrent: Any peer that wants to share a file through
the BitTorrent network creates a “.torrent” file that consists
of some meta data information (e.g. certificates for different
portions of the file that downloading clients can use to check
for the validity of downloads) and the address of the tracker
that will act as the directory server for the file.
• Tracker: The tracker is the entity that maintains, for
any given file that it tracks, all current peers that have the file
either in its entirety or in parts. When it receives a request
from a client for a specific file, it furnishes the client with
the addresses of the peers associated with the file. The list
of peer addresses is updated periodically to accommodate
peers leaving the network.
• Swarm: All peers currently connected to each other
(logically) in the process of downloading a particular file
form a swarm for that file. From the standpoint of a sin-
gle client, it uploads to some members in the swarm and
downloads from some members in the swarm. Because of
3. Internet
BitSpirit 3.2.215 Azureus 2.3.0.4
BitSpirit 3.2.215
BitSpirit 3.2.215
Azureus 2.3.0.4
Azureus 2.3.0.4
Peer
1
…...
Other BitTorrent Peers
Peer
2
Figure 1. Network Testbed for P2P Evaluation
the incentive policy discussed later in this section, a down-
loading client is likely to be uploading to a subset of the
members it is downloading from.
• Tit-for-Tat: BitTorrent uses a tit-for-tat incentive policy
that controls the upload rate of one peer to another specific
peer based on the download rate the peer enjoys from that
other peer.
• Rarest-first fetch: BitTorrent peers do not fetch parts
of the file in sequence. Instead, each peer picks the rarest
of the blocks (in terms of the number of peers in the swarm
that have the block) preferably to download. This ensures
that the rarest blocks of a file are propagated in the swarm
faster, reducing bottlenecks at the few peers that have the
block and increasing the availability of those blocks if the
peers that have them shutdown.
• Seeds and leeches: Seeds are peers that have a com-
plete copy of a file, and leeches are peers that have a partial
copy of the file (which typically means that the peers are
downloading other parts as they are uploading the parts they
already have).
Thus, when a peer wants to download a particular file,
it downloads the torrent file, contacts the tracker specified,
receives a list of addresses to contact, and joins the swarm
for downloads. As soon as it receives blocks of the file,
it also begins uploading to other peers that require those
blocks. When the entire file is downloaded, the peer may
decide to leave the swarm or stay back as a seed.
3 Motivation
3.1 Testbed & Methodology
In this section, we use experiments performed on a Bit-
Torrent network to study the performance of a mobile host.
We identify several design characteristics of P2P data net-
works that are incompatible with typical characteristics of
a wireless environment. We also use the insights gained
as the basis for the design of the wP2P solution presented
later in the paper. While we present all the discussions in
the context of BitTorrent, we revisit the implications of the
discussions on the other P2P networks at the end of the sec-
tion. The network testbed used in the experiments is shown
in Figure 1. The testbed consists of six locally controlled
BitTorrent peers which run popular BitTorrent clients: three
run the Azureus client 2.3.0.4 on Linux, and the other three
peers run the BitSpirit 3.2.215 client on Windows.
3.2 Bi-directional TCP
As described in Section 2, most peers in BitTorrent up-
load and download at the same time, and because of the
tit-for-tat policy used by BitTorrent, several of the uploads
are to peers from which downloads are being done. Hence,
it is common for data to be exchanged simultaneously be-
tween peers in both directions. Given that BitTorrent (or for
that matter the other P2P applications) uses TCP, and that
TCP is inherently designed to be a bi-directional protocol,
BitTorrent uses TCP in its true bi-directional mode. In other
words, a single TCP connection is used to transfer data in
both directions between the peers.
While TCP is designed to be a bi-directional transport
protocol, few extensive studies of its behavior have been
performed. More importantly, in the context of this work,
very little is understood about the behavior of bi-directional
TCP in a wireless environment. In this context, we identify
two issues with the use of bi-directional TCP by BitTorrent
centered around the behavior of TCP with respect to ACK
piggybacking and fast-retransmit under bi-directional con-
ditions.
• Piggybacking: When bi-directional TCP is used,
ACKs in the reverse path are almost always piggybacked
on the data packets being sent in the reverse direction. In
a wireless environment, where random errors rates can be
non-trivial, this potentially has an adverse impact on the
connection performance. More specifically, when ACKs are
piggybacked on data packets, the effective “length” of the
ACKs is longer than if they were sent as pure ACKs (non-
piggybacked). Hence, for the same bit error rate (BER) in a
wireless environment, the effective packet error rate (PER)
for the ACK traffic is larger. This in turn results in more
number of ACK packets being lost on the reverse path just
because they were piggybacked.
While it is true that TCP uses cumulative ACKs, and
hence is relatively robust to ACK losses, there still is a neg-
ative impact in terms of the overall throughput enjoyed by a
connection in the presence of higher number of ACK losses.
More importantly, in a P2P network peers typically have a
large number of TCP connections ongoing even for a single
swarm (BitTorrent trackers typically provide addresses of
50 peers in response to a request, but the overall swarm size
can grow to numbers greater than 500), resulting in the aver-
age congestion window size of a TCP connection to be rel-
atively small. And, it is for connections with small conges-
tion window sizes that a higher ACK loss rate can result in
a non-trivial degradation in throughput. In other words, the
download rate for a TCP connection from a particular peer
4. 0 0.5 1 1.5 2
x 10
−5
0
10
20
30
40
50
BER (Bit Error Rate)
DownloadingThroughput(KBps)
Bi−TCP
Uni−TCP
(a) Throughput comparison
0 1 2 3 4 5
0
5
10
15
20
25
30
35
Time (Seconds)
Numberofpackets
Buffer drop
Packets sent from client
(b) Uni-directional: Packets
0 1 2 3 4 5
0
5
10
15
20
25
30
35
Time (Seconds)
Numberofpackets
Buffer drop
Packets sent from client
(c) Bi-directional: Packets
Figure 2. Impact of Bi-Directional TCP
0 10 20 30 40 50 60 70 80 90
0
50
100
150
200
250
300
350
Uploading Speed Limit (vs. physical bandwidth (%))
DownloadingThroughput(KB/sec)
(a) Impact of upload: Wired
0 20 40 60 80
0
50
100
150
200
250
300
350
Uploading Speed Limit (vs. physical bandwidth (%))
DownloadingThroughput(KB/sec)
(b) Impact of upload: Wireless
0 10 20 30 40
0
20
40
60
80
100
120
140
160
DownloadedSize(MB)
Time (Minutes)
No Mobility, Uploading
No Mobility, No Uploading
Mobility, Uploading
Mobility, No Uploading
(c) Impact of incentive and mobility
Figure 3. Impact of upload traffic on downloads (a, b), Impact of incentive and mobility (c)
will be smaller just because of ACKs being piggybacked in
the reverse direction.
We set up two peers which hold different portion of
shared data, and obtain the throughput values when either
uni-TCP or bi-TCP is used. Specifically, when two peers
hold different data, they exchange data over bi-TCP. When
only one peer has the data the other needs, data are down-
loaded using uni-TCP. Figure 2 (a) presents the 5-run aver-
aged results of the download rate experienced by a peer un-
der varying conditions of bit error rate on the wireless leg.
Note that bi-directional connections will in general suffer in
throughput when compared to uni-directional connections
because of the self-contention between packets being sent
in the upstream and downstream directions. However, that
difference is captured by the data-point at BER=01
.
• Fast Retransmit: The second issue with BitTorrent us-
ing bi-directional TCP occurs during congestion. TCP’s fast
retransmit mechanism is based on the arrival of DUPACKs
(duplicate ACKs) at the sender. When bi-directional TCP
is used, TCP specifications stipulate that DUPACKs should
not be piggybacked. The reason for this stipulation is that
otherwise the sender has no way of knowing whether piggy-
backed DUPACKs are due of losses, or due to the receiver
sending multiple data packets between two data packet ar-
rivals (and hence piggybacking the same ACK sequence
number on those data packets)2
.
1While it might appear that peers are better off not uploading for this
reason, recall that BitTorrent’s tit-for-tat policy will render such a strategy
ineffective.
2Note that TCP specifications also stipulate that ALL packets except
the initial SYN packet has to have the ACK option bit set, and carry a valid
ACK sequence number.
Hence, a TCP receiver will send only pure ACKs when
DUPACKs have to be transmitted due to losses. While
this design has no issues in a wired environment, it results
in problems when performed as-is in a WLAN environ-
ment. This is because, when congestion has occurred in the
WLAN resulting in a packet drop, the DUPACKs sent back
will be explicitly de-coupled from the data stream in the re-
verse path, thus actually increasing the number of packets
in transit on the wireless leg. While it is true that the TCP
sender, when it receives the DUPACKs, will reduce its num-
ber of outstanding packets in the network by half, the new
transmissions of pure ACKs essentially offsets the decrease
in the number data-packets. Hence, as far as the wireless
leg is concerned, the number of packets in transit stays ap-
proximately the same even after a congestion event!
Figures 2 (b, c) show the number of packets sent on the
wireless leg with time for two BitTorrent connections of a
typical run, one uni-directional and one bi-directional re-
spectively. The congestion events are indicated in the same
figure (buffer drop) as well. It can be observed that while the
number of packets on the wireless leg in general decreases
after congestion events for the uni-directional connection,
this is not true for the bi-directional TCP connection. This
“mis-behavior” can potentially result in performance degra-
dation for the connections due to deviation from the in-
tended behavior of TCP’s congestion control.
We have thus far discussed the negative impact of us-
ing bi-directional TCP connections. While it is true that
the above problems will be issues for any application that
uses simultaneous data transfer using bi-directional TCP, it
is noteworthy that P2P data networks are perhaps one of
5. the few instances where such bi-directional data transfer
does happen simultaneously and in large volumes. Applica-
tions (or protocols) such as http or secure-shell, while using
bi-directional TCP, do not exercise the bi-directionality the
same way P2P networks do.
3.3 Uploads based Incentives
The tit-for-tat mechanism in BitTorrent encourages
higher rates for uploads to enjoy better download rates. In
a wired environment, it can be shown that peers enjoy their
best download rates when their upload rates are high. Fig-
ure 3(a) shows the aggregate download rate of five simulta-
neous tasks as a function of the upload rate limit in a wired
setting. The upload rate limit is represented as a fraction of
the physical link capacity3
. We observe that the download
rate is an increasing function of the upload rate limit.
However, for a wireless environment, the relationship
between the enjoyed download rate and the upload rate limit
changes. Figure 3(b) shows the aggregate download rate of
the same five tasks4
. As shown, while the download rates
initially increase with higher upload rates, beyond a much
smaller upload rate (than 80%) the download rates actually
drop. This is due to the shared channel nature of the wire-
less link, where the uploads and downloads are contending
for the same wireless channel bandwidth. This is in contrast
to a wired setting where the uploads and downloads do not
share the same bandwidth resources. The same figure also
demonstrates that shutting down the upload rates to zero is
not a solution either as the tit-for-tat strategy of BitTorrent
will kick-in punishing the peer with low download rates.
This problem of uploads contending with the downloads
also goes beyond the incentives mechanism in BitTorrent.
In a wired environment, peers have a relatively low dis-
incentive to continue as a seed once the downloads are com-
pleted with the argument being that upload bandwidth is
anyway largely unused under most conditions except for
TCP ACK traffic. However, in a wireless setting, a mobile
peer functioning as a seed can potentially impact its down-
load rates for other non P2P applications without any direct
counter-benefit for the user. While this contention between
P2P uploads and other application downloads is true even
when the mobile peer is a leech, it can be argued that the
mobile user is at least receiving the benefit of the tit-for-tat
scheme. However, when the peer converts to a seed, this
advantage no longer remains. Hence, any viable solution to
motivate mobile peers to continue as a seed has to ensure
that the uploads do not negatively affect the downloads of
other applications.
3The network is Comcast Cable High-speed Internet with 4Mbps down-
loading rate and 384Kbps upload rate.
4The network is Georgia Tech Wireless LAN 802.11G.
3.4 Incentives and Mobility
The tit-for-tat mechanism in BitTorrent is associated
with a unique identifier for the peer called the peer-id. The
peer-id is typically constructed as either a function of the
IP address of the host and a random value, or simply as a
function of a mobile host specific random value. The peer-
id is regenerated every time fetch tasks are reinitiated. Thus
when a mobile host experiences a hand-off and receives a
new IP address, the ongoing tasks are terminated and the
tasks are re-initiated 5
thus generating a new peer-id. How-
ever, since the peers track the goodness of corresponding
peers based on the peer-id, this results in the mobile peer
losing all the credit it has built with its corresponding peers.
Figure 3(c) show the effect of incentives on the download
size for a 100MB file as a function of time of a typical run.
Under the no mobility scenario, we observe that the down-
load size is lower when there is no upload traffic. This is
the normal incentive behavior. However when we introduce
mobility (IP address changes periodically) we see that the
incentive mechanism is rendered ineffective. Not only is the
actual download size lower than the no-mobility case, there
is marginal difference between the download rates with or
without uploading. This is because every time the IP ad-
dress changes, tasks are re-initiated and thus the host acts
as a new peer without any previous incentives. Thus, the
mobility of a peer can have an adverse impact on the incen-
tive mechanism of a P2P network.
3.5 Server Mobility
Peer address updates in BitTorrent happen at the gran-
ularity of tens of minutes when a peer goes back to the
tracker for an updated set of peers to use in its swarm. Even
within that period, the decision on whether to use a peer or
not for downloads is adjusted at the granularity of tens of
seconds. Note that this is understandable in a wired envi-
ronment where disconnections of peers may not occur fre-
quently. However, when a mobile peer undergoes a hand-
off or simply gets disconnected, the fixed peers who were
clients with respect to the mobile peer will continue to try
to reach the mobile peer till either the peer selection algo-
rithm chooses an alternate peer or the tracker provides al-
ternate addresses or alternate peers (in the order of several
minutes).
Figure 4(a) shows the effect of server side mobility on
the throughput performance for a fixed peer of a typical
run. The fixed peer is served by three mobile peers. The
IP address of the server is changed every fixed time interval
and the resultant throughput as enjoyed by the fixed peers
is observed. We observe that as the time interval between
5We assume here that mobile IP is not used to handle mobility due to
its slow deployment.
6. No Mobility Every 2 Min. Every 1.5 Min. Every 1 Min. Every 0.5 Min.
0
50
100
150
200
250
300
Mobility Rate
Throughput(KBps)
One peer is mobile
All peers are mobile
(a) Impact of server mobility
0 20 40 60 80 100
0
20
40
60
80
100
Downloaded Percentage (%)
PlayablePercentage(%)
(b) 5MB file
0 20 40 60 80 100
0
20
40
60
80
100
Downloaded Percentage (%)
PlayablePercentage(%)
(c) 100MB file
Figure 4. Impact of server mobility (a), Impact of rarest first fetching (b, c)
successive IP change decreases (reflecting higher mobil-
ity) the throughput falls. Furthermore, the degradation due
to mobility is amplified when the number of mobile peers
amongst the corresponding peers is increased.
3.6 Rarest-first Fetches
As outlined in Section 2, BitTorrent employs a rarest
first fetching paradigm. This results in any snapshot of the
downloaded content for a file not having any significant “in-
sequence” data from the head of the file till a large percent-
age of the file download is completed. Many media formats,
on the other hand, allow for partial playback of content pro-
vided the partial information is in sequence. For example,
for an MPEG file of a 2 hour video, the download of the first
30 minutes worth of the video will still allow for a playback
of that part of the video. Figures 4(b,c) show the playable
fraction of two files being downloaded with increasing frac-
tion of the actual downloads using rarest-fetch. The piece
length is the default value of 256 KB, and the results are
averaged over 10 runs. It can be observed that until a large
percentage of the whole file download is complete, a sig-
nificant percentage of the file still remains unplayable. For
a 5 MB file, even with a 60% download fraction, less than
10% of the file remains playable. In fact, for the 100 MB
file size scenario, more than 90% of the file size needs to be
downloaded to playback the first 2% of the video.
While this property of BitTorrent is an irritant even for a
fixed peer, it is justifiable for two reasons: (a) this enables
the peer to contribute well to the P2P network as it is likely
to have blocks that are different from those at other peers;
and (b) fixed peers do not have to concern themselves with
wireless disconnections thus ensuring that the downloads
will eventually complete and will not be in vain.
However, for a mobile peer, this property can have more
serious implications. In the example of the 100 MB file, if
the mobile peer gets disconnected from its wireless network
(and remains so) after 90% of the file has been downloaded,
the user still cannot playback more than 5% of the content.
Furthermore, the 90% of the file size downloaded thus far
using the rarest-first algorithm in the interest of the well be-
ing of the rest of the P2P network cannot be served back to
the P2P network anyway because of the disconnection!
3.7 Relevance to Other P2P Networks
Thus far, we have investigated properties of the BitTor-
rent P2P data network that negatively impact performance
of a mobile peer. While not all the properties discussed thus
far are directly relevant in the context of the other three pop-
ular P2P data networks (Gnutella, FastTrack, and eDonkey),
a majority of the issues discussed apply. This is especially
true for the other third-generation P2P network - eDonkey,
where a majority of the above issues still hold true except
for the problem with rarest first fetching. For the second-
generation P2P networks represented by Gnutella and Fast-
Track, a subset of the issues apply including the impact
of mobility on incentives, the impact of server mobility,
and the impact of uploads on downloads (for other appli-
cations).
4 Design and Solution
In this section, we outline some key design aspects of
the proposed wP2P solution that are targeted to address the
limitations of existing P2P data networks identified in Sec-
tion 3. Before we outline the design, we briefly categorize
the different limitations into problem classes where prob-
lems within a class all have a common underlying cause.
We use the categorization to then position the design ba-
sis for wP2P. The limitations identified in Section 3 can be
categorized as follows:
• Use of bi-directional TCP: While bi-directional TCP
has been in use by other applications such as http or secure-
shell, P2P data networks uniquely use bi-directional TCP
to transfer large volumes data in both directions simulta-
neously. Hence, several quirks of bi-directional TCP that
do not arise in wireless environments otherwise have to be
addressed.
• Failure of incentives: While P2P data networks heavily
rely on incentives based mechanisms to encourage peers to
contribute to the network, such mechanisms are not tailored
for the unique characteristics of wireless and mobile envi-
ronments. Specifically, the problems of upload-download
self-contention and identity loss after mobility fall under
this category of problems.
• Disconnections and fetching: The newest generation of
7. Variables
CWND: Congestion window of TCP connection
γ: Connection status threshold
STATUS: Status of the TCP connection
DUPACK CNT: Number of DUPACKs sent by MH
1 Calculate CWND of TCP connections;
2 If CWND < γ
3 Set STATUS to Y OUNG;
4 Else
5 Set STATUS to MATURE;
6 End If
7 Capture TCP packet transmitted by MH;
8 If piggybacked ACK and STATUS = Y OUNG
9 Decouple ACK from DATA; Send pure ACK;
10 If DUPACK and STATUS = MATURE
11 DUPACK CNT ++;
12 If DUPACK CNT % 4 ==0
13 Drop DUPACK;
Figure 5. Pseudo-code : Age-based Manipu-
lation
P2P data networks use multiple simultaneous fetches from
different peers and fetch blocks in a non-sequential order.
While such strategies have obvious benefits in a wired en-
vironment, they compromise performance in a wireless set-
ting. Problems that fall under this category include lack of
playable content during disconnections.
• Mobile host as a server: Unlike in other applications,
in P2P data networks, the mobile host uniquely functions
as a server that can be accessed by other peers. Hence,
several problems attributed to wireless and mobile environ-
ments that can be (and have been) solved or do not exist
when the mobile host acts only as a client either have to be
solved differently or arise newly.
In the rest of the section, we present the design basis
for wP2P in the form of three principles that address the
above four categories of problems. One key property of all
the principles we present is that they are mobile host only
changes that do not require any support from the fixed peers,
and are fully backward compatible with already existing
versions of the P2P (BitTorrent) protocols. Also, we present
any specific implementation details with respect to the Bit-
Torrent protocol. However, all the solutions presented are
purely local to the mobile host and backward compatible
to all existing BitTorrent P2P client applications on fixed
peers.
4.1 Age-based performance optimization
The bi-directional TCP problem arises because of spe-
cific quirks of the TCP design and how they relate to the
wireless environment. However, at the same time, bi-
directional TCP’s performance otherwise is desirable since
it eliminates ACK overheads under normal conditions. In
other words, the solution to the problems with bi-directional
TCP is not to switch back to dual unidirectional TCP con-
nections as that would render the overall performance worse
than when using bi-directional TCP as pure ACKs in both
directions consume precious bandwidth resources.
In this context, the Age-based Manipulation (AM) de-
sign principle of wP2P involves the adaptive manipula-
tion of the bi-directional TCP connections for better perfor-
mance. Essentially, recalling the discussion on ACK loss
rates in Section 3, an argument can be made that TCP’s
throughput performance is vulnerable to ACK losses only
when the congestion window is small. At larger congestion
windows, the higher ACK loss rates do impact progress,
but not significantly. Hence, under age-based manipulation,
explicit conversion of piggybacked ACKs to pure ACKs is
performed when the connection congestion window (cwnd)
is small6
and piggybacked ACKs are let through as-is when
the congestion window is larger than a threshold7
.
Similarly, the use of pure ACKs during fast retransmit
and the associated wireless link overload is addressed by
throttling the number of packets down explicitly such that
the total number of packets, including the pure DUPACKs,
outstanding amounts to half the number of outstanding
packets before the congestion detection. This is performed
by explicitly dropping one-fourth of the DUPACKs in the
reverse path during the first round-trip time after the first
DUPACK is generated. For example, if the cwnd is 100
on congestion detection (assume one packet loss), 99 DU-
PACKs will be generated by the receiver. If one-fourth of
the DUPACKs are dropped, approximately 24 DUPACKs
will be dropped resulting in 75 DUPACKs reaching the
sender. The sender, when it performs fast retransmit and
fast recovery, will thus send out 25 ((100/2)+75-100) new
packets. Thus, even if the 25 new packets generate 25 pure
DUPACKs (assuming the receiver still is in loss recovery),
that amounts to a total of 50 total packets equalling half of
the number of packets outstanding before congestion detec-
tion.
The pseudo-code for the AM component of wP2P so-
lution is listed in Figure 5. First the AM component con-
stantly monitors the congestion window of the TCP con-
nection and if the current connection congestion window is
less than a specified threshold value γ (set to 6 in our eval-
uations as suggested in [10]), the connection status is set to
YOUNG (Line 3). If the congestion window is greater than
the threshold γ, the connection status is set to MATURE
(Line 5). The AM component also maintains state about the
TCP connection and captures TCP packets transmitted by
the mobile host. If the connection status is YOUNG, the AM
module conveys any new ACK information piggybacked on
DATA packets transmitted by the mobile host as separate
6Note that although this manipulation is done at the receiver, standard
techniques exist to track the sender congestion window at the receiver.
7A straightforward value for the threshold is 6 as it can be shown that
congestion windows less than 6 are highly vulnerable to losses in either
direction [10].
8. Variables
Umax: Maximum upload limit
Ucur, Uprev: Current, previous upload state
Dcur, Dprev: Current, previous download state
α, β: Upload increment and decrement factor
Udec cnt: Upload decrement count
Initialization
1 Ucur = Uprev = 0.5*Umax;
2 Dcur = Dprev = 0; Udec cnt = 0;
Update
3 Determine current P2P download rate and store;
4 If Dprev <> 0
5 If Dprev < Dcur
6 Ucur = Ucur + α; Udec cnt = 0;
7 Else
8 Increment Udec cnt; Ucur = Ucur − β ∗ Udec cnt;
Figure 6. Pseudo-code : Incentive-Aware Op-
erations
pure ACKs (Line 9). This achieves better robustness for
the ACKs given a finite error rate in the wireless channel.
The AM component also detects losses experienced by the
TCP connection and performs the following operation dur-
ing loss recovery. If the status of the connection encounter-
ing loss is MATURE, the AM module drops one DUPACK
every four DUPACKs (Line 13).
4.2 Incentive-Aware operations
The problem of failure of incentives stems from the two
distinct conditions of the self contention in a wireless link
and mobility related identity loss. The Incentive-Aware op-
erations (IA) principle in wP2P is used to address both
problems. Essentially, one technique under incentive aware
operations in wP2P involves the adaptation of the upload
rate in order to find the smallest upload rate possible to
achieve the maximum download rate. While this value for
the upload rate is trivial to determine in a wired setting, a
more sophisticated algorithm is required in a wireless envi-
ronment.
Since a wireless host uses a shared channel, the upload
and download traffic contend with each other and hence in-
creased uploads might reduce the downloads possible. In
order to strike the optimal balance between the two compet-
ing issues (incentives and self-contention) wP2P performs a
Linear Increase History-based Decrease (LIHD) algorithm
that adapts the uploading rate to an optimal value. The intu-
ition behind the LIHD algorithm is that while increasing the
upload rate, it is better to be conservative so that the mobile
host does not upload more than necessary. At the same time
while reducing the uploads it is desirable to be aggressive.
LIHD hence increases upload rates linearly when there is
a positive correlation between the uploads and downloads,
while decreasing the upload rates with increasing aggres-
siveness when decreasing the uploads does not cause a de-
crease in the downloads.
The Incentive-Aware (IA) component monitors upload
and download rates achieved by the P2P application. The
IA component uses window-averaged throughputs to deter-
mine the upload rate control of the P2P application. It con-
trols the upload rate in a way as to optimize the downloads
achieved by the mobile host. While the incentive mecha-
nism requires a peer to upload as much data as possible, the
wireless connection restricts the amount of uploads in or-
der to maximize the downloads. Thus in order to achieve
optimal performance we need to operate at the peak of Fig-
ure 3(b). If the download rate in the current time window
is greater than the download rate achieved in the preced-
ing time window, then the IA component increments the
upload-rate counter (Line 6 in Figure 6). On the other hand,
if the download rate in the current time window is less than
the previously recorded download rate, then the upload rate
counter is decremented by a value proportional to the num-
ber of consecutive cutdowns of the upload rate (Line 8 in
Figure 6). This procedure achieves the optimal trade-off
between incentive driven P2P downloads and wireless con-
tention of the uplink and downlink transmissions.
LIHD can also be used for controlling the rate of up-
loads when the mobile peer becomes a seed, such that the
uploads do not impact negatively any of the downloads be-
ing performed by other non-P2P applications on the mobile
peer. We do not consider this aspect of the mechanism in
this paper, and leave it for future work.
Another technique wP2P uses that falls under this design
principle is identity retention across hand-offs and within
the same swarm. The rationale for generating uniquely dif-
ferent peer-ids in BitTorrent is to be able to identify and
distinguish between clients with the same IP address (say,
if the clients are behind a NAT), but at the same time con-
fine the benefits of incentives accumulated by a peer to only
that swarm in which the peer contributed. Since the typical
scenario for task initiation in wired environments is when a
peer wants to download another data file, generating a new
peer-id is reasonable. However, in mobile environments
task re-initiations can occur just because IP addresses have
changed. wP2P, in this context, performs identity retention
within a swarm, whereby even when task re-initiation is per-
formed, as long as it is for a swarm the mobile peer was a
member of before, the old peer-id is retained. This enables
the mobile peer to leverage its previously accumulated in-
centives. Thus, IA component stores the peer ID of the mo-
bile host when the application is started and when there is
IP layer handoff, the IA component restores the stored peer
ID to maintain incentives.
4.3 Mobility-Aware operations
In Section 3 we observed how in a mobile peer (as a
client) mobility can impact the performance of downloads
in BitTorrent. In this context, wP2P uses a Mobility-Aware
9. operations (MA) principle to deal with the problems associ-
ated with mobility. MA consists of two techniques, namely
Mobility-aware Fetching and Role Reversal.
• Mobility-aware fetching (MF): This technique explic-
itly controls how data is fetched. The mechanism is that of
exponentially increasing altruism or exponentially decreas-
ing selfishness. Essentially, a mobile peer fetches blocks in
sequence with a probability ps (=1 − pr), and fetches the
rarest-first block with a probability pr. This probability Pr
is a function of the network stability of the mobile host as
measured by the amount of time elapsed since the last net-
work disconnection of the mobile host (or the start of the
download). During the initial phases of the download, the
mobile peer uses a small value (say, 20%) for pr, and expo-
nentially increases pr as it downloads increasing fractions
of the total file.
The rationale for this design is as follows: during the
initial stages of downloads, if the mobile host gets discon-
nected, there is no benefit due to the rarest-fetch mecha-
nism either for the mobile host (in terms of playability) or
to the P2P network (in terms of availability). Hence, it is
more desirable to fetch sequentially. However, as the mo-
bile host stays connected for a longer period of time, its
utility to the P2P network has more stability and hence it
is more meaningful to have available rare blocks. Further-
more, if the mobile host now gets disconnected, the user still
has a considerable portion of the data in-sequence for play-
back. Thus, This mobility-aware adaptive content fetching
achieves a more desired tradeoff between sequential content
availability for disconnected usage of content and usability
of content for other peers to download.
• Role Reversal (RR): The mobile host as a server prob-
lem primarily impacts connections when the mobile host
moves and hence undergoes an IP address change. In this
context, the role reversal technique involves the mobile host
switching its role to that of a client to address the above
problems. Note that the fact that a mobile host switches to
acting as a client will not have any impact on the mobile
host still serving content to the peers it connects to as peers
can serve traffic irrespective of whether or not they initiated
the connection.
RR technique of MA component monitors the IP ad-
dress of the wireless interface. If it detects a change in
the IP address, RR will: (i) stores all the corresponding
peers with which P2P TCP connections have been estab-
lished, (ii) transmits application termination messages to all
the stored peers, and (iii) issues application setup messages
to the stored peers.
4.4 Integrated Operations
For a particular connection, all the three components of
the wP2P framework work in tandem to achieve optimal
performance. We can classify the operation of the compo-
nents with respect to the different periods of the P2P con-
nection, as illustrated in Figure 7. After the connection is
setup, Age-based Manipulation component kicks in during
early stages of the connection. It also works during con-
gestion recovery periods and after reconnection in case of
mobility. The operations of the Incentive-Aware component
are performed during steady-state of the TCP connections.
Finally, the Mobility-Aware operations component is active
during the steady-state period of the TCP connection and
also after IP address change due to reconnection.
Connection
Setup
Age-based
Manipulation
Congestion
Age-based
Manipulation
Mobility-aware Operations
Mobility
Handoff
Re-Connect
Age-based
Manipulation
Incentive-aware Operations
Mobility-aware Operations
Incentive-aware Operations
Time
Figure 7. Integrated operations
5 Evaluation
5.1 Implementation
We use a prototype implementation of wP2P that is built
as an enhancement to the CTorrent client version 1.2 [2].
CTorrent is a lightweight C++ implementation of BitTor-
rent protocol with about 10K lines of code. All the three
components of wP2P are implemented by modifying the
source code of CTorrent and adding a separate module
which works with a packet filtering utility widely avail-
able in Linux distributions. In particular, the Incentive-
Aware Operations and Mobility-Aware Operations compo-
nents are implemented by directly modifying the CTorrent
source code, and the Age-based Manipulation component is
realized with the assistance of Netfilter utility [3]. We now
describe the network setup of our implementation followed
by descriptions of the three individual wP2P components.
• Network Setup: We use two wireless clients on a
popular BitTorrent network to compare the performances
of wP2P with a default version of BitTorrent. One of the
clients has the modified CTorrent version and the other has
a plain vanilla version of the CTorrent (we call this as the
default client). Linux machines connected to the Internet
through ns-2 based wireless emulators are used for the two
clients. An illustration of the network setup is shown in
Figure 10. We use ns-2 emulation to study the impact of
various issues of wireless environments like random wire-
less losses, mobility and bandwidth. We emulate random
wireless losses using random bit errors. We emulate mo-
bility by changing the IP addresses of the clients using the
“ifup/ifdown” commands in Linux. We also monitor the
bandwidth consumed at each client to enforce bandwidth
limitations.
10. • Age-based Manipulation: The operations of this com-
ponent require the determination of age of the connection.
The determination is based on the measurement of current
congestion window. Since the information of congestion
window typically is not available to the application itself,
the realization of this component has to obtain such infor-
mation from certain networking entities. Specifically, we
choose Netfilter utility to assist the implementation of the
component partly due to its wide deployment in Linux dis-
tributions. A module in the user space keeps track of the
amount of data sent by the remote peer in every round trip
time (rtt), and uses the current value as an estimate of that
peer’s TCP congestion window for the next rtt. We chose
a congestion widow of size 9k bytes (approximately 6 full
packets) as an indicator of the age of the flow. If the window
size is less than the threshold, the connection is considered
to be young, and TCP ACKs are decoupled from the data
packets. Otherwise, the connection is set as mature, and the
packets are sent as such without modifications.
• Incentive-Aware Operations: This component em-
ploys two techniques: identity retention and Linear Increase
History based Decrease (LIHD) rate control. For the first
technique a static peer ID is used in lieu of a randomly gen-
erated peer ID every time the IP address changes. For the
second technique we modify CTorrent’s in-built capability
to control upload and download limits. The default CTor-
rent client allows uses to specify the upload and downloads
limits. We modify it to allow the adaptive LIHD rate control
algorithm described in the previous Section. We use band-
width monitors to check the current upload and download
rates for the algorithm.
•Mobility-Aware Operations: The basic CTorrent client
does not implement the rarest first fetching algorithm com-
monly used by BitTorrent clients. Hence we first implement
the rarest first fetching algorithm for the default client. We
then modify this algorithm to include sequence information
and awareness of download progress. Specifically as de-
scribed in Section 4, at the start of the download higher
probability is given for low sequence numbered pieces as
opposed to high sequence numbered ones. As the download
progresses, the default rarest first search algorithm gains
prominence. The Role reversal technique aids in fast recov-
ery from disconnections caused by mobility. Change of IP
addresses induced by mobility will render all existing con-
nections unusable thus making the BitTorrent client lose all
live peers. The wP2P client monitors the number of live
peers, and infers mobility by the lack of any live peer. Once
mobility is detected, the client will immediately attempt to
build new connections to remote peers to resume serving
data.
Internet
C2
P1
Pn
…...
Default
Ctorrent Client
BitTorrent
Peers
C1
wP2P
Ctorrent Client
P2
Wireless
Emulator
Wireless
Emulator
Figure 10. Testbed used in evaluation
5.2 Evaluation of wP2P
We now look at the effectiveness of the specific mecha-
nisms employed by wP2P to address the limitations of de-
fault BitTorrent clients in wireless environments.
5.2.1 Use of Bi-directional TCP
wP2P addresses the problems of Bi-directional TCP in
wireless environments using the AM component. We study
the impact of this component under varying random loss
conditions emulated by varying the BERs ranging from
1e − 6 to 1.5e − 5. Initially we setup a single seed for
a 100MB file and use the two CTorrent clients as leeches.
We allow each of the leech to initially download about 50%
from the seed (and the other leech). We then remove the
seed so that any further data transfer is just between the two
leech peers.
We compare the download rates observed by the two
leech peers for five runs and show the averaged results in
Figure 8(a). We observe that wP2P outperforms the default
CTorrent under all bit error rates because decoupling ACKs
result in smaller ACK losses for the connection, and in turn,
larger throughput. Specifically, with all the four BER val-
ues, wP2P achieves about 20% more throughput.
5.2.2 Failure of Incentives
As discussed in the previous Section identity retention and
LIHD rate control address the issue of failure or loss of
incentives. To evaluate identity retention we use the two
CTorrent clients to simultaneously download a Fedora-
7-KDE-Live-i686.iso (http://torrent.fedoraproject.org/) im-
age, a 688MB file shared among more than two hundreds
peers when our experiments were conducted. The IP ad-
dresses of the two clients are changed every one minute to
emulate mobility. Figure 8(b) shows the total downloaded
size of a typical run for these two peers. The downloaded
size is plotted as a function of time. For the default client
whenever incentives are lost the download rate is reset to
the initial nominal value unlike in wP2P where the incen-
tives are maintained. Hence we find a higher downloads
for wP2P compared to the default for the same time. After
50 minutes of download we observe that wP2P downloaded
about 100MB more than the default.
11. 1.0e−6 5.0e−6 1.0e−5 1.5e−5
0
5
10
15
20
25
30
35
Bit Error Rate
Throughput(KBps)
Default P2P
wP2P
(a) Age-based manipulation
0 10 20 30 40 50
0
100
200
300
400
500
Downloading Time (Minutes))
DownloadedSize(MB)
Default P2P
wP2P
(b) Maintaining peer ID
50 100 150 200
0
20
40
60
80
100
Physical Wireless Bandwidth (KBps)
DownloadingThroughput(KBps)
Default P2P
wP2P
(c) LIHD
Figure 8. Age-based manipulation (a), Incentive-aware operations (b, c)
0 20 40 60 80 100
0
20
40
60
80
100
Downloaded Percentage (%)
PlayablePercentage(%)
Default P2P
wP2P
(a) Mobility-aware Fetching (5 MB)
0 20 40 60 80 100
0
20
40
60
80
100
Downloaded Percentage (%)
PlayablePercentage(%)
Default P2P
wP2P
(b) Mobility-aware Fetching (100 MB)
Every 6 Min. Every 4 Min. Every 2 Min.
0
5
10
15
20
25
Mobility Rate
UploadingThroughput(KBps)
Default P2P
wP2P
(c) Role-reversal
Figure 9. Mobility-aware Fetching (a, b), Role reversal (c)
To evaluate the benefits of LIHD we vary the bandwidth
of the wireless emulator from 50KBps to 200KBps. Figure
8(c) shows the averaged results over 10 runs for the case
when α = β = 10KBps (refer to Section 4 for defini-
tions of α and β). We observe that, initially as the available
bandwidth increases both wP2P and the default client show
increased download throughputs, but beyond a certain point
the default client starts losing achieved throughput. With
a bottleneck bandwidth of 200KBps we observe that wP2P
outperforms the default by as much as 70%.
5.2.3 Disconnections and Fetching
Figures 9 (a) and (b) show the results of the Mobility-Aware
Fetching technique for different file sizes of the content be-
ing downloaded and compare them against the default rarest
first fetch algorithm. The results are averaged over 20 runs.
In these experiments we set the value of pr (the rarest first
fetching probability) to be equal to the downloaded percent-
age of file. Figure 9(a) shows the result of a 5 MB file.
We observe that MF can achieve significantly better perfor-
mance compared to the default. For instance when 50%
of the data has been downloaded, MF can result in about
30% of playable content while the default rarest first tech-
nique can achieve only about 5%. The improvements are
even more prominent when the file size increases (20% as
opposed to only 0.5% for the same 50% download).
5.2.4 Mobile host as a server
To evaluate the role reversal technique we setup two mo-
bile seeds in the above mentioned swarm(for the Fedora-
7-KDE-Live-i686.iso image). Again we emulate mobility
by changing IP address. Figure 9(c) shows the 10-run av-
eraged uploading throughput of the two clients with differ-
ent disconnection rates (i.e., rate of change of the IP ad-
dress). As the rate of connection disruptions increases the
upload throughput naturally drops. The role reversal tech-
nique of wP2P allows the client to achieve far more up-
load rates when compared to the default client. We observe
that with increasing rate of disruptions the performance im-
provement of wP2P is higher. This is because when there
are frequent disruptions, the re-establishment time for de-
fault P2P becomes a significant factor, whereas in wP2P
the re-establishment time is reduced. We observe improve-
ments of up to 50% in wP2P when connections are dis-
rupted every 2 minutes.
6 Related Work
P2P Enhancements: There are several works in related
literature that propose to improve performance in P2P sys-
tems. Among them, there is a significant amount of work
that focuses on incorporating better incentive schemes to
encourage cooperative behavior and penalize free riders.
Reputation based trust systems ([18] [7] [13]) and key shar-
ing protocol ([21]) are works in this category and these work
try to prevent non-contributing nodes from gaining unde-
served benefits from the system. Other work ([19], [14])
design mechanisms to generate unique peer IDs that fea-
ture desired properties. Some work ([15, 4, 12]) analyze the
performance characteristics of the BitTorrent protocol. In
comparison with these works, our work is focused on the
unique challenges arise as mobile hosts join the p2p net-
works. These challenges are not seen in fixed hosts and
in wired networks. For instance, we deal with the incen-
12. tive loss problem experienced by mobile hosts instead of
proposing a new incentive mechanism.
Recently more and more p2p users go mobile and are
connected with wireless links. The authors in [9] analyze
the traffic pattern of a well established 802.11 WLAN net-
work and show that P2P traffic including P2P data sharing
and streaming has increased dramatically. The authors in
[6] propose a cross-layer optimization of Gnutella for de-
ployment in purely mobile ad hoc networks. Our work on
the other hand looks at the effect of mobile peers on an ex-
isting P2P network.
Other Related Work: [20] addresses the issue of mobility
in an ongoing transport connection by providing transparent
network connection mobility using reliable sockets (rocks)
and reliable packets (racks). [8] designs a mobility-aware
file system for partially connected operation. Specifically,
it allows applications to maintain consistency on only the
critical portions of its data files. In [11] the authors design
an algorithm to select a new resource provider for mobile
peers when mobility disconnects remote peers. In compar-
ison, our work looks at issues faced by generic P2P data
sharing applications on mobile hosts, identifying a variety
of challenges that arise when mobile hosts join the P2P net-
works and act as P2P server.
7 Conclusions
In this paper we investigated the issues with using mobile
hosts as peers in a P2P network. We identified several in-
sights into the issues such hosts face using a real-life BitTor-
rent P2P data network. We proposed a solution called wP2P
that significantly improves performance and also evaluated
the solution using a real life implementation as an extension
of the CTorrent client.
References
[1] BitTorrent. http://www.bittorrent.org/.
[2] Enhanced CTorrent, a lightweight C++ implementa-
tion. http://www.rahul.net/dholmes/ctorrent/.
[3] Netfilter project. http://www.netfilter.org/.
[4] A. Bharambe, C. Herley, and V. Padmanabhan. Under-
standing and deconstructing bittorrent performance.
In ACM SIGMETRICS 2005.
[5] CacheLogic, http://www.cachelogic.com/home/pages/
research/p2p2005.php. Peer-to-Peer in 2005, 2005.
[6] M. Conti, E. Gregori, and G. Turi. A cross-layer op-
timization of gnutella for mobile ad hoc networks. In
MobiHoc ’05, pages 343–354, 2005.
[7] C. Dellarocas. Immunizing online reputation report-
ing systems against unfair ratings and discriminatory
behavior. In EC ’00: Proceedings of the 2nd ACM
conference on Electronic commerce, pages 150–157,
New York, NY, USA, 2000.
[8] D. Dwyer and V. Bharghavan. A mobility-aware file
system for partially connected operation. ACM Oper-
ating Systems Review, 31(1):24–30, Jan. 1997.
[9] T. Henderson, D. Kotz, and I. Abyzov. The changing
usage of a mature campus-wide wireless network. In
MobiCom ’04, pages 187–201, New York, NY, USA,
2004.
[10] H.-Y. Hsieh, K.-H. Kim, and R. Sivakumar. On
achieving weighted service differentiation: An end-to-
end perspective. In Proceedings of IEEE International
Workshop on Quality of Service (IWQoS), 2003.
[11] C.-M. Huang, T.-H. Hsu, and M.-F. Hsu. A file discov-
ery control scheme for p2p file sharing applications in
wireless mobile environments. In ACSC ’05: Proceed-
ings of the Twenty-eighth Australasian conference on
Computer Science, pages 39–47, 2005.
[12] A. Legout, N. Liogkas, E. Kohler, and L. Zhang. Clus-
tering and sharing incentives in bittorrent systems. In
ACM SIGMETRICS 2007.
[13] Q. Lian, Z. Zhang, M. Yang, B. Y. Zhao, Y. Dai, and
X. Li. An empirical study of collusion behavior in the
maze p2p file-sharing system. In IEEE ICDCS, 2007.
[14] L. Lu, J. Han, L. Hu, J. Huai, Y. Liu, and L. M. Ni.
Pseudo trust: Zero-knowledge based authentication in
anonymous peer-to-peer protocols. In IPDPS, 2007.
[15] D. Qiu and R. Srikant. Modeling and performance
analysis of bit torrent-like peer-to-peer networks. In
ACM SIGCOMM 2004.
[16] Ringtonia, http://www.ringtonia.com/. Melodeo’s mo-
bile phone P2P to launch.
[17] Roadcasting, http://www.roadcasting.org/. A new type
of radio.
[18] M. Srivatsa, L. Xiong, and L. Liu. Trustguard: coun-
tering vulnerabilities in reputation management for
decentralized overlay networks. In WWW ’05, 2005.
[19] K. Wei, Y.-F. Chen, A. J. Smith, and B. Vo. Whopay:
a scalable and anonymous payment system for peer-
to-peer environments. In IEEE ICDCS, 2006.
[20] V. C. Zandy and B. P. Miller. Reliable network con-
nections. In MobiCom ’02, 2002.
[21] Z. Zhang, S. Chen, and M. Yoon. March: A distributed
incentive scheme for peer-to-peer networks. In IEEE
INFOCOM 2007, Anchorage, Alaska, USA, 2007.