[{"year":"2015","citation":{"ama":"Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed A, Schaefer I, eds. <i>Fundamental Approaches to Software Engineering</i>. Lecture Notes in Computer Science. ; 2015:100-114. doi:<a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">10.1007/978-3-662-46675-9_7</a>","chicago":"Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What You Cannot Verify!” In <i>Fundamental Approaches to Software Engineering</i>, edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">https://doi.org/10.1007/978-3-662-46675-9_7</a>.","ieee":"M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,” in <i>Fundamental Approaches to Software Engineering</i>, 2015, pp. 100–114.","apa":"Czech, M., Jakobs, M.-C., &#38; Wehrheim, H. (2015). Just test what you cannot verify! In A. Egyed &#38; I. Schaefer (Eds.), <i>Fundamental Approaches to Software Engineering</i> (pp. 100–114). <a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">https://doi.org/10.1007/978-3-662-46675-9_7</a>","mla":"Czech, Mike, et al. “Just Test What You Cannot Verify!” <i>Fundamental Approaches to Software Engineering</i>, edited by Alexander Egyed and Ina Schaefer, 2015, pp. 100–14, doi:<a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">10.1007/978-3-662-46675-9_7</a>.","short":"M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental Approaches to Software Engineering, 2015, pp. 100–114.","bibtex":"@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Just test what you cannot verify!}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">10.1007/978-3-662-46675-9_7</a>}, booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes in Computer Science} }"},"page":"100-114","has_accepted_license":"1","title":"Just test what you cannot verify!","doi":"10.1007/978-3-662-46675-9_7","date_updated":"2022-01-06T06:58:00Z","date_created":"2017-10-17T12:41:47Z","author":[{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"editor":[{"first_name":"Alexander","full_name":"Egyed, Alexander","last_name":"Egyed"},{"first_name":"Ina","full_name":"Schaefer, Ina","last_name":"Schaefer"}],"abstract":[{"text":"Today, software verification is an established analysis method which can provide high guarantees for software safety. However, the resources (time and/or memory) for an exhaustive verification are not always available, and analysis then has to resort to other techniques, like testing. Most often, the already achieved partial verification results arediscarded in this case, and testing has to start from scratch.In this paper, we propose a method for combining verification and testing in which testing only needs to check the residual fraction of an uncompleted verification. To this end, the partial results of a verification run are used to construct a residual program (and residual assertions to be checked on it). The residual program can afterwards be fed into standardtesting tools. The proposed technique is sound modulo the soundness of the testing procedure. Experimental results show that this combinedusage of verification and testing can significantly reduce the effort for the subsequent testing.","lang":"eng"}],"file":[{"file_id":"1469","access_level":"closed","file_name":"283-FASEsubmission38_01.pdf","file_size":391253,"date_created":"2018-03-21T09:25:36Z","creator":"florida","date_updated":"2018-03-21T09:25:36Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Fundamental Approaches to Software Engineering","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:25:36Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"283","user_id":"477","series_title":"Lecture Notes in Computer Science","department":[{"_id":"77"}]},{"date_updated":"2022-01-06T06:58:03Z","publisher":"ACM","date_created":"2017-10-17T12:41:47Z","author":[{"first_name":"Martina","full_name":"Eikel, Martina","last_name":"Eikel"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"title":"IRIS: A Robust Information System Against Insider DoS Attacks","doi":"10.1145/2809806","has_accepted_license":"1","issue":"3","year":"2015","citation":{"ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS Attacks,” <i>Transactions on Parallel Computing</i>, no. 3, pp. 18:1--18:33, 2015.","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3 (2015): 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>.","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>. 2015;(3):18:1--18:33. doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>","short":"M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.","bibtex":"@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System Against Insider DoS Attacks}, DOI={<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>}, number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel, Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3, ACM, 2015, pp. 18:1--18:33, doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>.","apa":"Eikel, M., &#38; Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>, (3), 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>"},"page":"18:1--18:33","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"284","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:25:04Z","type":"journal_article","publication":"Transactions on Parallel Computing","abstract":[{"text":"In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers.","lang":"eng"}],"file":[{"file_size":651726,"file_id":"1468","file_name":"284-Eikel-Scheideler-ACM2015.pdf","access_level":"closed","date_updated":"2018-03-21T09:25:04Z","date_created":"2018-03-21T09:25:04Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public"},{"type":"conference","publication":"Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)","abstract":[{"text":"We propose an incremental workflow for the verification of parameterized systems modeled as symmetric networks of timed automata. Starting with a small number of timed automata in the network, a safety property is verified using IC3, a state-of-the-art algorithm based on induction.The result of the verification, an inductive strengthening, is reused proposing a candidate inductive strengthening for a larger network.If the candidate is valid, our main theorem states that the safety property holds for all sizes of the network of timed automata. Otherwise the number of automata is increased and the next iteration is started with a new run of IC3.We propose and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms to speed up the run of IC3.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:23:45Z","date_created":"2018-03-21T09:23:45Z","creator":"florida","file_size":479808,"file_id":"1466","access_level":"closed","file_name":"285-07352419.pdf"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"285","user_id":"477","department":[{"_id":"77"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:23:45Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2015","citation":{"mla":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>, 2015, pp. 1–9, doi:<a href=\"https://doi.org/10.1109/ACSD.2015.13\">10.1109/ACSD.2015.13</a>.","short":"T. Isenberg, in: Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9.","bibtex":"@inproceedings{Isenberg_2015, title={Incremental Inductive Verification of Parameterized Timed Systems}, DOI={<a href=\"https://doi.org/10.1109/ACSD.2015.13\">10.1109/ACSD.2015.13</a>}, booktitle={Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015}, pages={1–9} }","apa":"Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed Systems. In <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i> (pp. 1–9). <a href=\"https://doi.org/10.1109/ACSD.2015.13\">https://doi.org/10.1109/ACSD.2015.13</a>","ieee":"T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,” in <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>, 2015, pp. 1–9.","chicago":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” In <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>, 1–9, 2015. <a href=\"https://doi.org/10.1109/ACSD.2015.13\">https://doi.org/10.1109/ACSD.2015.13</a>.","ama":"Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems. In: <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>. ; 2015:1-9. doi:<a href=\"https://doi.org/10.1109/ACSD.2015.13\">10.1109/ACSD.2015.13</a>"},"page":"1-9 ","date_updated":"2022-01-06T06:58:07Z","author":[{"first_name":"Tobias","last_name":"Isenberg","full_name":"Isenberg, Tobias"}],"date_created":"2017-10-17T12:41:47Z","title":"Incremental Inductive Verification of Parameterized Timed Systems","doi":"10.1109/ACSD.2015.13"},{"language":[{"iso":"ger"}],"_id":"286","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","status":"public","type":"bachelorsthesis","title":"Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup","date_updated":"2022-01-06T06:58:10Z","publisher":"Universität Paderborn","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:47Z","author":[{"last_name":"Kalde","full_name":"Kalde, Benedikt","first_name":"Benedikt"}],"year":"2015","citation":{"ama":"Kalde B. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn; 2015.","chicago":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","ieee":"B. Kalde, <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","mla":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","short":"B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup, Universität Paderborn, 2015.","bibtex":"@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt}, year={2015} }","apa":"Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn."}},{"citation":{"ama":"Strotmann D. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.; 2015.","ieee":"D. Strotmann, <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>. 2015.","chicago":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>, 2015.","bibtex":"@book{Strotmann_2015, title={Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen}, author={Strotmann, Daniela}, year={2015} }","mla":"Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>. 2015.","short":"D. Strotmann, Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015.","apa":"Strotmann, D. (2015). <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>."},"status":"public","year":"2015","type":"bachelorsthesis","title":"Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen","date_created":"2018-05-24T13:05:41Z","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"user_id":"25078","author":[{"first_name":"Daniela","full_name":"Strotmann, Daniela","last_name":"Strotmann"}],"department":[{"_id":"64"}],"date_updated":"2022-01-06T06:58:12Z","_id":"2865"},{"doi":"10.1109/EWSDN.2015.57","title":"HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks","date_created":"2017-10-17T12:41:48Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T06:58:17Z","page":"1--7","citation":{"ieee":"P. Wette and H. Karl, “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks,” in <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7.","chicago":"Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 1--7, 2015. <a href=\"https://doi.org/10.1109/EWSDN.2015.57\">https://doi.org/10.1109/EWSDN.2015.57</a>.","ama":"Wette P, Karl H. HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In: <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>. ; 2015:1--7. doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>","mla":"Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7, doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>.","short":"P. Wette, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7.","bibtex":"@inproceedings{Wette_Karl_2015, title={HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Wette, Philip and Karl, Holger}, year={2015}, pages={1--7} }","apa":"Wette, P., &#38; Karl, H. (2015). HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i> (pp. 1--7). <a href=\"https://doi.org/10.1109/EWSDN.2015.57\">https://doi.org/10.1109/EWSDN.2015.57</a>"},"year":"2015","has_accepted_license":"1","quality_controlled":"1","file_date_updated":"2018-03-08T09:59:05Z","ddc":["040"],"department":[{"_id":"75"}],"user_id":"15572","_id":"287","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","file":[{"file_size":1625732,"file_id":"1203","file_name":"287-1503.04317v1.pdf","access_level":"closed","date_updated":"2018-03-08T09:59:05Z","creator":"florida","date_created":"2018-03-08T09:55:30Z","relation":"main_file","content_type":"application/pdf"}],"urn":"2875","abstract":[{"lang":"eng","text":"The size of modern data centers is constantly increasing. As it is not economic to interconnect all machines in the data center using a full-bisection-bandwidth network, techniques have to be developed to increase the efficiency of data-center networks. The Software-Defined Network paradigm opened the door for centralized traffic engineering (TE) in such environments. Up to now, there were already a number of TE proposals for SDN-controlled data centers that all work very well. However, these techniques either use a high amount of flow table entries or a high flow installation rate that overwhelms available switching hardware, or they require custom or very expensive end-of-line equipment to be usable in practice. We present HybridTE, a TE technique that uses (uncertain) information about large flows. Using this extra information, our technique has very low hardware requirements while maintaining better performance than existing TE techniques. This enables us to build very low-cost, high performance data-center networks."}],"publication":"Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)","type":"conference"},{"has_accepted_license":"1","citation":{"apa":"Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>","bibtex":"@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>}, booktitle={Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>.","short":"C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015.","ieee":"C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures,” in <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015.","chicago":"Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” In <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs), 2015. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>.","ama":"Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In: <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs). ; 2015. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>"},"year":"2015","date_created":"2017-10-17T12:41:39Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer"},{"full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann","first_name":"Thim Frederik"}],"date_updated":"2022-01-06T06:56:07Z","doi":"10.4230/LIPIcs.OPODIS.2015.24","title":"Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures","publication":"Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)","type":"conference","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":692363,"file_name":"241-ScheidelerSetzerStrothmann2015.pdf","file_id":"1497","access_level":"closed","date_updated":"2018-03-21T10:28:21Z","creator":"florida","date_created":"2018-03-21T10:28:21Z"}],"abstract":[{"text":"Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics.","lang":"eng"}],"department":[{"_id":"79"}],"user_id":"477","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","_id":"241","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-21T10:28:21Z","language":[{"iso":"eng"}],"ddc":["040"]},{"ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest."}],"file":[{"date_updated":"2018-03-21T09:59:32Z","date_created":"2018-03-21T09:59:32Z","creator":"florida","file_size":532792,"file_name":"242-KSS-SSS2015.pdf","access_level":"closed","file_id":"1496","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","title":"Towards a Universal Approach for the Finite Departure Problem in Overlay Networks","date_created":"2017-10-17T12:41:39Z","year":"2015","file_date_updated":"2018-03-21T09:59:32Z","_id":"242","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","series_title":"Lecture Notes in Computer Science","status":"public","type":"conference","doi":"10.1007/978-3-319-21741-3_14","date_updated":"2022-01-06T06:56:10Z","author":[{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"}],"page":"201-216","citation":{"ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Lecture Notes in Computer Science. ; 2015:201-216. doi:<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 201–16. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">https://doi.org/10.1007/978-3-319-21741-3_14</a>.","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2015, pp. 201–216.","mla":"Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2015, pp. 201–16, doi:<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>.","bibtex":"@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture Notes in Computer Science}, title={Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>}, booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216}, collection={Lecture Notes in Computer Science} }","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216.","apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 201–216). <a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">https://doi.org/10.1007/978-3-319-21741-3_14</a>"},"has_accepted_license":"1"},{"abstract":[{"lang":"eng","text":"This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm, which is closely related to the nearly thirty-year-old idea of splay trees and evaluate its adaption performance in the distributed scenario if different communication patterns are provided.To do so, the process of self-adjustment is modeled similarly to a basic network creation game, in which the nodes want to communicate with only a certain subset of all nodes. We show that, in general, the game (i.e., the process of local adjustments) does not converge, and convergence is related to certain structures of the communication interests, which we call conflicts.We classify conflicts and show that for two communication scenarios in which convergence is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate the different classes of conflicts separately and show that, for a certain class of conflicts, the performance of the tree network is asymptotically as good as the performance for converging instances. However, for the other conflict classes, a distributed self-adjusting binary search tree adapts poorly."}],"status":"public","file":[{"file_size":1003113,"access_level":"closed","file_name":"243-Strothmann-Walcom2015.pdf","file_id":"1495","date_updated":"2018-03-21T09:59:00Z","creator":"florida","date_created":"2018-03-21T09:59:00Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-21T09:59:00Z","language":[{"iso":"eng"}],"_id":"243","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"477","year":"2015","page":"175--186","citation":{"apa":"Strothmann, T. F. (2015). The impact of communication patterns on distributed locally self-adjusting binary search trees. In <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i> (pp. 175--186). <a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">https://doi.org/10.1007/978-3-319-15612-5_16</a>","short":"T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.","bibtex":"@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication patterns on distributed locally self-adjusting binary search trees}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>}, booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186}, collection={LNCS} }","mla":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186, doi:<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>.","ama":"Strothmann TF. The impact of communication patterns on distributed locally self-adjusting binary search trees. In: <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>. LNCS. ; 2015:175--186. doi:<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>","chicago":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” In <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 175--186. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">https://doi.org/10.1007/978-3-319-15612-5_16</a>.","ieee":"T. F. Strothmann, “The impact of communication patterns on distributed locally self-adjusting binary search trees,” in <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186."},"has_accepted_license":"1","title":"The impact of communication patterns on distributed locally self-adjusting binary search trees","doi":"10.1007/978-3-319-15612-5_16","date_updated":"2022-01-06T06:56:17Z","author":[{"last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik"}],"date_created":"2017-10-17T12:41:39Z"},{"type":"dissertation","status":"public","file":[{"file_size":10091866,"file_id":"1492","access_level":"closed","file_name":"246-Dissertation_-_Besova.pdf","date_updated":"2018-03-21T09:47:14Z","date_created":"2018-03-21T09:47:14Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"_id":"246","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-21T09:47:14Z","has_accepted_license":"1","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899","relation":"confirmation"}]},"year":"2015","citation":{"apa":"Besova, G. (2015). <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn.","bibtex":"@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations}, publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }","mla":"Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn, 2015.","short":"G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität Paderborn, 2015.","chicago":"Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn, 2015.","ieee":"G. Besova, <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn, 2015.","ama":"Besova G. <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn; 2015."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:56:30Z","author":[{"first_name":"Galina","full_name":"Besova, Galina","last_name":"Besova"}],"supervisor":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2017-10-17T12:41:40Z","title":"Systematic Development and Re-Use of Model Tranformations"},{"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T09:46:21Z","creator":"florida","date_updated":"2018-03-21T09:46:21Z","access_level":"closed","file_name":"247-07313613.pdf","file_id":"1491","file_size":277574}],"abstract":[{"text":"Multi-rooted trees are becoming the norm for modern data-center networks. In these networks, scalable flow routing is challenging owing to vast number of flows. Current approaches either employ a central controller that can have scalability issues or a scalable decentralized algorithm only considering local information. In this paper we present a new decentralized approach to least-congested path routing in software-defined data center networks that has neither of these issues: By duplicating the initial (or SYN) packet of a flow and estimating the data rate of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find the least congested path. We show that our algorithm significantly improves flow completion time without the need for a central controller or specialized hardware.","lang":"eng"}],"publication":"Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)","type":"conference","file_date_updated":"2018-03-21T09:46:21Z","ddc":["040"],"department":[{"_id":"75"}],"user_id":"15504","_id":"247","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"page":"37-42","citation":{"mla":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42, doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>.","short":"A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.","bibtex":"@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42} }","apa":"Schwabe, A., &#38; Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i> (pp. 37–42). <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>","ama":"Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In: <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>. ; 2015:37-42. doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>","ieee":"A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics,” in <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42.","chicago":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 37–42, 2015. <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>."},"year":"2015","has_accepted_license":"1","doi":"10.1109/EWSDN.2015.58","title":"SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics","date_created":"2017-10-17T12:41:40Z","author":[{"first_name":"Arne","full_name":"Schwabe, Arne","last_name":"Schwabe"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:56:32Z"},{"language":[{"iso":"ger"}],"user_id":"477","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"261","status":"public","type":"bachelorsthesis","title":"Protokolle zur authentifizierten Schüsselvereinbarung","date_created":"2017-10-17T12:41:43Z","author":[{"first_name":"Thorsten","last_name":"Eisenhofer","full_name":"Eisenhofer, Thorsten"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_updated":"2022-01-06T06:57:16Z","publisher":"Universität Paderborn","citation":{"ama":"Eisenhofer T. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn; 2015.","ieee":"T. Eisenhofer, <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","chicago":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","short":"T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität Paderborn, 2015.","bibtex":"@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung}, publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015} }","mla":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","apa":"Eisenhofer, T. (2015). <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn."},"year":"2015"},{"date_updated":"2022-01-06T06:57:18Z","date_created":"2017-10-17T12:41:43Z","author":[{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"title":"Programs from Proofs of Predicated Dataflow Analyses","doi":"10.1145/2695664.2695690","has_accepted_license":"1","year":"2015","page":"1729-1736","citation":{"bibtex":"@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs from Proofs of Predicated Dataflow Analyses}, DOI={<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>}, booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736}, collection={SAC ’15} }","short":"M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–1736.","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 2015, pp. 1729–36, doi:<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>.","apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2015). Programs from Proofs of Predicated Dataflow Analyses. In <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i> (pp. 1729–1736). <a href=\"https://doi.org/10.1145/2695664.2695690\">https://doi.org/10.1145/2695664.2695690</a>","ama":"Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses. In: <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>. SAC ’15. ; 2015:1729-1736. doi:<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” In <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 1729–36. SAC ’15, 2015. <a href=\"https://doi.org/10.1145/2695664.2695690\">https://doi.org/10.1145/2695664.2695690</a>.","ieee":"M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow Analyses,” in <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 2015, pp. 1729–1736."},"_id":"262","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"user_id":"477","series_title":"SAC '15","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:35:34Z","publication":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","type":"conference","abstract":[{"text":"Programs from Proofs\" is a generic method which generates new programs out of correctness proofs of given programs. The technique ensures that the new and given program are behaviorally equivalent and that the new program is easily verifiable, thus serving as an alternative to proof-carrying code concepts. So far, this generic method has one instantiation that verifies type-state properties of programs. In this paper, we present a whole range of new instantiations, all based on data ow analyses. More precisely, we show how an imprecise but fast data ow analysis can be enhanced with a predicate analysis as to yield a precise but expensive analysis. Out of the safety proofs of this analysis, we generate new programs, again behaviorally equivalent to the given ones, which are easily verifiable\" in the sense that now the data ow analysis alone can yield precise results. An experimental evaluation practically supports our claim of easy verification.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T09:35:34Z","date_updated":"2018-03-21T09:35:34Z","file_id":"1483","access_level":"closed","file_name":"262-mainSACfinal.pdf","file_size":554583}]},{"ddc":["040"],"file_date_updated":"2018-03-21T09:34:36Z","_id":"264","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"75"}],"user_id":"477","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1481","file_name":"264-Dissertation_-_Wette.pdf","file_size":8031107,"creator":"florida","date_created":"2018-03-21T09:34:36Z","date_updated":"2018-03-21T09:34:36Z"}],"type":"dissertation","title":"Optimizing Software-Defined Networks using Application-Layer Knowledge","date_updated":"2022-01-06T06:57:20Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:43Z","supervisor":[{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"}],"year":"2015","citation":{"ama":"Wette P. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn; 2015.","ieee":"P. Wette, <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","chicago":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","apa":"Wette, P. (2015). <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn.","bibtex":"@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015} }","short":"P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge, Universität Paderborn, 2015.","mla":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015."},"has_accepted_license":"1"},{"date_created":"2021-10-18T20:52:45Z","author":[{"first_name":"Hans","full_name":"Pongratz, Hans","last_name":"Pongratz"},{"last_name":"Keil","full_name":"Keil, Reinhard","first_name":"Reinhard"}],"date_updated":"2022-01-06T06:57:21Z","publisher":"Koellen Druck + Verlag GmbH","title":"DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV","publication_status":"published","citation":{"ieee":"H. Pongratz and R. Keil, <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV</i>. Koellen Druck + Verlag GmbH, 2015.","chicago":"Pongratz, Hans, and Reinhard Keil. <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV</i>. GI-Edition Lecture Notes in Informatics (LNI). Koellen Druck + Verlag GmbH, 2015.","ama":"Pongratz H, Keil R. <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV</i>. Koellen Druck + Verlag GmbH; 2015.","short":"H. Pongratz, R. Keil, DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV, Koellen Druck + Verlag GmbH, 2015.","bibtex":"@book{Pongratz_Keil_2015, series={GI-Edition Lecture Notes in Informatics (LNI)}, title={DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV}, publisher={Koellen Druck + Verlag GmbH}, author={Pongratz, Hans and Keil, Reinhard}, year={2015}, collection={GI-Edition Lecture Notes in Informatics (LNI)} }","mla":"Pongratz, Hans, and Reinhard Keil. <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV</i>. Koellen Druck + Verlag GmbH, 2015.","apa":"Pongratz, H., &#38; Keil, R. (2015). <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV</i>. Koellen Druck + Verlag GmbH."},"year":"2015","user_id":"71124","series_title":"GI-Edition Lecture Notes in Informatics (LNI)","department":[{"_id":"71"}],"_id":"26446","language":[{"iso":"eng"}],"type":"book","status":"public"},{"publication_status":"published","page":"103-117","intvolume":"       330","citation":{"chicago":"Winkelnkemper, Felix, and Andreas Oberhoff. “WebArena - R {\\ ‘A} Spacious Structures for {\\’ U} r the Learning Locations of the Future.” edited by Reinhard  wedge and Harald Selke, 330:103–17. Publication series of the Heinz Nixdorf Institute, Paderborn, 2015.","ieee":"F. Winkelnkemper and A. Oberhoff, “WebArena - R {\\ ‘a} spacious structures for {\\’ u} r the learning locations of the future,” 2015, vol. 330, pp. 103–117.","ama":"Winkelnkemper F, Oberhoff A. WebArena - R {\\ “a} spacious structures for {\\” u} r the learning locations of the future. In: wedge R, Selke H, eds. Vol 330. Publication series of the Heinz Nixdorf Institute, Paderborn; 2015:103-117.","apa":"Winkelnkemper, F., &#38; Oberhoff, A. (2015). <i>WebArena - R {\\ “a} spacious structures for {\\” u} r the learning locations of the future</i> (R. wedge &#38; H. Selke, Eds.; Vol. 330, pp. 103–117). Publication series of the Heinz Nixdorf Institute, Paderborn.","mla":"Winkelnkemper, Felix, and Andreas Oberhoff. <i>WebArena - R {\\ “A} Spacious Structures for {\\” U} r the Learning Locations of the Future</i>. Edited by Reinhard  wedge and Harald Selke, vol. 330, Publication series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–17.","bibtex":"@inproceedings{Winkelnkemper_Oberhoff_2015, title={WebArena - R {\\ “a} spacious structures for {\\” u} r the learning locations of the future}, volume={330}, publisher={Publication series of the Heinz Nixdorf Institute, Paderborn}, author={Winkelnkemper, Felix and Oberhoff, Andreas}, editor={wedge, Reinhard  and Selke, Harald}, year={2015}, pages={103–117} }","short":"F. Winkelnkemper, A. Oberhoff, in: R. wedge, H. Selke (Eds.), Publication series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–117."},"year":"2015","volume":330,"author":[{"last_name":"Winkelnkemper","id":"3117","full_name":"Winkelnkemper, Felix","first_name":"Felix"},{"last_name":"Oberhoff","full_name":"Oberhoff, Andreas","first_name":"Andreas"}],"date_created":"2021-10-18T20:56:42Z","publisher":"Publication series of the Heinz Nixdorf Institute, Paderborn","date_updated":"2022-01-06T06:57:21Z","title":"WebArena - R {\\ \"a} spacious structures for {\\\" u} r the learning locations of the future","type":"conference","status":"public","editor":[{"last_name":"wedge","full_name":"wedge, Reinhard ","first_name":"Reinhard "},{"full_name":"Selke, Harald","last_name":"Selke","first_name":"Harald"}],"department":[{"_id":"71"}],"user_id":"71124","_id":"26449","language":[{"iso":"eng"}],"alternative_title":["20 years of learning with the World Wide Web - technology and education in dialogue"]},{"language":[{"iso":"eng"}],"_id":"26531","series_title":"Heinz publishing house series Nixdorf Institute, Paderborn","user_id":"71124","department":[{"_id":"71"}],"editor":[{"full_name":"Keil, Reinhard","last_name":"Keil","first_name":"Reinhard"},{"id":"497","full_name":"Selke, Harald","last_name":"Selke","first_name":"Harald"}],"status":"public","type":"book_editor","title":"20 years of learning with the World Wide Web - technology and education in dialogue","date_updated":"2022-01-06T06:57:22Z","publisher":"publishing series of the Heinz Nixdorf Institute, Paderborn","date_created":"2021-10-19T14:09:39Z","volume":330,"year":"2015","citation":{"chicago":"Keil, Reinhard, and Harald Selke, eds. <i>20 Years of Learning with the World Wide Web - Technology and Education in Dialogue</i>. Vol. 330. Heinz Publishing House Series Nixdorf Institute, Paderborn. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ieee":"R. Keil and H. Selke, Eds., <i>20 years of learning with the World Wide Web - technology and education in dialogue</i>, vol. 330. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ama":"Keil R, Selke H, eds. <i>20 Years of Learning with the World Wide Web - Technology and Education in Dialogue</i>. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015.","short":"R. Keil, H. Selke, eds., 20 Years of Learning with the World Wide Web - Technology and Education in Dialogue, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","mla":"Keil, Reinhard, and Harald Selke, editors. <i>20 Years of Learning with the World Wide Web - Technology and Education in Dialogue</i>. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","bibtex":"@book{Keil_Selke_2015, series={Heinz publishing house series Nixdorf Institute, Paderborn}, title={20 years of learning with the World Wide Web - technology and education in dialogue}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, year={2015}, collection={Heinz publishing house series Nixdorf Institute, Paderborn} }","apa":"Keil, R., &#38; Selke, H. (Eds.). (2015). <i>20 years of learning with the World Wide Web - technology and education in dialogue</i> (Vol. 330). publishing series of the Heinz Nixdorf Institute, Paderborn."},"intvolume":"       330","publication_status":"published"},{"type":"conference","status":"public","editor":[{"first_name":"Reinhard","full_name":"Keil, Reinhard","last_name":"Keil"},{"first_name":"Harald","last_name":" Selke","full_name":" Selke, Harald"}],"user_id":"71124","department":[{"_id":"71"}],"_id":"26532","alternative_title":["20 years of learning with the World Wide Web - technology and education in dialogue"],"language":[{"iso":"eng"}],"publication_status":"published","citation":{"ama":"Keil R, Selke H. Learn with, through and {\\ \"about the WWW. In: Keil R,  Selke H, eds. Vol 330. Publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:1-7.","chicago":"Keil, Reinhard , and Harald Selke. “Learn with, through and {\\ \"about the WWW.” edited by Reinhard Keil and Harald  Selke, 330:1–7. Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ieee":"R. Keil and H. Selke, “Learn with, through and {\\ \"about the WWW,” 2015, vol. 330, pp. 1–7.","bibtex":"@inproceedings{Keil_Selke_2015, title={Learn with, through and {\\ \"about the WWW}, volume={330}, publisher={Publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard  and Selke, Harald}, editor={Keil, Reinhard and  Selke, Harald}, year={2015}, pages={1–7} }","short":"R. Keil, H. Selke, in: R. Keil, H.  Selke (Eds.), Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.","mla":"Keil, Reinhard, and Harald Selke. <i>Learn with, through and {\\ \"about the WWW</i>. Edited by Reinhard Keil and Harald  Selke, vol. 330, Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.","apa":"Keil, R., &#38; Selke, H. (2015). <i>Learn with, through and {\\ \"about the WWW</i> (R. Keil &#38; H.  Selke, Eds.; Vol. 330, pp. 1–7). Publishing series of the Heinz Nixdorf Institute, Paderborn."},"intvolume":"       330","page":"1-7","year":"2015","date_created":"2021-10-19T14:13:08Z","author":[{"last_name":"Keil","full_name":"Keil, Reinhard ","first_name":"Reinhard "},{"first_name":"Harald","last_name":"Selke","id":"497","full_name":"Selke, Harald"}],"volume":330,"publisher":"Publishing series of the Heinz Nixdorf Institute, Paderborn","date_updated":"2022-01-06T06:57:22Z","title":"Learn with, through and {\\ \"about the WWW"},{"alternative_title":["20 years of learning with the World Wide Web - technology and education in dialogue"],"language":[{"iso":"eng"}],"user_id":"71124","department":[{"_id":"71"}],"_id":"26533","status":"public","editor":[{"last_name":"Keil","full_name":"Keil, Reinhard","first_name":"Reinhard"},{"last_name":"Selke","full_name":"Selke, Harald","first_name":"Harald"}],"type":"conference","title":"Virtual knowledge {\\ \"a} ume - From the presentation of content to virtual learning {\\\" a} tten","date_created":"2021-10-19T14:19:23Z","author":[{"first_name":"Reinhard ","full_name":"Keil, Reinhard ","last_name":"Keil"},{"first_name":"Harald","last_name":"Selke","id":"497","full_name":"Selke, Harald"}],"volume":330,"publisher":"publishing series of the Heinz Nixdorf Institute, Paderborn","date_updated":"2022-01-06T06:57:22Z","citation":{"ieee":"R. Keil and H. Selke, “Virtual knowledge {\\ ‘a} ume - From the presentation of content to virtual learning {\\’ a} tten,” 2015, vol. 330, pp. 39–53.","chicago":"Keil, Reinhard , and Harald Selke. “Virtual Knowledge {\\ ‘A} Ume - From the Presentation of Content to Virtual Learning {\\’ A} Tten.” edited by Reinhard Keil and Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ama":"Keil R, Selke H. Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten. In: Keil R, Selke H, eds. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.","bibtex":"@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard  and Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={39–53} }","mla":"Keil, Reinhard, and Harald Selke. <i>Virtual Knowledge {\\ “A} Ume - From the Presentation of Content to Virtual Learning {\\” A} Tten</i>. Edited by Reinhard Keil and Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","short":"R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","apa":"Keil, R., &#38; Selke, H. (2015). <i>Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten</i> (R. Keil &#38; H. Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute, Paderborn."},"intvolume":"       330","page":"39-53","year":"2015","publication_status":"published"},{"type":"dissertation","status":"public","_id":"26534","department":[{"_id":"71"}],"user_id":"71124","language":[{"iso":"eng"}],"publication_status":"published","place":"Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science","year":"2015","citation":{"apa":"Klompmaker, F. (2015). <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universitaetsbibliothek Paderborn.","mla":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn, 2015.","short":"F. Klompmaker, Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces, Universitaetsbibliothek Paderborn, Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science, 2015.","bibtex":"@book{Klompmaker_2015, place={Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science}, title={Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces}, publisher={Universitaetsbibliothek Paderborn}, author={Klompmaker, Florian}, year={2015} }","chicago":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","ieee":"F. Klompmaker, <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","ama":"Klompmaker F. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn; 2015."},"date_updated":"2022-01-06T06:57:22Z","publisher":"Universitaetsbibliothek Paderborn","author":[{"first_name":"Florian","last_name":"Klompmaker","full_name":"Klompmaker, Florian"}],"date_created":"2021-10-19T14:22:28Z","title":"Development of a structured process of interaction design for {\\ \"u} r nat {\\\" u} local user interfaces"}]