Change search
Link to record
Permanent link

Direct link
Publications (8 of 8) Show all publications
Fischer, A., Bhamare, D. & Kassler, A. (2019). On the Construction of Optimal Embedding Problems for Delay-Sensitive Service Function Chains. In: Proceedings of the ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019: . Paper presented at ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019. IEEE
Open this publication in new window or tab >>On the Construction of Optimal Embedding Problems for Delay-Sensitive Service Function Chains
2019 (English)In: Proceedings of the ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019, IEEE, 2019, p. -28Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
IEEE, 2019
Series
Computer Communications and Networks, ISSN 1095-2055 ; 28
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-77387 (URN)000533348400113 ()9781728118574 (ISBN)
Conference
ICCCN 2019: 28th International Conference on Computer Communications and Networks, Valencia, Spain, July 29-August 1, 2019
Funder
Knowledge Foundation, 4707
Available from: 2020-03-31 Created: 2020-03-31 Last updated: 2020-12-22Bibliographically approved
Khademi, N., Bozakov, Z., Brunström, A., Dale, Ø., Damjanovic, D., Riktor Evensen, K., . . . Welzl, M. (2017). Deliverable D2.3 - Final Version of Core Transport System.
Open this publication in new window or tab >>Deliverable D2.3 - Final Version of Core Transport System
Show others...
2017 (English)Report (Refereed)
Abstract [en]

This document presents the core transport system in NEAT, as used for development of the reference implementation of the NEAT System. The document describes the components necessary to realise the basic Transport Services provided by the NEAT User API, with the description of a set of NEAT building blocks and their related design choices. The design of this core transport system, which is the final product ofWork Package 2, is driven by the Transport Services and API design from Task 1.4, and in close coordination with the overall NEAT architecture defined in Task 1.2. To realise the Transport Services provided by the API, a set of transport functions has to be provided by the NEAT Core Transport System. These functions take the form of several building blocks, or NEAT Components, each representing an associated implementation activity. Some components are needed to ensure the basic operation of the NEAT System—e.g., a NEAT Flow Endpoint, a callback-based NEAT API Framework, the NEAT Logic and the functionality to Connect to a name. Additional components are needed for: (a) ensuring connectivity, by means of mechanisms for discovery of path support for different protocols; (b) supporting end-to-end security; (c) the ability to apply different policies to influence the decision-making process of the transport system; (d) providing other important functionalities (e.g., a user-space SCTP stack, or gathering statistics for users or system administrators). This document updates Deliverable D2.2; in particular, the descriptions of NEAT components presented here correspond to their implementation status by the end of WP2, and as such they supersede those in D2.2.

Publisher
p. 131
National Category
Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-70623 (URN)
Projects
A New, Evolutive API and Transport-Layer Architecture for the Internet (NEAT)
Funder
EU, Horizon 2020, 644334
Available from: 2018-12-22 Created: 2018-12-22 Last updated: 2018-12-28Bibliographically approved
Fischer, A. (2017). Generating Random Service Function Chain Embedding Problems. In: 2017 IEEE Conference On Network Function Virtualization And Software Defined Networks (Nfv-Sdn): (pp. 79-84). IEEE
Open this publication in new window or tab >>Generating Random Service Function Chain Embedding Problems
2017 (English)In: 2017 IEEE Conference On Network Function Virtualization And Software Defined Networks (Nfv-Sdn), IEEE, 2017, p. 79-84Chapter in book (Other academic)
Abstract [en]

The combination of Software Defined Networking (SDN) and Network Function Virtualization (NFV) promises to provide highly flexible and configurable network infrastructures. This relies, however, on an efficient assignment of the respective Service Function Chain (SFC). This is related to Virtual Network Embedding (VNE), where algorithms are devised to provide such an assignment. To evaluate and compare the efficiency of such algorithms, well-designed embedding problems have to be generated. This paper presents a new mechanism for generating embedding problems: Problems are generated from a given set of SFCs such that each generated problem is known in advance to have an optimal solution. Experimenters can use this approach to investigate specific properties of embedding algorithms. The approach, thereby, facilitates more detailed evaluation.

Place, publisher, year, edition, pages
IEEE, 2017
Series
2017 IEEE CONFERENCE ON NETWORK FUNCTION VIRTUALIZATION AND SOFTWARE DEFINED NETWORKS (NFV-SDN)
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-66887 (URN)000426936400012 ()978-1-5386-3285-7 (ISBN)
Available from: 2018-03-29 Created: 2018-03-29 Last updated: 2018-12-28Bibliographically approved
Fischer, A. & De Meer, H. (2016). Generating Virtual Network Embedding Problems with Guaranteed Solutions. IEEE Transactions on Network and Service Management, 13(3), 504-517
Open this publication in new window or tab >>Generating Virtual Network Embedding Problems with Guaranteed Solutions
2016 (English)In: IEEE Transactions on Network and Service Management, ISSN 1932-4537, E-ISSN 1932-4537, Vol. 13, no 3, p. 504-517Article in journal (Refereed) Published
Abstract [en]

The efficiency of network virtualization depends on the appropriate assignment of resources. The underlying problem, called Virtual Network Embedding, has been much discussed in the literature, and many algorithms have been proposed, attempting to optimize the resource assignment in various respects. Evaluation of those algorithms requires a large number of randomly generated embedding scenarios. This paper presents a novel scenario generation approach and demonstrates how to produce scenarios with a guaranteed exact solution, thereby facilitating better evaluation of embedding algorithms.

Place, publisher, year, edition, pages
IEEE, 2016
Keywords
Virtual network embedding, network virtualization, problem generation, experimental algorithmics, algorithm simulation
National Category
Communication Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-48407 (URN)10.1109/TNSM.2016.2596802 (DOI)000384911900012 ()2-s2.0-84991442110 (Scopus ID)
Available from: 2017-04-28 Created: 2017-04-28 Last updated: 2021-11-29Bibliographically approved
Beck, M. T., Fischer, A., Kokot, F., Linnhoff-Popien, C. & De Meer, H. (2014). A Simulation Framework for Virtual Network Embedding Algorithms. In: 16th International Telecommunications Network Strategy and Planning Symposium (Networks): . Paper presented at 16th International Telecommunications Network Strategy and Planning Symposium (Networks 2014), Funchal, Portugal Sept. 17-19, 2014 (pp. 1-6). New York: IEEE
Open this publication in new window or tab >>A Simulation Framework for Virtual Network Embedding Algorithms
Show others...
2014 (English)In: 16th International Telecommunications Network Strategy and Planning Symposium (Networks), New York: IEEE, 2014, p. 1-6Conference paper, Published paper (Refereed)
Abstract [en]

Network virtualization is seen as an enabling technology for the Future Internet. In this context, many Virtual Network Embedding algorithms have been introduced in literature so far. This paper discusses an open source framework for the evaluation of such algorithms. The paper describes features provided by the framework, how to use the framework for evaluating these algorithms, and how to extend the software with respect to novel algorithms and simulation scenarios. Lessons learned are presented, describing how the software evolved towards a mature and highly extensible simulation framework.

Place, publisher, year, edition, pages
New York: IEEE, 2014
Keywords
Virtual Network Embedding, Simulation Framework, Evaluation
National Category
Media and Communication Technology
Identifiers
urn:nbn:se:kau:diva-48389 (URN)10.1109/NETWKS.2014.6959238 (DOI)000356141000055 ()978-1-4799-6515-1 (ISBN)
Conference
16th International Telecommunications Network Strategy and Planning Symposium (Networks 2014), Funchal, Portugal Sept. 17-19, 2014
Available from: 2017-05-09 Created: 2017-05-09 Last updated: 2019-05-27Bibliographically approved
Fischer, A., Botero, J. F., Beck, M. T., De Meer, H. & Hesselbach, X. (2013). Virtual Network Embedding: A Survey. IEEE Communications Surveys and Tutorials, 15(4), 1888-1906
Open this publication in new window or tab >>Virtual Network Embedding: A Survey
Show others...
2013 (English)In: IEEE Communications Surveys and Tutorials, ISSN 1553-877X, E-ISSN 1553-877X, Vol. 15, no 4, p. 1888-1906Article in journal (Refereed) Published
Abstract [en]

Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change. Application of this technology relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as “Virtual Network Embedding (VNE)” algorithms. This paper presents a survey of current research in the VNE area. Based upon a novel classification scheme for VNE algorithms a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.

Place, publisher, year, edition, pages
IEEE, 2013
Keywords
Virtual networks, network virtualization, virtual network embedding, embedding algorithms, network mapping
National Category
Media and Communication Technology
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-48405 (URN)10.1109/SURV.2013.013013.00155 (DOI)
Available from: 2017-05-09 Created: 2017-05-09 Last updated: 2020-05-22Bibliographically approved
Fischer, A., Botero, J. F., Duelli, M., Schlosser, D., Hesselbach, X. & De Meer, H. (2011). ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms. Electronic Communications of the EASST, 37, 1-12
Open this publication in new window or tab >>ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms
Show others...
2011 (English)In: Electronic Communications of the EASST, E-ISSN 1863-2122, Vol. 37, p. 1-12Article in journal (Refereed) Published
Abstract [en]

Network virtualization is recognized as an enabling technology for the Future Internet. Applying virtualization of network resources leads to the problem of mapping virtual resources to physical resources, known as “Virtual Network Embedding” (VNE). Several algorithms attempting to solve this problem have been discussed in the literature, so far. However, comparison of VNE algorithms is hard, as each algorithm focuses on different criteria. To that end, we introduce a framework to compare different algorithms according to a set of metrics, which allow to evaluate the algorithms and compute their results on a given scenario for arbitrary parameters.

Place, publisher, year, edition, pages
Limerick: ECEASST, 2011
Keywords
Virtual network, network virtualization, network embedding, embedding algorithms, evaluation framework
National Category
Media and Communication Technology
Identifiers
urn:nbn:se:kau:diva-48406 (URN)10.14279/tuj.eceasst.37.495.580 (DOI)
Available from: 2017-05-09 Created: 2017-05-09 Last updated: 2023-10-23Bibliographically approved
Rubio-Loyola, J., Astorga, A., Serrat, J., Lefevre, L., Cheniour, A., Muldowney, D., . . . De Meer, H. (2010). Managability of Future Internet Networks from a Practical Viewpoint. In: Tselentis, Georgios; Galis, Alex; Gavras, Anastasius; Krco, Srdjan; Lotz, Volkmar; Simperl, Elena; Stiller, Burkhard; Zahariadis, Theodore (Ed.), Towards the Future Internet - Emerging Trends from European Research: (pp. 105-114). IOS Press, 0
Open this publication in new window or tab >>Managability of Future Internet Networks from a Practical Viewpoint
Show others...
2010 (English)In: Towards the Future Internet - Emerging Trends from European Research / [ed] Tselentis, Georgios; Galis, Alex; Gavras, Anastasius; Krco, Srdjan; Lotz, Volkmar; Simperl, Elena; Stiller, Burkhard; Zahariadis, Theodore, IOS Press, 2010, Vol. 0, p. 105-114Chapter in book (Refereed)
Abstract [en]

The Autonomic Internet project [1] approach relies on abstractions and distributed systems of a five plane solution for the provision of Future Internet Services (OSKMV): Orchestration, Service Enablers, Knowledge, Management and Virtualisation Planes. This paper presents a practical viewpoint of the manageability of virtual networks, exercising the components and systems that integrate this approach and that are being validated. This paper positions the distributed systems and networking services that integrate this solution, focusing on the provision of Future Internet services for self-configuration and selfperformance management scenes.

Place, publisher, year, edition, pages
IOS Press, 2010
Keywords
Virtualisation, Management Plane, Knowledge Plane, Service Enablers Plane, Orchestration Plane, Self-configuration, Self-performance
National Category
Media and Communication Technology
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-48424 (URN)10.3233/978-1-60750-539-6-105 (DOI)
Available from: 2017-05-09 Created: 2017-05-09 Last updated: 2019-05-27Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-0074-5411

Search in DiVA

Show all publications