Peer-to-Peer Gradient Topologies in Networks With Churn

Terelius, Håkan; Johansson, Karl Henrik

doi:10.1109/tcns.2018.2795704

Cited by 16 publications

(9 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly for the third round r 3 , the seeder shares k out n − 2k pieces in n−2k k ways, and so on until the last round when the seeder shares k out of k pieces in k k = 1 ways. Mathematically, this is written as (6) n…”

Section: A Baseline Bittorrent Analysismentioning

confidence: 99%

“…RF techniques partially solve the scheduling problem as they are usually applied locally within a swarm and do not take into account the pieces within other swarms. The second important problem is that the nature of P2P content distribution networks is dynamic, and hence peers can depart suddenly which is known as dynamic peers participation or churn [6]. This in turn may affect the download time or or even prevent the completion of the download.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Super Generation Network Coding for Peer-to-Peer Content Distribution Networks

et al. 2020

View full text Add to dashboard Cite

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 paper, 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.

show abstract

Section: A Baseline Bittorrent Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Super Generation Network Coding for Peer-to-Peer Content Distribution Networks

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Håkan Terelius et al, 2018 [9] proposed the system topology combination in a peer-to-peer align framework, area the cold of the framework is to addition live-alive performance. The broadcast framework builds an bend bury topology, declared by a directed chart, area every hub angular appear neighbors absolute college account qualities to such an admeasurement that means of accretion utilities appear in the arrangement topology.…”

Section: Cnetwork Gradient Topologymentioning

confidence: 99%

Churn rate prediction in Telecommunication systems

R*,

Ganesh

2019

IJEAT

View full text Add to dashboard Cite

The broad view of chum rate measures the amount of individuals or items comes out of a collective group over a predefined time period. Many challenges linked with the churn rates in the telecom industry rise in increasing competition with the elimination of switching costs. The customer loyalty over the telecom industry exists along with the service provider struggling to offer improved services with the lower cost. Many author reviews depends on the churn rate prediction in the field of telecommunication sector discussed with the paper. The paper talk about an idea related with an application of churn rate for the technical review.

show abstract

“…This is known as piece scheduling [13], piece selection [14], or the coupon collector's problem [15]. The other important challenge, especially in large-scale content distribution networks, is that the departure, or the failure of a peer is naturally dynamic as the peer may depart or fail without notice, which is known as dynamics peer participation or churn [16]. Subsequently, pieces that were owned by the departing peers may become rare or unavailable.…”

Section: Introductionmentioning

confidence: 99%

Survey of Network Coding Based P2P File Sharing in Large Scale Networks

AbuDaqa¹,

Mahmoud²,

Abu-Amara³

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

Peer-to-peer (P2P) content distribution and file sharing systems aim to facilitate the dissemination of large files over unreliable networks. Network coding is a transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems.

show abstract

Peer-to-Peer Gradient Topologies in Networks With Churn

Cited by 16 publications

References 27 publications

Super Generation Network Coding for Peer-to-Peer Content Distribution Networks

Super Generation Network Coding for Peer-to-Peer Content Distribution Networks

Churn rate prediction in Telecommunication systems

Survey of Network Coding Based P2P File Sharing in Large Scale Networks

Contact Info

Product

Resources

About