Bipartite graph structures for efficient balancing of heterogeneous loads

Abstract : This paper considers large scale distributed content service platforms, such as peer-to-peer video-on-demand systems. Such systems feature two basic resources, namely storage and bandwidth. Their efficiency critically depends on two factors: (i) content replication within servers, and (ii) how incoming service requests are matched to servers holding requested content. To inform the corresponding design choices, we make the following contributions. We first show that, for underloaded systems, so-called proportional content placement with a simple greedy strategy for matching requests to servers ensures full system efficiency provided storage size grows logarithmically with the system size. However, for constant storage size, this strategy undergoes a phase transition with severe loss of efficiency as system load approaches criticality. To better understand the role of the matching strategy in this performance degradation, we characterize the asymptotic system efficiency under an optimal matching policy. Our analysis shows that -in contrast to greedy matching- optimal matching incurs an inefficiency that is exponentially small in the server storage size, even at critical system loads. It further allows a characterization of content replication policies that minimize the inefficiency. These optimal policies, which differ markedly from proportional placement, have a simple structure which makes them implementable in practice. On the methodological side, our analysis of matching performance uses the theory of local weak limits of random graphs, and highlights a novel characterization of matching numbers in bipartite graphs, which may both be of independent interest.
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00841296
Contributor : Marc Lelarge <>
Submitted on : Thursday, July 4, 2013 - 1:47:14 PM
Last modification on : Thursday, February 7, 2019 - 3:49:43 PM
Document(s) archivé(s) le : Saturday, October 5, 2013 - 4:17:45 AM

File

sig37-leconte.pdf
Files produced by the author(s)

Identifiers

Citation

Mathieu Leconte, Lelarge Marc, Massoulié Laurent. Bipartite graph structures for efficient balancing of heterogeneous loads. ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '12), Jun 2012, United Kingdom. p. 41-52, ⟨10.1145/2318857.2254764⟩. ⟨hal-00841296⟩

Share

Metrics

Record views

535

Files downloads

280