Linearizing Peer-to-Peer Systems with Oracles

Abstract : We study distributed linearization or topological sorting in peer-to-peer networks. We define strict and eventual variants of the problem. We consider these problems restricted to existing peer identifiers or without this restriction. None of these variants are solvable in the asynchronous message-passing system model. We define a collection of oracles and prove which oracle combination is necessary to enable a solution for each variant of the linearization problem. We then present a linearization algorithm. We prove that this algorithm and a specific combination of the oracles solves each stated variant of the linearization problem.
Type de document :
Communication dans un congrès
International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2013, Osaka, Japan. Springer, 8255, pp.221-236, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-319-03089-0_16〉
Liste complète des métadonnées

https://hal.sorbonne-universite.fr/hal-00930281
Contributeur : Sébastien Tixeuil <>
Soumis le : mardi 14 janvier 2014 - 15:36:28
Dernière modification le : jeudi 22 novembre 2018 - 14:40:43

Identifiants

Collections

Citation

Rizal Mohd Nor, Mikhail Nesterenko, Sébastien Tixeuil. Linearizing Peer-to-Peer Systems with Oracles. International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2013, Osaka, Japan. Springer, 8255, pp.221-236, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-319-03089-0_16〉. 〈hal-00930281〉

Partager

Métriques

Consultations de la notice

391