[{"ddc":["000"],"title":"MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops","user_id":"65718","project":[{"_id":"27","name":"Akustische Sensornetzwerke - Teilprojekt "}],"date_created":"2018-04-24T08:06:55Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-24T08:07:24Z","department":[{"_id":"75"}],"author":[{"id":"65718","last_name":"Afifi","full_name":"Afifi, Haitham","first_name":"Haitham"},{"full_name":"Auroux, Sébastien","first_name":"Sébastien","id":"42575","last_name":"Auroux"},{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"}],"publisher":"Proc. of IEEE Wireless Communications and Networking Conference (WCNC)","file":[{"access_level":"closed","date_created":"2018-04-24T08:07:24Z","file_name":"p2292-afifi.pdf","content_type":"application/pdf","date_updated":"2018-04-24T08:07:24Z","success":1,"relation":"main_file","file_size":1428258,"creator":"tabu","file_id":"2475"}],"_id":"2474","date_updated":"2022-01-06T06:56:33Z","year":"2018","citation":{"chicago":"Afifi, Haitham, Sébastien Auroux, and Holger Karl. “MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops.” Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","ama":"Afifi H, Auroux S, Karl H. MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC); 2018.","apa":"Afifi, H., Auroux, S., & Karl, H. (2018). MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops. Proc. of IEEE Wireless Communications and Networking Conference (WCNC).","mla":"Afifi, Haitham, et al. MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops. Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","bibtex":"@inproceedings{Afifi_Auroux_Karl_2018, title={MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops}, publisher={Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}, author={Afifi, Haitham and Auroux, Sébastien and Karl, Holger}, year={2018} }","short":"H. Afifi, S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","ieee":"H. Afifi, S. Auroux, and H. Karl, “MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops,” 2018."},"type":"conference","language":[{"iso":"eng"}]},{"_id":"2476","date_updated":"2022-01-06T06:56:34Z","type":"conference","citation":{"mla":"Shiferaw Heyi, Binyam, and Holger Karl. Modelling Time-Limited Capacity of a Wireless Channel as AMarkov Reward Process. Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","bibtex":"@inproceedings{Shiferaw Heyi_Karl_2018, title={Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process}, publisher={Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}, author={Shiferaw Heyi, Binyam and Karl, Holger}, year={2018} }","ama":"Shiferaw Heyi B, Karl H. Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC); 2018.","apa":"Shiferaw Heyi, B., & Karl, H. (2018). Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process. Proc. of IEEE Wireless Communications and Networking Conference (WCNC).","chicago":"Shiferaw Heyi, Binyam, and Holger Karl. “Modelling Time-Limited Capacity of a Wireless Channel as AMarkov Reward Process.” Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","ieee":"B. Shiferaw Heyi and H. Karl, “Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process,” 2018.","short":"B. Shiferaw Heyi, H. Karl, in: Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018."},"year":"2018","user_id":"15572","ddc":["000"],"title":"Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process","file":[{"file_name":"p2861-heyi.pdf","date_created":"2018-04-24T08:08:50Z","access_level":"closed","file_size":428839,"creator":"tabu","file_id":"2477","content_type":"application/pdf","date_updated":"2018-04-24T08:08:50Z","success":1,"relation":"main_file"}],"file_date_updated":"2018-04-24T08:08:50Z","department":[{"_id":"75"}],"publisher":"Proc. of IEEE Wireless Communications and Networking Conference (WCNC)","author":[{"last_name":"Shiferaw Heyi","first_name":"Binyam","full_name":"Shiferaw Heyi, Binyam"},{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"}],"date_created":"2018-04-24T08:09:00Z","project":[{"_id":"24","name":"Netzgewahre Regelung & regelungsgewahre Netze"}],"status":"public","has_accepted_license":"1"},{"year":"2018","type":"conference","citation":{"ieee":"F. Mohr, M. D. Wever, E. Hüllermeier, and A. Faez, “(WIP) Towards the Automated Composition of Machine Learning Services,” in SCC, San Francisco, CA, USA, 2018.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, A. Faez, in: SCC, IEEE, San Francisco, CA, USA, 2018.","mla":"Mohr, Felix, et al. “(WIP) Towards the Automated Composition of Machine Learning Services.” SCC, IEEE, 2018, doi:10.1109/SCC.2018.00039.","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_Faez_2018, place={San Francisco, CA, USA}, title={(WIP) Towards the Automated Composition of Machine Learning Services}, DOI={10.1109/SCC.2018.00039}, booktitle={SCC}, publisher={IEEE}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke and Faez, Amin}, year={2018} }","chicago":"Mohr, Felix, Marcel Dominik Wever, Eyke Hüllermeier, and Amin Faez. “(WIP) Towards the Automated Composition of Machine Learning Services.” In SCC. San Francisco, CA, USA: IEEE, 2018. https://doi.org/10.1109/SCC.2018.00039.","apa":"Mohr, F., Wever, M. D., Hüllermeier, E., & Faez, A. (2018). (WIP) Towards the Automated Composition of Machine Learning Services. In SCC. San Francisco, CA, USA: IEEE. https://doi.org/10.1109/SCC.2018.00039","ama":"Mohr F, Wever MD, Hüllermeier E, Faez A. (WIP) Towards the Automated Composition of Machine Learning Services. In: SCC. San Francisco, CA, USA: IEEE; 2018. doi:10.1109/SCC.2018.00039"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8456425","open_access":"1"}],"_id":"2479","conference":{"location":"San Francisco, CA, USA","start_date":"2018-07-02","name":"IEEE International Conference on Services Computing, SCC 2018","end_date":"2018-07-07"},"status":"public","has_accepted_license":"1","date_created":"2018-04-24T08:34:52Z","author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","id":"48129"},{"last_name":"Faez","full_name":"Faez, Amin","first_name":"Amin"}],"publisher":"IEEE","file_date_updated":"2018-11-06T15:08:39Z","publication":"SCC","file":[{"date_created":"2018-11-06T15:08:39Z","file_name":"08456425.pdf","access_level":"closed","file_size":237890,"file_id":"5382","creator":"wever","date_updated":"2018-11-06T15:08:39Z","content_type":"application/pdf","relation":"main_file"}],"ddc":["000"],"user_id":"49109","language":[{"iso":"eng"}],"doi":"10.1109/SCC.2018.00039","oa":"1","date_updated":"2022-01-06T06:56:35Z","publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"355"}],"title":"(WIP) Towards the Automated Composition of Machine Learning Services","place":"San Francisco, CA, USA"},{"page":"318--322","year":"2018","citation":{"mla":"Dräxler, Sevil, et al. “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case.” 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322, doi:10.1109/NETSOFT.2018.8460029.","bibtex":"@inproceedings{Dräxler_Peuster_Illian_Karl_2018, title={Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case}, DOI={10.1109/NETSOFT.2018.8460029}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, publisher={IEEE}, author={Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}, year={2018}, pages={318--322} }","chicago":"Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case.” In 4th IEEE International Conference on Network Softwarization (NetSoft 2018), 318--322. IEEE, 2018. https://doi.org/10.1109/NETSOFT.2018.8460029.","ama":"Dräxler S, Peuster M, Illian M, Karl H. Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case. In: 4th IEEE International Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:318--322. doi:10.1109/NETSOFT.2018.8460029","apa":"Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case. In 4th IEEE International Conference on Network Softwarization (NetSoft 2018) (pp. 318--322). Montreal: IEEE. https://doi.org/10.1109/NETSOFT.2018.8460029","ieee":"S. Dräxler, M. Peuster, M. Illian, and H. Karl, “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case,” in 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, 2018, pp. 318--322.","short":"S. Dräxler, M. Peuster, M. Illian, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322."},"type":"conference","conference":{"end_date":"2018-07-29","location":"Montreal","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","start_date":"2018-07-25"},"_id":"2480","date_created":"2018-04-24T12:11:36Z","status":"public","has_accepted_license":"1","file":[{"success":1,"relation":"main_file","date_updated":"2018-12-12T15:18:12Z","content_type":"application/pdf","file_id":"6195","creator":"ups","file_size":2211450,"access_level":"closed","date_created":"2018-12-12T15:18:12Z","file_name":"08460029.pdf"},{"date_created":"2019-01-24T10:17:00Z","file_name":"NetSoft18_RIS.pdf","access_level":"open_access","file_size":3445650,"creator":"sevilmeh","file_id":"6968","content_type":"application/pdf","date_updated":"2019-01-24T10:17:00Z","relation":"main_file"}],"file_date_updated":"2019-01-24T10:17:00Z","publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","author":[{"last_name":"Dräxler","id":"31764","first_name":"Sevil","full_name":"Dräxler, Sevil"},{"last_name":"Peuster","id":"13271","first_name":"Manuel","full_name":"Peuster, Manuel"},{"first_name":"Marvin","full_name":"Illian, Marvin","last_name":"Illian"},{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"}],"publisher":"IEEE","user_id":"31764","ddc":["004"],"abstract":[{"lang":"eng","text":"Understanding the behavior of the components of service function chains (SFCs) in different load situations is important for efficient and automatic management and orches- tration of services. For this purpose and for practical research in network function virtualization in general, there is a great need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of virtual network functions (VNFs) and the expected performance of the SFC, considering the individual performance of the VNFs as well as the interdependencies among VNFs within the SFC. We have designed our experiments focusing on video streaming, an important application in this context. We present examples of models for predicting the interdependence between resource demands and performance characteristics of SFCs using support vector regression and polynomial regression models. We also show practical evidence from our experiments that VNFs need to be benchmarked in their final chain setup, rather than individually, to capture important interdependencies that affect their performance. The data gathered from our experiments is publicly available."}],"language":[{"iso":"eng"}],"oa":"1","doi":"10.1109/NETSOFT.2018.8460029","date_updated":"2022-01-06T06:56:37Z","project":[{"_id":"23","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","grant_number":"762057"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"title":"Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case"},{"project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"publication_status":"published","department":[{"_id":"75"}],"title":" Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:56:38Z","date_created":"2018-04-24T12:14:00Z","status":"public","has_accepted_license":"1","file":[{"date_created":"2018-06-25T07:40:57Z","file_name":"RIS.pdf","access_level":"open_access","file_id":"3319","creator":"sevilmeh","file_size":1471937,"relation":"main_file","date_updated":"2018-06-25T07:40:57Z","content_type":"application/pdf"}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","file_date_updated":"2018-06-25T07:40:57Z","publisher":"IEEE","author":[{"id":"31764","last_name":"Dräxler","full_name":"Dräxler, Sevil","first_name":"Sevil"},{"first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","last_name":"Schneider","id":"35343"},{"first_name":"Holger","full_name":"Karl, Holger","last_name":"Karl","id":"126"}],"user_id":"477","ddc":["040"],"abstract":[{"text":"Network function virtualization requires scaling and placement, deciding the number and the location of function instances. Current approaches are limited in flexibility and practical applicability. Specifically, we study dynamic, single-step, joint scaling and placement of network services with bidirectional flows traversing Physical or Virtual Network Functions (VNFs) and returning to their sources. We develop models to support stateful components and legacy network functions with fixed locations in these network services as well as the possibility of reusing VNFs across network services. We formalize the problem of jointly scaling and placing such network services as a mixed- integer linear program (MILP). We show that this problem is NP-complete and also present a heuristic algorithm to find good solutions in short time. In an extensive evaluation with realistic scenarios, we investigate the capabilities of the two approaches.","lang":"eng"}],"page":"123--131","year":"2018","citation":{"chicago":"Dräxler, Sevil, Stefan Balthasar Schneider, and Holger Karl. “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions.” In 4th IEEE International Conference on Network Softwarization (NetSoft 2018), 123--131. IEEE, 2018.","apa":"Dräxler, S., Schneider, S. B., & Karl, H. (2018). Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions. In 4th IEEE International Conference on Network Softwarization (NetSoft 2018) (pp. 123--131). Montreal: IEEE.","ama":"Dräxler S, Schneider SB, Karl H. Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions. In: 4th IEEE International Conference on Network Softwarization (NetSoft 2018). IEEE; 2018:123--131.","mla":"Dräxler, Sevil, et al. “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions.” 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.","bibtex":"@inproceedings{Dräxler_Schneider_Karl_2018, title={ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, publisher={IEEE}, author={Dräxler, Sevil and Schneider, Stefan Balthasar and Karl, Holger}, year={2018}, pages={123--131} }","short":"S. Dräxler, S.B. Schneider, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.","ieee":"S. Dräxler, S. B. Schneider, and H. Karl, “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions,” in 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, 2018, pp. 123--131."},"type":"conference","conference":{"location":"Montreal","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)"},"urn":"24814","_id":"2481"},{"citation":{"bibtex":"@inproceedings{Dräxler_Karl_Razzaghi Kouchaksaraei_Machwe_Dent-Young_Katsalis_Samdanis, title={5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures}, booktitle={27th European Conference on Networks and Communications (EUCNC 2018)}, author={Dräxler, Sevil and Karl, Holger and Razzaghi Kouchaksaraei, Hadi and Machwe, Azahar and Dent-Young, Crispin and Katsalis, Kostas and Samdanis, Konstantinos} }","mla":"Dräxler, Sevil, et al. “5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures.” 27th European Conference on Networks and Communications (EUCNC 2018).","chicago":"Dräxler, Sevil, Holger Karl, Hadi Razzaghi Kouchaksaraei, Azahar Machwe, Crispin Dent-Young, Kostas Katsalis, and Konstantinos Samdanis. “5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures.” In 27th European Conference on Networks and Communications (EUCNC 2018), n.d.","ama":"Dräxler S, Karl H, Razzaghi Kouchaksaraei H, et al. 5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures. In: 27th European Conference on Networks and Communications (EUCNC 2018).","apa":"Dräxler, S., Karl, H., Razzaghi Kouchaksaraei, H., Machwe, A., Dent-Young, C., Katsalis, K., & Samdanis, K. (n.d.). 5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures. In 27th European Conference on Networks and Communications (EUCNC 2018). Ljubljana.","ieee":"S. Dräxler et al., “5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures,” in 27th European Conference on Networks and Communications (EUCNC 2018), Ljubljana.","short":"S. Dräxler, H. Karl, H. Razzaghi Kouchaksaraei, A. Machwe, C. Dent-Young, K. Katsalis, K. Samdanis, in: 27th European Conference on Networks and Communications (EUCNC 2018), n.d."},"type":"conference","year":"2018","language":[{"iso":"eng"}],"oa":"1","_id":"2482","date_updated":"2022-01-06T06:56:38Z","conference":{"location":"Ljubljana","start_date":"2018-07-18","name":"27th European Conference on Networks and Communications (EUCNC 2018)","end_date":"2018-07-21"},"publication_status":"accepted","status":"public","has_accepted_license":"1","date_created":"2018-04-24T12:17:15Z","project":[{"grant_number":"762057","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","_id":"23"}],"author":[{"last_name":"Dräxler","id":"31764","first_name":"Sevil","full_name":"Dräxler, Sevil"},{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"},{"last_name":"Razzaghi Kouchaksaraei","id":"60845","first_name":"Hadi","full_name":"Razzaghi Kouchaksaraei, Hadi"},{"last_name":"Machwe","full_name":"Machwe, Azahar","first_name":"Azahar"},{"full_name":"Dent-Young, Crispin","first_name":"Crispin","last_name":"Dent-Young"},{"last_name":"Katsalis","full_name":"Katsalis, Kostas","first_name":"Kostas"},{"last_name":"Samdanis","full_name":"Samdanis, Konstantinos","first_name":"Konstantinos"}],"file_date_updated":"2019-01-24T10:29:12Z","publication":"27th European Conference on Networks and Communications (EUCNC 2018)","file":[{"date_created":"2019-01-24T10:29:12Z","file_name":"eucnc18_RIS.pdf","access_level":"open_access","file_id":"6969","creator":"sevilmeh","file_size":215571,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-01-24T10:29:12Z"}],"ddc":["000"],"title":"5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures","user_id":"31764"},{"author":[{"first_name":"Sevil","full_name":"Dräxler, Sevil","last_name":"Dräxler","id":"31764"},{"first_name":"Manuel","full_name":"Peuster, Manuel","last_name":"Peuster","id":"13271"},{"last_name":"Illian","full_name":"Illian, Marvin","first_name":"Marvin"},{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"}],"status":"public","date_created":"2018-04-24T12:22:40Z","abstract":[{"lang":"eng","text":"Understanding the behavior of distributed cloud service components in different load situations is important for efficient and automatic management and orchestration of these services. For this purpose and for practical research in distributed cloud computing in general, there is need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of application components and the expected performance of applica- tions. We present initial results for predicting the interdependence between resource demands and performance characteristics using support vector regression and polynomial regression models. The data gathered from our experiments is publicly available."}],"user_id":"31764","ddc":["000"],"main_file_link":[{"url":"http://www.infosys.tuwien.ac.at/docs/proceedings.pdf#page=14","open_access":"1"}],"type":"report","citation":{"short":"S. Dräxler, M. Peuster, M. Illian, H. Karl, Towards Predicting Resource Demands and Performance of Distributed Cloud Services, Wien, Darmstadt, 2018.","ieee":"S. Dräxler, M. Peuster, M. Illian, and H. Karl, Towards Predicting Resource Demands and Performance of Distributed Cloud Services. Wien, Darmstadt, 2018.","chicago":"Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. Towards Predicting Resource Demands and Performance of Distributed Cloud Services. KuVS-Fachgespräch Fog Computing 2018. Wien, Darmstadt, 2018.","ama":"Dräxler S, Peuster M, Illian M, Karl H. Towards Predicting Resource Demands and Performance of Distributed Cloud Services. Wien, Darmstadt; 2018.","apa":"Dräxler, S., Peuster, M., Illian, M., & Karl, H. (2018). Towards Predicting Resource Demands and Performance of Distributed Cloud Services. Wien, Darmstadt.","mla":"Dräxler, Sevil, et al. Towards Predicting Resource Demands and Performance of Distributed Cloud Services. 2018.","bibtex":"@book{Dräxler_Peuster_Illian_Karl_2018, place={Wien, Darmstadt}, series={KuVS-Fachgespräch Fog Computing 2018}, title={Towards Predicting Resource Demands and Performance of Distributed Cloud Services}, author={Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}, year={2018}, collection={KuVS-Fachgespräch Fog Computing 2018} }"},"year":"2018","_id":"2483","department":[{"_id":"75"}],"project":[{"_id":"23","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","grant_number":"762057"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"publication_status":"published","place":"Wien, Darmstadt","related_material":{"link":[{"relation":"confirmation","url":"http://repositum.tuwien.ac.at/obvutwoa/content/titleinfo/2514843"}]},"title":"Towards Predicting Resource Demands and Performance of Distributed Cloud Services","series_title":"KuVS-Fachgespräch Fog Computing 2018","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:38Z","oa":"1"},{"conference":{"location":"Prag","start_date":"2018-07-10","name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","end_date":"2018-07-13"},"intvolume":" 107","_id":"2484","page":"51:1-51:24","year":"2018","type":"conference","citation":{"short":"B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.","ieee":"B. Feldkord et al., “Fully-Dynamic Bin Packing with Little Repacking,” in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Prag, 2018, vol. 107, pp. 51:1-51:24.","chicago":"Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.ICALP.2018.51.","apa":"Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., & Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, & D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2018.51","ama":"Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:10.4230/LIPIcs.ICALP.2018.51","mla":"Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:10.4230/LIPIcs.ICALP.2018.51.","bibtex":"@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107}, DOI={10.4230/LIPIcs.ICALP.2018.51}, booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors}, year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }"},"abstract":[{"text":"We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.","lang":"eng"}],"ddc":["000"],"user_id":"14052","publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","file_date_updated":"2018-10-31T16:58:18Z","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","author":[{"last_name":"Feldkord","id":"22704","first_name":"Björn","full_name":"Feldkord, Björn"},{"last_name":"Feldotto","id":"14052","first_name":"Matthias","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516"},{"first_name":"Anupam","full_name":"Gupta, Anupam","last_name":"Gupta"},{"full_name":"Guruganesh, Guru","first_name":"Guru","last_name":"Guruganesh"},{"first_name":"Amit ","full_name":"Kumar, Amit ","last_name":"Kumar"},{"last_name":"Riechers","first_name":"Sören","full_name":"Riechers, Sören"},{"full_name":"Wajc, David","first_name":"David","last_name":"Wajc"}],"file":[{"access_level":"closed","date_created":"2018-10-31T16:58:18Z","file_name":"LIPIcs-ICALP-2018-51.pdf","relation":"main_file","success":1,"date_updated":"2018-10-31T16:58:18Z","content_type":"application/pdf","creator":"feldi","file_id":"5227","file_size":723824}],"volume":107,"date_created":"2018-04-24T15:21:56Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:56:39Z","doi":"10.4230/LIPIcs.ICALP.2018.51","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"external_id":{"arxiv":["1711.01231"]},"place":"Dagstuhl, Germany","title":"Fully-Dynamic Bin Packing with Little Repacking","department":[{"_id":"541"},{"_id":"63"}],"publication_identifier":{"isbn":["978-3-95977-076-7"],"issn":["1868-8969"]},"publication_status":"published","editor":[{"last_name":"Chatzigiannakis","full_name":"Chatzigiannakis, Ioannis","first_name":"Ioannis"},{"first_name":"Christos","full_name":"Kaklamanis, Christos","last_name":"Kaklamanis"},{"first_name":"Dániel","full_name":"Marx, Dániel","last_name":"Marx"},{"last_name":"Sannella","first_name":"Donald","full_name":"Sannella, Donald"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Subproject C4","_id":"16"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:39Z","doi":"10.1145/3210377.3210389","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_status":"published","title":"Online Facility Location with Mobile Facilities","citation":{"short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.","ieee":"B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018, pp. 373–381.","apa":"Feldkord, B., & Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 373–381). Wien: ACM. https://doi.org/10.1145/3210377.3210389","ama":"Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2018:373-381. doi:10.1145/3210377.3210389","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 373–81. ACM, 2018. https://doi.org/10.1145/3210377.3210389.","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–81, doi:10.1145/3210377.3210389.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility Location with Mobile Facilities}, DOI={10.1145/3210377.3210389}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2018}, pages={373–381} }"},"type":"conference","year":"2018","page":"373 - 381 ","_id":"2485","conference":{"name":"SPAA'18","location":"Wien"},"file":[{"access_level":"closed","date_created":"2018-11-02T14:42:33Z","file_name":"p373-feldkord.pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:42:33Z","content_type":"application/pdf","file_id":"5280","creator":"ups","file_size":1207546}],"author":[{"id":"22704","last_name":"Feldkord","full_name":"Feldkord, Björn","first_name":"Björn"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publisher":"ACM","file_date_updated":"2018-11-02T14:42:33Z","publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","status":"public","has_accepted_license":"1","date_created":"2018-04-25T08:49:43Z","user_id":"477","ddc":["000"]},{"ddc":["040"],"title":"Business model idea generation: An exploratory study on changing perspectives","user_id":"477","author":[{"id":"36372","last_name":"Szopinski","full_name":"Szopinski, Daniel","first_name":"Daniel"},{"id":"21117","last_name":"Kundisch","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"publication":"2nd Business Model Conference","file_date_updated":"2018-11-12T13:24:21Z","department":[{"_id":"276"}],"file":[{"access_level":"closed","file_name":"BuMoCo2018_Standardization.pdf","date_created":"2018-11-12T13:24:21Z","success":1,"relation":"main_file","date_updated":"2018-11-12T13:24:21Z","content_type":"application/pdf","creator":"dsz","file_id":"5505","file_size":589100}],"status":"public","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"date_created":"2018-04-25T13:03:08Z","_id":"2490","date_updated":"2022-01-06T06:56:40Z","conference":{"end_date":"2018-06-07","location":"Florence, Italy","name":"2nd Business Model Conference","start_date":"2018-06-06"},"type":"conference_abstract","year":"2018","citation":{"chicago":"Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An Exploratory Study on Changing Perspectives.” In 2nd Business Model Conference, 2018.","ama":"Szopinski D, Kundisch D. Business model idea generation: An exploratory study on changing perspectives. In: 2nd Business Model Conference. ; 2018.","apa":"Szopinski, D., & Kundisch, D. (2018). Business model idea generation: An exploratory study on changing perspectives. In 2nd Business Model Conference. Florence, Italy.","mla":"Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An Exploratory Study on Changing Perspectives.” 2nd Business Model Conference, 2018.","bibtex":"@inproceedings{Szopinski_Kundisch_2018, title={Business model idea generation: An exploratory study on changing perspectives}, booktitle={2nd Business Model Conference}, author={Szopinski, Daniel and Kundisch, Dennis}, year={2018} }","short":"D. Szopinski, D. Kundisch, in: 2nd Business Model Conference, 2018.","ieee":"D. Szopinski and D. Kundisch, “Business model idea generation: An exploratory study on changing perspectives,” in 2nd Business Model Conference, Florence, Italy, 2018."},"language":[{"iso":"eng"}]}]