This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
27th International Conference on Distributed Computing Systems (ICDCS '07)
Distributed Slicing in Dynamic Systems
Toronto, Canada
June 25-June 27
ISBN: 0-7695-2837-3
Antonio Fernandez, Universidad Rey Juan Carlos, Spain
Vincent Gramoli, IRISA, INRIA, France
Ernesto Jimenez, Universidad Politecnica de Madrid, Spain
Anne-Marie Kermarrec, IRISA, INRIA Universite Rennes, France
Michel Raynal, IRISA, INRIA Universite Rennes, 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.
Citation:
Antonio Fernandez, Vincent Gramoli, Ernesto Jimenez, Anne-Marie Kermarrec, Michel Raynal, "Distributed Slicing in Dynamic Systems," icdcs, pp.66, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.