{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:53:47Z","timestamp":1761976427362,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319030883"},{"type":"electronic","value":"9783319030890"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03089-0_16","type":"book-chapter","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T15:18:14Z","timestamp":1382023094000},"page":"221-236","source":"Crossref","is-referenced-by-count":3,"title":["Linearizing Peer-to-Peer Systems with Oracles"],"prefix":"10.1007","author":[{"given":"Rizal Mohd","family":"Nor","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1290672.1290674","volume":"3","author":"J. Aspnes","year":"2007","unstructured":"Aspnes, J., Shah, G.: Skip graphs. ACM Transactions on Algorithms\u00a03(4), 1\u201337 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"16_CR2","first-page":"318","volume-title":"SODA 2004: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA 2004: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 318\u2013327. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-28634-9_11","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"D. Cavin","year":"2004","unstructured":"Cavin, D., Sasson, Y., Schiper, A.: Consensus with unknown participants or fundamental self-organization. In: Nikolaidis, I., Barbeau, M., An, H.-C. (eds.) ADHOC-NOW 2004. LNCS, vol.\u00a03158, pp. 135\u2013148. Springer, Heidelberg (2004)"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of ACM"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cramer, C., Fuhrmann, T.: ISPRP: a message-efficient protocol for initializing structured P2P networks. In: International Performance Computing and Communications Conference (IPCCC), pp. 365\u2013370 (2005)","DOI":"10.1109\/PCCC.2005.1460589"},{"issue":"11","key":"16_CR7","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilization in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"16_CR8","unstructured":"Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. Technical Report 1110.0334, ArXiv eprint (October 2011)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-31104-8_3","volume-title":"Structural Information and Communication Complexity","author":"Y. Emek","year":"2012","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Kutten, S., Peleg, D.: Notions of connectivity in overlay networks. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol.\u00a07355, pp. 25\u201335. Springer, Heidelberg (2012)"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-12200-2_27","volume-title":"LATIN 2010: Theoretical Informatics","author":"D. Gall","year":"2010","unstructured":"Gall, D., Jacob, R., Richa, A.W., Scheideler, C., Schmid, S., T\u00e4ubig, H.: Time complexity of distributed topological self-stabilization: The case of graph linearization. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 294\u2013305. Springer, Heidelberg (2010)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Gouda, M.G., McGuire, T.M.: Accelerated heartbeat protocols. In: 18th International Conference on Distributed Computing Systems (ICDCS), pp. 202\u2013209 (May 1998)","DOI":"10.1109\/ICDCS.1998.679503"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Greve, F., Tixeuil, S.: Knowledge connectivity vs. synchrony requirements for fault-tolerant agreement in unknown networks. In: Proceedings of IEEE International Conference on Dependable Systems and networks (DSN), pp. 82\u201391. IEEE (June 2007)","DOI":"10.1109\/DSN.2007.61"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ipl.2004.01.019","volume":"90","author":"N.J.A. Harvey","year":"2004","unstructured":"Harvey, N.J.A., Ian Munro, J.: Deterministic skipnet. Inf. Process. Lett.\u00a090(4), 205\u2013208 (2004)","journal-title":"Inf. Process. Lett."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/571825.571857","volume-title":"PODC 2002: Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC 2002: Proceedings of the Twenty-first Annual Symposium on Principles of Distributed Computing, pp. 183\u2013192. ACM, New York (2002)"},{"key":"16_CR16","first-page":"367","volume-title":"SODA 1992: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algogrithms","author":"J.I. Munro","year":"1992","unstructured":"Munro, J.I., Papadakis, T., Sedgewick, R.: Deterministic skip lists. In: SODA 1992: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algogrithms, pp. 367\u2013375. Society for Industrial and Applied Mathematics, Philadelphia (1992)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-24550-3_27","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"R.M. Nor","year":"2011","unstructured":"Nor, R.M., Nesterenko, M., Scheideler, C.: Corona: A stabilizing deterministic message-passing skip list. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol.\u00a06976, pp. 356\u2013370. Springer, Heidelberg (2011)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Onus, M., Richa, A.W., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: ALENEX 2007: Proceedings of the Workshop on Algorithm Engineering and Experiments. SIAM ( January 2007)","DOI":"10.1137\/1.9781611972870.10"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE\/ACM Transactions on Networking\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Tixeuil, S.: Self-stabilizing Algorithms. In: Algorithms and Theory of Computation Handbook, 2nd edn., pp. 26.1\u201326.45. CRC Press, Taylor & Francis Group (2009); Chapman & Hall\/CRC Applied Algorithms and Data Structures","DOI":"10.1201\/9781584888215-c26"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03089-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:25:54Z","timestamp":1746033954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03089-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319030883","9783319030890"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03089-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}