[{"date_created":"2017-10-17T12:40:59Z","title":"Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-based Configuration of Text Analysis Pipelines","quality_controlled":"1","year":"2018","ddc":["000"],"keyword":["Software Product Lines: Engineering","Services","and Management","Ambiguities","Incompleteness","Natural Language Processing","Software Requirements"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 51st Hawaii International Conference on System Sciences","abstract":[{"lang":"eng","text":"Natural language software requirements descriptions enable end users to formulate their wishes and expectations for a future software product without much prior knowledge in requirements engineering. However, these descriptions are susceptible to linguistic inaccuracies such as ambiguities and incompleteness that can harm the development process. There is a number of software solutions that can detect deficits in requirements descriptions and partially solve them, but they are often hard to use and not suitable for end users. For this reason, we develop a software system that helps end-users to create unambiguous and complete requirements descriptions by combining existing expert tools and controlling them using automatic compensation strategies. In order to recognize the necessity of individual compensation methods in the descriptions, we have developed linguistic indicators, which we present in this paper. Based on these indicators, the whole text analysis pipeline is ad-hoc configured and thus adapted to the individual circumstances of a requirements description."}],"file":[{"creator":"ups","date_created":"2018-11-02T14:32:35Z","date_updated":"2018-11-02T14:32:35Z","access_level":"closed","file_name":"paper0722.pdf","file_id":"5274","file_size":753693,"content_type":"application/pdf","relation":"main_file","success":1}],"date_updated":"2022-01-06T07:01:01Z","oa":"1","author":[{"last_name":"Bäumer","full_name":"Bäumer, Frederik Simon","id":"38837","first_name":"Frederik Simon"},{"first_name":"Michaela","full_name":"Geierhos, Michaela","id":"42496","last_name":"Geierhos","orcid":"0000-0002-8180-5606"}],"main_file_link":[{"url":"https://scholarspace.manoa.hawaii.edu/bitstream/10125/50609/1/paper0722.pdf","open_access":"1"}],"doi":"10125/50609","conference":{"name":"51st Hawaii International Conference on System Sciences (HICSS 2018)","start_date":"2018-01-03","end_date":"2018-01-06","location":"Big Island, Waikoloa Village"},"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["978-0-9981331-1-9"]},"citation":{"ieee":"F. S. Bäumer and M. Geierhos, “Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-based Configuration of Text Analysis Pipelines,” in <i>Proceedings of the 51st Hawaii International Conference on System Sciences</i>, Big Island, Waikoloa Village, 2018, pp. 5746–5755.","chicago":"Bäumer, Frederik Simon, and Michaela Geierhos. “Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-Based Configuration of Text Analysis Pipelines.” In <i>Proceedings of the 51st Hawaii International Conference on System Sciences</i>, 5746–55, 2018. <a href=\"https://doi.org/10125/50609\">https://doi.org/10125/50609</a>.","ama":"Bäumer FS, Geierhos M. Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-based Configuration of Text Analysis Pipelines. In: <i>Proceedings of the 51st Hawaii International Conference on System Sciences</i>. ; 2018:5746-5755. doi:<a href=\"https://doi.org/10125/50609\">10125/50609</a>","mla":"Bäumer, Frederik Simon, and Michaela Geierhos. “Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-Based Configuration of Text Analysis Pipelines.” <i>Proceedings of the 51st Hawaii International Conference on System Sciences</i>, 2018, pp. 5746–55, doi:<a href=\"https://doi.org/10125/50609\">10125/50609</a>.","short":"F.S. Bäumer, M. Geierhos, in: Proceedings of the 51st Hawaii International Conference on System Sciences, 2018, pp. 5746–5755.","bibtex":"@inproceedings{Bäumer_Geierhos_2018, title={Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-based Configuration of Text Analysis Pipelines}, DOI={<a href=\"https://doi.org/10125/50609\">10125/50609</a>}, booktitle={Proceedings of the 51st Hawaii International Conference on System Sciences}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, year={2018}, pages={5746–5755} }","apa":"Bäumer, F. S., &#38; Geierhos, M. (2018). Flexible Ambiguity Resolution and Incompleteness Detection in Requirements Descriptions via an Indicator-based Configuration of Text Analysis Pipelines. In <i>Proceedings of the 51st Hawaii International Conference on System Sciences</i> (pp. 5746–5755). Big Island, Waikoloa Village. <a href=\"https://doi.org/10125/50609\">https://doi.org/10125/50609</a>"},"page":"5746-5755","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"_id":"44","user_id":"477","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"file_date_updated":"2018-11-02T14:32:35Z","type":"conference","status":"public"},{"doi":"10.1145/3236024.3236029","date_updated":"2022-01-06T07:01:34Z","author":[{"full_name":"Pauck, Felix","id":"22398","last_name":"Pauck","first_name":"Felix"},{"first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"citation":{"ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep their promises?,” in <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>, 2018.","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” In <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3236024.3236029\">https://doi.org/10.1145/3236024.3236029</a>.","ama":"Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their promises? In: <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android taint analysis tools keep their promises? In <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press. <a href=\"https://doi.org/10.1145/3236024.3236029\">https://doi.org/10.1145/3236024.3236029</a>","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>.","short":"F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018.","bibtex":"@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis tools keep their promises?}, DOI={<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>}, booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }"},"has_accepted_license":"1","publication_identifier":{"isbn":["9781450355735"]},"publication_status":"published","file_date_updated":"2018-11-02T13:37:38Z","_id":"4999","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"77"},{"_id":"76"}],"user_id":"477","status":"public","type":"conference","title":"Do Android taint analysis tools keep their promises?","publisher":"ACM Press","date_created":"2018-10-30T08:03:17Z","year":"2018","ddc":["004"],"language":[{"iso":"eng"}],"file":[{"file_id":"5251","access_level":"closed","file_name":"fse18main-id76-p.pdf","file_size":524169,"creator":"ups","date_created":"2018-11-02T13:37:38Z","date_updated":"2018-11-02T13:37:38Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018"},{"publication":"European Conference on Object-Oriented Programming (ECOOP)","type":"conference","status":"public","file":[{"date_updated":"2018-11-02T13:51:05Z","date_created":"2018-11-02T13:51:05Z","creator":"ups","file_size":747259,"access_level":"closed","file_id":"5255","file_name":"ksa+18crysl.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"department":[{"_id":"76"}],"user_id":"477","_id":"5203","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"file_date_updated":"2018-11-02T13:51:05Z","language":[{"iso":"eng"}],"keyword":["ITSECWEBSITE","CROSSING"],"ddc":["000"],"has_accepted_license":"1","page":"10:1-10:27","citation":{"ieee":"S. Krüger, J. Späth, K. Ali, E. Bodden, and M. Mezini, “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs,” in <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2018, pp. 10:1-10:27.","chicago":"Krüger, Stefan, Johannes Späth, Karim Ali, Eric Bodden, and Mira Mezini. “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.” In <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 10:1-10:27, 2018.","ama":"Krüger S, Späth J, Ali K, Bodden E, Mezini M. CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs. In: <i>European Conference on Object-Oriented Programming (ECOOP)</i>. ; 2018:10:1-10:27.","bibtex":"@inproceedings{Krüger_Späth_Ali_Bodden_Mezini_2018, title={CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs}, booktitle={European Conference on Object-Oriented Programming (ECOOP)}, author={Krüger, Stefan and Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}, year={2018}, pages={10:1-10:27} }","mla":"Krüger, Stefan, et al. “CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs.” <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2018, pp. 10:1-10:27.","short":"S. Krüger, J. Späth, K. Ali, E. Bodden, M. Mezini, in: European Conference on Object-Oriented Programming (ECOOP), 2018, pp. 10:1-10:27.","apa":"Krüger, S., Späth, J., Ali, K., Bodden, E., &#38; Mezini, M. (2018). CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs. In <i>European Conference on Object-Oriented Programming (ECOOP)</i> (pp. 10:1-10:27)."},"year":"2018","date_created":"2018-10-31T12:37:29Z","author":[{"full_name":"Krüger, Stefan","last_name":"Krüger","first_name":"Stefan"},{"first_name":"Johannes","last_name":"Späth","full_name":"Späth, Johannes"},{"full_name":"Ali, Karim","last_name":"Ali","first_name":"Karim"},{"orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"first_name":"Mira","full_name":"Mezini, Mira","last_name":"Mezini"}],"date_updated":"2022-01-06T07:01:44Z","main_file_link":[{"url":"http://bodden.de/pubs/ksa+18crysl.pdf"}],"title":"CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs"},{"date_created":"2018-10-31T13:33:05Z","title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks","year":"2018","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","file":[{"relation":"main_file","content_type":"application/pdf","file_size":369818,"file_name":"Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf","access_level":"closed","file_id":"5223","date_updated":"2018-10-31T16:09:48Z","date_created":"2018-10-31T15:51:45Z","creator":"asetzer"}],"abstract":[{"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. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests.","lang":"eng"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"}],"date_updated":"2022-01-06T07:01:47Z","conference":{"location":"Tokyo, Japan","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)"},"doi":"10.1007/978-3-030-03232-6_16","has_accepted_license":"1","publication_status":"published","citation":{"ama":"Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>","ieee":"C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018.","chicago":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">https://doi.org/10.1007/978-3-030-03232-6_16</a>.","bibtex":"@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian and Setzer, Alexander}, year={2018} }","short":"C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.","mla":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">10.1007/978-3-030-03232-6_16</a>.","apa":"Scheideler, C., &#38; Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. Tokyo, Japan. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_16\">https://doi.org/10.1007/978-3-030-03232-6_16</a>"},"department":[{"_id":"79"}],"user_id":"11108","_id":"5216","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file_date_updated":"2018-10-31T16:09:48Z","type":"conference","status":"public"},{"has_accepted_license":"1","citation":{"apa":"Götte, T., Scheideler, C., &#38; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i> (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.","mla":"Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, vol. 11201, Springer, 2018, pp. 50–64.","bibtex":"@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64}, collection={Lecture Notes in Computer Science} }","short":"T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64.","chicago":"Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.","ieee":"T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018, vol. 11201, pp. 50–64.","ama":"Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64."},"intvolume":"     11201","page":"50-64","date_updated":"2022-01-06T07:01:47Z","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"}],"volume":11201,"conference":{"name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","location":"Tokyo, Japan"},"type":"conference","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"5222","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"79"}],"file_date_updated":"2018-10-31T15:59:26Z","year":"2018","publisher":"Springer","date_created":"2018-10-31T15:44:30Z","title":"On Underlay-Aware Self-Stabilizing Overlay Networks","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","abstract":[{"text":"We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. ","lang":"eng"}],"file":[{"date_updated":"2018-10-31T15:59:26Z","creator":"thgoette","date_created":"2018-10-31T15:59:26Z","file_size":367812,"file_id":"5224","file_name":"sss18_camera.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"ddc":["040"],"language":[{"iso":"eng"}]},{"status":"public","type":"journal_article","file_date_updated":"2018-11-13T20:51:34Z","funded_apc":"1","article_type":"review","article_number":"e0207172","user_id":"477","department":[{"_id":"205"},{"_id":"475"}],"project":[{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"5330","citation":{"apa":"Mir Djawadi, B., Fahr, R., Haake, C.-J., &#38; Recker, S. (2018). Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. <i>PLoS ONE</i>, <i>13</i>(11). <a href=\"https://doi.org/10.1371/journal.pone.0207172\">https://doi.org/10.1371/journal.pone.0207172</a>","mla":"Mir Djawadi, Behnud, et al. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” <i>PLoS ONE</i>, vol. 13, no. 11, e0207172, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>.","bibtex":"@article{Mir Djawadi_Fahr_Haake_Recker_2018, title={Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate}, volume={13}, DOI={<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>}, number={11e0207172}, journal={PLoS ONE}, publisher={Public Library of Science}, author={Mir Djawadi, Behnud and Fahr, Rene and Haake, Claus-Jochen and Recker, Sonja}, year={2018} }","short":"B. Mir Djawadi, R. Fahr, C.-J. Haake, S. Recker, PLoS ONE 13 (2018).","ama":"Mir Djawadi B, Fahr R, Haake C-J, Recker S. Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. <i>PLoS ONE</i>. 2018;13(11). doi:<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>","chicago":"Mir Djawadi, Behnud, Rene Fahr, Claus-Jochen Haake, and Sonja Recker. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” <i>PLoS ONE</i> 13, no. 11 (2018). <a href=\"https://doi.org/10.1371/journal.pone.0207172\">https://doi.org/10.1371/journal.pone.0207172</a>.","ieee":"B. Mir Djawadi, R. Fahr, C.-J. Haake, and S. Recker, “Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate,” <i>PLoS ONE</i>, vol. 13, no. 11, 2018."},"intvolume":"        13","publication_status":"published","publication_identifier":{"eissn":["1932-6203"]},"has_accepted_license":"1","doi":"10.1371/journal.pone.0207172","author":[{"first_name":"Behnud","id":"26032","full_name":"Mir Djawadi, Behnud","orcid":"0000-0002-6271-5912","last_name":"Mir Djawadi"},{"first_name":"Rene","id":"111","full_name":"Fahr, Rene","last_name":"Fahr"},{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"},{"last_name":"Recker","full_name":"Recker, Sonja","first_name":"Sonja"}],"volume":13,"date_updated":"2022-01-06T07:01:50Z","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1107189,"access_level":"closed","file_id":"5542","file_name":"Maintaining_vs_Milking.pdf","date_updated":"2018-11-13T20:51:34Z","creator":"cjhaake","date_created":"2018-11-13T20:51:34Z"}],"abstract":[{"lang":"eng","text":"In Internet transactions, customers and service providers often interact once and anonymously.\r\nTo prevent deceptive behavior a reputation system is particularly important to\r\nreduce information asymmetries about the quality of the offered product or service. In this\r\nstudy we examine the effectiveness of a reputation system to reduce information asymmetries\r\nwhen customers may make mistakes in judging the provided service quality. In our model,\r\na service provider makes strategic quality choices and short-lived customers are asked to\r\nevaluate the observed quality by providing ratings to a reputation system. The customer is\r\nnot able to always evaluate the service quality correctly and possibly submits an erroneous\r\nrating according to a predefined probability. Considering reputation profiles of the last three\r\nsales, within the theoretical model we derive that the service provider’s dichotomous quality\r\ndecisions are independent of the reputation profile and depend only on the probabilities of\r\nreceiving positive and negative ratings when providing low or high quality. Thus, a service\r\nprovider optimally either maintains a good reputation or completely refrains from any reputation\r\nbuilding process. However, when mapping our theoretical model to an experimental\r\ndesign we find that a significant share of subjects in the role of the service provider deviates\r\nfrom optimal behavior and chooses actions which are conditional on the current reputation\r\nprofile. With respect to these individual quality choices we see that subjects use milking\r\nstrategies which means that they exploit a good reputation. In particular, if the sales price\r\nis high, low quality is delivered until the price drops below a certain threshold, and then\r\nhigh quality is chosen until the price increases again."}],"publication":"PLoS ONE","language":[{"iso":"eng"}],"ddc":["330"],"year":"2018","issue":"11","title":"Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate","date_created":"2018-11-03T11:51:48Z","publisher":"Public Library of Science"},{"type":"bachelorsthesis","status":"public","_id":"5368","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2018","citation":{"short":"M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","mla":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","bibtex":"@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }","apa":"Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","chicago":"Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ieee":"M. Jochmaring, <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ama":"Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018."},"date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-11-06T06:21:37Z","author":[{"full_name":"Jochmaring, Moritz","last_name":"Jochmaring","first_name":"Moritz"}],"title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"477","_id":"5403","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","type":"bachelorsthesis","title":"Mobile Facility Leasing","date_created":"2018-11-07T09:20:59Z","author":[{"first_name":"Marcel","full_name":"Geromel, Marcel","last_name":"Geromel"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","citation":{"ama":"Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.","chicago":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","ieee":"M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","apa":"Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.","mla":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }"},"year":"2018"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"5404","user_id":"477","department":[{"_id":"63"}],"year":"2018","citation":{"apa":"Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn.","bibtex":"@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","mla":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","chicago":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","ieee":"P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn, 2018.","ama":"Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn; 2018."},"title":"Online Algorithmen für das k-Page Migration Problem","date_updated":"2022-01-06T07:01:51Z","publisher":"Universität Paderborn","author":[{"last_name":"Kolpaczki","full_name":"Kolpaczki, Patrick Irenäus","first_name":"Patrick Irenäus"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2018-11-07T09:23:17Z"},{"year":"2018","citation":{"bibtex":"@book{Filmwala_2018, title={Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform}, publisher={Universität Paderborn}, author={Filmwala, Tasneem}, year={2018} }","short":"T. Filmwala, Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform, Universität Paderborn, 2018.","mla":"Filmwala, Tasneem. <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform</i>. Universität Paderborn, 2018.","apa":"Filmwala, T. (2018). <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform</i>. Universität Paderborn.","ama":"Filmwala T. <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform</i>. Universität Paderborn; 2018.","chicago":"Filmwala, Tasneem. <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate It on FPGA Platform</i>. Universität Paderborn, 2018.","ieee":"T. Filmwala, <i>Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform</i>. Universität Paderborn, 2018."},"title":"Study Effects of Approximation on Conjugate Gradient Algorithm and Accelerate it on FPGA Platform","date_updated":"2022-01-06T07:01:52Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian"}],"date_created":"2018-11-07T15:14:26Z","author":[{"full_name":"Filmwala, Tasneem","last_name":"Filmwala","first_name":"Tasneem"}],"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"_id":"5414","user_id":"477","department":[{"_id":"27"},{"_id":"518"}]},{"citation":{"bibtex":"@book{Gadewar_2018, title={Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL}, publisher={Universität Paderborn}, author={Gadewar, Onkar}, year={2018} }","short":"O. Gadewar, Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL, Universität Paderborn, 2018.","mla":"Gadewar, Onkar. <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn, 2018.","apa":"Gadewar, O. (2018). <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn.","ieee":"O. Gadewar, <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn, 2018.","chicago":"Gadewar, Onkar. <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn, 2018.","ama":"Gadewar O. <i>Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL</i>. Universität Paderborn; 2018."},"year":"2018","title":"Programmable Programs? - Designing FPGA Overlay Architectures with OpenCL","date_created":"2018-11-07T16:16:56Z","supervisor":[{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"author":[{"last_name":"Gadewar","full_name":"Gadewar, Onkar","first_name":"Onkar"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:53Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"477","_id":"5421","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"14","name":"SFB 901 - Subproject C2"}]},{"year":"2018","citation":{"ieee":"V. Diemke, <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn, 2018.","chicago":"Diemke, Viktoria. <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn, 2018.","ama":"Diemke V. <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn; 2018.","bibtex":"@book{Diemke_2018, title={Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen}, publisher={Universität Paderborn}, author={Diemke, Viktoria}, year={2018} }","short":"V. Diemke, Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen, Universität Paderborn, 2018.","mla":"Diemke, Viktoria. <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn, 2018.","apa":"Diemke, V. (2018). <i>Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen</i>. Universität Paderborn."},"title":"Vertrauen und Vertrauenswürdigkeit - Akteure auf Cloud-basierten Plattformen","date_updated":"2022-01-06T07:01:53Z","publisher":"Universität Paderborn","author":[{"first_name":"Viktoria","full_name":"Diemke, Viktoria","last_name":"Diemke"}],"date_created":"2018-11-07T16:36:06Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"5422","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"department":[{"_id":"19"}],"user_id":"477"},{"author":[{"first_name":"Bahar","last_name":"Jazayeri","full_name":"Jazayeri, Bahar","id":"36399"},{"full_name":"Zimmermann, Olaf","last_name":"Zimmermann","first_name":"Olaf"},{"full_name":"Küster, Jochen","last_name":"Küster","first_name":"Jochen"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"},{"first_name":"Daniel","id":"36372","full_name":"Szopinski, Daniel","last_name":"Szopinski"}],"date_updated":"2022-01-06T07:01:57Z","conference":{"start_date":"2018-11-20","end_date":"2018-11-23"},"has_accepted_license":"1","citation":{"short":"B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, D. Szopinski, in: The Latin American Conference on Pattern Languages of Programs (SLPLoP), ACM. To appear, Valparaíso, Chile, 2018.","mla":"Jazayeri, Bahar, et al. “Patterns of Store-Oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options.” <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>, ACM. To appear, 2018.","bibtex":"@inproceedings{Jazayeri_Zimmermann_Küster_Engels_Kundisch_Szopinski_2018, place={Valparaíso, Chile}, series={To appear}, title={Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options}, booktitle={The Latin American Conference on Pattern Languages of Programs (SLPLoP)}, publisher={ACM. To appear}, author={Jazayeri, Bahar and Zimmermann, Olaf and Küster, Jochen and Engels, Gregor and Kundisch, Dennis and Szopinski, Daniel}, year={2018}, collection={To appear} }","apa":"Jazayeri, B., Zimmermann, O., Küster, J., Engels, G., Kundisch, D., &#38; Szopinski, D. (2018). Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options. In <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>. Valparaíso, Chile: ACM. To appear.","ama":"Jazayeri B, Zimmermann O, Küster J, Engels G, Kundisch D, Szopinski D. Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options. In: <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>. To appear. Valparaíso, Chile: ACM. To appear; 2018.","ieee":"B. Jazayeri, O. Zimmermann, J. Küster, G. Engels, D. Kundisch, and D. Szopinski, “Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options,” in <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>, 2018.","chicago":"Jazayeri, Bahar, Olaf Zimmermann, Jochen Küster, Gregor Engels, Dennis Kundisch, and Daniel Szopinski. “Patterns of Store-Oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options.” In <i>The Latin American Conference on Pattern Languages of Programs (SLPLoP)</i>. To Appear. Valparaíso, Chile: ACM. To appear, 2018."},"place":"Valparaíso, Chile","department":[{"_id":"66"},{"_id":"276"}],"user_id":"36399","series_title":"To appear","_id":"5530","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C5","_id":"17"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-11-29T23:41:07Z","type":"conference","status":"public","date_created":"2018-11-12T16:02:14Z","publisher":"ACM. To appear","title":"Patterns of Store-oriented Software Ecosystems: Detection, Classification, and Analysis of Design Options","year":"2018","language":[{"iso":"eng"}],"ddc":["000"],"publication":"The Latin American Conference on Pattern Languages of Programs (SLPLoP)","file":[{"file_size":514038,"file_id":"5983","access_level":"closed","file_name":"Jazayerietal-SLPLoP18.pdf","date_updated":"2018-11-29T23:41:07Z","date_created":"2018-11-29T23:41:07Z","creator":"bahareh","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Software companies nowadays create ecosystems of users and third-party providers around their platforms. They often provide online stores so that the third-party developments can be exposed to users directly. The resulting ecosystems differ significantly from each other in their architectural designs because their providers differ in terms of business goals and contexts. Until now, this architectural diversity and rationale behind it are not well-understood. Therefore, it is not clear which software features contribute to ecosystem’s success with respect to certain business goals and context. This hinders systematic creation of ecosystems in the future. Thus, decision-making becomes too risky; for future ecosystem providers, which may lead to creation of inefficient ecosystems that lack critical features, and for third-party providers to rely on ad-hoc choices while deciding on suitability of an ecosystem for their future career. In this paper, we introduce three design patterns for store- oriented software ecosystems by classifying the design decisions, business goals, and context of 111 store-oriented software ecosystems. Each design pattern provides an architectural solution to achieve a different business goal while supporting a different context. We discuss how the design patterns are applied together in order to achieve more business goals. Our work supports ecosystem and third-party providers by sharing practice-proven architectural solutions, helping them to take informed architectural decisions and reduce technical risks."}]},{"year":"2018","title":"A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes","publisher":"IEEE","date_created":"2018-11-14T09:26:53Z","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"aloesch","date_created":"2018-11-14T09:40:42Z","date_updated":"2018-11-14T09:40:42Z","file_name":"loesch_asap2018.pdf","file_id":"5552","access_level":"closed","file_size":2464949}],"publication":"2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)","ddc":["040"],"language":[{"iso":"eng"}],"citation":{"ieee":"A. Lösch and M. Platzner, “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes,” in <i>2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>, Milan, Italy, 2018.","chicago":"Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes.” In <i>2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/asap.2018.8445098\">https://doi.org/10.1109/asap.2018.8445098</a>.","ama":"Lösch A, Platzner M. A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes. In: <i>2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/asap.2018.8445098\">10.1109/asap.2018.8445098</a>","mla":"Lösch, Achim, and Marco Platzner. “A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes.” <i>2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/asap.2018.8445098\">10.1109/asap.2018.8445098</a>.","short":"A. Lösch, M. Platzner, in: 2018 IEEE 29th International Conference on Application-Specific Systems, Architectures and Processors (ASAP), IEEE, 2018.","bibtex":"@inproceedings{Lösch_Platzner_2018, title={A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes}, DOI={<a href=\"https://doi.org/10.1109/asap.2018.8445098\">10.1109/asap.2018.8445098</a>}, booktitle={2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)}, publisher={IEEE}, author={Lösch, Achim and Platzner, Marco}, year={2018} }","apa":"Lösch, A., &#38; Platzner, M. (2018). A Highly Accurate Energy Model for Task Execution on Heterogeneous Compute Nodes. In <i>2018 IEEE 29th International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>. Milan, Italy: IEEE. <a href=\"https://doi.org/10.1109/asap.2018.8445098\">https://doi.org/10.1109/asap.2018.8445098</a>"},"publication_status":"published","publication_identifier":{"isbn":["9781538674796"]},"has_accepted_license":"1","doi":"10.1109/asap.2018.8445098","conference":{"start_date":"2018-07-10","name":"The 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors","location":"Milan, Italy","end_date":"2018-07-12"},"date_updated":"2022-01-06T07:01:59Z","author":[{"first_name":"Achim","full_name":"Lösch, Achim","id":"43646","last_name":"Lösch"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"status":"public","type":"conference","file_date_updated":"2018-11-14T09:40:42Z","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"}],"_id":"5547","user_id":"43646","department":[{"_id":"78"}]},{"has_accepted_license":"1","place":"Verona","year":"2018","citation":{"ama":"Peuster M, Schneider SB, Christ F, Karl H. A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In: <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE; 2018.","chicago":"Peuster, Manuel, Stefan Balthasar Schneider, Frederic Christ, and Holger Karl. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE, 2018.","ieee":"M. Peuster, S. B. Schneider, F. Christ, and H. Karl, “A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains,” in <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>, Verona, 2018.","apa":"Peuster, M., Schneider, S. B., Christ, F., &#38; Karl, H. (2018). A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains. In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>. Verona: IEEE.","bibtex":"@inproceedings{Peuster_Schneider_Christ_Karl_2018, place={Verona}, title={A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp}, publisher={IEEE}, author={Peuster, Manuel and Schneider, Stefan Balthasar and Christ, Frederic and Karl, Holger}, year={2018} }","mla":"Peuster, Manuel, et al. “A Prototyping Platform to Validate and Verify Network Service Header-Based Service Chains.” <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp</i>, IEEE, 2018.","short":"M. Peuster, S.B. Schneider, F. Christ, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp, IEEE, Verona, 2018."},"oa":"1","date_updated":"2022-01-06T07:03:07Z","publisher":"IEEE","author":[{"id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster","first_name":"Manuel"},{"first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"full_name":"Christ, Frederic","last_name":"Christ","first_name":"Frederic"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2019-01-04T07:47:19Z","title":"A Prototyping Platform to Validate and Verify Network Service Header-based Service Chains","conference":{"location":"Verona","end_date":"2018-11-29","start_date":"2018-11-27","name":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp"},"type":"conference","publication":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN) 5GNetApp","file":[{"access_level":"open_access","file_id":"6484","file_name":"main_for_ris.pdf","file_size":541469,"creator":"peuster","date_created":"2019-01-04T07:46:21Z","date_updated":"2019-01-04T07:46:21Z","relation":"main_file","content_type":"application/pdf"}],"status":"public","project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"6483","user_id":"35343","department":[{"_id":"75"}],"ddc":["000"],"file_date_updated":"2019-01-04T07:46:21Z","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"64"}],"project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"}],"_id":"6597","status":"public","type":"dissertation","doi":"10.17619/UNIPB/1-570","title":"Models and Constructions for Secure Reputation Systems","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"author":[{"full_name":"Juhnke, Jakob","id":"48090","last_name":"Juhnke","first_name":"Jakob"}],"date_created":"2019-01-10T07:51:07Z","date_updated":"2022-01-06T07:03:13Z","publisher":"Universität Paderborn","citation":{"apa":"Juhnke, J. (2018). <i>Models and Constructions for Secure Reputation Systems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-570\">https://doi.org/10.17619/UNIPB/1-570</a>","mla":"Juhnke, Jakob. <i>Models and Constructions for Secure Reputation Systems</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-570\">10.17619/UNIPB/1-570</a>.","bibtex":"@book{Juhnke_2018, title={Models and Constructions for Secure Reputation Systems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-570\">10.17619/UNIPB/1-570</a>}, publisher={Universität Paderborn}, author={Juhnke, Jakob}, year={2018} }","short":"J. Juhnke, Models and Constructions for Secure Reputation Systems, Universität Paderborn, 2018.","chicago":"Juhnke, Jakob. <i>Models and Constructions for Secure Reputation Systems</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-570\">https://doi.org/10.17619/UNIPB/1-570</a>.","ieee":"J. Juhnke, <i>Models and Constructions for Secure Reputation Systems</i>. Universität Paderborn, 2018.","ama":"Juhnke J. <i>Models and Constructions for Secure Reputation Systems</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-570\">10.17619/UNIPB/1-570</a>"},"year":"2018"},{"ddc":["000"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1607.05143"]},"abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":605207,"access_level":"closed","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","file_id":"5226","date_updated":"2018-10-31T16:57:32Z","date_created":"2018-10-31T16:57:32Z","creator":"feldi"}],"publication":"Journal of Combinatorial Optimization","title":"Congestion games with mixed objectives","publisher":"Springer Nature","date_created":"2017-10-26T14:11:04Z","year":"2018","issue":"4","file_date_updated":"2018-10-31T16:57:32Z","_id":"669","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","status":"public","type":"journal_article","doi":"10.1007/s10878-017-0189-y","date_updated":"2022-01-06T07:03:15Z","volume":36,"author":[{"full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"page":"1145-1167","intvolume":"        36","citation":{"ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>.","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }"},"publication_identifier":{"issn":["1382-6905","1573-2886"]},"has_accepted_license":"1","publication_status":"published"},{"publication":"IEEE Global Communications Conference (GLOBECOM 2018)","type":"conference","status":"public","file":[{"file_size":422196,"file_id":"6971","access_level":"open_access","file_name":"preprint_ris.pdf","date_updated":"2019-01-24T13:53:16Z","date_created":"2019-01-24T13:53:16Z","creator":"stschn","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Dynamic allocation of resources is a key feature in network function virtualization (NFV), enabling flexible adjustment of slices and contained network services to ever-changing service demands. \r\nConsidering resource allocation across the entire network, many authors have proposed approaches to optimize the placement and chaining of virtual network function (VNF) instances and the allocation of resources to these VNF instances. In doing so, various optimization objectives are conceivable, e.g., minimizing certain required resources or the end-to-end delay of the placed services.\r\n\r\nIn this paper, we investigate the relationship between four typical optimization objectives when coordinating the placement and resource allocation of chained VNF instances. We observe an interesting trade-off between minimizing the overhead of starting/stopping VNF instances and all other objectives when adapting to changed service demands.","lang":"eng"}],"department":[{"_id":"75"}],"user_id":"35343","_id":"6970","project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"language":[{"iso":"eng"}],"file_date_updated":"2019-01-24T13:53:16Z","ddc":["040"],"has_accepted_license":"1","citation":{"chicago":"Schneider, Stefan Balthasar, Sevil Dräxler, and Holger Karl. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE, 2018.","ieee":"S. B. Schneider, S. Dräxler, and H. Karl, “Trade-offs in Dynamic Resource Allocation in Network Function Virtualization,” in <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, Abu Dhabi, UAE, 2018.","ama":"Schneider SB, Dräxler S, Karl H. Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In: <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. IEEE; 2018.","bibtex":"@inproceedings{Schneider_Dräxler_Karl_2018, title={Trade-offs in Dynamic Resource Allocation in Network Function Virtualization}, booktitle={IEEE Global Communications Conference (GLOBECOM 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Dräxler, Sevil and Karl, Holger}, year={2018} }","short":"S.B. Schneider, S. Dräxler, H. Karl, in: IEEE Global Communications Conference (GLOBECOM 2018), IEEE, 2018.","mla":"Schneider, Stefan Balthasar, et al. “Trade-Offs in Dynamic Resource Allocation in Network Function Virtualization.” <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>, IEEE, 2018.","apa":"Schneider, S. B., Dräxler, S., &#38; Karl, H. (2018). Trade-offs in Dynamic Resource Allocation in Network Function Virtualization. In <i>IEEE Global Communications Conference (GLOBECOM 2018)</i>. Abu Dhabi, UAE: IEEE."},"year":"2018","author":[{"full_name":"Schneider, Stefan Balthasar","id":"35343","last_name":"Schneider","orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar"},{"last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764","first_name":"Sevil"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2019-01-24T13:53:22Z","date_updated":"2022-01-06T07:03:24Z","publisher":"IEEE","oa":"1","conference":{"name":"IEEE Global Communications Conference (GLOBECOM 2018)","location":"Abu Dhabi, UAE"},"title":"Trade-offs in Dynamic Resource Allocation in Network Function Virtualization"},{"year":"2018","title":"A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms","date_created":"2019-01-24T14:10:17Z","publisher":"IEEE","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2019-01-24T14:25:23Z","date_created":"2019-01-24T14:10:08Z","creator":"stschn","file_size":468396,"access_level":"open_access","file_id":"6973","file_name":"preprint_ris.pdf"}],"abstract":[{"lang":"eng","text":"In recent years, a variety of different approaches\r\nhave been proposed to tackle the problem of scaling and placing\r\nnetwork services, consisting of interconnected virtual network\r\nfunctions (VNFs). This paper presents a placement abstraction\r\nlayer (PAL) that provides a clear and simple northbound interface\r\nfor using such algorithms while hiding their internal\r\nfunctionality and implementation. Through its southbound interface,\r\nPAL can connect to different back ends that evaluate\r\nthe calculated placements, e.g., using simulations, emulations, or\r\ntestbed approaches. As an example for such evaluation back ends,\r\nwe introduce a novel placement emulation framework (PEF)\r\nthat allows executing calculated placements using real, containerbased\r\nVNFs on real-world network topologies. In a case study,\r\nwe show how PAL and PEF facilitate reusing and evaluating\r\nplacement algorithms as well as validating their underlying\r\nmodels and performance claims."}],"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","language":[{"iso":"eng"}],"ddc":["040"],"citation":{"ieee":"S. B. Schneider, M. Peuster, and H. Karl, “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, Verona, Italy, 2018.","chicago":"Schneider, Stefan Balthasar, Manuel Peuster, and Holger Karl. “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">https://doi.org/10.1109/NFV-SDN.2018.8725795</a>.","ama":"Schneider SB, Peuster M, Karl H. A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>","short":"S.B. Schneider, M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.","bibtex":"@inproceedings{Schneider_Peuster_Karl_2018, title={A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}, year={2018} }","mla":"Schneider, Stefan Balthasar, et al. “A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">10.1109/NFV-SDN.2018.8725795</a>.","apa":"Schneider, S. B., Peuster, M., &#38; Karl, H. (2018). A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725795\">https://doi.org/10.1109/NFV-SDN.2018.8725795</a>"},"has_accepted_license":"1","doi":"10.1109/NFV-SDN.2018.8725795","conference":{"name":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","location":"Verona, Italy"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8725795"}],"author":[{"last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"},{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_updated":"2022-01-06T07:03:24Z","oa":"1","status":"public","type":"conference","file_date_updated":"2019-01-24T14:25:23Z","department":[{"_id":"75"}],"user_id":"35343","_id":"6972","project":[{"_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}]},{"type":"conference","status":"public","user_id":"35343","department":[{"_id":"75"}],"project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"6974","file_date_updated":"2019-01-24T14:26:23Z","has_accepted_license":"1","citation":{"ama":"Schneider SB, Peuster M, Tavernier W, Karl H. A Fully Integrated Multi-Platform NFV SDK. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>","ieee":"S. B. Schneider, M. Peuster, W. Tavernier, and H. Karl, “A Fully Integrated Multi-Platform NFV SDK,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, Verona, Italy, 2018.","chicago":"Schneider, Stefan Balthasar, Manuel Peuster, Wouter Tavernier, and Holger Karl. “A Fully Integrated Multi-Platform NFV SDK.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">https://doi.org/10.1109/NFV-SDN.2018.8725794</a>.","short":"S.B. Schneider, M. Peuster, W. Tavernier, H. Karl, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018), IEEE, 2018.","mla":"Schneider, Stefan Balthasar, et al. “A Fully Integrated Multi-Platform NFV SDK.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>.","bibtex":"@inproceedings{Schneider_Peuster_Tavernier_Karl_2018, title={A Fully Integrated Multi-Platform NFV SDK}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">10.1109/NFV-SDN.2018.8725794</a>}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}, year={2018} }","apa":"Schneider, S. B., Peuster, M., Tavernier, W., &#38; Karl, H. (2018). A Fully Integrated Multi-Platform NFV SDK. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)</i>. Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/NFV-SDN.2018.8725794\">https://doi.org/10.1109/NFV-SDN.2018.8725794</a>"},"author":[{"last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"},{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"full_name":"Tavernier, Wouter","last_name":"Tavernier","first_name":"Wouter"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_updated":"2022-01-06T07:03:25Z","oa":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8725794"}],"doi":"10.1109/NFV-SDN.2018.8725794","conference":{"location":"Verona, Italy","name":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)"},"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"Pre-print.pdf","access_level":"open_access","file_id":"6975","file_size":475022,"date_created":"2019-01-24T14:17:29Z","creator":"stschn","date_updated":"2019-01-24T14:26:23Z"}],"abstract":[{"lang":"eng","text":"A key challenge of network function virtualization\r\n(NFV) is the complexity of developing and deploying new\r\nnetwork services. Currently, development requires many manual\r\nsteps that are time-consuming and error-prone (e.g., for creating\r\nservice descriptors). Furthermore, existing management and\r\norchestration (MANO) platforms only offer limited support of\r\nstandardized descriptor models or package formats, limiting the\r\nre-usability of network services.\r\n\r\nTo this end, we introduce a fully integrated, open-source\r\nNFV service development kit (SDK) with multi-MANO platform\r\nsupport. Our SDK simplifies many NFV service development\r\nsteps by offering initial generation of descriptors, advanced\r\nproject management, as well as fully automated packaging and\r\nsubmission for on-boarding. To achieve multi-platform support,\r\nwe present a package format that extends ETSI’s VNF package\r\nformat. In this demonstration, we present the end-to-end workflow\r\nto develop an NFV service that is then packaged for multiple\r\nplatforms, i.e., 5GTANGO and OSM."}],"language":[{"iso":"eng"}],"ddc":["040"],"year":"2018","date_created":"2019-01-24T14:17:58Z","publisher":"IEEE","title":"A Fully Integrated Multi-Platform NFV SDK"}]