Comparative analysis of web-based concurrent algorithms to optimize the subscription process for streaming services

Abstract

The purpose of this article is to perform a comparative analysis to optimize the subscription process in streaming services through concurrent algorithms. The problem of this research is the difficulty of subscription in the customers of the various streaming companies, which is due to the lack of maintenance and management of massive subscriptions, generating collapses in the platforms that offer this service. Concurrent algorithms have proven to be an efficient solution to the problem of resource control in highly visited systems. The research design was qualitative, and the type was descriptive, the result shows that through the comparison of concurrent algorithms on the web platform, we have an algorithm developed in Go (Synchronization, Message Passing, and Binary Barriers), which when running the test, indicates that with 1000 requests for the subscription process an average response time of 1402 ms is obtained with a throughput of 249. 2 processes per second, on the other hand, the other algorithm developed in PHP, which indicates that with 1000 requests for the subscription process, an average response time of 1689 ms is obtained with a throughput of 524 processes per second. Finally, we conclude that the use of the concurrent algorithm developed in Go under the web platform, optimises the process based on its average response time and performance indicators for subscription streaming services through Synchronisation, Message Passing and Binary Barriers.