The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
Toronto, Canada
June 25, 2007 to June 27, 2007
ISBN: 0-7695-2837-3
pp: 66
Antonio Fernandez , Universidad Rey Juan Carlos, Spain
Michel Raynal , IRISA, INRIA Universite Rennes, France
Ernesto Jimenez , Universidad Politecnica de Madrid, Spain
Anne-Marie Kermarrec , IRISA, INRIA Universite Rennes, France
Vincent Gramoli , IRISA, INRIA, France
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.
Antonio Fernandez, Michel Raynal, Ernesto Jimenez, Anne-Marie Kermarrec, Vincent Gramoli, "Distributed Slicing in Dynamic Systems", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 66, 2007, doi:10.1109/ICDCS.2007.102
76 ms
(Ver 3.3 (11022016))