Overhead and performance of low latency live streaming using MPEG-DASH

Scaling Byzantine Fault Tolerant (BFT) systems in terms of membership is important for secure applications with large participation such as blockchains. While traditional protocols have low latency, they cannot handle many processors. Conversely, blockchains often have hundreds to thousands of processors to increase robustness, but they typically have high latency or energy costs. We describe various sources of unscalability in BFT consensus protocols. To improve performance, many BFT protocols optimize the “normal case,” where there are no failures. This can be done in a modular fashion by wrapping existing BFT protocols with a building block that we call alliance . In normal case executions, alliance can scalably determine if the initial conditions of a BFT consensus protocol predetermine the outcome, obviating running the consensus protocol. We give examples of existing protocols that solve alliance. We show that a solution based on hypercubes and MAC s has desirable scalability and performance in normal case executions, with only a modest overhead otherwise. We provide important optimizations. Finally, we evaluate our solution using the ns3 simulator and show that it scales up to thousands of processors and compare with prior work in various network topologies.

Download Full-text

Content-Aware Playback Speed Control for Low-Latency Live Streaming of Sports

10.1145/3458305.3478437 ◽

2021 ◽

Cited By ~ 1

Author(s):

Omer F. Aladag ◽

Deniz Ugur ◽

Mehmet N. Akcay ◽

Ali C. Begen

Keyword(s):

Speed Control ◽

Low Latency ◽

Live Streaming ◽

Content Aware

Download Full-text

Low-Latency Live Streaming over HTTP in Bandwidth-Limited Networks

IEEE Communications Letters ◽

10.1109/lcomm.2020.3030887 ◽

2020 ◽

pp. 1-1

Author(s):

Ihsan Mert Ozcelik ◽

Cem Ersoy

Keyword(s):

Low Latency ◽

Live Streaming

Download Full-text

Catching the Moment with LoL+ in Twitch-Like Low-Latency Live Streaming Platforms

IEEE Transactions on Multimedia ◽

10.1109/tmm.2021.3079288 ◽

2021 ◽

pp. 1-1

Author(s):

Abdelhak Bentaleb ◽

Mehmet N. Akcay ◽

May Lim ◽

Ali C. Begen ◽

Roger Zimmermann

Keyword(s):

Low Latency ◽

Live Streaming ◽

The Moment

Download Full-text

Design of Optimized Trading Strategies with Web Assembly

International Journal for Research in Applied Science and Engineering Technology ◽

10.22214/ijraset.2021.36049 ◽

2021 ◽

Vol 9 (VI) ◽

pp. 4997-5001

Author(s):

Shubham R Rahate

Keyword(s):

Programming Language ◽

Trading Strategies ◽

The Internet ◽

Low Latency ◽

Algorithmic Trading ◽

Essential Factor ◽

Executable File ◽

And Performance ◽

The Right ◽

The Web

Web Assembly is growing and also the most widely studied area which interests many developers when it comes to performance and speed to make web development fast as ever. When it comes to speed and performance algorithms can perform faster computations. Algorithmic trading executes trade at a faster speed. It can buy and sell stocks within a fraction of milliseconds. However, selecting the right tools and technologies is extremely important in algorithmic trading. There are trading strategies which we can use to optimize our trade and increase the return gained on buying and selling stocks. But, choosing an efficient programming language is substantially important. A programming language with a low latency can leverage the trade. Most commonly used languages for algorithmic trading are C/C++, Java, C#, Python. Speed and performance are an essential factor in algorithmic trading. The main purpose of introducing web Assembly in trading as discussed above is speed and performance. Web Assembly is a low-level binary instruction which can execute any program on the web and it can deliver native like performance on the internet. Using Web Assembly, we can compile any code written in languages like C/C++, C#, Java, and python to wasm (Web Assembly executable file) and run on the browser. Web Assembly was developed by W3C, Mozilla Corporation, and Google.

Download Full-text

Real-time Search for Compact Binary Mergers in Advanced LIGO and Virgo's Third Observing Run Using PyCBC Live

The Astrophysical Journal ◽

10.3847/1538-4357/ac2f9a ◽

2021 ◽

Vol 923 (2) ◽

pp. 254

Author(s):

Tito Dal Canton ◽

Alexander H. Nitz ◽

Bhooshan Gadre ◽

Gareth S. Cabourn Davies ◽

Verónica Villa-Ortega ◽

...

Keyword(s):

Gravitational Wave ◽

Frequency Domain ◽

Rapid Identification ◽

Matched Filtering ◽

Low Latency ◽

The Third ◽

Compact Binary ◽

Binary Mergers ◽

And Performance

Abstract The third observing run of Advanced LIGO and Advanced Virgo took place between 2019 April and 2020 March and resulted in dozens of gravitational-wave candidates, many of which are now published as confident detections. A crucial requirement of the third observing run was the rapid identification and public reporting of compact binary mergers, which enabled massive follow-up observation campaigns with electromagnetic and neutrino observatories. PyCBC Live is a low-latency search for compact binary mergers based on frequency-domain matched filtering, which was used during the second and third observing runs, together with other low-latency analyses, to generate these rapid alerts from the data acquired by LIGO and Virgo. This paper describes and evaluates the improvements made to PyCBC Live after the second observing run, which defined its operation and performance during the third observing run.

Download Full-text