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.
Type de document :
Communication dans un congrès
ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '12), Jun 2012, United Kingdom. p. 41-52, 2012, 〈10.1145/2318857.2254764〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00841296
Contributeur : Marc Lelarge <>
Soumis le : jeudi 4 juillet 2013 - 13:47:14
Dernière modification le : jeudi 22 novembre 2018 - 14:22:19
Document(s) archivé(s) le : samedi 5 octobre 2013 - 04:17:45

Fichier

sig37-leconte.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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, 2012, 〈10.1145/2318857.2254764〉. 〈hal-00841296〉

Partager

Métriques

Consultations de la notice

507

Téléchargements de fichiers

229