[{"ddc":["040"],"title":"A Self-Stabilization Process for Small-World Networks","user_id":"15504","abstract":[{"text":"Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:56Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","department":[{"_id":"79"}],"file_date_updated":"2018-03-14T14:13:13Z","author":[{"last_name":"Kniesburges","first_name":"Sebastian","full_name":"Kniesburges, Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"relation":"main_file","success":1,"date_updated":"2018-03-14T14:13:13Z","content_type":"application/pdf","creator":"florida","file_id":"1230","file_size":210176,"access_level":"closed","date_created":"2018-03-14T14:13:13Z","file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf"}],"doi":"10.1109/IPDPS.2012.115","date_updated":"2022-01-06T07:03:04Z","_id":"640","page":"1261--1271","type":"conference","citation":{"short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115.","mla":"Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }"},"year":"2012"},{"page":"507--516","type":"conference","year":"2011","citation":{"short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair Medium Access Despite Reactive Jamming,” in 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, 2011, pp. 507--516.","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive and Fair Medium Access Despite Reactive Jamming. In: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011. IEEE Computer Society; 2011:507--516. doi:10.1109/ICDCS.2011.8","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 (pp. 507--516). IEEE Computer Society. https://doi.org/10.1109/ICDCS.2011.8","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Medium Access Despite Reactive Jamming.” In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, 507--516. IEEE Computer Society, 2011. https://doi.org/10.1109/ICDCS.2011.8.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive and Fair Medium Access Despite Reactive Jamming}, DOI={10.1109/ICDCS.2011.8}, booktitle={2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={507--516} }","mla":"W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive Jamming.” 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516, doi:10.1109/ICDCS.2011.8."},"doi":"10.1109/ICDCS.2011.8","_id":"1891","date_updated":"2022-01-06T06:53:54Z","date_created":"2018-03-28T07:08:13Z","status":"public","publication_identifier":{"isbn":["978-0-7695-4364-2"]},"department":[{"_id":"79"}],"publication":"2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"publisher":"IEEE Computer Society","user_id":"15504","title":"Competitive and Fair Medium Access Despite Reactive Jamming"},{"title":"Towards jamming-resistant and competitive medium access in the SINR model","user_id":"15504","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"publisher":"ACM","department":[{"_id":"79"}],"publication":"Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011","publication_identifier":{"isbn":["978-1-4503-0868-7"]},"status":"public","date_created":"2018-03-28T07:09:07Z","_id":"1892","date_updated":"2022-01-06T06:53:54Z","doi":"10.1145/2030686.2030697","type":"conference","citation":{"ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant and competitive medium access in the SINR model,” in Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 2011, pp. 33--36.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.","mla":"W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant and competitive medium access in the SINR model}, DOI={10.1145/2030686.2030697}, booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM. https://doi.org/10.1145/2030686.2030697","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and competitive medium access in the SINR model. In: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011. ACM; 2011:33--36. doi:10.1145/2030686.2030697","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” In Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 33--36. ACM, 2011. https://doi.org/10.1145/2030686.2030697."},"year":"2011","page":"33--36"},{"publisher":"ACM","author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"department":[{"_id":"79"}],"publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","status":"public","date_created":"2018-03-28T07:09:54Z","publication_identifier":{"isbn":["978-1-4503-0722-2"]},"user_id":"15504","title":"Self-stabilizing leader election for single-hop wireless networks despite jamming","citation":{"ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader election for single-hop wireless networks despite jamming,” in Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing leader election for single-hop wireless networks despite jamming}, DOI={10.1145/2107502.2107522}, booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={15} }","mla":"W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM. https://doi.org/10.1145/2107502.2107522","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election for single-hop wireless networks despite jamming. In: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011. ACM; 2011:15. doi:10.1145/2107502.2107522","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 15. ACM, 2011. https://doi.org/10.1145/2107502.2107522."},"year":"2011","type":"conference","page":"15","_id":"1893","date_updated":"2022-01-06T06:53:54Z","doi":"10.1145/2107502.2107522"},{"date_updated":"2022-01-06T06:53:55Z","_id":"1895","doi":"10.1145/1989493.1989527","page":"235--244","citation":{"short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing chord overlay network,” in SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011), 2011, pp. 235--244.","apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244). https://doi.org/10.1145/1989493.1989527","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing chord overlay network. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011). ; 2011:235--244. doi:10.1145/1989493.1989527","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 235--244, 2011. https://doi.org/10.1145/1989493.1989527.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord: a self-stabilizing chord overlay network}, DOI={10.1145/1989493.1989527}, booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2011}, pages={235--244} }","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527."},"type":"conference","year":"2011","user_id":"15504","title":"Re-Chord: a self-stabilizing chord overlay network","publication":"SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)","department":[{"_id":"79"}],"author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-03-28T07:12:49Z","status":"public","publication_identifier":{"isbn":["978-1-4503-0743-7"]}},{"publication_identifier":{"isbn":["978-3-642-19093-3"]},"volume":6552,"status":"public","date_created":"2018-03-28T07:17:05Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","user_id":"15504","type":"conference","citation":{"bibtex":"@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}, volume={6552}, DOI={10.1007/978-3-642-19094-0_18}, booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181}, collection={Lecture Notes in Computer Science} }","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 6552:170--181. Lecture Notes in Computer Science. Springer, 2011. https://doi.org/10.1007/978-3-642-19094-0_18.","apa":"Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer. https://doi.org/10.1007/978-3-642-19094-0_18","ama":"Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181. doi:10.1007/978-3-642-19094-0_18","ieee":"S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 2011, vol. 6552, pp. 170--181.","short":"S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170--181."},"year":"2011","page":"170--181","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-19094-0_18","_id":"1899","date_updated":"2022-01-06T06:53:56Z","intvolume":" 6552"},{"doi":"10.1007/978-1-4614-1168-0_9","_id":"1900","date_updated":"2022-01-06T06:53:57Z","page":"155--168","type":"book_chapter","year":"2011","citation":{"mla":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.","bibtex":"@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing: From Physical to Logical Networks}, DOI={10.1007/978-1-4614-1168-0_9}, booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer}, author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168} }","apa":"Scheideler, C., & Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In Computer Science, The Hardware, Software and Heart of It (pp. 155--168). Springer. https://doi.org/10.1007/978-1-4614-1168-0_9","ama":"Scheideler C, Graffi K. Programming for Distributed Computing: From Physical to Logical Networks. In: Computer Science, The Hardware, Software and Heart of It. Springer; 2011:155--168. doi:10.1007/978-1-4614-1168-0_9","chicago":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” In Computer Science, The Hardware, Software and Heart of It, 155--168. Springer, 2011. https://doi.org/10.1007/978-1-4614-1168-0_9.","ieee":"C. Scheideler and K. Graffi, “Programming for Distributed Computing: From Physical to Logical Networks,” in Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168."},"user_id":"15504","title":"Programming for Distributed Computing: From Physical to Logical Networks","date_created":"2018-03-28T07:17:53Z","status":"public","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"department":[{"_id":"79"}],"publication":"Computer Science, The Hardware, Software and Heart of It","publisher":"Springer","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"}]},{"date_updated":"2022-01-06T06:53:57Z","_id":"1901","doi":"10.1007/978-3-642-15328-0_22","year":"2011","citation":{"mla":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.","bibtex":"@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate Information?}, DOI={10.1007/978-3-642-15328-0_22}, booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian}, year={2011}, pages={223--229} }","apa":"Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In Algorithms Unplugged (pp. 223--229). Springer. https://doi.org/10.1007/978-3-642-15328-0_22","ama":"Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In: Algorithms Unplugged. Springer; 2011:223--229. doi:10.1007/978-3-642-15328-0_22","chicago":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” In Algorithms Unplugged, 223--229. Springer, 2011. https://doi.org/10.1007/978-3-642-15328-0_22.","ieee":"C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in Algorithms Unplugged, Springer, 2011, pp. 223--229.","short":"C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229."},"type":"book_chapter","page":"223--229","user_id":"15504","title":"Broadcasting - How Can I Quickly Disseminate Information?","publisher":"Springer","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"publication":"Algorithms Unplugged","status":"public","date_created":"2018-03-28T07:18:43Z","publication_identifier":{"isbn":["978-3-642-15327-3"]}},{"_id":"1902","date_updated":"2022-01-06T06:53:57Z","doi":"10.1007/978-3-642-15328-0","citation":{"short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Algorithms Unplugged, 2011.","ieee":"B. Vöcking et al., Algorithms Unplugged. 2011.","chicago":"Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. Algorithms Unplugged, 2011. https://doi.org/10.1007/978-3-642-15328-0.","ama":"Vöcking B, Alt H, Dietzfelbinger M, et al. Algorithms Unplugged.; 2011. doi:10.1007/978-3-642-15328-0","apa":"Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., & Wagner, D. (2011). Algorithms Unplugged. https://doi.org/10.1007/978-3-642-15328-0","mla":"Vöcking, Berthold, et al. Algorithms Unplugged. 2011, doi:10.1007/978-3-642-15328-0.","bibtex":"@book{Vöcking_Alt_Dietzfelbinger_Reischuk_Scheideler_Vollmer_Wagner_2011, title={Algorithms Unplugged}, DOI={10.1007/978-3-642-15328-0}, author={Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}, year={2011} }"},"type":"book","year":"2011","title":"Algorithms Unplugged","user_id":"15504","department":[{"_id":"79"}],"author":[{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"},{"last_name":"Alt","first_name":"Helmut","full_name":"Alt, Helmut"},{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"full_name":"Reischuk, Rüdiger","first_name":"Rüdiger","last_name":"Reischuk"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Vollmer","full_name":"Vollmer, Heribert","first_name":"Heribert"},{"last_name":"Wagner","full_name":"Wagner, Dorothea","first_name":"Dorothea"}],"publication_identifier":{"isbn":["978-3-642-15327-3"]},"date_created":"2018-03-28T07:19:31Z","status":"public"},{"title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","user_id":"15504","author":[{"full_name":"Kolman, Petr","first_name":"Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"}],"publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","status":"public","date_created":"2018-03-29T08:44:00Z","date_updated":"2022-01-06T06:54:00Z","_id":"1924","doi":"10.4230/LIPIcs.STACS.2011.129","year":"2011","type":"conference","citation":{"bibtex":"@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.4230/LIPIcs.STACS.2011.129}, booktitle={28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany}, author={Kolman, Petr and Scheideler, Christian}, year={2011}, pages={129--140} }","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140, doi:10.4230/LIPIcs.STACS.2011.129.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 129--140, 2011. https://doi.org/10.4230/LIPIcs.STACS.2011.129.","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. ; 2011:129--140. doi:10.4230/LIPIcs.STACS.2011.129","apa":"Kolman, P., & Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany (pp. 129--140). https://doi.org/10.4230/LIPIcs.STACS.2011.129","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” in 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.","short":"P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140."},"page":"129--140"},{"citation":{"bibtex":"@book{Setzer_2011, title={Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2011} }","mla":"Setzer, Alexander. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.","chicago":"Setzer, Alexander. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.","apa":"Setzer, A. (2011). Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk. Universität Paderborn.","ama":"Setzer A. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk. Universität Paderborn; 2011.","ieee":"A. Setzer, Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.","short":"A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011."},"type":"bachelorsthesis","year":"2011","supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"_id":"17997","date_updated":"2022-01-06T06:53:24Z","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2020-08-17T08:08:13Z","publisher":"Universität Paderborn","author":[{"last_name":"Setzer","id":"11108","first_name":"Alexander","full_name":"Setzer, Alexander"}],"department":[{"_id":"79"}],"title":"Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk","user_id":"477"},{"author":[{"full_name":"Sascha, Brauer","first_name":"Brauer","last_name":"Sascha"}],"department":[{"_id":"79"}],"status":"public","date_created":"2020-08-17T08:11:05Z","title":"Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems","user_id":"15504","type":"bachelorsthesis","year":"2011","citation":{"apa":"Sascha, B. (2011). Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems.","ama":"Sascha B. Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems.; 2011.","chicago":"Sascha, Brauer. Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems, 2011.","mla":"Sascha, Brauer. Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems. 2011.","bibtex":"@book{Sascha_2011, title={Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems}, author={Sascha, Brauer}, year={2011} }","short":"B. Sascha, Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems, 2011.","ieee":"B. Sascha, Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems. 2011."},"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:24Z","_id":"17998"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:57Z","has_accepted_license":"1","status":"public","file":[{"access_level":"closed","date_created":"2018-03-14T13:58:11Z","file_name":"645-spaa70-scheideler.pdf","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-14T13:58:11Z","file_id":"1228","creator":"florida","file_size":268500}],"publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-14T13:58:11Z","department":[{"_id":"79"}],"author":[{"first_name":"Benjamin","full_name":"Doerr, Benjamin","last_name":"Doerr"},{"last_name":"Goldberg","full_name":"Goldberg, Leslie Ann","first_name":"Leslie Ann"},{"last_name":"Minder","full_name":"Minder, Lorenz","first_name":"Lorenz"},{"full_name":"Sauerwald, Thomas","first_name":"Thomas","last_name":"Sauerwald"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"15504","title":"Stabilizing consensus with the power of two choices","ddc":["040"],"abstract":[{"lang":"eng","text":"In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence."}],"page":"149-158","year":"2011","type":"conference","citation":{"mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.","bibtex":"@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing consensus with the power of two choices}, DOI={10.1145/1989493.1989516}, booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011}, pages={149–158} }","ama":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus with the power of two choices. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2011:149-158. doi:10.1145/1989493.1989516","apa":"Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., & Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 149–158). https://doi.org/10.1145/1989493.1989516","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 149–58, 2011. https://doi.org/10.1145/1989493.1989516.","ieee":"B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing consensus with the power of two choices,” in Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.","short":"B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158."},"doi":"10.1145/1989493.1989516","date_updated":"2022-01-06T07:03:05Z","_id":"645"},{"department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"title":"Self-Stabilizing DeBruijn Networks","series_title":"LNCS","date_updated":"2022-01-06T07:03:06Z","doi":"10.1007/978-3-642-24550-3_31","file_date_updated":"2018-03-14T13:57:26Z","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-14T13:57:26Z","creator":"florida","file_id":"1227","file_size":339664,"access_level":"closed","date_created":"2018-03-14T13:57:26Z","file_name":"646-SSS2011-Scheideler_02.pdf"}],"date_created":"2017-10-17T12:42:58Z","status":"public","has_accepted_license":"1","abstract":[{"text":"This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected.","lang":"eng"}],"ddc":["040"],"user_id":"15504","page":"416-430","citation":{"ieee":"A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.","short":"A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.","mla":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.","bibtex":"@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing DeBruijn Networks}, DOI={10.1007/978-3-642-24550-3_31}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler, Christian}, year={2011}, pages={416–430}, collection={LNCS} }","ama":"Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:416-430. doi:10.1007/978-3-642-24550-3_31","apa":"Richa, A. W., & Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 416–430). https://doi.org/10.1007/978-3-642-24550-3_31","chicago":"Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.” In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 416–30. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_31."},"type":"conference","year":"2011","_id":"646"},{"_id":"648","date_updated":"2022-01-06T07:03:06Z","supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"language":[{"iso":"eng"}],"year":"2011","citation":{"short":"P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität Paderborn, 2011.","ieee":"P. Brandes, Robust Distributed Computation in Dynamic Networks. Universität Paderborn, 2011.","chicago":"Brandes, Philipp. Robust Distributed Computation in Dynamic Networks. Universität Paderborn, 2011.","ama":"Brandes P. Robust Distributed Computation in Dynamic Networks. Universität Paderborn; 2011.","apa":"Brandes, P. (2011). Robust Distributed Computation in Dynamic Networks. Universität Paderborn.","bibtex":"@book{Brandes_2011, title={Robust Distributed Computation in Dynamic Networks}, publisher={Universität Paderborn}, author={Brandes, Philipp}, year={2011} }","mla":"Brandes, Philipp. Robust Distributed Computation in Dynamic Networks. Universität Paderborn, 2011."},"type":"mastersthesis","user_id":"477","title":"Robust Distributed Computation in Dynamic Networks","date_created":"2017-10-17T12:42:58Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Brandes","full_name":"Brandes, Philipp","first_name":"Philipp"}],"publisher":"Universität Paderborn"},{"page":"154-155","citation":{"chicago":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” In Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 154–55, 2011. https://doi.org/10.1109/P2P.2011.6038673.","ama":"Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP). ; 2011:154-155. doi:10.1109/P2P.2011.6038673","apa":"Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP) (pp. 154–155). https://doi.org/10.1109/P2P.2011.6038673","bibtex":"@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned}, DOI={10.1109/P2P.2011.6038673}, booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }","mla":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–55, doi:10.1109/P2P.2011.6038673.","short":"K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155.","ieee":"K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned,” in Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155."},"year":"2011","type":"conference","_id":"654","date_created":"2017-10-17T12:42:59Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)","file_date_updated":"2018-03-14T13:50:18Z","author":[{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"}],"file":[{"creator":"florida","file_id":"1221","file_size":327680,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-14T13:50:18Z","date_created":"2018-03-14T13:50:18Z","file_name":"654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf","access_level":"closed"}],"ddc":["040"],"user_id":"477","abstract":[{"lang":"eng","text":"Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project “QuaP2P”,which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project “On-the-fly Computing” aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV."}],"language":[{"iso":"eng"}],"doi":"10.1109/P2P.2011.6038673","date_updated":"2022-01-06T07:03:11Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"title":"PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned"},{"author":[{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"full_name":"Mohd, Rizal","first_name":"Rizal","last_name":"Mohd"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-03-14T13:46:48Z","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"file_name":"662-SSS2011-Corona-Scheideler.pdf","date_created":"2018-03-14T13:46:48Z","access_level":"closed","file_size":305543,"creator":"florida","file_id":"1217","content_type":"application/pdf","date_updated":"2018-03-14T13:46:48Z","success":1,"relation":"main_file"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:43:01Z","abstract":[{"lang":"eng","text":"We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph."}],"ddc":["040"],"user_id":"15504","year":"2011","type":"conference","citation":{"mla":"Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.","bibtex":"@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS} }","apa":"Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27","ama":"Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370. doi:10.1007/978-3-642-24550-3_27","chicago":"Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.","ieee":"M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.","short":"M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370."},"page":"356--370","_id":"662","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Corona: A Stabilizing Deterministic Message-Passing Skip List","series_title":"LNCS","date_updated":"2022-01-06T07:03:13Z","doi":"10.1007/978-3-642-24550-3_27"},{"user_id":"477","title":"Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord","publisher":"Universität Paderborn","author":[{"full_name":"Wette, Philip","first_name":"Philip","last_name":"Wette"}],"department":[{"_id":"79"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:43:01Z","_id":"665","date_updated":"2022-01-06T07:03:14Z","language":[{"iso":"ger"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"citation":{"ieee":"P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011.","short":"P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011.","bibtex":"@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2011} }","mla":"Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011.","chicago":"Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011.","apa":"Wette, P. (2011). Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn.","ama":"Wette P. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn; 2011."},"year":"2011","type":"mastersthesis"},{"date_created":"2018-03-28T07:21:50Z","status":"public","publication":"Informatik Spektrum","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"title":"Algorithmische Grundlagen verteilter Speichersysteme","user_id":"14955","page":"468--474","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474, doi:10.1007/s00287-010-0470-2.","bibtex":"@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }","ama":"Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2","apa":"Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010): 468--474. https://doi.org/10.1007/s00287-010-0470-2."},"type":"journal_article","year":"2010","language":[{"iso":"eng"}],"doi":"10.1007/s00287-010-0470-2","issue":"5","date_updated":"2022-01-06T06:53:57Z","_id":"1903"},{"department":[{"_id":"79"}],"publication":"Theory of Computing Systems","author":[{"full_name":"Gavoille, Cyril","first_name":"Cyril","last_name":"Gavoille"},{"last_name":"Patt-Shamir","first_name":"Boaz","full_name":"Patt-Shamir, Boaz"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-03-28T07:22:21Z","status":"public","title":"Foreword","user_id":"15504","page":"809--810","year":"2010","type":"journal_article","citation":{"ama":"Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems. 2010;(4):809--810. doi:10.1007/s00224-010-9284-5","apa":"Gavoille, C., Patt-Shamir, B., & Scheideler, C. (2010). Foreword. Theory of Computing Systems, (4), 809--810. https://doi.org/10.1007/s00224-010-9284-5","chicago":"Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.” Theory of Computing Systems, no. 4 (2010): 809--810. https://doi.org/10.1007/s00224-010-9284-5.","mla":"Gavoille, Cyril, et al. “Foreword.” Theory of Computing Systems, no. 4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.","bibtex":"@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={10.1007/s00224-010-9284-5}, number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }","short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing Systems, no. 4, pp. 809--810, 2010."},"date_updated":"2022-01-06T06:53:57Z","_id":"1904","doi":"10.1007/s00224-010-9284-5","issue":"4"}]