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. © Springer International Publishing 2013.
CITATION STYLE
Nor, R. M., Nesterenko, M., & Tixeui, S. (2013). Linearizing peer-to-peer systems with oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8255 LNCS, pp. 221–236). https://doi.org/10.1007/978-3-319-03089-0_16
Mendeley helps you to discover research relevant for your work.