[{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-26T12:36:33Z","publication":"Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005","citation":{"mla":"Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 2005, pp. 267–70.","ama":"Dangelmaier W, Mueck B, Fischer M, Mahajan K,  Laroque C. Methods to lead the user to significant processes in a 3D material flow simulation. In: <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>. ; 2005:267-270.","bibtex":"@inproceedings{Dangelmaier_Mueck_Fischer_Mahajan_ Laroque_2005, title={Methods to lead the user to significant processes in a 3D material flow simulation}, booktitle={Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005}, author={Dangelmaier, Wilhelm and Mueck, Bengt and Fischer, Matthias and Mahajan, Kiran and  Laroque, Christoph}, year={2005}, pages={267–270} }","apa":"Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., &#38;  Laroque, C. (2005). Methods to lead the user to significant processes in a 3D material flow simulation. In <i>Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i> (pp. 267–270).","ieee":"W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, and C.  Laroque, “Methods to lead the user to significant processes in a 3D material flow simulation,” in <i>Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 2005, pp. 267–270.","chicago":"Dangelmaier, Wilhelm, Bengt Mueck, Matthias Fischer, Kiran Mahajan, and Christoph  Laroque. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” In <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 267–70, 2005.","short":"W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, C.  Laroque, in: Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–270."},"user_id":"15415","page":"267-270","_id":"18366","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:30Z","status":"public","title":"Methods to lead the user to significant processes in a 3D material flow simulation","year":"2005","author":[{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"},{"first_name":"Bengt","last_name":"Mueck","full_name":"Mueck, Bengt"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Mahajan, Kiran","first_name":"Kiran","last_name":"Mahajan"},{"last_name":" Laroque","first_name":"Christoph","full_name":" Laroque, Christoph"}]},{"_id":"18449","language":[{"iso":"eng"}],"user_id":"15415","author":[{"full_name":"Loeser, Christoph","first_name":"Christoph","last_name":"Loeser"},{"last_name":"Drüke","first_name":"Isabell","full_name":"Drüke, Isabell"},{"last_name":"Oesterdiekhoff","first_name":"Brigitte","full_name":"Oesterdiekhoff, Brigitte"}],"year":"2005","title":" Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario","status":"public","date_updated":"2022-01-06T06:53:32Z","date_created":"2020-08-27T12:04:12Z","department":[{"_id":"63"}],"type":"conference","citation":{"apa":"Loeser, C., Drüke, I., &#38; Oesterdiekhoff, B. (2005).  Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In <i>IEEE International Conference on Industrial Informatics (INDIN)</i>.","ieee":"C. Loeser, I. Drüke, and B. Oesterdiekhoff, “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario,” in <i>IEEE International Conference on Industrial Informatics (INDIN)</i>, 2005.","chicago":"Loeser, Christoph, Isabell Drüke, and Brigitte Oesterdiekhoff. “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” In <i>IEEE International Conference on Industrial Informatics (INDIN)</i>, 2005.","short":"C. Loeser, I. Drüke, B. Oesterdiekhoff, in: IEEE International Conference on Industrial Informatics (INDIN), 2005.","mla":"Loeser, Christoph, et al. “ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” <i>IEEE International Conference on Industrial Informatics (INDIN)</i>, 2005.","ama":"Loeser C, Drüke I, Oesterdiekhoff B.  Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In: <i>IEEE International Conference on Industrial Informatics (INDIN)</i>. ; 2005.","bibtex":"@inproceedings{Loeser_Drüke_Oesterdiekhoff_2005, title={ Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario}, booktitle={IEEE International Conference on Industrial Informatics (INDIN)}, author={Loeser, Christoph and Drüke, Isabell and Oesterdiekhoff, Brigitte}, year={2005} }"},"publication":"IEEE International Conference on Industrial Informatics (INDIN)"},{"user_id":"15415","_id":"18450","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:32Z","author":[{"last_name":"Oesterdiekhoff","first_name":"Brigitte","full_name":"Oesterdiekhoff, Brigitte"}],"status":"public","year":"2005","title":"Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-27T12:06:59Z","citation":{"bibtex":"@inproceedings{Oesterdiekhoff_2005, title={Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices}, booktitle={IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)}, author={Oesterdiekhoff, Brigitte}, year={2005} }","chicago":"Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” In <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2005.","ama":"Oesterdiekhoff B. Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In: <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. ; 2005.","short":"B. Oesterdiekhoff, in: IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005.","ieee":"B. Oesterdiekhoff, “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices,” in <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2005.","apa":"Oesterdiekhoff, B. (2005). Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>.","mla":"Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” <i>IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2005."},"publication":"IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)"},{"date_created":"2020-04-08T09:18:56Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","citation":{"ieee":"M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in <i>Peer-to-Peer Systems IV</i>, Berlin, Heidelberg, 2005.","apa":"Bienkowski, M., Korzeniowski, M., &#38; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>","short":"M. Bienkowski, M. Korzeniowski, F. Meyer auf der Heide, in: Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Dynamic Load Balancing in Distributed Hash Tables.” In <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11558989_20\">https://doi.org/10.1007/11558989_20</a>.","mla":"Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.” <i>Peer-to-Peer Systems IV</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>.","bibtex":"@inbook{Bienkowski_Korzeniowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Dynamic Load Balancing in Distributed Hash Tables}, DOI={<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>}, booktitle={Peer-to-Peer Systems IV}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2005} }","ama":"Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: <i>Peer-to-Peer Systems IV</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11558989_20\">10.1007/11558989_20</a>"},"publication":"Peer-to-Peer Systems IV","_id":"16468","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/11558989_20","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540290681","9783540319061"]},"author":[{"last_name":"Bienkowski","first_name":"Marcin","full_name":"Bienkowski, Marcin"},{"full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski","first_name":"Miroslaw"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2005","title":"Dynamic Load Balancing in Distributed Hash Tables","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:50Z"},{"_id":"16469","language":[{"iso":"eng"}],"doi":"10.1007/11549345_1","user_id":"15415","year":"2005","title":"Page Migration in Dynamic Networks","status":"public","publication_identifier":{"isbn":["9783540287025","9783540318675"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-08T09:23:36Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"Mathematical Foundations of Computer Science 2005","citation":{"chicago":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>.","short":"M. Bienkowski, F. Meyer auf der Heide, in: Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.","apa":"Bienkowski, M., &#38; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549345_1\">https://doi.org/10.1007/11549345_1</a>","ieee":"M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in <i>Mathematical Foundations of Computer Science 2005</i>, Berlin, Heidelberg, 2005.","ama":"Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: <i>Mathematical Foundations of Computer Science 2005</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>","bibtex":"@inbook{Bienkowski_Meyer auf der Heide_2005, place={Berlin, Heidelberg}, title={Page Migration in Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>}, booktitle={Mathematical Foundations of Computer Science 2005}, author={Bienkowski, Marcin and Meyer auf der Heide, Friedhelm}, year={2005} }","mla":"Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.” <i>Mathematical Foundations of Computer Science 2005</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549345_1\">10.1007/11549345_1</a>."}},{"citation":{"chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “A Web Computing Environment for Parallel Algorithms in Java.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 801–8, 2005. <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>.","short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.","apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 801–808). <a href=\"https://doi.org/10.1007/11752578_96\">https://doi.org/10.1007/11752578_96</a>","ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–808.","ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:801-808. doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={A Web Computing Environment for Parallel Algorithms in Java}, DOI={<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={801–808} }","mla":"Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 801–08, doi:<a href=\"https://doi.org/10.1007/11752578_96\">10.1007/11752578_96</a>."},"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","abstract":[{"text":"We present a web computing library (PUBWCL) in Java that allows to execute strongly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed over the internet whose owners are willing to donate their unused computation power.\r\nPUBWCL is realized as a peer-to-peer system and features migration and restoration of BSP processes executed on it.\r\nThe use of Java guarantees a high level of security and makes PUBWCL platform independent. In order to estimate the loss of efficiency inherent in such a Java-based system, we have compared it to our C-based PUB-Library.\r\n","lang":"eng"}],"date_created":"2020-04-08T09:25:44Z","department":[{"_id":"63"}],"type":"conference","publication_identifier":{"isbn":["9783540341413","9783540341420"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"status":"public","year":"2005","title":"A Web Computing Environment for Parallel Algorithms in Java","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16470","page":"801-808","doi":"10.1007/11752578_96","user_id":"15415"},{"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540341413","9783540341420"]},"title":"Load Balancing Strategies in a Web Computing Environment","year":"2005","status":"public","user_id":"15415","doi":"10.1007/11752578_101","_id":"16471","language":[{"iso":"eng"}],"page":"839-846","abstract":[{"text":"We compare different load balancing strategies for Bulk-Synchronous Parallel (BSP) programs in a web computing environment. In order to handle the influence of the fluctuating available computation power, we classify the external work load.\r\n\r\nWe evaluate the load balancing algorithms using our web computing library for BSP programs in Java (PUBWCL). Thereby we simulated the external work load in order to have repeatable testing conditions.\r\n\r\nWith the best performing load balancing strategy we could save 39% of the execution time averaged and even up to 50% in particular cases.","lang":"eng"}],"citation":{"ama":"Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. ; 2005:839-846. doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>","bibtex":"@inproceedings{Bonorden_Gehweiler_Meyer auf der Heide_2005, title={Load Balancing Strategies in a Web Computing Environment}, DOI={<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>}, booktitle={Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Bonorden, Olaf and Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2005}, pages={839–846} }","mla":"Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.” <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–46, doi:<a href=\"https://doi.org/10.1007/11752578_101\">10.1007/11752578_101</a>.","short":"O. Bonorden, J. Gehweiler, F. Meyer auf der Heide, in: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.","chicago":"Bonorden, Olaf, Joachim Gehweiler, and Friedhelm Meyer auf der Heide. “Load Balancing Strategies in a Web Computing Environment.” In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 839–46, 2005. <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>.","apa":"Bonorden, O., Gehweiler, J., &#38; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 839–846). <a href=\"https://doi.org/10.1007/11752578_101\">https://doi.org/10.1007/11752578_101</a>","ieee":"O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in <i>Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2005, pp. 839–846."},"publication":"Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-08T09:30:12Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-06-22T13:22:22Z","related_material":{"link":[{"url":"http://www.win.tue.nl/EWCG2005/Proceedings/43.pdf","relation":"confirmation"}]},"publication":"Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005","citation":{"ieee":"M. Bienkowski, V. Damerow, F. Meyer auf der Heide, and C. Sohler, “Average case complexity of Voronoi diagrams of n sites from the unit cube,” in <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>, 2005.","mla":"Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>, Technische Universiteit Eindhoven, 2005.","apa":"Bienkowski, M., Damerow, V., Meyer auf der Heide, F., &#38; Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven.","bibtex":"@inproceedings{Bienkowski_Damerow_Meyer auf der Heide_Sohler_2005, title={Average case complexity of Voronoi diagrams of n sites from the unit cube}, booktitle={Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005}, publisher={Technische Universiteit Eindhoven}, author={Bienkowski, Marcin and Damerow, Valentina and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2005} }","chicago":"Bienkowski, Marcin, Valentina Damerow, Friedhelm Meyer auf der Heide, and Christian Sohler. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” In <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven, 2005.","short":"M. Bienkowski, V. Damerow, F. Meyer auf der Heide, C. Sohler, in: Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.","ama":"Bienkowski M, Damerow V, Meyer auf der Heide F, Sohler C. Average case complexity of Voronoi diagrams of n sites from the unit cube. In: <i>Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005</i>. Technische Universiteit Eindhoven; 2005."},"user_id":"15415","language":[{"iso":"eng"}],"_id":"17112","publisher":"Technische Universiteit Eindhoven","date_updated":"2022-01-06T06:53:05Z","year":"2005","title":"Average case complexity of Voronoi diagrams of n sites from the unit cube","status":"public","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"full_name":"Damerow, Valentina","last_name":"Damerow","first_name":"Valentina"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}]},{"_id":"17113","language":[{"iso":"eng"}],"series_title":"Dagstuhl Seminar Proceedings","volume":"05361","editor":[{"full_name":"Leonardi, Stefano","first_name":"Stefano","last_name":"Leonardi"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Wagner","first_name":"Dorothea","full_name":"Wagner, Dorothea"}],"user_id":"15415","conference":{"location":"Schloss Dagstuhl, Germany","name":"Dagstuhl Seminar Proceedings","start_date":"2005-09-04","end_date":"2005-09-09"},"status":"public","title":"Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks","year":"2005","intvolume":"      5361","date_updated":"2022-01-06T06:53:05Z","date_created":"2020-06-22T13:52:52Z","department":[{"_id":"63"}],"type":"conference_editor","citation":{"mla":"Leonardi, Stefano, et al., editors. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol. 05361, 2005.","bibtex":"@book{Leonardi_Meyer auf der Heide_Wagner_2005, series={Dagstuhl Seminar Proceedings}, title={Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks}, volume={05361}, year={2005}, collection={Dagstuhl Seminar Proceedings} }","ama":"Leonardi S, Meyer auf der Heide F, Wagner D, eds. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol 05361.; 2005.","ieee":"S. Leonardi, F. Meyer auf der Heide, and D. Wagner, Eds., <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>, vol. 05361. 2005.","apa":"Leonardi, S., Meyer auf der Heide, F., &#38; Wagner, D. (Eds.). (2005). <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i> (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.","short":"S. Leonardi, F. Meyer auf der Heide, D. Wagner, eds., Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks, 2005.","chicago":"Leonardi, Stefano, Friedhelm Meyer auf der Heide, and Dorothea Wagner, eds. <i>Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks</i>. Vol. 05361. Dagstuhl Seminar Proceedings, 2005."},"related_material":{"link":[{"url":"https://drops.dagstuhl.de/opus/volltexte/2006/570/","relation":"confirmation"}]}},{"language":[{"iso":"eng"}],"_id":"15058","page":"14-26","doi":"10.1016/j.tcs.2005.09.053","user_id":"15415","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"publication_identifier":{"issn":["0304-3975"]},"title":"Stability versus speed in a computable algebraic model","status":"public","year":"2005","date_updated":"2022-01-06T06:52:15Z","publication_status":"published","date_created":"2019-11-20T13:22:22Z","department":[{"_id":"63"}],"type":"journal_article","citation":{"ieee":"M. Ziegler, “Stability versus speed in a computable algebraic model,” <i>Theoretical Computer Science</i>, pp. 14–26, 2005.","apa":"Ziegler, M. (2005). Stability versus speed in a computable algebraic model. <i>Theoretical Computer Science</i>, 14–26. <a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">https://doi.org/10.1016/j.tcs.2005.09.053</a>","mla":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” <i>Theoretical Computer Science</i>, 2005, pp. 14–26, doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">10.1016/j.tcs.2005.09.053</a>.","bibtex":"@article{Ziegler_2005, title={Stability versus speed in a computable algebraic model}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">10.1016/j.tcs.2005.09.053</a>}, journal={Theoretical Computer Science}, author={Ziegler, Martin}, year={2005}, pages={14–26} }","ama":"Ziegler M. Stability versus speed in a computable algebraic model. <i>Theoretical Computer Science</i>. 2005:14-26. doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">10.1016/j.tcs.2005.09.053</a>","short":"M. Ziegler, Theoretical Computer Science (2005) 14–26.","chicago":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” <i>Theoretical Computer Science</i>, 2005, 14–26. <a href=\"https://doi.org/10.1016/j.tcs.2005.09.053\">https://doi.org/10.1016/j.tcs.2005.09.053</a>."},"publication":"Theoretical Computer Science"},{"user_id":"5786","volume":153,"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19616","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:08Z","intvolume":"       153","title":"Data Distribution Algorithms for Storage Networks","year":"2004","status":"public","author":[{"first_name":"Kay","last_name":"Salzwedel","full_name":"Salzwedel, Kay"}],"publication_identifier":{"isbn":["3-935433-62-X"]},"type":"dissertation","department":[{"_id":"26"},{"_id":"63"}],"date_created":"2020-09-22T08:37:39Z","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20040101385"}]},"citation":{"bibtex":"@book{Salzwedel_2004, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Distribution Algorithms for Storage Networks}, volume={153}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Salzwedel, Kay}, year={2004}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Salzwedel K. <i>Data Distribution Algorithms for Storage Networks</i>. Vol 153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2004.","mla":"Salzwedel, Kay. <i>Data Distribution Algorithms for Storage Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.","chicago":"Salzwedel, Kay. <i>Data Distribution Algorithms for Storage Networks</i>. Vol. 153. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.","short":"K. Salzwedel, Data Distribution Algorithms for Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.","ieee":"K. Salzwedel, <i>Data Distribution Algorithms for Storage Networks</i>, vol. 153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.","apa":"Salzwedel, K. (2004). <i>Data Distribution Algorithms for Storage Networks</i> (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}]},{"date_updated":"2022-01-06T06:54:10Z","publication_status":"published","status":"public","title":"The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes","year":"2004","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540230922","9783540302179"]},"author":[{"last_name":"Briest","first_name":"Patrick","full_name":"Briest, Patrick"},{"full_name":"Brockhoff, Dimo","last_name":"Brockhoff","first_name":"Dimo"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"first_name":"Matthias","last_name":"Englert","full_name":"Englert, Matthias"},{"first_name":"Christian","last_name":"Gunia","full_name":"Gunia, Christian"},{"full_name":"Heering, Oliver","first_name":"Oliver","last_name":"Heering"},{"first_name":"Thomas","last_name":"Jansen","full_name":"Jansen, Thomas"},{"first_name":"Michael","last_name":"Leifhelm","full_name":"Leifhelm, Michael"},{"last_name":"Plociennik","first_name":"Kai","full_name":"Plociennik, Kai"},{"full_name":"Röglin, Heiko","first_name":"Heiko","last_name":"Röglin"},{"full_name":"Schweer, Andrea","last_name":"Schweer","first_name":"Andrea"},{"full_name":"Sudholt, Dirk","last_name":"Sudholt","first_name":"Dirk"},{"full_name":"Tannenbaum, Stefan","last_name":"Tannenbaum","first_name":"Stefan"},{"last_name":"Wegener","first_name":"Ingo","full_name":"Wegener, Ingo"}],"doi":"10.1007/978-3-540-30217-9_4","user_id":"15415","_id":"19692","language":[{"iso":"eng"}],"publication":"Parallel Problem Solving from Nature - PPSN VIII","citation":{"chicago":"Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” In <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">https://doi.org/10.1007/978-3-540-30217-9_4</a>.","short":"P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T. Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt, S. Tannenbaum, I. Wegener, in: Parallel Problem Solving from Nature - PPSN VIII, Berlin, Heidelberg, 2004.","ieee":"P. Briest <i>et al.</i>, “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004.","apa":"Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O., … Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">https://doi.org/10.1007/978-3-540-30217-9_4</a>","bibtex":"@inproceedings{Briest_Brockhoff_Degener_Englert_Gunia_Heering_Jansen_Leifhelm_Plociennik_Röglin_et al._2004, place={Berlin, Heidelberg}, title={The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>}, booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Briest, Patrick and Brockhoff, Dimo and Degener, Bastian and Englert, Matthias and Gunia, Christian and Heering, Oliver and Jansen, Thomas and Leifhelm, Michael and Plociennik, Kai and Röglin, Heiko and et al.}, year={2004} }","ama":"Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg; 2004. doi:<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>","mla":"Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004, doi:<a href=\"https://doi.org/10.1007/978-3-540-30217-9_4\">10.1007/978-3-540-30217-9_4</a>."},"type":"conference","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-09-25T10:41:37Z"},{"citation":{"mla":"Schweer, Andrea, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004.","ama":"Schweer A, Leifhelm M, Degener B, et al. Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In: <i>Parallel Problem Solving from Nature - PPSN VIII</i>. ; 2004.","bibtex":"@inproceedings{Schweer_Leifhelm_Degener_Heering_Tannenbaum_Röglin_Gunia_Englert_Briest_Sudholt_et al._2004, title={Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization}, booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Schweer, Andrea and Leifhelm, Michael and Degener, Bastian and Heering, Oliver and Tannenbaum, Stefan and Röglin, Heiko and Gunia, Christian and Englert, Matthias and Briest, Patrick and Sudholt, Dirk and et al.}, year={2004} }","apa":"Schweer, A., Leifhelm, M., Degener, B., Heering, O., Tannenbaum, S., Röglin, H., … Plociennik, K. (2004). Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In <i>Parallel Problem Solving from Nature - PPSN VIII</i>.","ieee":"A. Schweer <i>et al.</i>, “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization,” in <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004.","chicago":"Schweer, Andrea, Michael Leifhelm, Bastian Degener, Oliver Heering, Stefan Tannenbaum, Heiko Röglin, Christian Gunia, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” In <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004.","short":"A. Schweer, M. Leifhelm, B. Degener, O. Heering, S. Tannenbaum, H. Röglin, C. Gunia, M. Englert, P. Briest, D. Sudholt, D. Brockhoff, I. Wegener, T. Jansen, K. Plociennik, in: Parallel Problem Solving from Nature - PPSN VIII, 2004."},"publication":"Parallel Problem Solving from Nature - PPSN VIII","date_created":"2020-09-25T10:45:22Z","department":[{"_id":"63"}],"type":"conference","author":[{"last_name":"Schweer","first_name":"Andrea","full_name":"Schweer, Andrea"},{"full_name":"Leifhelm, Michael","first_name":"Michael","last_name":"Leifhelm"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Heering, Oliver","first_name":"Oliver","last_name":"Heering"},{"full_name":"Tannenbaum, Stefan","first_name":"Stefan","last_name":"Tannenbaum"},{"last_name":"Röglin","first_name":"Heiko","full_name":"Röglin, Heiko"},{"full_name":"Gunia, Christian","last_name":"Gunia","first_name":"Christian"},{"full_name":"Englert, Matthias","first_name":"Matthias","last_name":"Englert"},{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"full_name":"Sudholt, Dirk","first_name":"Dirk","last_name":"Sudholt"},{"full_name":"Brockhoff, Dimo","first_name":"Dimo","last_name":"Brockhoff"},{"first_name":"Ingo","last_name":"Wegener","full_name":"Wegener, Ingo"},{"first_name":"Thomas","last_name":"Jansen","full_name":"Jansen, Thomas"},{"last_name":"Plociennik","first_name":"Kai","full_name":"Plociennik, Kai"}],"title":"Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization","status":"public","year":"2004","date_updated":"2022-01-06T06:54:10Z","publication_status":"published","_id":"19693","language":[{"iso":"eng"}],"user_id":"15415"},{"publication_status":"published","date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"full_name":"Vodisek, Mario","last_name":"Vodisek","first_name":"Mario"}],"title":"A case for virtualized arrays of RAID","year":"2004","status":"public","user_id":"15415","doi":"10.1145/1162628.1162630","language":[{"iso":"eng"}],"_id":"19800","page":"9-16","abstract":[{"lang":"eng","text":"Redundant arrays of independent disks, also called RAID arrays, have gained a wide popularity in the last twenty years. Most of the disks used in the server market are currently based on RAID technology. The primary reason for introducing RAID technology in 1988 has been the fact that large disk systems have become much slower and more expensive than the connection of a large number of inexpensive disks and the use of them as an array. The times seem to repeat themselves. Today, large scale RAID arrays have become incredible big and expensive. It seems that it makes sense to replace them by a collection of smaller and inexpensive arrays of JBODs or mid-ranged RAID arrays. In this paper we will show that combining these systems with state-of-the-art virtualization technology can lead to a system that is faster and less expensive than an enterprise storage system, while being as easy to manage and as reliable. Therefore we will outline the most important features of storage management and compare there realization in enterprise class storage systems and in current and future virtualization environments."}],"citation":{"short":"A. Brinkmann, K. Salzwedel, M. Vodisek, in: Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004, pp. 9–16.","chicago":"Brinkmann, André, Kay Salzwedel, and Mario Vodisek. “A Case for Virtualized Arrays of RAID.” In <i>Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04</i>, 9–16, 2004. <a href=\"https://doi.org/10.1145/1162628.1162630\">https://doi.org/10.1145/1162628.1162630</a>.","ieee":"A. Brinkmann, K. Salzwedel, and M. Vodisek, “A case for virtualized arrays of RAID,” in <i>Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04</i>, 2004, pp. 9–16.","apa":"Brinkmann, A., Salzwedel, K., &#38; Vodisek, M. (2004). A case for virtualized arrays of RAID. In <i>Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04</i> (pp. 9–16). <a href=\"https://doi.org/10.1145/1162628.1162630\">https://doi.org/10.1145/1162628.1162630</a>","bibtex":"@inproceedings{Brinkmann_Salzwedel_Vodisek_2004, title={A case for virtualized arrays of RAID}, DOI={<a href=\"https://doi.org/10.1145/1162628.1162630\">10.1145/1162628.1162630</a>}, booktitle={Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04}, author={Brinkmann, André and Salzwedel, Kay and Vodisek, Mario}, year={2004}, pages={9–16} }","ama":"Brinkmann A, Salzwedel K, Vodisek M. A case for virtualized arrays of RAID. In: <i>Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04</i>. ; 2004:9-16. doi:<a href=\"https://doi.org/10.1145/1162628.1162630\">10.1145/1162628.1162630</a>","mla":"Brinkmann, André, et al. “A Case for Virtualized Arrays of RAID.” <i>Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04</i>, 2004, pp. 9–16, doi:<a href=\"https://doi.org/10.1145/1162628.1162630\">10.1145/1162628.1162630</a>."},"publication":"Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI '04","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-30T12:39:30Z"},{"date_created":"2020-09-30T12:58:55Z","department":[{"_id":"63"}],"type":"conference","citation":{"mla":"Schindelhauer, Christian, et al. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.” <i>Proceedings of the Second International Workshop on Mobility Management &#38; Wireless Access Protocols</i>, 2004, doi:<a href=\"https://doi.org/10.1145/1023783.1023807\">10.1145/1023783.1023807</a>.","ama":"Schindelhauer C, Böttcher S, Rammig F. The design of PaMaNet the Paderborn mobile ad-hoc network. In: <i>Proceedings of the Second International Workshop on Mobility Management &#38; Wireless Access Protocols</i>. ; 2004. doi:<a href=\"https://doi.org/10.1145/1023783.1023807\">10.1145/1023783.1023807</a>","bibtex":"@inproceedings{Schindelhauer_Böttcher_Rammig_2004, title={The design of PaMaNet the Paderborn mobile ad-hoc network}, DOI={<a href=\"https://doi.org/10.1145/1023783.1023807\">10.1145/1023783.1023807</a>}, booktitle={Proceedings of the second international workshop on Mobility management &#38; wireless access protocols}, author={Schindelhauer, Christian and Böttcher, Stefan and Rammig, Franz}, year={2004} }","apa":"Schindelhauer, C., Böttcher, S., &#38; Rammig, F. (2004). The design of PaMaNet the Paderborn mobile ad-hoc network. In <i>Proceedings of the second international workshop on Mobility management &#38; wireless access protocols</i>. <a href=\"https://doi.org/10.1145/1023783.1023807\">https://doi.org/10.1145/1023783.1023807</a>","ieee":"C. Schindelhauer, S. Böttcher, and F. Rammig, “The design of PaMaNet the Paderborn mobile ad-hoc network,” in <i>Proceedings of the second international workshop on Mobility management &#38; wireless access protocols</i>, 2004.","chicago":"Schindelhauer, Christian, Stefan Böttcher, and Franz Rammig. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.” In <i>Proceedings of the Second International Workshop on Mobility Management &#38; Wireless Access Protocols</i>, 2004. <a href=\"https://doi.org/10.1145/1023783.1023807\">https://doi.org/10.1145/1023783.1023807</a>.","short":"C. Schindelhauer, S. Böttcher, F. Rammig, in: Proceedings of the Second International Workshop on Mobility Management &#38; Wireless Access Protocols, 2004."},"publication":"Proceedings of the second international workshop on Mobility management & wireless access protocols","abstract":[{"lang":"eng","text":"Wireless connectivity is state of the art for local area networks. Currently, most W-LAN networks rely on a centralized design with access points routing all inner and outbound traffic. These access points are intrinsic communication bottlenecks. Mobile Ad Hoc Networks (MANET) overcome this problem, because every participant works as well as a simple node and as a router. Current MANETs are restricted in scalability, because they rely on flooding mechanisms or complete routing tables. Other approaches, providing better scalability use clustering, yet network performance deteriorates in case of high node mobility. We describe the design of a PAMANET, the Paderborn Mobile Ad Hoc Network, a MANET overcoming these problems providing scalability and reliability in a mobile scenario. When implemented, PAMANET works with standard W-LAN IEEE 802.11 radio devices, provides IPv6 communication interfaces and works on personal computers under a standard Linux distribution. First, we present current routing protocols and classify them with respect to scalability and stability in dynamically evolving MANETs. Then, we discuss related research in the area of distributed hash tables and consistent hashing, used for relieving hot spots in the Web, storage area networks and peerto-peer networks, which inspires the design of PAMANET. PAMANET consists of three main components: First, the embedding of the routing layer into IEEE 802.11 and IPv6 by using techniques used at the ad hoc support library (aslib) by Gupta et al. Second, the routing layer which combines a landmark routing, hierarchical clustering, consistent hashing for providing location dependent addresses and lookup-service for the location of nodes. Third, a peerto-peer data storage system based on egoistic distributed caches enabling hop and traffic efficient data access on replicated data partitions. <br>The routing layer incorporates a variety of new approaches. Link distances reflect the failure probability of links, which is estimated by the reciprocal age of the link. Then, we combine a landmarking system on this metric with the hierarchical layer graph yielding small landmark addresses and small routing tables. To balance the load of the distributed lookup-service for landmark addresses, a hierarchical weighted consistent hashing scheme is used. This ensures that each node receives an equal part of all landmark addresses. Using these mechanisms (regularly and on demand) PAMANET adjusts IPv6 routing tables such that short stable routes are preferred. For the distribution of control data like landmark information PAMANET uses a message box system interface to provide fast one-hop communication. On top of this system, PAMANET provides a peer-to-peer data storage and lookup system that realizes time, traffic, and load efficient access using egoistic caches and data segmentation strategies."}],"language":[{"iso":"eng"}],"_id":"19807","user_id":"15415","doi":"10.1145/1023783.1023807","publication_identifier":{"isbn":["1581139209"]},"author":[{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"},{"first_name":"Stefan","last_name":"Böttcher","full_name":"Böttcher, Stefan"},{"full_name":"Rammig, Franz","last_name":"Rammig","first_name":"Franz"}],"title":"The design of PaMaNet the Paderborn mobile ad-hoc network","year":"2004","status":"public","publication_status":"published","date_updated":"2022-01-06T06:54:13Z"},{"_id":"19851","language":[{"iso":"eng"}],"page":"40-47","doi":"10.1145/1162628.1162634","user_id":"15415","author":[{"first_name":"Peter","last_name":"Bleckmann","full_name":"Bleckmann, Peter"},{"last_name":"Schomaker","first_name":"Gunnar","full_name":"Schomaker, Gunnar"},{"full_name":"Slowik, Adrian","last_name":"Slowik","first_name":"Adrian"}],"status":"public","year":"2004","title":"Virtualization with prefetching abilities based on iSCSI","date_updated":"2022-01-06T06:54:13Z","publication_status":"published","date_created":"2020-10-02T11:40:12Z","department":[{"_id":"63"}],"type":"conference","citation":{"bibtex":"@inproceedings{Bleckmann_Schomaker_Slowik_2004, title={Virtualization with prefetching abilities based on iSCSI}, DOI={<a href=\"https://doi.org/10.1145/1162628.1162634\">10.1145/1162628.1162634</a>}, number={2}, booktitle={Proceeding of International Workshop on Storage Network Architecture and Parallel I/O}, author={Bleckmann, Peter and Schomaker, Gunnar and Slowik, Adrian}, year={2004}, pages={40–47} }","chicago":"Bleckmann, Peter, Gunnar Schomaker, and Adrian Slowik. “Virtualization with Prefetching Abilities Based on ISCSI.” In <i>Proceeding of International Workshop on Storage Network Architecture and Parallel I/O</i>, 40–47, 2004. <a href=\"https://doi.org/10.1145/1162628.1162634\">https://doi.org/10.1145/1162628.1162634</a>.","short":"P. Bleckmann, G. Schomaker, A. Slowik, in: Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2004, pp. 40–47.","ama":"Bleckmann P, Schomaker G, Slowik A. Virtualization with prefetching abilities based on iSCSI. In: <i>Proceeding of International Workshop on Storage Network Architecture and Parallel I/O</i>. ; 2004:40-47. doi:<a href=\"https://doi.org/10.1145/1162628.1162634\">10.1145/1162628.1162634</a>","ieee":"P. Bleckmann, G. Schomaker, and A. Slowik, “Virtualization with prefetching abilities based on iSCSI,” in <i>Proceeding of International Workshop on Storage Network Architecture and Parallel I/O</i>, 2004, no. 2, pp. 40–47, doi: <a href=\"https://doi.org/10.1145/1162628.1162634\">10.1145/1162628.1162634</a>.","apa":"Bleckmann, P., Schomaker, G., &#38; Slowik, A. (2004). Virtualization with prefetching abilities based on iSCSI. <i>Proceeding of International Workshop on Storage Network Architecture and Parallel I/O</i>, <i>2</i>, 40–47. <a href=\"https://doi.org/10.1145/1162628.1162634\">https://doi.org/10.1145/1162628.1162634</a>","mla":"Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on ISCSI.” <i>Proceeding of International Workshop on Storage Network Architecture and Parallel I/O</i>, no. 2, 2004, pp. 40–47, doi:<a href=\"https://doi.org/10.1145/1162628.1162634\">10.1145/1162628.1162634</a>."},"issue":"2","publication":"Proceeding of International Workshop on Storage Network Architecture and Parallel I/O","abstract":[{"text":"The Internet-SCSI protocol [iSCSI] allows a client to interact with a remote SCSI-capable target by means of block-oriented commands encapsulated within TCP/IP packets. Thereby, iSCSI greatly simplifies storage virtualization, since clients can access storage in a unified manner, no matter whether the I/O-path is short or long distance. Intermediate devices located on the path between a client and a target can easily intercept iSCSI sessions and rewrite packets for the sake of load balancing, prefetching, or redundancy, to mention just a few beneficial applications. Within this paper we describe the design and implementation of such an iSCSI capable intermediate device that deploys prefetching strategies in combination with redundant disks to reduce average I/O-latency. Depending on its location within the network, this virtualization and prefetching device can hide wide area access latency and reduce network contention targeting remote SCSI-devices to a large extent.","lang":"eng"}]},{"volume":28,"user_id":"15415","doi":"10.1016/j.cag.2004.08.012","language":[{"iso":"eng"}],"_id":"19879","page":"839-850","intvolume":"        28","date_updated":"2022-01-06T06:54:14Z","author":[{"full_name":"Klein, Jan","last_name":"Klein","first_name":"Jan"},{"full_name":"Zachmann, Gabriel","first_name":"Gabriel","last_name":"Zachmann"}],"title":"Point Cloud Surfaces using Geometric Proximity Graphs","status":"public","year":"2004","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-10-05T12:57:39Z","citation":{"mla":"Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity Graphs.” <i>Computers and Graphics</i>, vol. 28, no. 6, 2004, pp. 839–50, doi:<a href=\"https://doi.org/10.1016/j.cag.2004.08.012\">10.1016/j.cag.2004.08.012</a>.","bibtex":"@article{Klein_Zachmann_2004, title={Point Cloud Surfaces using Geometric Proximity Graphs}, volume={28}, DOI={<a href=\"https://doi.org/10.1016/j.cag.2004.08.012\">10.1016/j.cag.2004.08.012</a>}, number={6}, journal={Computers and Graphics}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={839–850} }","ama":"Klein J, Zachmann G. Point Cloud Surfaces using Geometric Proximity Graphs. <i>Computers and Graphics</i>. 2004;28(6):839-850. doi:<a href=\"https://doi.org/10.1016/j.cag.2004.08.012\">10.1016/j.cag.2004.08.012</a>","ieee":"J. Klein and G. Zachmann, “Point Cloud Surfaces using Geometric Proximity Graphs,” <i>Computers and Graphics</i>, vol. 28, no. 6, pp. 839–850, 2004.","apa":"Klein, J., &#38; Zachmann, G. (2004). Point Cloud Surfaces using Geometric Proximity Graphs. <i>Computers and Graphics</i>, <i>28</i>(6), 839–850. <a href=\"https://doi.org/10.1016/j.cag.2004.08.012\">https://doi.org/10.1016/j.cag.2004.08.012</a>","chicago":"Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity Graphs.” <i>Computers and Graphics</i> 28, no. 6 (2004): 839–50. <a href=\"https://doi.org/10.1016/j.cag.2004.08.012\">https://doi.org/10.1016/j.cag.2004.08.012</a>.","short":"J. Klein, G. Zachmann, Computers and Graphics 28 (2004) 839–850."},"publication":"Computers and Graphics","issue":"6"},{"publication":"Eurographics Symposium on Point-Based Grahics (SPBG'04)","citation":{"mla":"Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over Point Clouds.” <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>, 2004, pp. 131–38.","ama":"Klein J, Zachmann G. Proximity Graphs for Defining Surfaces over Point Clouds. In: <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>. ; 2004:131-138.","bibtex":"@inproceedings{Klein_Zachmann_2004, title={Proximity Graphs for Defining Surfaces over Point Clouds}, booktitle={Eurographics Symposium on Point-Based Grahics (SPBG’04)}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={131–138} }","apa":"Klein, J., &#38; Zachmann, G. (2004). Proximity Graphs for Defining Surfaces over Point Clouds. In <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i> (pp. 131–138).","ieee":"J. Klein and G. Zachmann, “Proximity Graphs for Defining Surfaces over Point Clouds,” in <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>, 2004, pp. 131–138.","chicago":"Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over Point Clouds.” In <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>, 131–38, 2004.","short":"J. Klein, G. Zachmann, in: Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004, pp. 131–138."},"date_created":"2020-10-05T13:03:44Z","type":"conference","department":[{"_id":"63"}],"status":"public","title":"Proximity Graphs for Defining Surfaces over Point Clouds","year":"2004","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"full_name":"Zachmann, Gabriel","first_name":"Gabriel","last_name":"Zachmann"}],"date_updated":"2022-01-06T06:54:14Z","page":"131-138","language":[{"iso":"eng"}],"_id":"19883","user_id":"15415"},{"status":"public","title":"Nice and Fast Implicit Surfaces over Noisy Point Clouds","year":"2004","author":[{"full_name":"Klein, Jan","first_name":"Jan","last_name":"Klein"},{"full_name":"Zachmann, Gabriel","first_name":"Gabriel","last_name":"Zachmann"}],"date_updated":"2022-01-06T06:54:14Z","language":[{"iso":"eng"}],"_id":"19889","user_id":"15415","publication":"SIGGRAPH 2004, Sketches","citation":{"mla":"Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy Point Clouds.” <i>SIGGRAPH 2004, Sketches</i>, 2004.","ama":"Klein J, Zachmann G. Nice and Fast Implicit Surfaces over Noisy Point Clouds. In: <i>SIGGRAPH 2004, Sketches</i>. ; 2004.","bibtex":"@inproceedings{Klein_Zachmann_2004, title={Nice and Fast Implicit Surfaces over Noisy Point Clouds}, booktitle={SIGGRAPH 2004, Sketches}, author={Klein, Jan and Zachmann, Gabriel}, year={2004} }","apa":"Klein, J., &#38; Zachmann, G. (2004). Nice and Fast Implicit Surfaces over Noisy Point Clouds. In <i>SIGGRAPH 2004, Sketches</i>.","ieee":"J. Klein and G. Zachmann, “Nice and Fast Implicit Surfaces over Noisy Point Clouds,” in <i>SIGGRAPH 2004, Sketches</i>, 2004.","short":"J. Klein, G. Zachmann, in: SIGGRAPH 2004, Sketches, 2004.","chicago":"Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy Point Clouds.” In <i>SIGGRAPH 2004, Sketches</i>, 2004."},"date_created":"2020-10-05T13:31:16Z","type":"conference","department":[{"_id":"63"}]},{"citation":{"ama":"Klein J, Zachmann G. Point Cloud Collision Detection. In: <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>. ; 2004:567-576.","bibtex":"@inproceedings{Klein_Zachmann_2004, title={Point Cloud Collision Detection}, booktitle={Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={567–576} }","mla":"Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 2004, pp. 567–76.","short":"J. Klein, G. Zachmann, in: Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–576.","chicago":"Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” In <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 567–76, 2004.","apa":"Klein, J., &#38; Zachmann, G. (2004). Point Cloud Collision Detection. In <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i> (pp. 567–576).","ieee":"J. Klein and G. Zachmann, “Point Cloud Collision Detection,” in <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 2004, pp. 567–576."},"publication":"Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)","date_created":"2020-10-05T13:49:10Z","department":[{"_id":"63"}],"type":"conference","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"first_name":"Gabriel","last_name":"Zachmann","full_name":"Zachmann, Gabriel"}],"status":"public","year":"2004","title":"Point Cloud Collision Detection","date_updated":"2022-01-06T06:54:14Z","language":[{"iso":"eng"}],"_id":"19891","page":"567-576","user_id":"15415"}]