[{"date_created":"2021-09-10T10:22:23Z","department":[{"_id":"355"}],"type":"journal_article","citation":{"ama":"Basavaraju M, Chandran LS, Rajendraprasad D, Ramaswamy A. Rainbow connection number of graph power and graph products. <i>Graphs and Combinatorics</i>. 2014;30(6):1363-1382.","bibtex":"@article{Basavaraju_Chandran_Rajendraprasad_Ramaswamy_2014, title={Rainbow connection number of graph power and graph products}, volume={30}, number={6}, journal={Graphs and Combinatorics}, publisher={Springer}, author={Basavaraju, Manu and Chandran, L Sunil and Rajendraprasad, Deepak and Ramaswamy, Arunselvan}, year={2014}, pages={1363–1382} }","mla":"Basavaraju, Manu, et al. “Rainbow Connection Number of Graph Power and Graph Products.” <i>Graphs and Combinatorics</i>, vol. 30, no. 6, Springer, 2014, pp. 1363–82.","short":"M. Basavaraju, L.S. Chandran, D. Rajendraprasad, A. Ramaswamy, Graphs and Combinatorics 30 (2014) 1363–1382.","chicago":"Basavaraju, Manu, L Sunil Chandran, Deepak Rajendraprasad, and Arunselvan Ramaswamy. “Rainbow Connection Number of Graph Power and Graph Products.” <i>Graphs and Combinatorics</i> 30, no. 6 (2014): 1363–82.","apa":"Basavaraju, M., Chandran, L. S., Rajendraprasad, D., &#38; Ramaswamy, A. (2014). Rainbow connection number of graph power and graph products. <i>Graphs and Combinatorics</i>, <i>30</i>(6), 1363–1382.","ieee":"M. Basavaraju, L. S. Chandran, D. Rajendraprasad, and A. Ramaswamy, “Rainbow connection number of graph power and graph products,” <i>Graphs and Combinatorics</i>, vol. 30, no. 6, pp. 1363–1382, 2014."},"publication":"Graphs and Combinatorics","issue":"6","extern":"1","publisher":"Springer","_id":"24155","language":[{"iso":"eng"}],"page":"1363-1382","volume":30,"user_id":"66937","author":[{"first_name":"Manu","last_name":"Basavaraju","full_name":"Basavaraju, Manu"},{"full_name":"Chandran, L Sunil","last_name":"Chandran","first_name":"L Sunil"},{"last_name":"Rajendraprasad","first_name":"Deepak","full_name":"Rajendraprasad, Deepak"},{"id":"66937","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan","last_name":"Ramaswamy","full_name":"Ramaswamy, Arunselvan"}],"title":"Rainbow connection number of graph power and graph products","status":"public","year":"2014","intvolume":"        30","date_updated":"2022-01-06T06:56:08Z"},{"intvolume":"        30","date_updated":"2022-01-06T06:56:08Z","author":[{"full_name":"Basavaraju, Manu","last_name":"Basavaraju","first_name":"Manu"},{"first_name":"L Sunil","last_name":"Chandran","full_name":"Chandran, L Sunil"},{"first_name":"Deepak","last_name":"Rajendraprasad","full_name":"Rajendraprasad, Deepak"},{"full_name":"Ramaswamy, Arunselvan","first_name":"Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","id":"66937"}],"status":"public","year":"2014","title":"Rainbow connection number and radius","volume":30,"user_id":"66937","language":[{"iso":"eng"}],"_id":"24156","publisher":"Springer","page":"275-285","extern":"1","citation":{"ama":"Basavaraju M, Chandran LS, Rajendraprasad D, Ramaswamy A. Rainbow connection number and radius. <i>Graphs and Combinatorics</i>. 2014;30(2):275-285.","bibtex":"@article{Basavaraju_Chandran_Rajendraprasad_Ramaswamy_2014, title={Rainbow connection number and radius}, volume={30}, number={2}, journal={Graphs and Combinatorics}, publisher={Springer}, author={Basavaraju, Manu and Chandran, L Sunil and Rajendraprasad, Deepak and Ramaswamy, Arunselvan}, year={2014}, pages={275–285} }","mla":"Basavaraju, Manu, et al. “Rainbow Connection Number and Radius.” <i>Graphs and Combinatorics</i>, vol. 30, no. 2, Springer, 2014, pp. 275–85.","short":"M. Basavaraju, L.S. Chandran, D. Rajendraprasad, A. Ramaswamy, Graphs and Combinatorics 30 (2014) 275–285.","chicago":"Basavaraju, Manu, L Sunil Chandran, Deepak Rajendraprasad, and Arunselvan Ramaswamy. “Rainbow Connection Number and Radius.” <i>Graphs and Combinatorics</i> 30, no. 2 (2014): 275–85.","apa":"Basavaraju, M., Chandran, L. S., Rajendraprasad, D., &#38; Ramaswamy, A. (2014). Rainbow connection number and radius. <i>Graphs and Combinatorics</i>, <i>30</i>(2), 275–285.","ieee":"M. Basavaraju, L. S. Chandran, D. Rajendraprasad, and A. Ramaswamy, “Rainbow connection number and radius,” <i>Graphs and Combinatorics</i>, vol. 30, no. 2, pp. 275–285, 2014."},"publication":"Graphs and Combinatorics","issue":"2","department":[{"_id":"355"}],"type":"journal_article","date_created":"2021-09-10T10:23:07Z"},{"title":"Twenty years of learning with the World Wide Web","year":"2014","status":"public","author":[{"full_name":"Keil, Reinhard","first_name":"Reinhard","last_name":"Keil"},{"id":"497","last_name":"Selke","first_name":"Harald","full_name":"Selke, Harald"},{"last_name":"Winkelnkemper","first_name":"Felix","full_name":"Winkelnkemper, Felix","id":"3117"}],"publication_status":"published","date_updated":"2022-01-06T06:57:22Z","page":"51–60","series_title":"Lecture Notes in Informatics (LNI)","_id":"26537","language":[{"iso":"eng"}],"user_id":"71124","editor":[{"last_name":"Trahasch","first_name":"Stephan","full_name":"Trahasch, Stephan"},{"first_name":"Rolf","last_name":" Pl {\\ \"o} tzner","full_name":" Pl {\\ \"o} tzner, Rolf"},{"full_name":"Schneider, Gerhard","first_name":"Gerhard","last_name":"Schneider"},{"full_name":"Gayer, Claudia","first_name":"Claudia","last_name":"Gayer"},{"full_name":"Sassiat, Daniel","first_name":"Daniel","last_name":"Sassiat"},{"last_name":"W {\\ \"o} hrle","first_name":"Nicole","full_name":"W {\\ \"o} hrle, Nicole"}],"citation":{"apa":"Keil, R., Selke, H., &#38; Winkelnkemper, F. (2014). <i>Twenty years of learning with the World Wide Web</i> (S. Trahasch, R.  Pl {\\ \"o} tzner, G. Schneider, C. Gayer, D. Sassiat, &#38; N. W {\\ \"o} hrle, Eds.; pp. 51–60).","ieee":"R. Keil, H. Selke, and F. Winkelnkemper, “Twenty years of learning with the World Wide Web.” pp. 51–60, 2014.","chicago":"Keil, Reinhard, Harald Selke, and Felix Winkelnkemper. “Twenty Years of Learning with the World Wide Web.” Edited by Stephan Trahasch, Rolf  Pl {\\ \"o} tzner, Gerhard Schneider, Claudia Gayer, Daniel Sassiat, and Nicole W {\\ \"o} hrle. Lecture Notes in Informatics (LNI), 2014.","short":"R. Keil, H. Selke, F. Winkelnkemper, (2014) 51–60.","mla":"Keil, Reinhard, et al. <i>Twenty Years of Learning with the World Wide Web</i>. Edited by Stephan Trahasch et al., 2014, pp. 51–60.","ama":"Keil R, Selke H, Winkelnkemper F. Twenty years of learning with the World Wide Web. Trahasch S,  Pl {\\ \"o} tzner R, Schneider G, Gayer C, Sassiat D, W {\\ \"o} hrle N, eds. Published online 2014:51–60.","bibtex":"@article{Keil_Selke_Winkelnkemper_2014, series={Lecture Notes in Informatics (LNI)}, title={Twenty years of learning with the World Wide Web}, author={Keil, Reinhard and Selke, Harald and Winkelnkemper, Felix}, editor={Trahasch, Stephan and  Pl {\\ \"o} tzner, Rolf and Schneider, Gerhard and Gayer, Claudia and Sassiat, Daniel and W {\\ \"o} hrle, Nicole}, year={2014}, pages={51–60}, collection={Lecture Notes in Informatics (LNI)} }"},"abstract":[{"lang":"eng","text":"n the summer of 1994, courses at universities were supported for the first time through the use of the World Wide Web. With the introduction of this new technology, high expectations quickly arose that the established forms of teaching and learning in schools and universities would be replaced and that the institutions themselves might even prove to be superfluous. Twenty years later, it turns out that there is a great gap between hope and reality. Some of the ideas at the time that, for example, having access to the world's knowledge at any time would make textbooks superfluous, turned out to be naive in retrospect. Characteristic of the ideas at that time was the assumption that didactic and organizational problems of teaching and learning could be solved purely technically.\r\n"}],"date_created":"2021-10-19T14:36:42Z","type":"conference","department":[{"_id":"71"}]},{"type":"conference","department":[{"_id":"71"}],"date_created":"2021-10-19T14:40:03Z","citation":{"short":"F. Winkelnkemper,  Reinhard Keil, in: A. Butz, J. Schlichter (Eds.), Oldenbourg Verlag, 2014, pp. 255–264.","chicago":"Winkelnkemper, Felix, and  Reinhard Keil. “Zwischen Design Und Flexibilit{\\\"a}t - Zur Ergonomie Des Flat Design.” edited by Andreas Butz and Johann Schlichter, 2014:255–64. Oldenbourg Verlag, 2014.","ieee":"F. Winkelnkemper and  Reinhard Keil, “Zwischen Design und Flexibilit{\\\"a}t - Zur Ergonomie des Flat Design,” 2014, vol. 2014, pp. 255–264.","apa":"Winkelnkemper, F., &#38; Keil,  Reinhard. (2014). <i>Zwischen Design und Flexibilit{\\\"a}t - Zur Ergonomie des Flat Design</i> (A. Butz &#38; J. Schlichter, Eds.; Vol. 2014, pp. 255–264). Oldenbourg Verlag.","bibtex":"@inproceedings{Winkelnkemper_Keil_2014, title={Zwischen Design und Flexibilit{\\\"a}t - Zur Ergonomie des Flat Design}, volume={2014}, publisher={Oldenbourg Verlag}, author={Winkelnkemper, Felix and Keil,  Reinhard}, editor={Butz, Andreas and Schlichter, Johann}, year={2014}, pages={255–264} }","ama":"Winkelnkemper F, Keil  Reinhard. Zwischen Design und Flexibilit{\\\"a}t - Zur Ergonomie des Flat Design. In: Butz A, Schlichter J, eds. Vol 2014. Oldenbourg Verlag; 2014:255-264.","mla":"Winkelnkemper, Felix, and  Reinhard Keil. <i>Zwischen Design Und Flexibilit{\\\"a}t - Zur Ergonomie Des Flat Design</i>. Edited by Andreas Butz and Johann Schlichter, vol. 2014, Oldenbourg Verlag, 2014, pp. 255–64."},"user_id":"71124","editor":[{"first_name":"Andreas","last_name":"Butz","full_name":"Butz, Andreas"},{"last_name":"Schlichter","first_name":"Johann","full_name":"Schlichter, Johann"}],"volume":2014,"page":"255-264","language":[{"iso":"eng"}],"_id":"26538","publisher":"Oldenbourg Verlag","date_updated":"2022-01-06T06:57:22Z","publication_status":"published","intvolume":"      2014","title":"Zwischen Design und Flexibilit{\\\"a}t - Zur Ergonomie des Flat Design","year":"2014","status":"public","author":[{"id":"3117","full_name":"Winkelnkemper, Felix","first_name":"Felix","last_name":"Winkelnkemper"},{"full_name":"Keil,  Reinhard","first_name":" Reinhard","last_name":"Keil"}]},{"user_id":"71124","editor":[{"full_name":"Forbrig, Peter","last_name":"Forbrig","first_name":"Peter"},{"full_name":"Magenheim,  Johannes","first_name":" Johannes","last_name":"Magenheim"}],"page":"74-84","publisher":"Universit{\\\"a}t Rostock","_id":"26540","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:57:22Z","status":"public","year":"2014","title":"Forschendes Lernen durch semantisches Positionieren","author":[{"last_name":"Jakoblew ","first_name":"Marcel ","full_name":"Jakoblew , Marcel "},{"full_name":"Keil, Reinhard","first_name":"Reinhard","last_name":"Keil"},{"id":"3117","full_name":"Winkelnkemper, Felix","last_name":"Winkelnkemper","first_name":"Felix"}],"type":"conference","department":[{"_id":"71"}],"date_created":"2021-10-19T15:04:47Z","publication":"Proceedings der HDI 2014","citation":{"bibtex":"@inproceedings{Jakoblew _Keil_Winkelnkemper_2014, title={Forschendes Lernen durch semantisches Positionieren}, booktitle={Proceedings der HDI 2014}, publisher={Universit{\\\"a}t Rostock}, author={Jakoblew , Marcel  and Keil, Reinhard and Winkelnkemper, Felix}, editor={Forbrig, Peter and Magenheim,  Johannes}, year={2014}, pages={74–84} }","ama":"Jakoblew  M, Keil R, Winkelnkemper F. Forschendes Lernen durch semantisches Positionieren. In: Forbrig P, Magenheim  Johannes, eds. <i>Proceedings Der HDI 2014</i>. Universit{\\\"a}t Rostock; 2014:74-84.","mla":"Jakoblew , Marcel, et al. “Forschendes Lernen Durch Semantisches Positionieren.” <i>Proceedings Der HDI 2014</i>, edited by Peter Forbrig and  Johannes Magenheim, Universit{\\\"a}t Rostock, 2014, pp. 74–84.","short":"M. Jakoblew , R. Keil, F. Winkelnkemper, in: P. Forbrig,  Johannes Magenheim (Eds.), Proceedings Der HDI 2014, Universit{\\\"a}t Rostock, 2014, pp. 74–84.","chicago":"Jakoblew , Marcel , Reinhard Keil, and Felix Winkelnkemper. “Forschendes Lernen Durch Semantisches Positionieren.” In <i>Proceedings Der HDI 2014</i>, edited by Peter Forbrig and  Johannes Magenheim, 74–84. Universit{\\\"a}t Rostock, 2014.","ieee":"M. Jakoblew , R. Keil, and F. Winkelnkemper, “Forschendes Lernen durch semantisches Positionieren,” in <i>Proceedings der HDI 2014</i>, 2014, pp. 74–84.","apa":"Jakoblew , M., Keil, R., &#38; Winkelnkemper, F. (2014). Forschendes Lernen durch semantisches Positionieren. In P. Forbrig &#38;  Johannes Magenheim (Eds.), <i>Proceedings der HDI 2014</i> (pp. 74–84). Universit{\\\"a}t Rostock."}},{"citation":{"mla":"Keil, Reinhard, and Christian Schild. <i>Hypothesengeleitete Gestaltung von Benutzungsoberfl{\\\"a}chen</i>. De Gruyter Oldenbourg, 2014, pp. 265–74.","apa":"Keil, R., &#38; Schild, C. (2014). <i>Hypothesengeleitete Gestaltung von Benutzungsoberfl{\\\"a}chen</i>. 265–274.","ieee":"R. Keil and C. Schild, “Hypothesengeleitete Gestaltung von Benutzungsoberfl{\\\"a}chen,” 2014, pp. 265–274.","chicago":"Keil, Reinhard, and Christian Schild. “Hypothesengeleitete Gestaltung von Benutzungsoberfl{\\\"a}chen,” 265–74. Berlin: De Gruyter Oldenbourg, 2014.","ama":"Keil R, Schild C. Hypothesengeleitete Gestaltung von Benutzungsoberfl{\\\"a}chen. In: De Gruyter Oldenbourg; 2014:265-274.","short":"R. Keil, C. Schild, in: De Gruyter Oldenbourg, Berlin, 2014, pp. 265–274.","bibtex":"@inproceedings{Keil_Schild_2014, place={Berlin}, title={Hypothesengeleitete Gestaltung von Benutzungsoberfl{\\\"a}chen}, publisher={De Gruyter Oldenbourg}, author={Keil, Reinhard and Schild, Christian}, year={2014}, pages={265–274} }"},"date_created":"2021-10-19T15:08:02Z","place":"Berlin","department":[{"_id":"71"}],"type":"conference","author":[{"full_name":"Keil, Reinhard","first_name":"Reinhard","last_name":"Keil"},{"first_name":"Christian","last_name":"Schild","full_name":"Schild, Christian"}],"status":"public","title":"Hypothesengeleitete Gestaltung von Benutzungsoberfl{\\\"a}chen","year":"2014","publication_status":"published","date_updated":"2022-01-06T06:57:22Z","_id":"26541","language":[{"iso":"eng"}],"publisher":"De Gruyter Oldenbourg","page":"265-274","user_id":"71124"},{"user_id":"71124","editor":[{"full_name":"Keller, Stefan Andreas","last_name":"Keller","first_name":"Stefan Andreas"},{"first_name":"René","last_name":"Schneider","full_name":"Schneider, René"},{"last_name":"Volk","first_name":"Benno","full_name":"Volk, Benno"}],"page":"162–179","publisher":"De Gruyter Saur","_id":"26542","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:57:22Z","publication_status":"published","title":"Knowledge integration processes and distributed knowledge organization","status":"public","year":"2014","author":[{"full_name":"Keil,  Reinhard","first_name":" Reinhard","last_name":"Keil"}],"type":"conference","department":[{"_id":"71"}],"place":"Berlin","date_created":"2021-10-19T15:14:12Z","citation":{"chicago":"Keil,  Reinhard. “Knowledge Integration Processes and Distributed Knowledge Organization.” edited by Stefan Andreas Keller, René Schneider, and Benno Volk, 162–179. Berlin: De Gruyter Saur, 2014.","short":"Reinhard Keil, in: S.A. Keller, R. Schneider, B. Volk (Eds.), De Gruyter Saur, Berlin, 2014, pp. 162–179.","ieee":"Reinhard Keil, “Knowledge integration processes and distributed knowledge organization,” 2014, pp. 162–179.","apa":"Keil,  Reinhard. (2014). <i>Knowledge integration processes and distributed knowledge organization</i> (S. A. Keller, R. Schneider, &#38; B. Volk, Eds.; pp. 162–179). De Gruyter Saur.","bibtex":"@inproceedings{Keil_2014, place={Berlin}, title={Knowledge integration processes and distributed knowledge organization}, publisher={De Gruyter Saur}, author={Keil,  Reinhard}, editor={Keller, Stefan Andreas and Schneider, René and Volk, Benno}, year={2014}, pages={162–179} }","ama":"Keil  Reinhard. Knowledge integration processes and distributed knowledge organization. In: Keller SA, Schneider R, Volk B, eds. De Gruyter Saur; 2014:162–179.","mla":"Keil,  Reinhard. <i>Knowledge Integration Processes and Distributed Knowledge Organization</i>. Edited by Stefan Andreas Keller et al., De Gruyter Saur, 2014, pp. 162–179."}},{"publication":"Proceedings of the 2014 IFIP Networking Conference (Networking 2014)","file_date_updated":"2018-03-20T07:30:29Z","citation":{"apa":"Wette, P., Dräxler, M., Schwabe, A., Wallaschek, F., Zahraee, M. H., &#38; Karl, H. (2014). MaxiNet: Distributed Emulation of Software-Defined Networks. In <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i> (pp. 1–9). <a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>","ieee":"P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M. H. Zahraee, and H. Karl, “MaxiNet: Distributed Emulation of Software-Defined Networks,” in <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 2014, pp. 1–9.","short":"P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M.H. Zahraee, H. Karl, in: Proceedings of the 2014 IFIP Networking Conference (Networking 2014), 2014, pp. 1–9.","chicago":"Wette, Philip, Martin Dräxler, Arne Schwabe, Felix Wallaschek, Mohammad Hassan Zahraee, and Holger Karl. “MaxiNet: Distributed Emulation of Software-Defined Networks.” In <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 1–9, 2014. <a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>.","mla":"Wette, Philip, et al. “MaxiNet: Distributed Emulation of Software-Defined Networks.” <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>, 2014, pp. 1–9, doi:<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>.","ama":"Wette P, Dräxler M, Schwabe A, Wallaschek F, Zahraee MH, Karl H. MaxiNet: Distributed Emulation of Software-Defined Networks. In: <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>. ; 2014:1-9. doi:<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>","bibtex":"@inproceedings{Wette_Dräxler_Schwabe_Wallaschek_Zahraee_Karl_2014, title={MaxiNet: Distributed Emulation of Software-Defined Networks}, DOI={<a href=\"https://doi.org/10.1109/IFIPNetworking.2014.6857078\">10.1109/IFIPNetworking.2014.6857078</a>}, booktitle={Proceedings of the 2014 IFIP Networking Conference (Networking 2014)}, author={Wette, Philip and Dräxler, Martin and Schwabe, Arne and Wallaschek, Felix and Zahraee, Mohammad Hassan and Karl, Holger}, year={2014}, pages={1–9} }"},"abstract":[{"lang":"eng","text":"Network emulations are widely used for testing novel network protocols and routing algorithms in realistic scenarios. Up to now, there is no emulation tool that is able to emulate large software-defined data center networks that consist of several thousand nodes. Mininet is the most common tool to emulate Software-Defined Networks of several hundred nodes. We extend Mininet to span an emulated network over several physical machines, making it possible to emulate networks of several thousand nodes on just a handful of physical machines. This enables us to emulate, e.g., large data center networks. To test this approach, we additionally introduce a traffic generator for data center traffic. Since there are no data center traffic traces publicly available we use the results of two recent traffic studies to create synthetic traffic. We show the design and discuss some challenges we had in building our traffic generator. As a showcase for our work we emulated a data center consisting of 3200 hosts on a cluster of only 12 physical machines. We show the resulting workloads and the trade-offs involved."}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"1425","date_updated":"2018-03-20T07:30:29Z","relation":"main_file","access_level":"closed","file_size":786320,"file_name":"329-maxinet_networking14_01.pdf","date_created":"2018-03-20T07:30:29Z","creator":"florida"}],"date_created":"2017-10-17T12:41:56Z","type":"conference","department":[{"_id":"75"}],"year":"2014","status":"public","title":"MaxiNet: Distributed Emulation of Software-Defined Networks","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Martin","last_name":"Dräxler","full_name":"Dräxler, Martin"},{"last_name":"Schwabe","first_name":"Arne","full_name":"Schwabe, Arne"},{"first_name":"Felix","last_name":"Wallaschek","full_name":"Wallaschek, Felix"},{"full_name":"Zahraee, Mohammad Hassan","last_name":"Zahraee","first_name":"Mohammad Hassan"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_updated":"2022-01-06T06:59:09Z","has_accepted_license":"1","page":"1-9","_id":"329","doi":"10.1109/IFIPNetworking.2014.6857078","ddc":["040"],"user_id":"15572"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-20T07:29:29Z","citation":{"bibtex":"@inproceedings{Walther_Wehrheim_2014, series={LNCS}, title={Verified Service Compositions by Template-Based Construction}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-15317-9_3\">10.1007/978-3-319-15317-9_3</a>}, booktitle={Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)}, author={Walther, Sven and Wehrheim, Heike}, editor={Lanese, Ivan and Madelaine, EricEditors}, year={2014}, pages={31–48}, collection={LNCS} }","short":"S. Walther, H. Wehrheim, in: I. Lanese, E. Madelaine (Eds.), Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS), 2014, pp. 31–48.","ama":"Walther S, Wehrheim H. Verified Service Compositions by Template-Based Construction. In: Lanese I, Madelaine E, eds. <i>Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)</i>. LNCS. ; 2014:31-48. doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_3\">10.1007/978-3-319-15317-9_3</a>","chicago":"Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based Construction.” In <i>Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)</i>, edited by Ivan Lanese and Eric Madelaine, 31–48. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-15317-9_3\">https://doi.org/10.1007/978-3-319-15317-9_3</a>.","ieee":"S. Walther and H. Wehrheim, “Verified Service Compositions by Template-Based Construction,” in <i>Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)</i>, 2014, pp. 31–48.","mla":"Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based Construction.” <i>Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)</i>, edited by Ivan Lanese and Eric Madelaine, 2014, pp. 31–48, doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_3\">10.1007/978-3-319-15317-9_3</a>.","apa":"Walther, S., &#38; Wehrheim, H. (2014). Verified Service Compositions by Template-Based Construction. In I. Lanese &#38; E. Madelaine (Eds.), <i>Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)</i> (pp. 31–48). <a href=\"https://doi.org/10.1007/978-3-319-15317-9_3\">https://doi.org/10.1007/978-3-319-15317-9_3</a>"},"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"editor":[{"full_name":"Lanese, Ivan","last_name":"Lanese","first_name":"Ivan"},{"full_name":"Madelaine, Eric","last_name":"Madelaine","first_name":"Eric"}],"page":"31-48","_id":"336","abstract":[{"lang":"eng","text":"Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning. In this paper, we propose a method to construct service compositions based on pre-verifiedtemplates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Templates are proven correct using an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Construction of service compositions amounts to instantiation of templates with domain-specific services.Correctness of an instantiation can then simply be checked by verifying that the domain ontology(a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template."}],"publication":"Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)","type":"conference","department":[{"_id":"77"}],"file":[{"file_id":"1423","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-20T07:29:29Z","file_name":"336-facs2014_walther.pdf","access_level":"closed","file_size":484422,"date_created":"2018-03-20T07:29:29Z","creator":"florida"}],"date_created":"2017-10-17T12:41:57Z","date_updated":"2022-01-06T06:59:13Z","year":"2014","title":"Verified Service Compositions by Template-Based Construction","author":[{"full_name":"Walther, Sven","last_name":"Walther","first_name":"Sven"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"doi":"10.1007/978-3-319-15317-9_3","series_title":"LNCS","language":[{"iso":"eng"}]},{"page":"3270-3276","_id":"339","ddc":["040"],"doi":"10.1109/ICC.2014.6883825","user_id":"15504","year":"2014","title":"Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms","status":"public","author":[{"last_name":"Wette","first_name":"Philip","full_name":"Wette, Philip"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:59:14Z","has_accepted_license":"1","file":[{"file_size":138062,"access_level":"closed","file_name":"339-IEEE-WK-14.pdf","date_updated":"2018-03-20T07:29:00Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1422","creator":"florida","date_created":"2018-03-20T07:29:00Z"}],"date_created":"2017-10-17T12:41:58Z","type":"conference","department":[{"_id":"75"}],"publication":"Proceedings of the IEEE International Conference on Communications 2014","file_date_updated":"2018-03-20T07:29:00Z","citation":{"mla":"Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.” <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 2014, pp. 3270–76, doi:<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>.","ama":"Wette P, Karl H. Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms. In: <i>Proceedings of the IEEE International Conference on Communications 2014</i>. ; 2014:3270-3276. doi:<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>","bibtex":"@inproceedings{Wette_Karl_2014, title={Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms}, DOI={<a href=\"https://doi.org/10.1109/ICC.2014.6883825\">10.1109/ICC.2014.6883825</a>}, booktitle={Proceedings of the IEEE International Conference on Communications 2014}, author={Wette, Philip and Karl, Holger}, year={2014}, pages={3270–3276} }","apa":"Wette, P., &#38; Karl, H. (2014). Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms. In <i>Proceedings of the IEEE International Conference on Communications 2014</i> (pp. 3270–3276). <a href=\"https://doi.org/10.1109/ICC.2014.6883825\">https://doi.org/10.1109/ICC.2014.6883825</a>","ieee":"P. Wette and H. Karl, “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms,” in <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 2014, pp. 3270–3276.","short":"P. Wette, H. Karl, in: Proceedings of the IEEE International Conference on Communications 2014, 2014, pp. 3270–3276.","chicago":"Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms.” In <i>Proceedings of the IEEE International Conference on Communications 2014</i>, 3270–76, 2014. <a href=\"https://doi.org/10.1109/ICC.2014.6883825\">https://doi.org/10.1109/ICC.2014.6883825</a>."},"abstract":[{"lang":"eng","text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case notenough resources are available to set up a new lightpath in aWavelength Division Multiplexing (WDM) network. The selectionof lightpaths to be preempted relies on internal decisions of theRWA algorithm. Thus, if dedicated properties of the networktopology are required by the applications running on the network,these requirements have to be known to the RWA algorithm.We present a family of preemptive RWA algorithms for WDMnetworks. These algorithms have two distinguishing features: a)they can handle dynamic traffic by on-the-fly reconfiguration,and b) users can give feedback for reconfiguration decisions andthus influence the preemption decision of the RWA algorithm,leading to networks which adapt directly to application needs.This is different from traffic engineering where the network is(slowly) adapted to observed traffic patterns.Our algorithms handle various WDM network configurationsincluding networks consisting of heterogeneous WDM hardware.To this end, we are using the layered graph approach togetherwith a newly developed graph model that is used to determineconflicting lightpaths."}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"year":"2014","title":"Untersuchung transitiver Eigenschaften der Technik \"Programs from Proofs\"","status":"public","author":[{"last_name":"Korth","first_name":"Philipp","full_name":"Korth, Philipp"}],"date_updated":"2022-01-06T06:59:14Z","language":[{"iso":"ger"}],"_id":"340","publisher":"Universität Paderborn","user_id":"15504","citation":{"ieee":"P. Korth, <i>Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.”</i> Universität Paderborn, 2014.","mla":"Korth, Philipp. <i>Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.”</i> Universität Paderborn, 2014.","apa":"Korth, P. (2014). <i>Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.”</i> Universität Paderborn.","bibtex":"@book{Korth_2014, title={Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs”}, publisher={Universität Paderborn}, author={Korth, Philipp}, year={2014} }","chicago":"Korth, Philipp. <i>Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.”</i> Universität Paderborn, 2014.","short":"P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs,” Universität Paderborn, 2014.","ama":"Korth P. <i>Untersuchung transitiver Eigenschaften der Technik “Programs from Proofs.”</i> Universität Paderborn; 2014."},"supervisor":[{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:41:58Z","type":"bachelorsthesis","department":[{"_id":"77"}]},{"_id":"343","publisher":"Universität Paderborn","user_id":"477","ddc":["040"],"author":[{"full_name":"Künsemöller, Jörn","first_name":"Jörn","last_name":"Künsemöller"}],"status":"public","title":"Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market","year":"2014","has_accepted_license":"1","date_updated":"2022-01-06T06:59:16Z","date_created":"2017-10-17T12:41:58Z","file":[{"date_created":"2018-03-20T07:28:26Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1421","file_size":1378657,"access_level":"closed","file_name":"343-2014_Diss_Kuensemoeller.pdf","date_updated":"2018-03-20T07:28:26Z","relation":"main_file"}],"department":[{"_id":"75"}],"type":"dissertation","citation":{"bibtex":"@book{Künsemöller_2014, title={Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market}, publisher={Universität Paderborn}, author={Künsemöller, Jörn}, year={2014} }","ama":"Künsemöller J. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn; 2014.","mla":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","chicago":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","short":"J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market, Universität Paderborn, 2014.","ieee":"J. Künsemöller, <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","apa":"Künsemöller, J. (2014). <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn."},"supervisor":[{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"file_date_updated":"2018-03-20T07:28:26Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"type":"conference","department":[{"_id":"77"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"1420","access_level":"closed","file_size":80674,"file_name":"344-paper_CAMERA_READY.pdf","date_updated":"2018-03-20T07:27:54Z","relation":"main_file","date_created":"2018-03-20T07:27:54Z","creator":"florida"}],"date_created":"2017-10-17T12:41:59Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-20T07:27:54Z","publication":"Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)","citation":{"short":"M. Becker, S. Becker, G. Besova, S. Walther, H. Wehrheim, in: Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session), 2014.","chicago":"Becker, Matthias, Steffen Becker, Galina Besova, Sven Walther, and Heike Wehrheim. “Towards Systematic Configuration for Architecture Validation.” In <i>Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)</i>, 2014.","apa":"Becker, M., Becker, S., Besova, G., Walther, S., &#38; Wehrheim, H. (2014). Towards Systematic Configuration for Architecture Validation. In <i>Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)</i>.","ieee":"M. Becker, S. Becker, G. Besova, S. Walther, and H. Wehrheim, “Towards Systematic Configuration for Architecture Validation,” in <i>Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)</i>, 2014.","ama":"Becker M, Becker S, Besova G, Walther S, Wehrheim H. Towards Systematic Configuration for Architecture Validation. In: <i>Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)</i>. ; 2014.","bibtex":"@inproceedings{Becker_Becker_Besova_Walther_Wehrheim_2014, title={Towards Systematic Configuration for Architecture Validation}, booktitle={Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)}, author={Becker, Matthias and Becker, Steffen and Besova, Galina and Walther, Sven and Wehrheim, Heike}, year={2014} }","mla":"Becker, Matthias, et al. “Towards Systematic Configuration for Architecture Validation.” <i>Proceedings of the 40th Euromicro Conference on Software Engineering and Advanced Applications (Work in Progress Session)</i>, 2014."},"user_id":"477","ddc":["040"],"_id":"344","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:17Z","has_accepted_license":"1","status":"public","title":"Towards Systematic Configuration for Architecture Validation","year":"2014","author":[{"last_name":"Becker","first_name":"Matthias","full_name":"Becker, Matthias"},{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"last_name":"Besova","first_name":"Galina","full_name":"Besova, Galina"},{"full_name":"Walther, Sven","first_name":"Sven","last_name":"Walther"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-20T07:26:49Z","citation":{"apa":"Brangewitz, S., Jungmann, A., Petrlic, R., &#38; Platenius, M. C. (2014). Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 49–57).","ieee":"S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services,” in <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","short":"S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp. 49–57.","chicago":"Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 49–57, 2014.","mla":"Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","ama":"Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In: <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2014:49-57.","bibtex":"@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services}, booktitle={Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57} }"},"user_id":"477","ddc":["040"],"page":"49-57","_id":"346","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"205"},{"_id":"76"}],"file":[{"relation":"main_file","date_updated":"2018-03-20T07:26:49Z","file_name":"346-service_computation_2014_3_10_10005.pdf","file_size":334101,"access_level":"closed","file_id":"1418","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-20T07:26:49Z"}],"date_created":"2017-10-17T12:41:59Z","abstract":[{"lang":"eng","text":"One future goal of service-oriented computing is to realize global markets of composed services. On such markets, service providers offer services that can be flexibly combined with each other. However, most often, market participants are not able to individually estimate the quality of traded services in advance. As a consequence, even potentially profitable transactions between customers and providers might not take place. In the worst case, this can induce a market failure. To overcome this problem, we propose the incorporation of reputation information as an indicator for expected service quality. We address On-The-Fly Computing as a representative environment of markets of composed services. In this environment, customers provide feedback on transactions. We present a conceptual design of a reputation system which collects and processes user feedback, and provides it to participants in the market. Our contribution includes the identification of requirements for such a reputation system from a technical and an economic perspective. Based on these requirements, we propose a flexible solution that facilitates the incorporation of reputation information into markets of composed services while simultaneously preserving privacy of customers who provide feedback. The requirements we formulate in this paper have just been partially met in literature. An integrated approach, however, has not been addressed yet."}],"publication":"Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:18Z","year":"2014","title":"Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services","author":[{"full_name":"Brangewitz, Sonja","first_name":"Sonja","last_name":"Brangewitz"},{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"},{"last_name":"Platenius","first_name":"Marie Christin","full_name":"Platenius, Marie Christin"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-20T07:26:16Z","citation":{"bibtex":"@inproceedings{Meisner_Platzner_2014, series={Lecture Notes in Computer Science}, title={Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">10.1007/978-3-319-05960-0_30</a>}, booktitle={Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)}, publisher={Springer}, author={Meisner, Sebastian and Platzner, Marco}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso, JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={283–290}, collection={Lecture Notes in Computer Science} }","ama":"Meisner S, Platzner M. Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection. In: Goehringer D, Santambrogio M, Cardoso JP, Bertels K, eds. <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>. Lecture Notes in Computer Science. Springer; 2014:283-290. doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">10.1007/978-3-319-05960-0_30</a>","mla":"Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-Cores for Error Detection.” <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>, edited by Diana Goehringer et al., Springer, 2014, pp. 283–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">10.1007/978-3-319-05960-0_30</a>.","short":"S. Meisner, M. Platzner, in: D. Goehringer, M. Santambrogio, J.P. Cardoso, K. Bertels (Eds.), Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC), Springer, 2014, pp. 283–290.","chicago":"Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-Cores for Error Detection.” In <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>, edited by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and Koen Bertels, 283–90. Lecture Notes in Computer Science. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">https://doi.org/10.1007/978-3-319-05960-0_30</a>.","ieee":"S. Meisner and M. Platzner, “Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection,” in <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>, 2014, pp. 283–290.","apa":"Meisner, S., &#38; Platzner, M. (2014). Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection. In D. Goehringer, M. Santambrogio, J. P. Cardoso, &#38; K. Bertels (Eds.), <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i> (pp. 283–290). Springer. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">https://doi.org/10.1007/978-3-319-05960-0_30</a>"},"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"398","editor":[{"full_name":"Goehringer, Diana","first_name":"Diana","last_name":"Goehringer"},{"full_name":"Santambrogio, MarcoDomenico","first_name":"MarcoDomenico","last_name":"Santambrogio"},{"full_name":"Cardoso, JoãoM.P.","first_name":"JoãoM.P.","last_name":"Cardoso"},{"full_name":"Bertels, Koen","first_name":"Koen","last_name":"Bertels"}],"page":"283-290","_id":"347","publisher":"Springer","abstract":[{"text":"Dynamic thread duplication is a known redundancy technique for multi-cores. The approach duplicates a thread under observation for some time period and compares the signatures of the two threads to detect errors. Hybrid multi-cores, typically implemented on platform FPGAs, enable the unique option of running the thread under observation and its copy in different modalities, i.e., software and hardware. We denote our dynamic redundancy technique on hybrid multi-cores as thread shadowing. In this paper we present the concept of thread shadowing and an implementation on a multi-threaded hybrid multi-core architecture. We report on experiments with a block-processing application and demonstrate the overheads, detection latencies and coverage for a range of thread shadowing modes. The results show that trans-modal thread shadowing, although bearing long detection latencies, offers attractive coverage at a low overhead.","lang":"eng"}],"publication":"Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)","type":"conference","department":[{"_id":"78"}],"file":[{"creator":"florida","date_created":"2018-03-20T07:26:16Z","file_size":1168877,"access_level":"closed","file_name":"347-meisner13_xx_SFB1__1_.pdf","date_updated":"2018-03-20T07:26:16Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1417"}],"date_created":"2017-10-17T12:41:59Z","date_updated":"2022-01-06T06:59:18Z","title":"Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection","year":"2014","author":[{"first_name":"Sebastian","last_name":"Meisner","full_name":"Meisner, Sebastian"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}],"doi":"10.1007/978-3-319-05960-0_30","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}]},{"page":"188-203","_id":"353","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-20T07:23:32Z","citation":{"bibtex":"@inproceedings{Mohr_Walther_2014, series={LNCS}, title={Template-based Generation of Semantic Services}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14130-5_14\">10.1007/978-3-319-14130-5_14</a>}, booktitle={Proceedings of the 14th International Conference on Software Reuse (ICSR)}, author={Mohr, Felix and Walther, Sven}, year={2014}, pages={188–203}, collection={LNCS} }","ama":"Mohr F, Walther S. Template-based Generation of Semantic Services. In: <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>. LNCS. ; 2014:188-203. doi:<a href=\"https://doi.org/10.1007/978-3-319-14130-5_14\">10.1007/978-3-319-14130-5_14</a>","mla":"Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.” <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 2014, pp. 188–203, doi:<a href=\"https://doi.org/10.1007/978-3-319-14130-5_14\">10.1007/978-3-319-14130-5_14</a>.","chicago":"Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.” In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 188–203. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14130-5_14\">https://doi.org/10.1007/978-3-319-14130-5_14</a>.","short":"F. Mohr, S. Walther, in: Proceedings of the 14th International Conference on Software Reuse (ICSR), 2014, pp. 188–203.","ieee":"F. Mohr and S. Walther, “Template-based Generation of Semantic Services,” in <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 2014, pp. 188–203.","apa":"Mohr, F., &#38; Walther, S. (2014). Template-based Generation of Semantic Services. In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i> (pp. 188–203). <a href=\"https://doi.org/10.1007/978-3-319-14130-5_14\">https://doi.org/10.1007/978-3-319-14130-5_14</a>"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-14130-5_14","title":"Template-based Generation of Semantic Services","year":"2014","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"first_name":"Sven","last_name":"Walther","full_name":"Walther, Sven"}],"date_updated":"2022-01-06T06:59:22Z","file":[{"relation":"main_file","date_updated":"2018-03-20T07:23:32Z","file_name":"353-icsr2015_submission_17.pdf","access_level":"closed","file_size":431778,"file_id":"1414","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-20T07:23:32Z"}],"date_created":"2017-10-17T12:42:00Z","type":"conference","department":[{"_id":"77"},{"_id":"355"}],"publication":"Proceedings of the 14th International Conference on Software Reuse (ICSR)","abstract":[{"lang":"eng","text":"There are many technologies for the automation of processesthat deal with services; examples are service discovery and composition.Automation of these processes requires that the services are described semantically. However, semantically described services are currently not oronly rarely available, which limits the applicability of discovery and composition approaches. The systematic support for creating new semanticservices usable by automated technologies is an open problem.We tackle this problem with a template based approach: Domain independent templates are instantiated with domain specific services andboolean expressions. The obtained services have semantic descriptionswhose correctness directly follows from the correctness of the template.Besides the theory, we present experimental results for a service repository in which 85% of the services were generated automatically."}]},{"publication":"Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)","file_date_updated":"2018-03-20T07:23:02Z","citation":{"apa":"Keller, M., Robbert, C., &#38; Karl, H. (2014). Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds. In <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i> (pp. 387--395). <a href=\"https://doi.org/10.1109/UCC.2014.49\">https://doi.org/10.1109/UCC.2014.49</a>","ieee":"M. Keller, C. Robbert, and H. Karl, “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds,” in <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp. 387--395.","short":"M. Keller, C. Robbert, H. Karl, in: Proceedings of 7th International Conference on Utility and Cloud Computing (UCC), 2014, pp. 387--395.","chicago":"Keller, Matthias, Christoph Robbert, and Holger Karl. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.” In <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 387--395, 2014. <a href=\"https://doi.org/10.1109/UCC.2014.49\">https://doi.org/10.1109/UCC.2014.49</a>.","mla":"Keller, Matthias, et al. “Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds.” <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp. 387--395, doi:<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>.","ama":"Keller M, Robbert C, Karl H. Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds. In: <i>Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)</i>. ; 2014:387--395. doi:<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>","bibtex":"@inproceedings{Keller_Robbert_Karl_2014, title={Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds}, DOI={<a href=\"https://doi.org/10.1109/UCC.2014.49\">10.1109/UCC.2014.49</a>}, booktitle={Proceedings of 7th International Conference on Utility and Cloud Computing (UCC)}, author={Keller, Matthias and Robbert, Christoph and Karl, Holger}, year={2014}, pages={387--395} }"},"abstract":[{"text":"In distributed cloud computing, application deployment across multiple sites can improve quality of service. Recent research developed algorithms to find optimal locations for virtual machines. However, those algorithms assume to have either single-tier applications or a fixed number of virtual machines – a strong simplification of reality. This paper investigates the placement and scaling of complex application architectures. An application is dynamically scaled to fit both the current demand situation and the currently available infrastructure resources. We compare two approaches: The first one is based on virtual network embedding. The second approach is a novel method called Template Embedding. It is based on a hierarchical 1-allocation hub flow problem and combines applica- tion scaling and embedding in one step. Extensive experiments on 43200 network configurations showed that Template Embedding outperforms virtual network embedding in all cases in three metrics: success rate, solution quality, and runtime. This positive result shows that template embedding is a promising approach for distributed cloud resource allocation.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file":[{"date_created":"2018-03-20T07:23:02Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1413","file_size":737652,"access_level":"closed","file_name":"354-keller_ucc14_preprint_01.pdf","date_updated":"2018-03-20T07:23:02Z","relation":"main_file"}],"date_created":"2017-10-17T12:42:01Z","type":"conference","department":[{"_id":"75"}],"title":"Template Embedding: Using Application Architecture to Allocate Resources in Distributed Clouds","year":"2014","status":"public","author":[{"last_name":"Keller","first_name":"Matthias","full_name":"Keller, Matthias"},{"last_name":"Robbert","first_name":"Christoph","full_name":"Robbert, Christoph"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"}],"date_updated":"2022-01-06T06:59:22Z","has_accepted_license":"1","page":"387--395","_id":"354","ddc":["040"],"doi":"10.1109/UCC.2014.49","user_id":"15572"},{"department":[{"_id":"64"}],"type":"conference","date_created":"2017-10-17T12:42:01Z","file":[{"creator":"florida","date_created":"2018-03-20T07:22:29Z","relation":"main_file","date_updated":"2018-03-20T07:22:29Z","file_name":"355-Bloemer2014.pdf","file_size":293394,"access_level":"closed","file_id":"1412","success":1,"content_type":"application/pdf"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"abstract":[{"lang":"eng","text":"In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area."}],"citation":{"ieee":"J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 1--7.","apa":"Blömer, J., Günther, P., &#38; Liske, G. (2014). Tampering attacks in pairing-based cryptography. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i> (pp. 1--7). <a href=\"https://doi.org/10.1109/FDTC.2014.10\">https://doi.org/10.1109/FDTC.2014.10</a>","chicago":"Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks in Pairing-Based Cryptography.” In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 1--7, 2014. <a href=\"https://doi.org/10.1109/FDTC.2014.10\">https://doi.org/10.1109/FDTC.2014.10</a>.","short":"J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.","mla":"Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.” <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 1--7, doi:<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>.","bibtex":"@inproceedings{Blömer_Günther_Liske_2014, title={Tampering attacks in pairing-based cryptography}, DOI={<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2014}, pages={1--7} }","ama":"Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography. In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>. ; 2014:1--7. doi:<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>"},"file_date_updated":"2018-03-20T07:22:29Z","publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","user_id":"25078","ddc":["040"],"doi":"10.1109/FDTC.2014.10","_id":"355","page":"1--7","has_accepted_license":"1","date_updated":"2022-01-06T06:59:23Z","author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Günther","first_name":"Peter","full_name":"Günther, Peter"},{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"year":"2014","status":"public","title":"Tampering attacks in pairing-based cryptography"},{"page":"7-13","_id":"360","urn":"3601","user_id":"31764","ddc":["040"],"status":"public","has_accepted_license":"1","oa":"1","file_date_updated":"2018-06-25T08:08:44Z","citation":{"chicago":"Dräxler, Sevil, Matthias Keller, and Holger Karl. “Specifying and Placing Chains of Virtual Network Functions.” In <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 7–13, 2014. <a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">https://doi.org/10.1109/CloudNet.2014.6968961</a>.","short":"S. Dräxler, M. Keller, H. Karl, in: Proceedings of the 3rd International Conference on Cloud Networking (CloudNet), 2014, pp. 7–13.","apa":"Dräxler, S., Keller, M., &#38; Karl, H. (2014). Specifying and Placing Chains of Virtual Network Functions. In <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i> (pp. 7–13). <a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">https://doi.org/10.1109/CloudNet.2014.6968961</a>","ieee":"S. Dräxler, M. Keller, and H. Karl, “Specifying and Placing Chains of Virtual Network Functions,” in <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 2014, pp. 7–13.","ama":"Dräxler S, Keller M, Karl H. Specifying and Placing Chains of Virtual Network Functions. In: <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>. ; 2014:7-13. doi:<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>","bibtex":"@inproceedings{Dräxler_Keller_Karl_2014, title={Specifying and Placing Chains of Virtual Network Functions}, DOI={<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>}, booktitle={Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)}, author={Dräxler, Sevil and Keller, Matthias and Karl, Holger}, year={2014}, pages={7–13} }","mla":"Dräxler, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.” <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>, 2014, pp. 7–13, doi:<a href=\"https://doi.org/10.1109/CloudNet.2014.6968961\">10.1109/CloudNet.2014.6968961</a>."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"doi":"10.1109/CloudNet.2014.6968961","title":"Specifying and Placing Chains of Virtual Network Functions","year":"2014","author":[{"full_name":"Dräxler, Sevil","first_name":"Sevil","last_name":"Dräxler","id":"31764"},{"last_name":"Keller","first_name":"Matthias","full_name":"Keller, Matthias"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"}],"date_updated":"2022-01-06T06:59:27Z","file":[{"date_created":"2018-03-20T07:21:01Z","creator":"florida","file_id":"1409","content_type":"application/pdf","file_name":"360-Mehr1410_Specifying_preprint_01.pdf","file_size":422019,"access_level":"open_access","relation":"main_file","date_updated":"2018-06-25T08:08:44Z"}],"date_created":"2017-10-17T12:42:02Z","type":"conference","department":[{"_id":"75"}],"publication":"Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)","abstract":[{"lang":"eng","text":"Network appliances perform different functions on network flows and constitute an important part of an operator’s network. Normally, a set of chained network functions process network flows. Following the trend of virtualization of networks, virtualization of the network functions has also become a topic of interest. We define a model for formalizing the chaining of network functions using a context-free language. We process deployment requests and construct virtual network function graphs that can be mapped to the network. We describe the mapping as a Mixed Integer Quadratically Constrained Program (MIQCP) for finding the placement of the network functions and chaining them together considering the limited network resources and requirements of the functions. We have performed a Pareto set analysis to investigate the possible trade-offs between different optimization objectives. "}]},{"date_created":"2017-10-17T12:42:02Z","type":"bachelorsthesis","department":[{"_id":"75"}],"citation":{"mla":"Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn, 2014.","ama":"Roeske D. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn; 2014.","bibtex":"@book{Roeske_2014, title={Simulating load-dependent operation of picocells}, publisher={Universität Paderborn}, author={Roeske, Daniel}, year={2014} }","apa":"Roeske, D. (2014). <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn.","ieee":"D. Roeske, <i>Simulating load-dependent operation of picocells</i>. Universität Paderborn, 2014.","chicago":"Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität Paderborn, 2014.","short":"D. Roeske, Simulating Load-Dependent Operation of Picocells, Universität Paderborn, 2014."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"361","publisher":"Universität Paderborn","user_id":"15504","title":"Simulating load-dependent operation of picocells","status":"public","year":"2014","author":[{"first_name":"Daniel","last_name":"Roeske","full_name":"Roeske, Daniel"}],"date_updated":"2022-01-06T06:59:27Z"}]