Evaluating the 2PC Algorithm for the Maintenance of P2P Live Streaming

IF 1.3 4区工程技术 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Latin America Transactions Pub Date : 2024-04-15 DOI:10.1109/TLA.2024.10500714

Adriel C. dos Santos;Iago A. Carvalho;Cristiano M. Silva;Eliseu C. Miguel

{"title":"Evaluating the 2PC Algorithm for the Maintenance of P2P Live Streaming","authors":"Adriel C. dos Santos;Iago A. Carvalho;Cristiano M. Silva;Eliseu C. Miguel","doi":"10.1109/TLA.2024.10500714","DOIUrl":null,"url":null,"abstract":"Peer-to-Peer (P2P) Networks for live streaming face challenges such as ensuring low latency and low discontinuity in media transmission among peers. Algorithms for constructing and maintaining the overlay are often proposed to address several of these challenges. However, it is common to find works that present positive results from the execution of these algorithms without showing the overlay structure constructed by them. In this article, we analyze the overlay constructed and maintained by the Peer Classification for Partnership Constraints (2PC) algorithm. 2PC proved to be efficient in dealing with a large number of free-riders on the network, imposing constraints on partnerships between peers according to their contributions to media transmission. To understand the 2PC execution effects supported by the K-Shortest Path Yen's algorithm, we evaluated the application of the 2PC and identified that the partnership relationships between peers imposed by the algorithm organize the overlay attracting high-contribution peers close to the server, while pushing low-contribution peers to the edge of the overlay.","PeriodicalId":55024,"journal":{"name":"IEEE Latin America Transactions","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10500714","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Latin America Transactions","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10500714/","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

Peer-to-Peer (P2P) Networks for live streaming face challenges such as ensuring low latency and low discontinuity in media transmission among peers. Algorithms for constructing and maintaining the overlay are often proposed to address several of these challenges. However, it is common to find works that present positive results from the execution of these algorithms without showing the overlay structure constructed by them. In this article, we analyze the overlay constructed and maintained by the Peer Classification for Partnership Constraints (2PC) algorithm. 2PC proved to be efficient in dealing with a large number of free-riders on the network, imposing constraints on partnerships between peers according to their contributions to media transmission. To understand the 2PC execution effects supported by the K-Shortest Path Yen's algorithm, we evaluated the application of the 2PC and identified that the partnership relationships between peers imposed by the algorithm organize the overlay attracting high-contribution peers close to the server, while pushing low-contribution peers to the edge of the overlay.

查看原文本刊更多论文

评估用于维护 P2P 实时流的 2PC 算法

用于直播流媒体的点对点（P2P）网络面临着各种挑战，如确保点对点之间媒体传输的低延迟和低不连续性。为了应对这些挑战，人们经常提出构建和维护叠加的算法。然而，常见的著作只介绍了执行这些算法的积极结果，却没有展示由这些算法构建的叠加结构。在本文中，我们分析了 "伙伴关系约束的对等分类（2PC）"算法构建和维护的覆盖。事实证明，2PC 能有效处理网络中的大量 "搭便车者"，它能根据对媒体传输的贡献对对等体之间的伙伴关系施加约束。为了理解 K-Shortest Path Yen 算法所支持的 2PC 执行效果，我们对 2PC 的应用进行了评估，发现该算法所施加的对等点之间的伙伴关系组织了重叠，吸引了高贡献的对等点靠近服务器，而将低贡献的对等点推到了重叠的边缘。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Latin America Transactions COMPUTER SCIENCE, INFORMATION SYSTEMS-ENGINEERING, ELECTRICAL & ELECTRONIC

CiteScore

3.50

自引率

7.70%

发文量

192

审稿时长

3-8 weeks

期刊介绍： IEEE Latin America Transactions (IEEE LATAM) is an interdisciplinary journal focused on the dissemination of original and quality research papers / review articles in Spanish and Portuguese of emerging topics in three main areas: Computing, Electric Energy and Electronics. Some of the sub-areas of the journal are, but not limited to: Automatic control, communications, instrumentation, artificial intelligence, power and industrial electronics, fault diagnosis and detection, transportation electrification, internet of things, electrical machines, circuits and systems, biomedicine and biomedical / haptic applications, secure communications, robotics, sensors and actuators, computer networks, smart grids, among others.