Autonomous Multi-dimensional Slicing for Large-Scale Distributed Systems
Slicing is a distributed systems primitive that allows to autonomously partition a large set of nodes based on node-local attributes. Slicing is decisive for automatically provisioning system resources for different services, based on their requirements or importance. One of the main limitations of...
Saved in:
Published in | Distributed Applications and Interoperable Systems Vol. 8460; pp. 141 - 155 |
---|---|
Main Authors | , , , |
Format | Book Chapter Conference Proceeding |
Language | English |
Published |
Germany
Springer Berlin / Heidelberg
2014
Springer Verlag Springer Berlin Heidelberg |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
ISBN | 9783662433515 3662433516 |
ISSN | 0302-9743 1611-3349 |
DOI | 10.1007/978-3-662-43352-2_12 |
Cover
Loading…
Summary: | Slicing is a distributed systems primitive that allows to autonomously partition a large set of nodes based on node-local attributes. Slicing is decisive for automatically provisioning system resources for different services, based on their requirements or importance. One of the main limitations of existing slicing protocols is that only single dimension attributes are considered for partitioning. In practical settings, it is often necessary to consider best compromises for an ensemble of metrics. In this paper we propose an extension of the slicing primitive that allows multi-attribute distributed systems slicing. Our protocol employs a gossip-based approach that does not require centralized knowledge and allows self-organization. It leverages the notion of domination between nodes, forming a partial order between multi-dimensional points, in a similar way to SkyLine queries for databases. We evaluate and demonstrate the interest of our approach using large-scale simulations.
This work received support from the Portuguese Foundation for Science and Technology under grant SFRH/BD/71476/2010. |
---|---|
ISBN: | 9783662433515 3662433516 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-662-43352-2_12 |