[{"date_created":"2017-10-17T12:42:30Z","type":"bachelorsthesis","citation":{"short":"A. Blix, Optimale und adaptive binäre Bäume in Netzwerken, Universität Paderborn, 2013.","chicago":"Blix, Andreas. <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn, 2013.","ieee":"A. Blix, <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn, 2013.","apa":"Blix, A. (2013). <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn.","bibtex":"@book{Blix_2013, title={Optimale und adaptive binäre Bäume in Netzwerken}, publisher={Universität Paderborn}, author={Blix, Andreas}, year={2013} }","ama":"Blix A. <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn; 2013.","mla":"Blix, Andreas. <i>Optimale und adaptive binäre Bäume in Netzwerken</i>. Universität Paderborn, 2013."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","_id":"503","language":[{"iso":"ger"}],"user_id":"477","status":"public","title":"Optimale und adaptive binäre Bäume in Netzwerken","year":"2013","author":[{"last_name":"Blix","first_name":"Andreas","full_name":"Blix, Andreas"}],"date_updated":"2022-01-06T07:01:35Z"},{"author":[{"first_name":"Jörg","last_name":"Becker","full_name":"Becker, Jörg"},{"first_name":"Torben","last_name":"Bernhold","full_name":"Bernhold, Torben"},{"id":"59677","full_name":"Beverungen, Daniel","first_name":"Daniel","last_name":"Beverungen"},{"full_name":"Kaling, Nina","last_name":"Kaling","first_name":"Nina"},{"full_name":"Knackstedt, Ralf","last_name":"Knackstedt","first_name":"Ralf"},{"last_name":"Vanessa","first_name":"Lellek","full_name":"Vanessa, Lellek"},{"first_name":"Hans","last_name":"Peter Rauer","full_name":"Peter Rauer, Hans"}],"title":"Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management","year":"2013","status":"public","date_updated":"2022-01-06T07:01:35Z","_id":"5031","page":"208--226","editor":[{"last_name":"Thomas","first_name":"Oliver","full_name":"Thomas, Oliver"},{"full_name":"Nüttgens, Markus","first_name":"Markus","last_name":"Nüttgens"}],"user_id":"21671","doi":"10.1007/978-3-658-00863-5","citation":{"mla":"Becker, Jörg, et al. “Softwaregestützte Konstruktion von Produktivitätsmodellen Im Facility Management.” <i>Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität</i>, edited by Oliver Thomas and Markus Nüttgens, 2013, pp. 208--226, doi:<a href=\"https://doi.org/10.1007/978-3-658-00863-5\">10.1007/978-3-658-00863-5</a>.","ama":"Becker J, Bernhold T, Beverungen D, et al. Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management. In: Thomas O, Nüttgens M, eds. <i>Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität</i>. Wiesbaden; 2013:208--226. doi:<a href=\"https://doi.org/10.1007/978-3-658-00863-5\">10.1007/978-3-658-00863-5</a>","bibtex":"@inbook{Becker_Bernhold_Beverungen_Kaling_Knackstedt_Vanessa_Peter Rauer_2013, place={Wiesbaden}, title={Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management}, DOI={<a href=\"https://doi.org/10.1007/978-3-658-00863-5\">10.1007/978-3-658-00863-5</a>}, booktitle={Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität}, author={Becker, Jörg and Bernhold, Torben and Beverungen, Daniel and Kaling, Nina and Knackstedt, Ralf and Vanessa, Lellek and Peter Rauer, Hans}, editor={Thomas, Oliver and Nüttgens, MarkusEditors}, year={2013}, pages={208--226} }","apa":"Becker, J., Bernhold, T., Beverungen, D., Kaling, N., Knackstedt, R., Vanessa, L., &#38; Peter Rauer, H. (2013). Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management. In O. Thomas &#38; M. Nüttgens (Eds.), <i>Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität</i> (pp. 208--226). Wiesbaden. <a href=\"https://doi.org/10.1007/978-3-658-00863-5\">https://doi.org/10.1007/978-3-658-00863-5</a>","ieee":"J. Becker <i>et al.</i>, “Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management,” in <i>Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität</i>, O. Thomas and M. Nüttgens, Eds. Wiesbaden, 2013, pp. 208--226.","short":"J. Becker, T. Bernhold, D. Beverungen, N. Kaling, R. Knackstedt, L. Vanessa, H. Peter Rauer, in: O. Thomas, M. Nüttgens (Eds.), Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität, Wiesbaden, 2013, pp. 208--226.","chicago":"Becker, Jörg, Torben Bernhold, Daniel Beverungen, Nina Kaling, Ralf Knackstedt, Lellek Vanessa, and Hans Peter Rauer. “Softwaregestützte Konstruktion von Produktivitätsmodellen Im Facility Management.” In <i>Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität</i>, edited by Oliver Thomas and Markus Nüttgens, 208--226. Wiesbaden, 2013. <a href=\"https://doi.org/10.1007/978-3-658-00863-5\">https://doi.org/10.1007/978-3-658-00863-5</a>."},"publication":"Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität","extern":"1","date_created":"2018-10-30T13:32:55Z","place":"Wiesbaden","department":[{"_id":"526"}],"type":"book_chapter"},{"type":"mastersthesis","date_created":"2017-10-17T12:42:30Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"apa":"Schwichtenberg, S. (2013). <i>Ontology-based Normalization and Matching of Rich Service Descriptions</i>. Universität Paderborn.","ieee":"S. Schwichtenberg, <i>Ontology-based Normalization and Matching of Rich Service Descriptions</i>. Universität Paderborn, 2013.","short":"S. Schwichtenberg, Ontology-Based Normalization and Matching of Rich Service Descriptions, Universität Paderborn, 2013.","chicago":"Schwichtenberg, Simon. <i>Ontology-Based Normalization and Matching of Rich Service Descriptions</i>. Universität Paderborn, 2013.","mla":"Schwichtenberg, Simon. <i>Ontology-Based Normalization and Matching of Rich Service Descriptions</i>. Universität Paderborn, 2013.","ama":"Schwichtenberg S. <i>Ontology-Based Normalization and Matching of Rich Service Descriptions</i>. Universität Paderborn; 2013.","bibtex":"@book{Schwichtenberg_2013, title={Ontology-based Normalization and Matching of Rich Service Descriptions}, publisher={Universität Paderborn}, author={Schwichtenberg, Simon}, year={2013} }"},"user_id":"15504","_id":"504","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:35Z","title":"Ontology-based Normalization and Matching of Rich Service Descriptions","year":"2013","status":"public","author":[{"id":"13235","full_name":"Schwichtenberg, Simon","last_name":"Schwichtenberg","first_name":"Simon"}]},{"place":"Herne","date_created":"2018-10-30T13:48:38Z","department":[{"_id":"187"},{"_id":"635"}],"type":"book","citation":{"chicago":"König, Rolf, and Caren Sureth-Sloane. <i>Besteuerung und Rechtsformwahl</i>. Herne: Verlag Neue Wirtschafts-Briefe, 2013.","short":"R. König, C. Sureth-Sloane, Besteuerung und Rechtsformwahl, Verlag Neue Wirtschafts-Briefe, Herne, 2013.","apa":"König, R., &#38; Sureth-Sloane, C. (2013). <i>Besteuerung und Rechtsformwahl</i>. Herne: Verlag Neue Wirtschafts-Briefe.","ieee":"R. König and C. Sureth-Sloane, <i>Besteuerung und Rechtsformwahl</i>. Herne: Verlag Neue Wirtschafts-Briefe, 2013.","ama":"König R, Sureth-Sloane C. <i>Besteuerung und Rechtsformwahl</i>. Herne: Verlag Neue Wirtschafts-Briefe; 2013.","bibtex":"@book{König_Sureth-Sloane_2013, place={Herne}, title={Besteuerung und Rechtsformwahl}, publisher={Verlag Neue Wirtschafts-Briefe}, author={König, Rolf and Sureth-Sloane, Caren}, year={2013} }","mla":"König, Rolf, and Caren Sureth-Sloane. <i>Besteuerung und Rechtsformwahl</i>. Verlag Neue Wirtschafts-Briefe, 2013."},"_id":"5042","publisher":"Verlag Neue Wirtschafts-Briefe","language":[{"iso":"ger"}],"alternative_title":["6., vollständig überarbeitete Auflage"],"user_id":"61801","author":[{"full_name":"König, Rolf","last_name":"König","first_name":"Rolf"},{"full_name":"Sureth-Sloane, Caren","last_name":"Sureth-Sloane","first_name":"Caren"}],"title":"Besteuerung und Rechtsformwahl","year":"2013","status":"public","date_updated":"2022-01-06T07:01:35Z"},{"issue":"125","publication":"Frankfurter Allgemeine Zeitung","citation":{"ieee":"R. Maiterth and C. Sureth-Sloane, “Vermögensteuer vernichtet Eigenkapital,” <i>Frankfurter Allgemeine Zeitung</i>, no. 125, 2013.","mla":"Maiterth, Ralf, and Caren Sureth-Sloane. “Vermögensteuer Vernichtet Eigenkapital.” <i>Frankfurter Allgemeine Zeitung</i>, no. 125, 2013.","apa":"Maiterth, R., &#38; Sureth-Sloane, C. (2013). Vermögensteuer vernichtet Eigenkapital. <i>Frankfurter Allgemeine Zeitung</i>.","bibtex":"@article{Maiterth_Sureth-Sloane_2013, title={Vermögensteuer vernichtet Eigenkapital}, number={125}, journal={Frankfurter Allgemeine Zeitung}, author={Maiterth, Ralf and Sureth-Sloane, Caren}, year={2013} }","ama":"Maiterth R, Sureth-Sloane C. Vermögensteuer vernichtet Eigenkapital. <i>Frankfurter Allgemeine Zeitung</i>. 2013.","short":"R. Maiterth, C. Sureth-Sloane, Frankfurter Allgemeine Zeitung (2013).","chicago":"Maiterth, Ralf, and Caren Sureth-Sloane. “Vermögensteuer Vernichtet Eigenkapital.” <i>Frankfurter Allgemeine Zeitung</i>, 2013."},"type":"newspaper_article","department":[{"_id":"187"}],"date_created":"2018-10-30T13:50:41Z","date_updated":"2022-01-06T07:01:35Z","title":"Vermögensteuer vernichtet Eigenkapital","status":"public","year":"2013","author":[{"first_name":"Ralf","last_name":"Maiterth","full_name":"Maiterth, Ralf"},{"id":"530","full_name":"Sureth-Sloane, Caren","first_name":"Caren","last_name":"Sureth-Sloane"}],"user_id":"21222","publication_date":"2013-09-16","page":"18","_id":"5043","language":[{"iso":"eng"}]},{"intvolume":"       141","date_updated":"2022-01-06T07:01:35Z","author":[{"last_name":"Meißner","first_name":"Fabian","full_name":"Meißner, Fabian"},{"id":"530","full_name":"Sureth-Sloane, Caren","last_name":"Sureth-Sloane","first_name":"Caren"}],"title":"The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation","status":"public","year":"2013","volume":141,"user_id":"21222","_id":"5044","series_title":"arqus, Quantitative Research in Taxation","language":[{"iso":"eng"}],"citation":{"ieee":"F. Meißner and C. Sureth-Sloane, <i>The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation</i>, vol. 141. 2013.","apa":"Meißner, F., &#38; Sureth-Sloane, C. (2013). <i>The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation</i> (Vol. 141).","short":"F. Meißner, C. Sureth-Sloane, The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation, 2013.","chicago":"Meißner, Fabian, and Caren Sureth-Sloane. <i>The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation</i>. Vol. 141. Arqus, Quantitative Research in Taxation, 2013.","mla":"Meißner, Fabian, and Caren Sureth-Sloane. <i>The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation</i>. Vol. 141, 2013.","bibtex":"@book{Meißner_Sureth-Sloane_2013, series={arqus, Quantitative Research in Taxation}, title={The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation}, volume={141}, author={Meißner, Fabian and Sureth-Sloane, Caren}, year={2013}, collection={arqus, Quantitative Research in Taxation} }","ama":"Meißner F, Sureth-Sloane C. <i>The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation</i>. Vol 141.; 2013."},"department":[{"_id":"187"}],"type":"working_paper","date_created":"2018-10-30T13:52:52Z"},{"language":[{"iso":"ger"}],"_id":"5046","user_id":"21222","publication_date":"2013-04-02","status":"public","year":"2013","title":" Die Reichensteuer gefährdet Arbeitsplätze","author":[{"id":"530","full_name":"Sureth-Sloane, Caren","first_name":"Caren","last_name":"Sureth-Sloane"}],"date_updated":"2022-01-06T07:01:35Z","date_created":"2018-10-30T13:55:19Z","type":"newspaper_article","department":[{"_id":"187"}],"publication":"Cicero Online","citation":{"ieee":"C. Sureth-Sloane, “ Die Reichensteuer gefährdet Arbeitsplätze,” <i>Cicero Online</i>, 2013.","apa":"Sureth-Sloane, C. (2013).  Die Reichensteuer gefährdet Arbeitsplätze. <i>Cicero Online</i>.","mla":"Sureth-Sloane, Caren. “ Die Reichensteuer gefährdet Arbeitsplätze.” <i>Cicero Online</i>, 2013.","bibtex":"@article{Sureth-Sloane_2013, title={ Die Reichensteuer gefährdet Arbeitsplätze}, journal={Cicero Online}, author={Sureth-Sloane, Caren}, year={2013} }","short":"C. Sureth-Sloane, Cicero Online (2013).","ama":"Sureth-Sloane C.  Die Reichensteuer gefährdet Arbeitsplätze. <i>Cicero Online</i>. 2013.","chicago":"Sureth-Sloane, Caren. “ Die Reichensteuer gefährdet Arbeitsplätze.” <i>Cicero Online</i>, 2013."}},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-15T10:48:11Z","citation":{"ieee":"G. Engels, “On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft,” in <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>, 2013, pp. 17–18.","apa":"Engels, G. (2013). On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft. In <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i> (pp. 17–18).","chicago":"Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma FürSoftwaresysteme Der Zukunft.” In <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>, 17–18. LNI, 2013.","short":"G. Engels, in: Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013), 2013, pp. 17–18.","mla":"Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma FürSoftwaresysteme Der Zukunft.” <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>, 2013, pp. 17–18.","bibtex":"@inproceedings{Engels_2013, series={LNI}, title={On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft}, booktitle={Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)}, author={Engels, Gregor}, year={2013}, pages={17–18}, collection={LNI} }","ama":"Engels G. On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft. In: <i>Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)</i>. LNI. ; 2013:17-18."},"ddc":["040"],"user_id":"477","page":"17-18","_id":"506","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"66"}],"file":[{"success":1,"content_type":"application/pdf","file_id":"1306","date_updated":"2018-03-15T10:48:11Z","relation":"main_file","file_size":175876,"access_level":"closed","file_name":"506-SE2013-OntheFlyComputing-GE.pdf","date_created":"2018-03-15T10:48:11Z","creator":"florida"}],"date_created":"2017-10-17T12:42:31Z","abstract":[{"text":"Alle Dom{\\\"a}nen und Branchen der heutigen Wirtschaft sind auf eine effiziente und effektive Entwicklung von ben{\\\"o}tigten Softwaresystemen angewiesen. Das 40 Jahre alte Prinzip der Beschaffung von Softwaresystemen durch den Einkauf von teuren, relativ unflexiblen Standardl{\\\"o}sungen beziehungsweise der noch teureren Erstellung durch Softwareh{\\\"a}user oder eigene Softwareabteilungen muss deshalb in Frage gestellt werden. Mit dem Einsatz von Cloud Computing-Techniken wird es m{\\\"o}glich, Softwaresysteme und die f{\\\"u}r den Betrieb ben{\\\"o}tigten Ressourcen nur bei Bedarf und nur in der ben{\\\"o}tigten Form einzukaufen. Mit dem Ansatz der service-orientierten Architekturen stehen Methoden zur Verf{\\\"u}gung, Software zumindest unternehmensintern flexibel zusammenzustellen. Diese ersten Ans{\\\"a}tze f{\\\"u}r eine neue Art der Entwicklung und des Betriebs von Softwaresystemen bilden den Ausgangspunkt f{\\\"u}r die Forschungen in dem seit 2011 laufenden DFG Sonderforschungsbereich (SFB) 901 „On-The-Fly Computing“ an der Universit{\\\"a}t Paderborn. Die Vision des On-The-Fly Computing ist, dass die Softwaresysteme der Zukunft aus individuell und automatisch konfigurierten und zur Ausf{\\\"u}hrung gebrachten Softwarebausteinen bestehen, die auf M{\\\"a}rkten frei gehandelt werden und flexibel kombinierbar sind. Um zu erforschen, in wie weit diese Vision realisierbar ist, werden Konzepte, Methoden und Techniken entwickelt, die eine weitestgehend automatische Konfiguration, Ausf{\\\"u}hrung und Adaption von Softwaresystemen aus auf weltweiten M{\\\"a}rkten verf{\\\"u}gbaren Services erm{\\\"o}glichen. Um diese Ziele zu erreichen, arbeiten an der Universit{\\\"a}t Paderborn Informatiker aus unterschiedlichen Disziplinen wie Softwaretechnik, Algorithmik, Rechnernetze, Systementwurf, Sicherheit und Kryptographie mit Wirtschaftswissenschaftlern zusammen, die ihre spezifische Expertise einbringen, mit der die Organisation und Weiterentwicklung des Marktes vorangetrieben werden kann.","lang":"eng"}],"publication":"Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)","language":[{"iso":"eng"}],"series_title":"LNI","date_updated":"2022-01-06T07:01:36Z","year":"2013","title":"On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft","author":[{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}]},{"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15504","page":"11-22","_id":"507","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T10:47:31Z","citation":{"ieee":"S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party Communication Through Dynamic Networks,” in <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22.","apa":"Abshoff, S., Benter, M., Malatyali, M., &#38; Meyer auf der Heide, F. (2013). On Two-Party Communication Through Dynamic Networks. In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 11–22). <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>","mla":"Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2013, pp. 11–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>.","bibtex":"@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS}, title={On Two-Party Communication Through Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>}, booktitle={Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS} }","chicago":"Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>, 11–22. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">https://doi.org/10.1007/978-3-319-03850-6_2</a>.","ama":"Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication Through Dynamic Networks. In: <i>Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2013:11-22. doi:<a href=\"https://doi.org/10.1007/978-3-319-03850-6_2\">10.1007/978-3-319-03850-6_2</a>","short":"S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22."},"date_updated":"2022-01-06T07:01:36Z","title":"On Two-Party Communication Through Dynamic Networks","year":"2013","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"doi":"10.1007/978-3-319-03850-6_2","series_title":"LNCS","abstract":[{"lang":"eng","text":"We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n+3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity."}],"publication":"Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)","type":"conference","department":[{"_id":"63"}],"file":[{"file_name":"507-on-two-party-communication-through-dynamic-networks_01.pdf","file_size":181398,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T10:47:31Z","file_id":"1305","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-15T10:47:31Z"}],"date_created":"2017-10-17T12:42:31Z"},{"file_date_updated":"2018-03-15T10:50:19Z","publication":"Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)","citation":{"short":"P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.","chicago":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 1–6, 2013. <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>.","apa":"Wette, P., &#38; Karl, H. (2013). On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i> (pp. 1–6). <a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">https://doi.org/10.1109/LANMAN.2013.6528271</a>","ieee":"P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks,” in <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6.","ama":"Wette P, Karl H. On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In: <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>. ; 2013:1-6. doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>","bibtex":"@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}, DOI={<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>}, booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={1–6} }","mla":"Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” <i>Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)</i>, 2013, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/LANMAN.2013.6528271\">10.1109/LANMAN.2013.6528271</a>."},"abstract":[{"text":"The process of planning a virtual topology for a Wavelength Devision Multiplexing (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find a virtual topology that supports forwarding the expected traffic without congestion. In networks with fluctuating, high traffic demands, it can happen that no single topology fits all changing traffic demands occurring over a longer time. Thus, during operation, the virtual topology has to be reconfigured. Since modern networks tend to be large, VTD algorithms have to scale well with increasing network size, requiring distributed algorithms. Existing distributed VTD algorithms, however, react too slowly on congestion for the real-time reconfiguration of large networks. We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm for distributed VTD. It combines reconfiguring the virtual topology and routing through a Software Defined Network (SDN). SVTR is used for online, on-the-fly network reconfiguration. Its integrated routing and WDM reconfiguration keeps connection disruption due to network reconfiguration to a minimum and is able to react very quickly to traffic pattern changes. SVTR works by iteratively adapting the virtual topology to the observed traffic patterns without global traffic information and without future traffic estimations. We evaluated SVTR by simulation and found that it significantly lowers congestion in realistic networks and high load scenarios.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"date_created":"2018-03-15T10:50:19Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1307","file_size":219902,"access_level":"closed","file_name":"508-06528271.pdf","date_updated":"2018-03-15T10:50:19Z","relation":"main_file"}],"date_created":"2017-10-17T12:42:31Z","type":"conference","department":[{"_id":"75"}],"status":"public","title":"On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks","year":"2013","author":[{"full_name":"Wette, Philip","first_name":"Philip","last_name":"Wette"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_updated":"2022-01-06T07:01:37Z","has_accepted_license":"1","page":"1 - 6 ","_id":"508","user_id":"15572","ddc":["040"],"doi":"10.1109/LANMAN.2013.6528271"},{"publication":"Proceedings of the Conference on Networked Systems (NetSys)","file_date_updated":"2018-03-15T10:46:51Z","citation":{"apa":"Autenrieth, M., &#38; Frey, H. (2013). On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 126–131). <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>","ieee":"M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–131.","chicago":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 126–31, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.10\">https://doi.org/10.1109/NetSys.2013.10</a>.","short":"M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.","mla":"Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 126–31, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>.","ama":"Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:126-131. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>","bibtex":"@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.10\">10.1109/NetSys.2013.10</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth, Marcus and Frey, Hannes}, year={2013}, pages={126–131} }"},"abstract":[{"text":"In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"date_updated":"2018-03-15T10:46:51Z","relation":"main_file","access_level":"closed","file_size":197048,"file_name":"509-06529245.pdf","content_type":"application/pdf","success":1,"file_id":"1304","creator":"florida","date_created":"2018-03-15T10:46:51Z"}],"date_created":"2017-10-17T12:42:31Z","type":"conference","department":[{"_id":"75"}],"status":"public","title":"On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings","year":"2013","author":[{"last_name":"Autenrieth","first_name":"Marcus","full_name":"Autenrieth, Marcus"},{"last_name":"Frey","first_name":"Hannes","full_name":"Frey, Hannes"}],"date_updated":"2022-01-06T07:01:37Z","has_accepted_license":"1","page":"126-131","_id":"509","doi":"10.1109/NetSys.2013.10","ddc":["040"],"user_id":"15504"},{"type":"mastersthesis","date_created":"2017-10-17T12:42:31Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ieee":"C. Jayesh Parekh, <i>Meta-data based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn, 2013.","mla":"Jayesh Parekh, Chintan. <i>Meta-Data Based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn, 2013.","apa":"Jayesh Parekh, C. (2013). <i>Meta-data based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn.","bibtex":"@book{Jayesh Parekh_2013, title={Meta-data based Search in Structured Peer-to-Peer Networks}, publisher={Universität Paderborn}, author={Jayesh Parekh, Chintan}, year={2013} }","chicago":"Jayesh Parekh, Chintan. <i>Meta-Data Based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn, 2013.","short":"C. Jayesh Parekh, Meta-Data Based Search in Structured Peer-to-Peer Networks, Universität Paderborn, 2013.","ama":"Jayesh Parekh C. <i>Meta-Data Based Search in Structured Peer-to-Peer Networks</i>. Universität Paderborn; 2013."},"user_id":"15504","publisher":"Universität Paderborn","_id":"510","date_updated":"2022-01-06T07:01:37Z","author":[{"last_name":"Jayesh Parekh","first_name":"Chintan","full_name":"Jayesh Parekh, Chintan"}],"title":"Meta-data based Search in Structured Peer-to-Peer Networks","year":"2013","status":"public"},{"date_created":"2017-10-17T12:42:32Z","department":[{"_id":"75"}],"type":"bachelorsthesis","citation":{"ama":"Splietker M. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn; 2013.","bibtex":"@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität Paderborn}, author={Splietker, Malte}, year={2013} }","mla":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","chicago":"Splietker, Malte. <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013.","short":"M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn, 2013.","apa":"Splietker, M. (2013). <i>MapReduce in Software Defined Networks</i>. Universität Paderborn.","ieee":"M. Splietker, <i>MapReduce in Software Defined Networks</i>. Universität Paderborn, 2013."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"511","publisher":"Universität Paderborn","user_id":"15504","author":[{"last_name":"Splietker","first_name":"Malte","full_name":"Splietker, Malte"}],"status":"public","title":"MapReduce in Software Defined Networks","year":"2013","date_updated":"2022-01-06T07:01:38Z"},{"date_created":"2018-10-31T07:56:40Z","department":[{"_id":"203"}],"type":"journal_article","citation":{"mla":"Gilroy, Bernard Michael, et al. “Subsidiarity between Economic Freedom and Harmonized Regulation: Is There an Optimal Degree of European Integration?” <i>Federal Governance</i>, vol. 10, no. 2, MISC, 2013, pp. 3–18.","bibtex":"@article{Gilroy_Schreckenberg_Seiler_2013, title={Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?}, volume={10}, number={2}, journal={Federal Governance}, publisher={MISC}, author={Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}, year={2013}, pages={3–18} }","ama":"Gilroy BM, Schreckenberg H, Seiler V. Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration? <i>Federal Governance</i>. 2013;10(2):3-18.","ieee":"B. M. Gilroy, H. Schreckenberg, and V. Seiler, “Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?,” <i>Federal Governance</i>, vol. 10, no. 2, pp. 3–18, 2013.","apa":"Gilroy, B. M., Schreckenberg, H., &#38; Seiler, V. (2013). Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration? <i>Federal Governance</i>, <i>10</i>(2), 3–18.","short":"B.M. Gilroy, H. Schreckenberg, V. Seiler, Federal Governance 10 (2013) 3–18.","chicago":"Gilroy, Bernard Michael, Heike Schreckenberg, and Volker Seiler. “Subsidiarity between Economic Freedom and Harmonized Regulation: Is There an Optimal Degree of European Integration?” <i>Federal Governance</i> 10, no. 2 (2013): 3–18."},"publication":"Federal Governance","issue":"2","language":[{"iso":"eng"}],"_id":"5111","publisher":"MISC","page":"3-18","volume":10,"user_id":"26589","author":[{"full_name":"Gilroy, Bernard Michael","first_name":"Bernard Michael","last_name":"Gilroy","id":"175"},{"first_name":"Heike","last_name":"Schreckenberg","full_name":"Schreckenberg, Heike"},{"last_name":"Seiler","first_name":"Volker","full_name":"Seiler, Volker"}],"status":"public","title":"Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?","year":"2013","intvolume":"        10","date_updated":"2022-01-06T07:01:38Z"},{"citation":{"ieee":"B. M. Gilroy, E. Lukas, and C. Heimann, “Technologiestandort Deutschland und internationale Wissensspillover.,” <i>Jahrbücher für Nationalokonomie 6 Statistik</i>, vol. 233, 2013.","apa":"Gilroy, B. M., Lukas, E., &#38; Heimann, C. (2013). Technologiestandort Deutschland und internationale Wissensspillover. <i>Jahrbücher Für Nationalokonomie 6 Statistik</i>, <i>233</i>.","short":"B.M. Gilroy, E. Lukas, C. Heimann, Jahrbücher Für Nationalokonomie 6 Statistik 233 (2013).","chicago":"Gilroy, Bernard Michael, Elmar Lukas, and Christian Heimann. “Technologiestandort Deutschland Und Internationale Wissensspillover.” <i>Jahrbücher Für Nationalokonomie 6 Statistik</i> 233 (2013).","mla":"Gilroy, Bernard Michael, et al. “Technologiestandort Deutschland Und Internationale Wissensspillover.” <i>Jahrbücher Für Nationalokonomie 6 Statistik</i>, vol. 233, 2013.","bibtex":"@article{Gilroy_Lukas_Heimann_2013, title={Technologiestandort Deutschland und internationale Wissensspillover.}, volume={233}, journal={Jahrbücher für Nationalokonomie 6 Statistik}, author={Gilroy, Bernard Michael and Lukas, Elmar and Heimann, Christian}, year={2013} }","ama":"Gilroy BM, Lukas E, Heimann C. Technologiestandort Deutschland und internationale Wissensspillover. <i>Jahrbücher für Nationalokonomie 6 Statistik</i>. 2013;233."},"publication":"Jahrbücher für Nationalokonomie 6 Statistik","department":[{"_id":"203"}],"type":"journal_article","date_created":"2018-10-31T07:58:12Z","intvolume":"       233","date_updated":"2022-01-06T07:01:38Z","author":[{"id":"175","full_name":"Gilroy, Bernard Michael","first_name":"Bernard Michael","last_name":"Gilroy"},{"full_name":"Lukas, Elmar","first_name":"Elmar","last_name":"Lukas"},{"last_name":"Heimann","first_name":"Christian","full_name":"Heimann, Christian"}],"year":"2013","title":"Technologiestandort Deutschland und internationale Wissensspillover.","status":"public","volume":233,"user_id":"26589","_id":"5112","language":[{"iso":"eng"}]},{"date_created":"2018-10-31T08:00:24Z","type":"journal_article","department":[{"_id":"203"}],"publication":"Basic Income Studies","issue":"1","citation":{"apa":"Gilroy, B. M., Heimann, A., &#38; Schopf, M. (2013). Basic income and labour supply: The German case. <i>Basic Income Studies</i>, <i>8</i>(1), 43–70.","ieee":"B. M. Gilroy, A. Heimann, and M. Schopf, “Basic income and labour supply: The German case,” <i>Basic Income Studies</i>, vol. 8, no. 1, pp. 43–70, 2013.","chicago":"Gilroy, Bernard Michael, Anastasia Heimann, and Mark Schopf. “Basic Income and Labour Supply: The German Case.” <i>Basic Income Studies</i> 8, no. 1 (2013): 43–70.","short":"B.M. Gilroy, A. Heimann, M. Schopf, Basic Income Studies 8 (2013) 43–70.","mla":"Gilroy, Bernard Michael, et al. “Basic Income and Labour Supply: The German Case.” <i>Basic Income Studies</i>, vol. 8, no. 1, De Gruyter, 2013, pp. 43–70.","ama":"Gilroy BM, Heimann A, Schopf M. Basic income and labour supply: The German case. <i>Basic Income Studies</i>. 2013;8(1):43-70.","bibtex":"@article{Gilroy_Heimann_Schopf_2013, title={Basic income and labour supply: The German case}, volume={8}, number={1}, journal={Basic Income Studies}, publisher={De Gruyter}, author={Gilroy, Bernard Michael and Heimann, Anastasia and Schopf, Mark}, year={2013}, pages={43–70} }"},"page":"43-70","_id":"5114","publisher":"De Gruyter","language":[{"iso":"eng"}],"user_id":"26589","volume":8,"status":"public","title":"Basic income and labour supply: The German case","year":"2013","author":[{"last_name":"Gilroy","first_name":"Bernard Michael","full_name":"Gilroy, Bernard Michael","id":"175"},{"last_name":"Heimann","first_name":"Anastasia","full_name":"Heimann, Anastasia"},{"last_name":"Schopf","first_name":"Mark","full_name":"Schopf, Mark"}],"date_updated":"2022-01-06T07:01:38Z","intvolume":"         8"},{"_id":"5115","language":[{"iso":"eng"}],"publisher":"Verlag Franz Vahlen GmbH","page":"134-140","volume":42,"user_id":"26589","author":[{"id":"175","first_name":"Bernard Michael","last_name":"Gilroy","full_name":"Gilroy, Bernard Michael"},{"first_name":"Birke Thuy Duong","last_name":"Nguyen","full_name":"Nguyen, Birke Thuy Duong"}],"title":"Ist Fairer Handel Wirklich Fair?","year":"2013","status":"public","intvolume":"        42","date_updated":"2022-01-06T07:01:38Z","date_created":"2018-10-31T08:01:49Z","department":[{"_id":"203"}],"type":"journal_article","citation":{"mla":"Gilroy, Bernard Michael, and Birke Thuy Duong Nguyen. “Ist Fairer Handel Wirklich Fair?” <i>WiSt-Wirtschaftswissenschaftliches Studium</i>, vol. 42, no. 3, Verlag Franz Vahlen GmbH, 2013, pp. 134–40.","bibtex":"@article{Gilroy_Nguyen_2013, title={Ist Fairer Handel Wirklich Fair?}, volume={42}, number={3}, journal={WiSt-Wirtschaftswissenschaftliches Studium}, publisher={Verlag Franz Vahlen GmbH}, author={Gilroy, Bernard Michael and Nguyen, Birke Thuy Duong}, year={2013}, pages={134–140} }","ama":"Gilroy BM, Nguyen BTD. Ist Fairer Handel Wirklich Fair? <i>WiSt-Wirtschaftswissenschaftliches Studium</i>. 2013;42(3):134-140.","ieee":"B. M. Gilroy and B. T. D. Nguyen, “Ist Fairer Handel Wirklich Fair?,” <i>WiSt-Wirtschaftswissenschaftliches Studium</i>, vol. 42, no. 3, pp. 134–140, 2013.","apa":"Gilroy, B. M., &#38; Nguyen, B. T. D. (2013). Ist Fairer Handel Wirklich Fair? <i>WiSt-Wirtschaftswissenschaftliches Studium</i>, <i>42</i>(3), 134–140.","chicago":"Gilroy, Bernard Michael, and Birke Thuy Duong Nguyen. “Ist Fairer Handel Wirklich Fair?” <i>WiSt-Wirtschaftswissenschaftliches Studium</i> 42, no. 3 (2013): 134–40.","short":"B.M. Gilroy, B.T.D. Nguyen, WiSt-Wirtschaftswissenschaftliches Studium 42 (2013) 134–140."},"publication":"WiSt-Wirtschaftswissenschaftliches Studium","issue":"3"},{"citation":{"mla":"Gilroy, Bernard Michael, et al. <i>Water as an Alternative Asset</i>. 2013.","bibtex":"@book{Gilroy_Schreckenberg_Seiler_2013, title={Water as an alternative asset}, author={Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}, year={2013} }","ama":"Gilroy BM, Schreckenberg H, Seiler V. <i>Water as an Alternative Asset</i>.; 2013.","ieee":"B. M. Gilroy, H. Schreckenberg, and V. Seiler, <i>Water as an alternative asset</i>. 2013.","apa":"Gilroy, B. M., Schreckenberg, H., &#38; Seiler, V. (2013). <i>Water as an alternative asset</i>.","short":"B.M. Gilroy, H. Schreckenberg, V. Seiler, Water as an Alternative Asset, 2013.","chicago":"Gilroy, Bernard Michael, Heike Schreckenberg, and Volker Seiler. <i>Water as an Alternative Asset</i>, 2013."},"date_created":"2018-10-31T08:06:28Z","type":"working_paper","department":[{"_id":"203"}],"status":"public","year":"2013","title":"Water as an alternative asset","author":[{"id":"175","full_name":"Gilroy, Bernard Michael","first_name":"Bernard Michael","last_name":"Gilroy"},{"first_name":"Heike","last_name":"Schreckenberg","full_name":"Schreckenberg, Heike"},{"first_name":"Volker","last_name":"Seiler","full_name":"Seiler, Volker"}],"date_updated":"2022-01-06T07:01:38Z","language":[{"iso":"eng"}],"_id":"5117","user_id":"26589"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Herzog E. <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn; 2013.","short":"E. Herzog, Lösungsverfahren für das many-to-one Matching Problem, Universität Paderborn, 2013.","chicago":"Herzog, Elvira. <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn, 2013.","bibtex":"@book{Herzog_2013, title={Lösungsverfahren für das many-to-one Matching Problem}, publisher={Universität Paderborn}, author={Herzog, Elvira}, year={2013} }","apa":"Herzog, E. (2013). <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn.","mla":"Herzog, Elvira. <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn, 2013.","ieee":"E. Herzog, <i>Lösungsverfahren für das many-to-one Matching Problem</i>. Universität Paderborn, 2013."},"type":"bachelorsthesis","date_created":"2017-10-17T12:42:32Z","date_updated":"2022-01-06T07:01:38Z","author":[{"full_name":"Herzog, Elvira","last_name":"Herzog","first_name":"Elvira"}],"title":"Lösungsverfahren für das many-to-one Matching Problem","year":"2013","status":"public","user_id":"477","_id":"512","language":[{"iso":"ger"}],"publisher":"Universität Paderborn"},{"citation":{"ama":"Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2013:395-406. doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>","bibtex":"@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }","mla":"Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406, doi:<a href=\"https://doi.org/10.1109/IPDPS.2013.40\">10.1109/IPDPS.2013.40</a>.","chicago":"Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 395–406, 2013. <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>.","short":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.","apa":"Avin, C., Häupler, B., Lotker, Z., Scheideler, C., &#38; Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 395–406). <a href=\"https://doi.org/10.1109/IPDPS.2013.40\">https://doi.org/10.1109/IPDPS.2013.40</a>","ieee":"C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in <i>Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2013, pp. 395–406."},"file_date_updated":"2018-03-15T10:45:15Z","publication":"Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"abstract":[{"text":"This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph.","lang":"eng"}],"date_created":"2017-10-17T12:42:32Z","file":[{"file_id":"1303","content_type":"application/pdf","success":1,"file_name":"513-ipdps13_01.pdf","access_level":"closed","file_size":518804,"relation":"main_file","date_updated":"2018-03-15T10:45:15Z","date_created":"2018-03-15T10:45:15Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"conference","author":[{"last_name":"Avin","first_name":"Chen","full_name":"Avin, Chen"},{"first_name":"Bernhard","last_name":"Häupler","full_name":"Häupler, Bernhard"},{"full_name":"Lotker, Zvi","last_name":"Lotker","first_name":"Zvi"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"title":"Locally Self-Adjusting Tree Networks","status":"public","year":"2013","has_accepted_license":"1","date_updated":"2022-01-06T07:01:38Z","_id":"513","page":"395-406","user_id":"15504","ddc":["040"],"doi":"10.1109/IPDPS.2013.40"}]