Search

In this paper we analyze the anonymous reports provided by our Android based BitTorrent client called DrTorrent. This application is available for free and is a full featured torrent client. The reports allow us to analyze the usage patterns typical for mobile torrent clients. As the mobile devices have some special properties like processing power, energy, and bandwidth limitations, the behavior differs from the traditional desktop clients. Beside the several statistics on for instance the sizes of accessed torrents and download times, we present parametric estimation models for the number of peers for a given torrent, and for the rate of peers which can be successfully connected to. This research can be considered as a pioneer work in the field of analyzing large peer-to-peer networks in modern mobile environments. The described measurement results enable to understand the mobile BitTorrent behavior in details and the proposed models can be used also as a base model for designing other mobile peer-to-peer services. [ABSTRACT FROM PUBLISHER]

Rendering is a crucial process in the production of computer generated animation movies. It executes computer programs to produce series of images which will be sequenced into a movie. However, rendering process on a single machine can be tedious, time-consuming and unproductive, especially for 3D animation. To resolve these problems, animation rendering is commonly carried out in a distributed computing environment where the rendering is distributed to a number of computers. As a result, efficient handling of such distributed animation rendering becomes a major challenging research to increase performance and reduce cost for numerous animation industries. In this paper, we describe the design and implementation of BitTorrent File System (BTFS) used to improve the communication performance of distributed animation rendering. The BTFS efficiently and transparently provides data sharing among distributed computers in a peer-to-peer manner to reduce the data access time for any rendering software. The experimental results and evaluation are verified as a proof-of-concept of our architecture. Some interesting future enhancement is also discussed. [ABSTRACT FROM PUBLISHER]

BitTorrent (BT) is a widely used P2P file-sharing system, and its performance is a hot research topic. It is important to design an efficient BT topology measurement system for BT performance research. Some studies use the BT clients to collect the information of BT topology, which may be incomplete due to their limitation. In this paper, combining the passive and active approaches, we design a BT topology measurement system. We evaluate the peer coverage ratio by comparing the number of nodes achieved by the measurement system with that registered to the tracker. And we evaluate the connection coverage ratio by comparing the connection number extracted from PEX messages with that of BT clients. The results show that the average peer coverage ratio can reach above 95%, which is much higher than that of μTorrent, and the connection coverage ratio reaches above 90%. Overall, the performance of our measurement system is better than that of BT clients. [ABSTRACT FROM PUBLISHER]

Video-on-demand (VoD) is today's standard for viewing and sharing video content over the Internet. However, the conventional client-server approach to video on demand consumes a significant amount bandwidth, pushing content publishers and content delivery networks to examine other approaches such as the use of peer-to-peer (P2P) technologies to assist in video distribution. We studied the performance impact of peer localization strategies aimed at limiting traffic exchanges between autonomous systems (ASes), and our findings suggest that peer localization can improve streaming performance while reducing inter-AS traffic, to the potential benefit of users and providers, respectively. Using a hybrid adaptive localization strategy (HALS), we allow external peers into a local mix when a swarm is outside its peak, in order to ensure a steady supply of pieces and to maintain structural robustness. Though HALS introduces additional inter-domain traffic compared to a purely localized approach, its download performance is at par or slightly better, while further reducing the content publisher's total upload volume. [ABSTRACT FROM PUBLISHER]

The Peer-to-Peer (P2P) file sharing system is one of the most widely-used P2P applications. Its traffic represents about 60%~80% of the whole Internet traffic. BitTorrent is a representative P2P file sharing system. In such systems, the schemes of choosing neighbors and selecting pieces are mainly based on the knowledge of overlay topologies, without considering the underlying Internet topology, which may lead to too much inter-ISP (Internet Service Provider) traffic and serious performance degrading of the whole systems. To overcome these problems, we design a new scheme to improve the performance of BitTorrent-like P2P file sharing systems, inspired by the idea of Application Level Traffic Optimization (ALTO). Firstly, we propose a novel approach to make BitTorrent node aware of the topology of underlying networks. Then we modify BitTorrent's original algorithms and replace them with three new localized algorithms based on autonomous system (AS) hops. Finally, we conduct comprehensive experiments to verify the correctness and effectiveness of our scheme based on the General Peer-to-Peer Simulator (GPS). The simulation result shows that, with our scheme, nodes in BitTorrent-like systems have better sense of the topology of their underlying networks, and can interact more efficiently. Besides, our scheme can help to decrease inter-AS or inter-ISP traffic, optimize traffic distribution across the whole networks, and improve the quality of experience of P2P users. [ABSTRACT FROM PUBLISHER]

BitTorrent (BT) is one of the most popular Peer-to-Peer (P2P) network applications. Most characteristics (except the topology) of BT network have been examined extensively by measurement approaches. In this work, we deploy a measurement system to study the performance-related properties of BT topologies. We also use our measurement system to verify some previous simulation and experiment results obtained by other researchers. Different from previous results, we observe that a BT swarm has short distance, low clustering coefficient and Gaussian-like degree-frequency distribution. This indicates that a BT swarm is very close to a random network rather than a scale-free network or a small world. We observe that the diameter of a BT network at the initial stage is small even when 95% of peers use the peer exchange extension but the networks are not fully connected at the steady stages. [ABSTRACT FROM PUBLISHER]

In this paper, we evaluate the energy consumption of BitTorrent based peer to peer (P2P) content distribution systems in bypass IP/WDM core networks and compare it to client-server (C/S) systems. A Mixed Integer Linear Programming (MILP) model is developed to carry out the comparison. Our results for homogeneous peers with similar upload capacities show that the original BitTorrent, based on random peer selection, has comparable energy consumption to the C/S model. The results also reveal that the power-minimized BitTorrent model achieves 30% energy savings compared to the C/S model as it converges to locality. Furthermore, a heterogeneous BitTorrent system with two upload capacity classes is investigated and the results show a 50% reduction in energy consumption compared to a C/S model. For real-time implementation, we develop a simple heuristic based on the model insights. Comparable power savings are achieved with a reduction of only 13% in the download rate. [ABSTRACT FROM PUBLISHER]

With the proliferation of the use of peer-to-peer networks for distributing multimedia and software content, there is an increasing need for efficient and reliable data distribution mechanisms that can scale to large numbers of users. The peer-to-peer protocol BitTorrent is scalable and is widely used to share content. The lack of reputation techniques in BitTorrent makes it impossible to get any information about how reliable a peer is. In this paper, we propose a secure and reliable architecture for reputation in BitTorrent. Our framework allows a peer to securely share its feedback about another peer after a transaction. Then, allow other peers to securely retrieve this information when required. Furthermore, we discuss how secure our system is by studying how it protects against the well knows peer-to-peer attacks. [ABSTRACT FROM PUBLISHER]

With the popularity of the P2P applications in the Internet, the study of the P2P file-sharing system becomes more important. BitTorrent is a preliminary and the most successful P2P file-sharing application in the Internet, and has all the typical characteristics of the P2P file-sharing systems. In this paper, we propose a dynamic model of BitTorrent-like P2P File-Sharing System. The model describes the P2P file-sharing system in the microcosmic view by defining a novel state. The state is used to describe the evolution of the interaction between peers of the system. Through the model, we will know how some central policies influence the system. These policies include peer selection policy, piece selection policy, bandwidth allocation policy and peer choking policy. Finally, some experiments are designed to validate the model. [ABSTRACT FROM PUBLISHER]

P2P networking is a popular technology for sharing large files efficiently without using powerful servers. The goal for a P2P file sharing application is to minimize the download time experienced by the peers. However, the efficiency of a P2P network comes at the expense of excessive network utilization. ISPs want to control the network utilization of P2P applications, and in particular it is desirable to minimize the inter-ISP traffic. The often contradicting interests of applications and network owners have led to the search for an ISP-friendly P2P application that reduces inter-ISP traffic while maintaining the high file-sharing efficiency. Existing solutions propose to localize most of the P2P traffic within the ISP, while randomly selecting a few external peers to ensure the global spread of content. However, these proposals disregard the inherent randomness that will naturally exist in P2P systems. In this paper, we analyze the different sources of inherent randomness in ISP-friendly P2P systems, and show that they can have a significant impact on performance, and therefore must be taken into account when designing new solutions. [ABSTRACT FROM PUBLISHER]

Private BitTorrent community (PT), as known as "BitTorrent Darknet", has become a popular research spot in recent years. PTs can provide ultra-high download performance which is much better than public BitTorrent communities. The Sharing Ratio Enhancement (SRE) mechanism is the key to PTs' success. However, it also brings negative side effects to the registered users in PTs. In this paper, we crawl and analyze all of user profiles from three influential PTs which provide very detailed information. We show that the sharing ratio of members cannot represent their upload contribution in terms of upload time and amount. Members are forced to seed for a long time to maintain adequate sharing ratios to survive in the community. SRE mechanism's nature drawbacks induce inequity. Based on these measurements, we propose a unified two-track payment system to pay peers based on their contribution, which is an alternative mechanism to SRE. We consider the payment with inflation and transit process. Our systems can provide a fair and consistent environment, which is helpful to unify and to build sustainable development of private BitTorrent communities. [ABSTRACT FROM PUBLISHER]

With the proliferation of the use of Internet for distributing multimedia and software content, there is an increasing need for efficient and reliable data distribution mechanisms that can scale to large numbers of users. The peer-to-peer protocol BitTorrent is scalable and is widely used to share content. The lack of reputation techniques in BitTorrent makes it impossible to get any information about how reliable a peer is. In this paper, we propose a secure framework for reputation in BitTorrent. Our framework allows peers to securely share their opinions (votes) about a peer after a transaction, then securely retrieve this information when required by another peer. [ABSTRACT FROM PUBLISHER]

While BitTorrent was originally conceived as a Peer-to-Peer file exchange protocol, it has proved extremely successful for asynchronous content distribution, allowing content sources to support huge numbers of users with a modest amount of bandwidth. This has prompted many researchers to study the possibility of using BitTorrent to support real-time media streaming. In this paper we present a comparison of three proposed adaptations to BitTorrent for media streaming, using our detailed packet-level BitTorrent simulator. Unlike previous evaluations which assumed that the streaming media player would drop data that did not arrive on time, in this paper we use a more realistic model where the player stalls when data are not available, thus placing emphasis on delays rather than losses. Our experiments indicate that under this, more realistic, evaluation model, user level performance can be quite reasonable. [ABSTRACT FROM PUBLISHER]

Inspired by the success of BitTorrent in peer-to-peer (P2P) file sharing, many research groups have proposed extensions of BitTorrent to enable P2P video delivery over the Internet in a time-sensitive manner. However, fixed sized chunks, a feature of the Torrent protocol, leads to inefficiency in application layer framing for error resilient video streaming, since video slices are variable length when encoded at constant quality. This paper proposes two modifications to the Torrent protocol, variable chunk size and adaptive scheduling window, for efficient, error-resilient, adaptive P2P streaming of scalable video. Experimental results show that the proposed modifications yield superior results in terms of number of decoded frames, hence superior quality of experience, in P2P video streaming. [ABSTRACT FROM PUBLISHER]

In this paper we analyse the energy consumption of BitTorrent, the most popular Peer-to-Peer (P2P) application, over IP/WDM networks considering different peers behaviour scenarios. We show, by mathematical modelling and simulation, that leechers can cause high network energy consumption if they leave the network after finishing downloading. We introduce an energy efficient approach to compensate for the negative impact of leechers departure on network energy consumption. [ABSTRACT FROM PUBLISHER]

The peer-to-peer networking technologies and systems provide a rapid and scalable content distribution mechanism for the increasing client population to access an explosive volume of media files on the Internet. Whereas the BitTorrent protocol and its derivatives are the most popular peer-to-peer file sharing applications, this paper proposes the performance measurement and analysis of BitTorrent protocols with an extensive volume of real trace logs. This examination reveals many new characteristics and information into the virtue of BitTorrent protocols in terms of downloading-side metrics, including overall download time and download bandwidth utilization, which have not been well specified in prior works that mainly focused on system-oriented and uploading-side performance measurements. [ABSTRACT FROM PUBLISHER]

The number of software applications available on the Internet for distributing video streams in real time over P2P networks has grown quickly in the last two years. Typical this kind of distribution is made by television channel broadcasters which try to make their content globally available, using viewer's resources to support a large scale distribution of video without incurring in incremental costs. However, the lack of adaptation in video quality, combined with the lack of a standard protocol for this kind of multimedia distribution has driven content providers to basically ignore it as a solution for video delivery over the Internet. While the scalable extension of the H.264 encoding (H.264/SVC) can be used to support terminal and network heterogeneity, it is not clear how it can be integrated in a P2P overlay to form a large scale and real time distribution. In this paper, we start by defining a solution that combines the most popular P2P file-sharing protocol, the BitTorrent, with the H.264/SVC encoding for a real-time video content delivery. Using this solution we then evaluate the effect of several parameters in the quality received by peers. [ABSTRACT FROM PUBLISHER]

Peer to Peer (P2P) computer networks rely on direct connections between participants instead of conventional centralized resources. These networks are useful for many purposes, but the killer application nowadays is file sharing. BitTorrent is a very popular protocol for this matter. In this paper, we use a multi-agent model of a BitTorrent network. In it, each BitTorrent client is an agent that interacts with other agents and reacts autonomously, following the same decision algorithms as a real client. Their goals are downloading contents in the shortest possible time and sharing them with other agents. The use of this multi-agent model allows us to introduce modifications to the protocol. We have modified this model to use multicast. A multicast transmission consists in sending information in a network to multiple destinations simultaneously, using a more efficient strategy: to send the message on each link of the network only once and to create copies when the links to the destinations are divided. We have evaluated how BitTorrent performs using multicast and compared to its normal behavior. [ABSTRACT FROM PUBLISHER]

Peer to Peer (P2P) computer networks rely on direct connections between participants instead of conventional centralized resources. These networks are useful for many purposes, but the killer application nowadays is file sharing. BitTorrent is a very popular protocol for this matter. In this paper, we use a multi-agent model of a BitTorrent network. In it, each BitTorrent client is an agent that interacts with other agents and reacts autonomously, following the same decision algorithms as real clients. Their goals are downloading contents in the shortest possible time and sharing them with other agents. The use of this multi-agent model allows us to introduce modifications to the protocol. We have modified this model to use fountain codes, also known as rate less erasure codes, a class of codes in which the original source symbols can be recovered from any subset of the encoding symbols. We evaluated how BitTorrent performs using these codes and compared with its normal behavior. [ABSTRACT FROM PUBLISHER]

In recent years, BitTorrent traffic accounts for a substantial percentage of Internet traffic in the world. However, the current BitTorrent protocols disregards traffic cost at the underlying network and generate a large amount of inter-AS traffic. As a result, BitTorrent peers may suffer from slow download of files due to long delays. Moreover, ISPs may limit BitTorrent traffic to reduce inter-AS traffic. In this paper, we propose a new approach localizing BitTorrent traffic within neighboring ASes, gBPEXh, in which a controller and peers directly exchange lists of peer in the vicinity through BitTorrent's PEX protocol. Conducting experiments on Planet Lab, we show that BPEX significantly reduces inter-AS traffic and peers' download completion time. [ABSTRACT FROM PUBLISHER]

In this paper, we describe the problem of large package distribution in the enterprise environment and propose a solution using BitTorrent. BitTorrent is an efficient package distribution protocol that is commonly used across the Internet. We share techniques for and our results with optimizing package transfers in enterprise environments. The techniques include using modified configuration, better peer selection methods, and the use of web seeding and HDFS-based seeding. We also identify potential ways to propagate delta changes to the packages. Results show the effectiveness of using BitTorrent for package transfers. [ABSTRACT FROM PUBLISHER]

Studying the BitTorrent (BT) swarm evolution in different time scale is important to design accurate BT simulators and improve the performance of current BT systems. In this paper, we develop a hybrid measurement system incorporating both active and passive approaches. By exploiting DHT and PEX protocols in addition to traditional resources, we collect more extensive information compared to prior measurement systems. Based on the measurement results, we study the swarm evolution with different population in minute/hour/day scales, and discover that: (1) The swarm peer population is unbalanced, in that 74.6% torrents have no more than 1000 peers, (2) The lifetime of torrents can be divided into a fast growing stage, a dramatically shrinking stage, a sustaining stage and a slowly fading out stage in terms of swarm population, (3) Users' interest and diurnal periodicity are the main factors that influence the swarm evolution. The former dominates the first two stages, while the latter is decisive in the third stage. In this spirit, we raise an improved peer arrival rate model to describe the variation of the swarm population. Comparison results show that our model outperforms the state-of-the-art approach according to root mean square error and correlation coefficient. [ABSTRACT FROM PUBLISHER]

Peer-to-peer networks such as Bit Torrent swarms have gained popularity on Internet. One of the fundamental underlying mechanisms is to foster and enforce peer cooperativeness. As for fairly exchanging Bit Torrent chunks, peers may resort to encrypted chunk exchanges yet at the cost of delayed availability of plain chunks. In response, this paper presents a chunk encryption scheme for exchanging chunks between Bit Torrent peers. This scheme uses only permutation-based operations. Further, two layers of permutation are conducted in order to hide more chunk information. As counts of zero and one bits are unchanged, the verifiable characteristic can be achieved. Finally, re-encryption capability is introduced for mitigating delayed availability problems that occur under encrypted chunk exchanges. [ABSTRACT FROM PUBLISHER]

BitTorrent is the most popular P2P application. So it is very significant to study its energy efficiency. Proxy-based energy efficient BitTorrent has been studied in recent years. In this paper we present the first study analytically on how long proxy should stays in multi-torrents for maximum energy efficient and minimum download time. We find that multiproxy should be deployed for maximum energy efficient and minimum download time. We also verify that, in single proxy situation, proxy downloading files simultaneously is better than that of one-by-one. Our result is useful for deploying proxy in BitTorrent file sharing system. [ABSTRACT FROM PUBLISHER]

Traditional peer-to-peer systems do not incorporate social networking and treat their peers or seeders as anonymous entities. Hence these systems are not able to take the advantage of the diverse social connections the user has [1]. Another problem encountered by the user is the exhaustive search required to find an authentic .torrent file for downloading desired data. To find a good .torrent file, the user has to consider a lot of parameters like the number of seeds and peers on a torrent, the user ratings of the torrent file, data size and so on. Current peer-to-peer systems lack the recommendation system to help users find the files they need. Most applications accept recommendation systems as a powerful business tool to aid the user. To address these issues, we introduce our client Torrentzshare, a search and recommendation system for torrent files. In this paper, we propose a search and recommendation algorithm for the same. [ABSTRACT FROM PUBLISHER]

In the area of network performance and discovery, network tomography focuses on reconstructing network properties using only end-to-end measurements at the application layer. One challenging problem in network tomography is reconstructing available bandwidth along all links during multiple source / multiple destination transmissions. The traditional measurement procedures used for bandwidth tomography are extremely time consuming. We propose a novel solution to this problem. Our method counts the fragments exchanged during a BitTorrent broadcast. While this measurement has a high level of randomness, it can be obtained very efficiently, and aggregated into a reliable metric. This data is then analyzed with state-of-the-art algorithms, which correctly reconstruct logical clusters of nodes interconnected by high bandwidth, as well as bottlenecks between these logical clusters. Our experiments demonstrate that the proposed two-phase approach efficiently solves the presented problem for a number of settings on a complex grid infrastructure. [ABSTRACT FROM PUBLISHER]

Massive and large scale content distribution over Internet is attracting a lot of research efforts as many challenges remain to be solved. Recent studies show that Internet video including video-to-TV and video calling is dominating the Internet traffic. As Internet becomes widely accessible to wired, mobile and wireless users, it is important to design a system that can ensure video streaming across variable network conditions while simultaneously handling devices and end-user heterogeneities. Most of the proposed solutions, such as CDN and peer-to-peer (P2P), solve the scalability problem but fail to handle receiver's heterogeneity. In this paper, we combine P2P network and SVC (Scalable Video Coding) to provide an efficient video sharing and streaming system. Our solution consists of an SVC layered extension of the widely used Bittorrent protocol to support real-time content delivery with different video qualities given the receivers capabilities. Thus, we propose different optimization techniques to organize peers in an overlay. The results, obtained by means of simulation, show that our system outperforms solutions that relay on single layer streams such as AVC (Advanced Video Coding) and this in terms of receivers perceived QoS. [ABSTRACT FROM PUBLISHER]

BitTorrent is currently a very popular protocol for P2P file sharing, and most of BitTorrent users access the Internet from residential networks. In this paper we compare the legacy BitTorrent protocol with EE-BitTorrent, a proxy-based version recently proposed for energy efficiency, in a residential scenario. We show that the performance achieved by users is strongly influenced by the uplink throughput allowed by the access network. When the available uplink rate is low, the legacy BitTorrent protocol performs poorly and EE-BitTorrent outperforms it, in terms of average download time and energy consumption at the user's PC. The opposite occurs when the uplink rate is good. Motivated by these results, we designed and implemented AdaBT, an adaptive algorithm that dynamically selects the most efficient BitTorrent option (i.e., legacy or proxy-based), depending on the operating conditions experienced by the user. Our experimental results show that AdaBT is able to reduce significantly the download time provided by either the legacy BitTorrent or EE-BitTorrent. [ABSTRACT FROM PUBLISHER]

With the emergence of IPv6 which provides an exponentially large number of available IP addresses, NAT is not one part of the new Internet world. P2P applications play important roles in IPv6 network environment, without focusing on overcoming the NAT difficulties and crossing restrictive firewall. In this paper, an IPv6 flow measuring system was developed, which enables us to study the behaviors of BitTorrent(a very popular P2P application) traffic. After analyzing of about 62GB of IPv6 traffic in the experiment, it was found: 1) The average flow size of BitTorrent over uTP is much larger than that over TCP and the ratio of big flows over uTP is higher than that over TCP. 2) The successful connecting rate of BitTorrent over TCP in IPv6 network environment is low. 3) The unbalanced distribution of BitTorrent flows' speed and duration over TCP is more obvious than these over uTP 4) In some cases, the relation between BitTorrent flows' size and duration and the relation between BitTorrent flows' size and speed are approximately linear in IPv6 network environment. [ABSTRACT FROM PUBLISHER]

BitTorrent (BT) is a well-known Peer-to-Peer (P2P) downloading protocol and has been implemented in several versions. New features and extensions used to improve performance of BitTorrent systems also bring some security issues. In this paper, we analyze potential DDoS vulnerabilities of BT and its Peer Exchange extension. We show the ways of launching connection-exhaustedDDoSattacks. Our experiments demonstrate these attacks are persistent and incur few costs for the attacker. By analyzing the main causes we find that both the defect of implement and the lack of trust and authentication mechanism are to blame, while the latter is critical. To defend against the DDoS attacks, we propose a score-based peer Reputation Exchange (REX) mechanism. Using REX, the score of a malicious peer is less than that of a good peer after several iterations, hence has less chance to be connected. REX makes it difficult to launch a DDoS attack and it can effectively mitigate the effect of the attack. [ABSTRACT FROM PUBLISHER]

This paper describes a way of using BitTorrent protocol for streaming playback of multimedia content. The paper also presents one solution of a BitTorrent stream player client application based on the concept presented. The realised application was tested and the utility value of the application was analyzed. [ABSTRACT FROM PUBLISHER]

BitTorrent has proved to be the most effective and popular P2P file distribution application in recent years. In order to improve the fairness of BitTorrent network, a novel incentive mechanism (proportional uploading mechanism), which consists of bandwidth limitation strategy for the seed and bandwidth allocation strategy for all peers, is proposed. Simulation results show that, compared with the default strategy and another representative block-based strategy, the proposed mechanism can improve piece diversity and fairness of the BitTorrent network remarkably and at the same time, can reduce the load on the seed by a large margin. [ABSTRACT FROM PUBLISHER]

BitTorrent has generated a significant and continuously increasing portion of Internet traffic. Several designs have been recently proposed to reduce the BitTorrent traffic without sacrificing user downloading performance. However, Most of these designs only consider IPv4-only Internet, not thinking about IPv4/IPv6 hybrid network. With the exhaustion of IPv4 addresses and the development of IPv6, the Internet is being converted from IPv4-only into IPv4/IPv6 hybrid. Thus, this paper examines a new approach to making BitTorrent system suitable to IPv4/IPv6 hybrid network, in which the dual-stack peers can share file via IPv4 or IPv6 connection. We present a simulation-based study in a special IPv4/IPv6 hybrid network topology based on CERNET and CERNET2. The simulation results show that our approach can effectively transfer BitTorrent traffic from IPv4 network to IPv6 network. [ABSTRACT FROM PUBLISHER]

Advances in next generations distributed cyberspace technologies are expected to evolve a global cyberspace marketplace for resource and services. In marketplaces, particularly with the autonomy of users, trading parties differ in many respects, for example their declared agendas, honesty, owned or outsourced resources, and their products. Given these differences and the scale of a global marketplace, trusting the outcome of services or service compositions becomes a challenging endeavor. Personalized autonomic trust management constitutes a powerful solution to such issues. However, current trust systems do not generalize well beyond those problems they were designed for. In addition they are oblivious to individual users' trust requirements. In this paper we propose a generic trust management framework and architecture for trust personalization and autonomic trust management. Our main contributions include: defining and quantifying trust in terms of four parameters: intent capability, integrity and results, and a unified framework for autonomic and personalized trust management. In our simulations, we investigated using trust parameters in BitTorrent protocol. Results showed that, using trust parameters reduce download time and an increase number of finished peers. [ABSTRACT FROM PUBLISHER]