[{"abstract":[{"lang":"eng","text":"In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \\epsilon-fraction of its serversby a DoS-attack, where \\epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":554618,"file_id":"1299","access_level":"closed","file_name":"519-iris-spaa2013_01.pdf","date_updated":"2018-03-15T10:38:34Z","date_created":"2018-03-15T10:38:34Z","creator":"florida"}],"publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-15T10:38:34Z","_id":"519","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"user_id":"15504","year":"2013","page":"119-129","citation":{"ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–129.","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 119–29, 2013. <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>.","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:119-129. doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>","short":"M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–29, doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>.","bibtex":"@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }","apa":"Eikel, M., &#38; Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 119–129). <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>"},"has_accepted_license":"1","title":"IRIS: A Robust Information System Against Insider DoS-Attacks","doi":"10.1145/2486159.2486186","date_updated":"2022-01-06T07:01:42Z","date_created":"2017-10-17T12:42:33Z","author":[{"first_name":"Martina","full_name":"Eikel, Martina","last_name":"Eikel"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"file_date_updated":"2018-03-15T10:38:04Z","ddc":["040"],"user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"520","file":[{"date_updated":"2018-03-15T10:38:04Z","creator":"florida","date_created":"2018-03-15T10:38:04Z","file_size":131502,"access_level":"closed","file_name":"520-wetteinfocom2013.pdf","file_id":"1298","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"doi":"10.1109/INFCOMW.2013.6970733","title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","date_created":"2017-10-17T12:42:33Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T07:01:43Z","citation":{"ama":"Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:51-52. doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>","chicago":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 51–52, 2013. <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>.","ieee":"P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52.","apa":"Wette, P., &#38; Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 51–52). <a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">https://doi.org/10.1109/INFCOMW.2013.6970733</a>","bibtex":"@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }","short":"P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","mla":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 51–52, doi:<a href=\"https://doi.org/10.1109/INFCOMW.2013.6970733\">10.1109/INFCOMW.2013.6970733</a>."},"page":"51-52","year":"2013","has_accepted_license":"1"},{"type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"27"},{"_id":"518"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"521","language":[{"iso":"ger"}],"keyword":["coldboot"],"citation":{"ama":"Riebler H. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn; 2013.","ieee":"H. Riebler, <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","chicago":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","apa":"Riebler, H. (2013). <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn.","bibtex":"@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }","mla":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","short":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013."},"year":"2013","author":[{"first_name":"Heinrich","full_name":"Riebler, Heinrich","id":"8961","last_name":"Riebler"}],"date_created":"2017-10-17T12:42:34Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:46Z","title":"Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs"},{"year":"2013","citation":{"ama":"Feldotto M. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn; 2013.","chicago":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","ieee":"M. Feldotto, <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","short":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013.","mla":"Feldotto, Matthias. <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn, 2013.","bibtex":"@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }","apa":"Feldotto, M. (2013). <i>HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths</i>. Universität Paderborn."},"title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","date_updated":"2022-01-06T07:01:47Z","publisher":"Universität Paderborn","author":[{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:34Z","status":"public","type":"mastersthesis","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"5","name":"SFB 901 - Subprojekt A1"}],"_id":"522","user_id":"14052","department":[{"_id":"79"}]},{"publisher":"arXiv","date_created":"2017-10-17T12:42:34Z","title":"Hierarchies in Local Distributed Decision","year":"2013","external_id":{"arxiv":["1311.7229"]},"ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.","lang":"eng"}],"file":[{"creator":"florida","date_created":"2018-03-15T10:37:07Z","date_updated":"2018-03-15T10:37:07Z","file_id":"1296","file_name":"524-paper_01.pdf","access_level":"closed","file_size":534906,"content_type":"application/pdf","relation":"main_file","success":1}],"date_updated":"2022-01-06T07:01:48Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Kamil","full_name":"Swirkot, Kamil","last_name":"Swirkot"}],"has_accepted_license":"1","citation":{"ama":"Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013.","chicago":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013.","ieee":"F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013.","apa":"Meyer auf der Heide, F., &#38; Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv.","bibtex":"@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }","short":"F. Meyer auf der Heide, K. Swirkot, (2013).","mla":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. <i>Hierarchies in Local Distributed Decision</i>. arXiv, 2013."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"524","user_id":"15415","department":[{"_id":"63"}],"file_date_updated":"2018-03-15T10:37:07Z","type":"preprint","status":"public"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"75"}],"user_id":"15504","_id":"525","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"apa":"Niklas Vinkemeier, T. (2013). <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn.","bibtex":"@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }","mla":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","short":"T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013.","ama":"Niklas Vinkemeier T. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn; 2013.","chicago":"Niklas Vinkemeier, Tim. <i>Haptics - Hadoop Performance Testing in Concurrent Job Scenarios</i>. Universität Paderborn, 2013.","ieee":"T. Niklas Vinkemeier, <i>Haptics - Hadoop performance testing in concurrent job scenarios</i>. Universität Paderborn, 2013."},"year":"2013","date_created":"2017-10-17T12:42:34Z","author":[{"full_name":"Niklas Vinkemeier, Tim","last_name":"Niklas Vinkemeier","first_name":"Tim"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:48Z","title":"Haptics - Hadoop performance testing in concurrent job scenarios"},{"publication":"Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)","type":"conference","status":"public","file":[{"date_updated":"2018-03-15T10:36:38Z","date_created":"2018-03-15T10:36:38Z","creator":"florida","file_size":730490,"access_level":"closed","file_name":"527-p715-platenius.pdf","file_id":"1295","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"In the future vision of software engineering, services from world-wide markets are composed automated in order to build custom-made systems.Supporting such scenarios requires an adequate service matching approach.Many existing approaches do not fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely (1) comprehensiveness, i.e., the consideration of different service aspects that cover not only functional properties, but also non-functional properties and (2) fuzzy matching, i.e., the ability to deliver gradual results in order to cope with a certain extent of uncertainty, incompleteness, and tolerance ranges.In this paper, I present a fuzzy matching process that distinguishes between different fuzziness sources and leverages fuzziness in different matching steps which consider different service aspects, e.g., behavior and quality properties. "}],"department":[{"_id":"76"}],"user_id":"477","_id":"527","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:36:38Z","ddc":["040"],"has_accepted_license":"1","page":" 715-718 ","citation":{"chicago":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” In <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>, 715–18, 2013. <a href=\"https://doi.org/10.1145/2491411.2492405\">https://doi.org/10.1145/2491411.2492405</a>.","ieee":"M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” in <i>Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>, 2013, pp. 715–718.","ama":"Christin Platenius M. Fuzzy Service Matching in On-The-Fly Computing. In: <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>. ; 2013:715-718. doi:<a href=\"https://doi.org/10.1145/2491411.2492405\">10.1145/2491411.2492405</a>","short":"M. Christin Platenius, in: Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–718.","mla":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” <i>Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i>, 2013, pp. 715–18, doi:<a href=\"https://doi.org/10.1145/2491411.2492405\">10.1145/2491411.2492405</a>.","bibtex":"@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in On-The-Fly Computing}, DOI={<a href=\"https://doi.org/10.1145/2491411.2492405\">10.1145/2491411.2492405</a>}, booktitle={Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)}, author={Christin Platenius, Marie}, year={2013}, pages={715–718} }","apa":"Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing. In <i>Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)</i> (pp. 715–718). <a href=\"https://doi.org/10.1145/2491411.2492405\">https://doi.org/10.1145/2491411.2492405</a>"},"year":"2013","date_created":"2017-10-17T12:42:35Z","author":[{"last_name":"Christin Platenius","full_name":"Christin Platenius, Marie","first_name":"Marie"}],"date_updated":"2022-01-06T07:01:48Z","doi":"10.1145/2491411.2492405","title":"Fuzzy Service Matching in On-The-Fly Computing"},{"title":"Emulating Wavelength Division Multiplexing using Openflow","author":[{"first_name":"Suhas","last_name":"Satya","full_name":"Satya, Suhas"}],"date_created":"2017-10-17T12:42:36Z","date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","citation":{"apa":"Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }","mla":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","ama":"Satya S. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn; 2013.","chicago":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","ieee":"S. Satya, <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn, 2013."},"year":"2013","department":[{"_id":"75"}],"user_id":"15504","_id":"534","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","type":"mastersthesis"},{"ddc":["040"],"file_date_updated":"2018-03-15T10:35:04Z","_id":"538","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"department":[{"_id":"64"}],"user_id":"25078","abstract":[{"lang":"eng","text":"We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1292","access_level":"closed","file_name":"538-AB-KEM_01.pdf","file_size":389797,"date_created":"2018-03-15T10:35:04Z","creator":"florida","date_updated":"2018-03-15T10:35:04Z"}],"type":"preprint","title":"Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2013/646"}],"oa":"1","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Gennadij","last_name":"Liske","full_name":"Liske, Gennadij"}],"date_created":"2017-10-17T12:42:37Z","year":"2013","citation":{"mla":"Blömer, Johannes, and Gennadij Liske. <i>Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles</i>. Universität Paderborn, 2013.","bibtex":"@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2013} }","short":"J. Blömer, G. Liske, (2013).","apa":"Blömer, J., &#38; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.","ama":"Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.","chicago":"Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","ieee":"J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013."},"has_accepted_license":"1"},{"date_updated":"2022-01-06T07:01:52Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"full_name":"Rapp, Vitaly","last_name":"Rapp","first_name":"Vitaly"}],"date_created":"2017-10-17T12:42:37Z","title":"Continuous Gossip-based Aggregation through Dynamic Information Aging","doi":"10.1109/ICCCN.2013.6614118","has_accepted_license":"1","year":"2013","citation":{"ama":"Graffi K, Rapp V. Continuous Gossip-based Aggregation through Dynamic Information Aging. In: <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>. ; 2013:1-7. doi:<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>","chicago":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” In <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 1–7, 2013. <a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">https://doi.org/10.1109/ICCCN.2013.6614118</a>.","ieee":"K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic Information Aging,” in <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 2013, pp. 1–7.","apa":"Graffi, K., &#38; Rapp, V. (2013). Continuous Gossip-based Aggregation through Dynamic Information Aging. In <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i> (pp. 1–7). <a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">https://doi.org/10.1109/ICCCN.2013.6614118</a>","bibtex":"@inproceedings{Graffi_Rapp_2013, title={Continuous Gossip-based Aggregation through Dynamic Information Aging}, DOI={<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>}, booktitle={Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)}, author={Graffi, Kalman and Rapp, Vitaly}, year={2013}, pages={1–7} }","mla":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 2013, pp. 1–7, doi:<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>.","short":"K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7."},"page":"1-7","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"541","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:33:20Z","type":"conference","publication":"Proceedings of the International Conference on Computer Communications and Networks (ICCCN'13)","abstract":[{"lang":"eng","text":"Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1290","file_name":"541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf","file_size":272960,"creator":"florida","date_created":"2018-03-15T10:33:20Z","date_updated":"2018-03-15T10:33:20Z"}],"status":"public"},{"doi":"10.1007/978-3-642-41527-2_37","title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system","date_created":"2017-10-17T12:42:38Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2022-01-06T07:01:53Z","page":"537-549","citation":{"apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i> (pp. 537–549). <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }","mla":"Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–49, doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 537–49. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–549.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2013:537-549. doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>"},"year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T10:32:48Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","series_title":"LNCS","_id":"542","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"date_updated":"2018-03-15T10:32:48Z","date_created":"2018-03-15T10:32:48Z","creator":"florida","file_size":262302,"file_id":"1289","access_level":"closed","file_name":"542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties.","lang":"eng"}],"publication":"Proceedings of the 27th International Symposium on Distributed Computing (DISC)","type":"conference"},{"has_accepted_license":"1","citation":{"chicago":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 99–106, 2013. <a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">https://doi.org/10.1109/HPCSim.2013.6641399</a>.","ieee":"M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM,” in <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 2013, pp. 99–106.","ama":"Feldotto M, Graffi K. Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In: <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>. ; 2013:99-106. doi:<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>","apa":"Feldotto, M., &#38; Graffi, K. (2013). Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i> (pp. 99–106). <a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">https://doi.org/10.1109/HPCSim.2013.6641399</a>","short":"M. Feldotto, K. Graffi, in: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.","bibtex":"@inproceedings{Feldotto_Graffi_2013, title={Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM}, DOI={<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>}, booktitle={Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)}, author={Feldotto, Matthias and Graffi, Kalman}, year={2013}, pages={99–106} }","mla":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 2013, pp. 99–106, doi:<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>."},"page":"99-106","year":"2013","author":[{"first_name":"Matthias","id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto"},{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"}],"date_created":"2017-10-17T12:42:38Z","date_updated":"2022-01-06T07:01:53Z","doi":"10.1109/HPCSim.2013.6641399","title":"Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM","type":"conference","publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T10:32:17Z","creator":"florida","date_updated":"2018-03-15T10:32:17Z","file_id":"1288","access_level":"closed","file_name":"544-FeldGraffi13.pdf","file_size":899441}],"status":"public","abstract":[{"text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer-to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems.","lang":"eng"}],"user_id":"14052","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"544","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:32:17Z","ddc":["040"]},{"page":"27-34","citation":{"apa":"Graffi, K., Benter, M., Divband, M., Kniesburges, S., &#38; Koutsopoulos, A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 27–34). <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>","mla":"Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>.","short":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.","bibtex":"@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi, Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and Koutsopoulos, Andreas}, year={2013}, pages={27–34} }","ieee":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34.","chicago":"Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges, and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 27–34, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>.","ama":"Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:27-34. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>"},"year":"2013","has_accepted_license":"1","doi":"10.1109/NetSys.2013.11","title":"Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"last_name":"Benter","full_name":"Benter, Markus","first_name":"Markus"},{"first_name":"Mohammad","last_name":"Divband","full_name":"Divband, Mohammad"},{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"}],"date_created":"2017-10-17T12:42:38Z","date_updated":"2022-01-06T07:01:55Z","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:30:42Z","creator":"florida","date_created":"2018-03-15T10:30:42Z","file_size":244841,"file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","file_id":"1286","access_level":"closed"}],"abstract":[{"lang":"eng","text":"Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord."}],"publication":"Proceedings of the Conference on Networked Systems (NetSys)","type":"conference","file_date_updated":"2018-03-15T10:30:42Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"546","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"abstract":[{"lang":"eng","text":"In recent years, the role of process models in the development of enterprise software systems has increased continuously. Today, process models are used at different levels in the development process. For instance, in Service-Oriented Architectures (SOA), high-level business process models become input for the development of IT systems, and in running IT systems executable process models describe choreographies of Web Services. A key driver behind this development is the necessity for a closer alignment of business and IT requirements, to reduce the reaction times in software development to frequent changes in competitive markets.Typically in these scenarios, process models are developed, maintained, and transformed in a team environment by several stakeholders that are often from different business units, resulting in different versions. To obtain integrated process models comprising the changes applied to different versions, the versions need to be consolidated by means of model change management. Change management for process models can be compared to widely used concurrent versioning systems (CVS) and consists of the following major activities: matching of process models, detection of differences, computation of dependencies and conflicts between differences, and merging of process models.Although in general model-driven development (MDD) is accepted as a well-established development approach, there are still some shortcomings that let developers decide against MDD and for more traditional development paradigms. These shortcomings comprise a lack of fully integrated and fully featured development environments for MDD, such as a comprehensive support for model change management.In this thesis, we present a framework for process model change management. The framework is based on an intermediate representation for process models that serves as an abstraction of specific process modeling languages and focuses on common syntactic and semantic core concepts for the modeling of workflow in process models. Based on the intermediate representation, we match process models in versioning scenarios and compute differences between process models generically. Further, we consider the analysis of dependencies between differences and show how conflicts between differences can be computed by taking into account the semantics of the modeling language.As proof-of concept, we have implemented major parts of this framework in terms of a prototype. The detection of differences and dependencies contributed also to the Compare & Merge framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released as a product in fall 2009."}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"547","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"66"}],"user_id":"477","year":"2013","citation":{"chicago":"Gerth, Christian. <i>Business Process Models - Change Management</i>. Universität Paderborn, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38604-6\">https://doi.org/10.1007/978-3-642-38604-6</a>.","ieee":"C. Gerth, <i>Business Process Models - Change Management</i>. Universität Paderborn, 2013.","ama":"Gerth C. <i>Business Process Models - Change Management</i>. Universität Paderborn; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-38604-6\">10.1007/978-3-642-38604-6</a>","apa":"Gerth, C. (2013). <i>Business Process Models - Change Management</i>. Universität Paderborn. <a href=\"https://doi.org/10.1007/978-3-642-38604-6\">https://doi.org/10.1007/978-3-642-38604-6</a>","short":"C. Gerth, Business Process Models - Change Management, Universität Paderborn, 2013.","bibtex":"@book{Gerth_2013, title={Business Process Models - Change Management}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-38604-6\">10.1007/978-3-642-38604-6</a>}, publisher={Universität Paderborn}, author={Gerth, Christian}, year={2013} }","mla":"Gerth, Christian. <i>Business Process Models - Change Management</i>. Universität Paderborn, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-38604-6\">10.1007/978-3-642-38604-6</a>."},"title":"Business Process Models - Change Management","doi":"10.1007/978-3-642-38604-6","date_updated":"2022-01-06T07:01:55Z","publisher":"Universität Paderborn","author":[{"full_name":"Gerth, Christian","last_name":"Gerth","first_name":"Christian"}],"supervisor":[{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"date_created":"2017-10-17T12:42:39Z"},{"doi":"10.1109/P2P.2013.6688720","title":"Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks","date_created":"2017-10-17T12:42:39Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"last_name":"Klerx","full_name":"Klerx, Timo","first_name":"Timo"}],"date_updated":"2022-01-06T07:01:56Z","citation":{"apa":"Graffi, K., &#38; Klerx, T. (2013). Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i> (pp. 1–5). <a href=\"https://doi.org/10.1109/P2P.2013.6688720\">https://doi.org/10.1109/P2P.2013.6688720</a>","short":"K. Graffi, T. Klerx, in: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.","mla":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>.","bibtex":"@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>}, booktitle={Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }","ama":"Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In: <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>. ; 2013:1-5. doi:<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>","ieee":"K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks,” in <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5.","chicago":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” In <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 1–5, 2013. <a href=\"https://doi.org/10.1109/P2P.2013.6688720\">https://doi.org/10.1109/P2P.2013.6688720</a>."},"page":"1-5","year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-15T10:30:09Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"548","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:30:09Z","creator":"florida","date_created":"2018-03-15T10:30:09Z","file_size":629234,"file_name":"548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf","file_id":"1285","access_level":"closed"}],"status":"public","abstract":[{"lang":"eng","text":"Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer-to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals."}],"type":"conference","publication":"Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)"},{"has_accepted_license":"1","page":"524--532","citation":{"ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition for On-the-Fly SOAs,” in <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 2013, pp. 524--532.","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated Service Composition for On-the-Fly SOAs.” In <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 524--532. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">https://doi.org/10.1007/978-3-642-45005-1_42</a>.","ama":"Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly SOAs. In: <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>. LNCS. ; 2013:524--532. doi:<a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">10.1007/978-3-642-45005-1_42</a>","apa":"Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2013). Automated Service Composition for On-the-Fly SOAs. In <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i> (pp. 524--532). <a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">https://doi.org/10.1007/978-3-642-45005-1_42</a>","mla":"Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 2013, pp. 524--532, doi:<a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">10.1007/978-3-642-45005-1_42</a>.","short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2013, series={LNCS}, title={Automated Service Composition for On-the-Fly SOAs}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">10.1007/978-3-642-45005-1_42</a>}, booktitle={Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2013}, pages={524--532}, collection={LNCS} }"},"year":"2013","author":[{"first_name":"Zille","full_name":"Huma, Zille","last_name":"Huma"},{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"},{"first_name":"Oliver","full_name":"Juwig, Oliver","last_name":"Juwig"}],"date_created":"2017-10-17T12:42:39Z","date_updated":"2022-01-06T07:01:57Z","doi":"10.1007/978-3-642-45005-1_42","title":"Automated Service Composition for On-the-Fly SOAs","publication":"Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13)","type":"conference","status":"public","file":[{"creator":"florida","date_created":"2018-03-15T10:31:20Z","date_updated":"2018-03-15T10:31:20Z","access_level":"closed","file_name":"551-978-3-642-45005-1_42.pdf","file_id":"1287","file_size":384397,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"In the service-oriented computing domain, the number of available software services steadily increased in recent years, favored by the rise of cloud computing with its attached delivery models like Software-as-a-Service (SaaS). To fully leverage the opportunities provided by these services for developing highly flexible and aligned SOA, integration of new services as well as the substitution of existing services must be simplified. As a consequence, approaches for automated and accurate service discovery and composition are needed. In this paper, we propose an automatic service composition approach as an extension to our earlier work on automatic service discovery. To ensure accurate results, it matches service requests and available offers based on their structural as well as behavioral aspects. Afterwards, possible service compositions are determined by composing service protocols through a composition strategy based on labeled transition systems.","lang":"eng"}],"department":[{"_id":"66"}],"series_title":"LNCS","user_id":"477","_id":"551","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T10:31:20Z","language":[{"iso":"eng"}],"ddc":["040"]},{"year":"2013","citation":{"ama":"Kohn K. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn; 2013.","chicago":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","ieee":"K. Kohn, <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","mla":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","short":"K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013.","bibtex":"@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2013} }","apa":"Kohn, K. (2013). <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:01:57Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:40Z","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"author":[{"full_name":"Kohn, Kathlén","last_name":"Kohn","first_name":"Kathlén"}],"title":"Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise","type":"bachelorsthesis","status":"public","_id":"553","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"department":[{"_id":"64"}],"user_id":"477","language":[{"iso":"ger"}]},{"status":"public","type":"mastersthesis","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"555","citation":{"ama":"Setzer A. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn; 2013.","chicago":"Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","ieee":"A. Setzer, <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","bibtex":"@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2013} }","short":"A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs, Universität Paderborn, 2013.","mla":"Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","apa":"Setzer, A. (2013). <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn."},"year":"2013","title":"Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs","date_created":"2017-10-17T12:42:40Z","author":[{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"}],"date_updated":"2022-01-06T07:01:59Z","publisher":"Universität Paderborn"},{"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"2014_Book_AlgorithmsForSensorSystems-1.pdf","access_level":"closed","file_id":"5327","file_size":9186107,"creator":"ups","date_created":"2018-11-02T16:29:07Z","date_updated":"2018-11-02T16:29:07Z"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2013","title":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","date_created":"2017-10-17T12:42:41Z","publisher":"Springer","status":"public","editor":[{"full_name":"Flocchini, Paola","last_name":"Flocchini","first_name":"Paola"},{"first_name":"Jie","last_name":"Gao","full_name":"Gao, Jie"},{"first_name":"Evangelos","last_name":"Kranakis","full_name":"Kranakis, Evangelos"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"type":"conference_editor","file_date_updated":"2018-11-02T16:29:07Z","series_title":"LNCS","user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"558","citation":{"chicago":"Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf der Heide, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol. 8243. LNCS. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>.","ieee":"P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>, vol. 8243. Springer, 2013.","ama":"Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol 8243. Springer; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>","bibtex":"@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>}, publisher={Springer}, year={2013}, collection={LNCS} }","mla":"Flocchini, Paola, et al., editors. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i>. Vol. 8243, Springer, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>.","short":"P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.","apa":"Flocchini, P., Gao, J., Kranakis, E., &#38; Meyer auf der Heide, F. (Eds.). (2013). <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics</i> (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>"},"intvolume":"      8243","has_accepted_license":"1","conference":{"name":"ALGOSENSORS 2013","start_date":"2013-09-05","end_date":"2013-09-06","location":"Sophia Antipolis, France"},"doi":"10.1007/978-3-642-45346-5","volume":8243,"date_updated":"2022-01-06T07:02:02Z"},{"publication":"Proceedings of the Conference on Networked Systems (NetSys)","type":"conference","abstract":[{"lang":"eng","text":"Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1282","file_name":"559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf","access_level":"closed","file_size":734618,"creator":"florida","date_created":"2018-03-15T10:27:21Z","date_updated":"2018-03-15T10:27:21Z"}],"_id":"559","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:27:21Z","has_accepted_license":"1","year":"2013","page":"35-42","citation":{"ama":"Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:35-42. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.9\">10.1109/NetSys.2013.9</a>","ieee":"P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 35–42.","chicago":"Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 35–42, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.9\">https://doi.org/10.1109/NetSys.2013.9</a>.","apa":"Wette, P., &#38; Graffi, K. (2013). Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 35–42). <a href=\"https://doi.org/10.1109/NetSys.2013.9\">https://doi.org/10.1109/NetSys.2013.9</a>","bibtex":"@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.9\">10.1109/NetSys.2013.9</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette, Philip and Graffi, Kalman}, year={2013}, pages={35–42} }","short":"P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.","mla":"Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 35–42, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.9\">10.1109/NetSys.2013.9</a>."},"date_updated":"2022-01-06T07:02:04Z","date_created":"2017-10-17T12:42:41Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"title":"Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables","doi":"10.1109/NetSys.2013.9"}]