Skip to Main content Skip to Navigation
Conference papers

Distributed Slicing in Dynamic Systems

Abstract : Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with providing useful P2P middleware services capable of dealing with resource assignment and management in a large-scale, heterogeneous and unreliable environment. The slicing service, has been proposed to allow for an automatic partitioning of P2P networks into groups (slices) that represent a controllable amount of some resource and that are also relatively homogeneous with respect to that resource. In this paper we propose two gossip-based algorithms to solve the distributed slicing problem. The first algorithm speeds up an existing algorithm sorting a set of uniform random numbers. The second algorithm statistically approximates the rank of nodes in the ordering. The scalability, efficiency and resilience to dynamics of both algorithms rely on their gossip-based models. These algorithms are proved viable theoretically and experimentally.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Vincent Gramoli <>
Submitted on : Wednesday, December 26, 2007 - 1:43:22 PM
Last modification on : Thursday, January 7, 2021 - 4:33:40 PM
Long-term archiving on: : Tuesday, April 13, 2010 - 3:42:18 PM


Files produced by the author(s)


  • HAL Id : inria-00201165, version 1
  • ARXIV : 0712.3980


Antonio Fernández, Vincent Gramoli, Ernesto Jimenez, Anne-Marie Kermarrec, Michel Raynal. Distributed Slicing in Dynamic Systems. The 27th International Conference on Distributed Computing Systems (ICDCS'07), Jun 2007, Toronto, Canada. pp.66. ⟨inria-00201165⟩



Record views


Files downloads