{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:21:54Z","timestamp":1761402114279,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The autonomic composition of Virtual Networks (VNs) and Service Function Chains (SFCs) based on application requirements is significant for complex environments. In this paper, we use graph transformation in order to compose an Extended Virtual Network (EVN) that is based on different requirements, such as locations, low latency, redundancy, and security functions. The EVN can represent physical environment devices and virtual application and network functions. We build a generic Virtual Network Embedding (VNE) framework for transforming an Application Request (AR) to an EVN. Subsequently, we define a set of transformations that reflect preliminary topological, performance, reliability, and security policies. These transformations update the entities and demands of the VN and add SFCs that include the required Virtual Network Functions (VNFs). Additionally, we propose a greedy proactive heuristic for path-independent embedding of the composed SFCs. This heuristic is appropriate for real complex environments, such as industrial networks. Furthermore, we present an Industrail Internet of Things (IIoT) use case that was inspired by Industry 4.0 concepts, in which EVNs for remote asset management are deployed over three levels; manufacturing halls and edge and cloud computing. We also implement the developed methods in Alevin and show exemplary mapping results from our use case. Finally, we evaluate the chain embedding heuristic while using a random topology that is typical for such a use case, and show that it can improve the admission ratio and resource utilization with minimal overhead.<\/jats:p>","DOI":"10.3390\/a13090240","type":"journal-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T09:40:56Z","timestamp":1600767656000},"page":"240","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Policy-Based Composition and Embedding of Extended Virtual Networks and SFCs for IIoT"],"prefix":"10.3390","volume":"13","author":[{"given":"Waseem","family":"Mandarawi","sequence":"first","affiliation":[{"name":"Faculty of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany"}]},{"given":"J\u00fcrgen","family":"Rottmeier","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany"}]},{"given":"Milad","family":"Rezaeighale","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany"}]},{"given":"Hermann","family":"de Meer","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1109\/SURV.2013.013013.00155","article-title":"Virtual Network Embedding: A Survey","volume":"15","author":"Fischer","year":"2013","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TNSM.2016.2598420","article-title":"Resource Allocation in NFV: A Comprehensive Survey","volume":"13","author":"Herrera","year":"2016","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Mehraghdam, S., Keller, M., and Karl, H. (2014, January 8\u201310). Specifying and placing chains of virtual network functions. Proceedings of the 2014 IEEE 3rd International Conference on Cloud Networking (CloudNet), Luxembourg.","DOI":"10.1109\/CloudNet.2014.6968961"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ocampo, A.F., Gil-Herrera, J., Isolani, P.H., Neves, M.C., Botero, J.F., Latr\u00e9, S., Zambenedetti, L., Barcellos, M.P., and Gaspary, L.P. (2017). Optimal Service Function Chain Composition in Network Functions Virtualization. Security of Networks and Services in an All-Connected World, Proceedings of the 11th IFIP WG 6.6 International Conference on Autonomous Infrastructure, Management, and Security, AIMS 2017, Zurich, Switzerland, 10\u201313 July 2017, Springer International Publishing.","DOI":"10.1007\/978-3-319-60774-0_5"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Beck, M.T., and Botero, J.F. (2015, January 6\u201310). Coordinated Allocation of Service Function Chains. Proceedings of the 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, CA, USA.","DOI":"10.1109\/GLOCOM.2015.7417401"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Hirwe, A., and Kataoka, K. (2016, January 6\u201310). LightChain: A lightweight optimisation of VNF placement for service chaining in NFV. Proceedings of the 2016 IEEE NetSoft Conference and Workshops (NetSoft), Seoul, Korea.","DOI":"10.1109\/NETSOFT.2016.7502438"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1109\/TNSM.2019.2933872","article-title":"Service Function Chain Composition, Placement, and Assignment in Data Centers","volume":"16","author":"Wang","year":"2019","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Li, D., Hong, P., Xue, K., and Pei, J. (2018). Virtual Network Function Placement Considering Resource Optimization and SFC Requests in Cloud Datacenter. IEEE Trans. Parallel Distrib. Syst., 1.","DOI":"10.1109\/TPDS.2018.2802518"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Wang, Y., Li, Z., Xie, G., and Salamatian, K. (2017, January 14\u201316). Enabling automatic composition and verification of service function chain. Proceedings of the 2017 IEEE\/ACM 25th International Symposium on Quality of Service (IWQoS), Vilanova i la Geltru, Spain.","DOI":"10.1109\/IWQoS.2017.7969147"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"17595","DOI":"10.1109\/ACCESS.2017.2780991","article-title":"Constructing Service Function Chain Test Database: An Optimal Modeling Approach for Coordinated Resource Allocation","volume":"6","author":"Li","year":"2018","journal-title":"IEEE Access"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wang, M., Cheng, B., Zhao, S., Li, B., Feng, W., and Chen, J. (2019, January 8\u201313). Availability-Aware Service Chain Composition and Mapping in NFV-Enabled Networks. Proceedings of the 2019 IEEE International Conference on Web Services (ICWS), Milan, Italy.","DOI":"10.1109\/ICWS.2019.00028"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Beck, M.T., Linnhoff-Popien, C., Fischer, A., Kokot, F., and de Meer, H. (2014, January 17\u201319). A simulation framework for Virtual Network Embedding algorithms. Proceedings of the 2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks), Funchal, Portugal.","DOI":"10.1109\/NETWKS.2014.6959238"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Beck, M.T., Botero, J.F., and Samelin, K. (2016, January 7\u201310). Resilient allocation of service Function chains. Proceedings of the 2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), Palo Alto, CA, USA.","DOI":"10.1109\/NFV-SDN.2016.7919487"},{"key":"ref_14","unstructured":"(2020, September 14). 5 Top Industrial IoT Use Cases. Available online: https:\/\/www.ibm.com\/blogs\/internet-of-things\/top-5-industrial-iot-use-cases\/."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"4674","DOI":"10.1109\/TII.2018.2855198","article-title":"Deploying fog computing in industrial internet of things and industry 4.0","volume":"14","author":"Aazam","year":"2018","journal-title":"IEEE Trans. Ind. Inf."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (1997). Handbook of Graph Grammars and Computing by Graph Transformation, World Scientific.","DOI":"10.1142\/9789812384720"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Fischer, A., K\u00fchn, R., Mandarawi, W., and de Meer, H. (2016, January 25\u201328). Modeling Security Requirements for VNE Algorithms. Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools, Taormina, Italy.","DOI":"10.4108\/eai.25-10-2016.2266673"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Mandarawi, W., Chahed, H., and de Meer, H. (2020, January 8\u201311). A Framework for Virtualizing Time-aware Shaper Using High Performance NFV. Proceedings of the IEEE 25th International Conference on Emerging Technologies and Factory Automation, ETFA 2020, Vienna, Austria.","DOI":"10.1109\/ETFA46521.2020.9211960"},{"key":"ref_19","unstructured":"Chen, X., Zhang, D., Wang, X., Zhu, K., and Zhou, H. (2019, January 8\u201312). P4SC: Towards High-Performance Service Function Chain Implementation on the P4-Capable Device. Proceedings of the 2019 IFIP\/IEEE Symposium on Integrated Network and Service Management (IM), Arlington, VA, USA."},{"key":"ref_20","unstructured":"Ottmann, T., and Widmayer, P. (2002). Algorithmen und Datenstrukturen, 4. Auflage, Spektrum Akademischer Verlag."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","article-title":"Finding the k shortest paths","volume":"28","author":"Eppstein","year":"1998","journal-title":"SIAM J. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","volume":"6","author":"Waxman","year":"1988","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/9\/240\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:12:20Z","timestamp":1760177540000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/9\/240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,22]]},"references-count":23,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2020,9]]}},"alternative-id":["a13090240"],"URL":"https:\/\/doi.org\/10.3390\/a13090240","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,9,22]]}}}