Achieving the Optimal Steaming Capacity and Delay Using Random Regular Digraphs in P2P Networks

TL;DR

This paper presents a new algorithm for P2P networks that achieves maximum streaming rate with logarithmic delay for almost all peers, using properties of union of random 1-regular digraphs.

Contribution

It introduces an alternative pairing and dissemination algorithm leveraging union of random 1-regular digraphs to optimize streaming capacity and delay.

Findings

Achieves $O( ext{log } N)$ delay at maximum streaming rate for most peers.

Uses properties of union of random 1-regular digraphs to ensure performance.

Ensures negligible fraction of peers experience higher delay.

Abstract

In earlier work, we showed that it is possible to achieve $O(\log N)$ streaming delay with high probability in a peer-to-peer network, where each peer has as little as four neighbors, while achieving any arbitrary fraction of the maximum possible streaming rate. However, the constant in the $O(log N)$ delay term becomes rather large as we get closer to the maximum streaming rate. In this paper, we design an alternative pairing and chunk dissemination algorithm that allows us to transmit at the maximum streaming rate while ensuring that all, but a negligible fraction of the peers, receive the data stream with $O(\log N)$ delay with high probability. The result is established by examining the properties of graph formed by the union of two or more random 1-regular digraphs, i.e., directed graphs in which each node has an incoming and an outgoing node degree both equal to one.