Search

As the majority of Internet traffic today is attributed to content-centric applications, there has been ever-increasing demand for highly scalable and efficient content delivery. An accurate prediction on future content consumption is essential for such demand. To address such an issue, this paper introduces a new computational approach, Content Network (CN) that can capture the relations among contents, and its potential applications. We conduct a measurement study to investigate how contents are inter-related from the viewpoint of content spreading on one of the popular BitTorrent portals: The Pirate Bay. Based on the large-scale dataset that contains 18 K torrents and 9 M users, we construct the CN and investigate its structural properties. Our key finding is that contents in the same community in the CN (i) belong to the same content category with 94% probability, (ii) are uploaded by the same content publisher with 76% probability, and (iii) have the similar titles with 51% probability, which implies that contents in the same community collectively contain common (shared) interests of users. Our trace-driven study demonstrates that the proposed CN model is useful in (i) content recommendation for increasing sales and (ii) content caching for networking efficiency. We believe our work can provide an important insight for content stakeholders, e.g., content providers for efficient publishing strategies, network engineers for networking efficiency, or content marketers for accurate recommendation.

currently, the development of a new class of software called "decentralized applications" is gaining popularity. Its foundations were laid by the technologies of Bitcoin and BitTorrent, aroused the interest of developers in the methods of their implementation. Over the past few years, the whole world has been excited by the explosion in popularity of cryptocurrencies, which has brought blockchain technology into the spotlight. its application is not limited to the creation of electronic money and platforms for their exchange. One of the promising areas for the introduction of blockchain technology is its use in the banking sector to improve the security of operations and reduce costs. This paper focuses on Blockchain technology and investigates its applications, implementations, and constituents. and how blockchain applications enhancing database management. [ABSTRACT FROM AUTHOR]

In peer-to-peer (P2P) content distribution systems, network coding is known as a helpful method for increasing the content availability, accelerating the download process, and robustness against churn. Originally, dense network coding (DNC) has been proposed and theoretically considered as an optimal solution. However, due to its huge computational overhead, it is not viable for real-world systems. Subsequently, sparse, generations, and overlapped generations network coding schemes are proposed as possible alternatives but at reduced performance compared to that provided by the DNC. Further in this article, an improved applicable network coding scheme for P2P content distribution systems referred to therein as Super Generation Network Coding (SGNC) is proposed. SGNC maximizes the generation size so that it is as close as possible to the optimal size without adding computational overhead. Theoretical analysis and experimental work show that SGNC outperforms classical and all previous coding based schemes for P2P content distribution systems in terms of content availability, download time, overhead, and decodability for all piece scheduling policies.

This article carries out a competitive analysis between BitTorrent-like algorithms for interactive video-on-demand streaming over mobile ad hoc networks. To this end, we herein mainly delve into five recent proposals of this kind, and assess the operational download (DO) and the discontinuity-time (DT) performance metrics in different scenarios by means of simulations, considering two client interactivity profiles, two mobility models, and various network sizes. Although final results indicate that all five proposals may provide suitable system quality of service and client quality of experience in certain scenarios, the one named as BitTorrent Interactive Broadcast - Network is overall the most competitive one. For instance, compared to other literature proposals, it may provide optimizations of up to 106% and 86% at the DO and DT metrics, respectively, thus confirming its attractive performance. [ABSTRACT FROM AUTHOR]

Nowadays, many universities face bandwidth saturation problem caused by several origins. These include youtube abusively use, online games and especially illegal downloading that makes havoc to Peer-toPeer protocol e.g. BitTorrent. The latter is often associated with data piracy and copyright violation. This article aims at presenting on one hand the impact of the use of Peer-to-Peer file sharing traffic on campus bandwidth by observation of BitTorrent traffic and on the other a method for limiting the illicit access to this kind of networks. For this purpose, we used a set of open source tools like wireshak sniffer software to capture Bitorrent traffic. Additionally, using the well-known Snort intrusion detection system with a number of adequate and new rules one can reduce bandwidth saturation problem. This solution allowed in our case, a bandwidth saturation reduction of 35%.

Summary: File sharing is one of the leading Internet applications of P2P technology. Given the high number of computer nodes involved in peer‐to‐peer networks, reducing their aggregate energy consumption is an important challenge to be faced. In this paper, we show how the sleep‐and‐wake energy saving approach can be exploited to reduce energy consumption in BitTorrent, one of the most popular file sharing peer‐to‐peer networks. We describe BitTorrentSW, a sleep‐and‐wake approach for BitTorrent networks that allows seeders (ie, peers that hold complete files) to cyclically switch between wake and sleep modes to save energy while ensuring good file sharing performance. The decision to switch to sleep mode is taken independently by each seeder based on local information about the composition of the peer‐to‐peer network. BitTorrentSW has been evaluated through PeerSim using real BitTorrent traces. The simulation results show that, in all the configurations under analysis, the percentage of energy saved by BitTorrentSW is much higher than the percentage of increase in download time. For instance, in a network with 50% of seeders, about 20% of energy is saved using BitTorrentSW, with an increase of only 7% of the average time needed to complete a file download compared to a standard BitTorrent network in which all seeders are always powered on. [ABSTRACT FROM AUTHOR]

Recent studies have suggested that the stability of peer-to-peer networks may rely on persistent peers, who dwell on the network after they obtain the entire file. In the absence of such peers, one piece becomes extremely rare in the network, which leads to instability. Technological developments, however, are poised to reduce the incidence of persistent peers, giving rise to a need for a protocol that guarantees stability with non-persistent peers. We propose a novel peer-to-peer protocol, the group suppression protocol, to ensure the stability of peer-to-peer networks under the scenario that all the peers adopt non-persistent behavior. Using a suitable Lyapunov potential function, the group suppression protocol is proven to be stable when the file is broken into two pieces, and detailed experiments demonstrate the stability of the protocol for arbitrary number of pieces. We define and simulate a decentralized version of this protocol for practical applications. Straightforward incorporation of the group suppression protocol into BitTorrent while retaining most of BitTorrent’s core mechanisms is also presented. Subsequent simulations show that under certain assumptions, BitTorrent with the official protocol cannot escape from the missing piece syndrome, but BitTorrent with group suppression does. [ABSTRACT FROM AUTHOR]

The rise in cloud storage and services in enterprise networks requires agile methods of content distribution, such as general-purpose files, software patches, image files, and other information. The work in this paper proposes a peer selection algorithm in BitTorrent to distribute content in enterprise networks. Peers execute this algorithm with a new special role called Internal Swarm Coordinator, ISC for short. Additions to the protocol allow peers from an Internal Swarm to cooperate in a coordinated manner, with an ISC acting as an orchestra director for a given broadcast domain. The proposed scheme uses two approaches: a Hamming distance to select the best peers enforcing productive connections between hosts, and fuzzy logic to handle peer load. This work includes a UDP-based protocol to select ISCs, and a procedure to define the behavior of this unique host. Also, to ensure backward compatibility, a description of how other peers can interact with this special role is given. [ABSTRACT FROM AUTHOR]

Nowadays, distributions of large volumes of data over enterprise TCP/IP networks bring problems such as high network and server utilizations, long periods for completion, and greater sensitivity to flaws in network infrastructure. These problems can be reduced with the use of Peer-to-Peer (P2P) networks, but the standard BitTorrent protocol does not perform well in some scenarios such as the one related to enterprise networks. This work proposes a modification in the BitTorrent protocol that uses locality-awareness to reduce traffic on long distance links of enterprise networks. In this modification, the tracker identifies the peer IP address requesting the list of IP addresses of the swarm and sends only those addresses that belong to the same LAN and to the original seeder. The performance of the proposal has been assessed by simulations. In typical enterprise scenarios, results show that the change is able to reduce bandwidth consumption and time of downloads compared with standard BitTorrent, and gives greater robustness to the distribution in case of failure of WAN links. Results also show that in more complex network environments, with many clients and where the bandwidth restriction on long distance links causes congestion and packet drops, the proposed modification consistently improves distribution performance. [ABSTRACT FROM AUTHOR]

Nowadays, many universities face bandwidth saturation problem caused by several origins. These include youtube abusively use, online games and especially illegal downloading that makes havoc to Peer-to- Peer protocol e.g. BitTorrent. The latter is often associated with data piracy and copyright violation. This article aims at presenting on one hand the impact of the use of Peer-to-Peer file sharing traffic on campus bandwidth by observation of BitTorrent traffic and on the other a method for limiting the illicit access to this kind of networks. For this purpose, we used a set of open source tools like wireshak sniffer software to capture Bitorrent traffic. Additionally, using the well-known Snort intrusion detection system with a number of adequate and new rules one can reduce bandwidth saturation problem. This solution allowed in our case, a bandwidth saturation reduction of 35%. [ABSTRACT FROM AUTHOR]

This paper proposes a novel BitTorrent-like algorithm for video-on-demand streaming over mobile ad hoc networks: the BT-MANET algorithm. Its conceptual innovations mainly lie on (i) a flexible data-transmission scheme between direct neighbors and on (ii) a sliding window to prioritize data request, settling a compromise between data diversity and playing continuity. Through a number of simulations and assessing four different competitive metrics, we are able to validate our proposal and confirm its attractive performance for on-demand streaming. For instance, it is shown that BT-MANET may support twice the bit rate of a nominal theoretical scheme, besides being reasonably competitive when compared to an alternative wired implementation. Within this context, the key contribution of this paper is to provide valuable insights for real protocol designs targeted at multimedia on-demand streaming over mobile ad hoc networks. General conclusions and avenues for further research are included at the end of this paper. [ABSTRACT FROM AUTHOR]

We partner with a major multinational telecommunications provider to analyze the effect of subscription video-on-demand (SVoD) services on digital piracy. For a period of 45 consecutive days, a group of randomly selected households who used BitTorrent in the past were gifted with a bundle of TV channels with movies and TV shows that could be streamed as in SVoD. We find that, on average, households that received the gift increased overall TV consumption by 4.6% and reduced Internet downloads and uploads by 4.2% and 4.5%, respectively. However, and also on average, treated households did not change their likelihood of using BitTorrent during the experiment. Our findings are heterogeneous across households and are mediated by the fit between the preferences of households in our sample for movies and the content available as part of the gifted channels. Households with preferences aligned with the gifted content reduced their probability of using BitTorrent during the experiment by 18% and decreased their amount of upload traffic by 45%. We also show using simulation that the size of the SVoD catalog and licensing window restrictions limit significantly the ability of content providers to match SVoD offerings to the preferences of BitTorrent users. Finally, we estimate that households in our sample are willing to pay at most $3.25 USD per month to access a SVoD catalog as large as Netflix's in the United States. Together, our results show that, as a stand-alone strategy, using legal SVoD to curtail piracy will require, at the minimum, offering content much earlier and at much lower prices than those currently offered in the marketplace, changes that are likely to reduce industry revenue and that may damage overall incentives to produce new content while, at the same time, curbing only a small share of piracy. The online appendix is available at https://doi.org/10.1287/mnsc.2017.2875. This paper was accepted by Chris Forman, information systems. [ABSTRACT FROM AUTHOR]

IEEE 802.11s introduces MAC-layer extensions to enable vendor-independent and inter-operable WLAN mesh networks. Featuring automatic device interconnection and routing, 802.11s networks provide a higher scalability, flexibility, and robustness compared to common centralized WLAN infrastructures. As logical Peer-to-Peer (P2P) networks exhibit many of the characteristics of physical WLAN mesh networks on the application layer, it is obvious to consider solutions where both technologies interact to leverage robust distributed wireless applications, such as collaborative data distribution and synchronization in future smart cities. Envisioned scenarios include the administration and update deployment to specific device groups or the distributed caching and delivery of on-demand multi-media content to selected end points within a city-area wireless mesh network. Nevertheless, common P2P protocols, such as BitTorrent (BT), do not consider the structure of the physical underlay as they were primarily designed to be used over wired communication networks, such as large parts of the Internet. Hence, the default BT peer selection mechanism does not adapt to the network topology and varying medium utilization in wireless multi-hop networks. We present MeNTor , a set of optimizations to enable underlay-aware BT peer selection in WLAN mesh networks. It relies on cross-layer integration of default 802.11s information, only requiring minor extension of the BT application layer without introducing any MAC-layer modifications or traffic overhead. Our solution was evaluated in a 25-node real-world mesh test bed, using 10 different seed/leecher placements and comparing 18 parameter combination variants of MeNTor . Results show that average download times can be reduced by 30–40%, depending on the seed/leecher placement and parameter combination variant. Finally, we recommend the variant that performed best across all scenarios as prospective default configuration. [ABSTRACT FROM AUTHOR]