Change search
Refine search result
1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Beck, Michael Till
    et al.
    Ludwig Maximilian University of Munich.
    Fischer, Andreas
    University of Passau.
    Kokot, Fabian
    University of Passau.
    Linnhoff-Popien, Claudia
    Ludwig Maximilian University of Munich.
    De Meer, Hermann
    University of Passau.
    A Simulation Framework for Virtual Network Embedding Algorithms2014In: 16th International Telecommunications Network Strategy and Planning Symposium (Networks), New York: IEEE, 2014, p. 1-6Conference 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.

  • 2.
    Fischer, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). ] Deggendorf Inst Technol, Elect Engn Media Tech & Comp Sci, Deggendorf, Germany.
    Generating Random Service Function Chain Embedding Problems2017In: 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.

  • 3.
    Fischer, Andreas
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Bhamare, Deval
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Kassler, Andreas
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT. Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    On the Construction of Optimal Embedding Problems for Delay-Sensitive Service Function Chains2019In: 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 (Refereed)
  • 4.
    Fischer, Andreas
    et al.
    University of Passau.
    Botero, Juan Felipe
    Universitat Politècnica de Catalunya.
    Beck, Michael Till
    University of Passau.
    De Meer, Hermann
    University of Passau.
    Hesselbach, Xavier
    Universitat Politècnica de Catalunya.
    Virtual Network Embedding: A Survey2013In: IEEE Communications Surveys and Tutorials, ISSN 1553-877X, E-ISSN 1553-877X, Vol. 15, no 4, p. 1888-1906Article in journal (Refereed)
    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.

  • 5.
    Fischer, Andreas
    et al.
    University of Passau.
    Botero, Juan Felipe
    Universitat Politècnica de Catalunya.
    Duelli, Michael
    University of Wuerzburg.
    Schlosser, Daniel
    University of Wuerzburg.
    Hesselbach, Xavier
    Universitat Politècnica de Catalunya.
    De Meer, Hermann
    University of Passau.
    ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms2011In: Electronic Communications of the EASST, E-ISSN 1863-2122, Vol. 37, p. 1-12Article in journal (Refereed)
    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.

  • 6.
    Fischer, Andreas
    et al.
    University of Passau, DEU.
    De Meer, Hermann
    University of Passau, DEU.
    Generating Virtual Network Embedding Problems with Guaranteed Solutions2016In: IEEE Transactions on Network and Service Management, ISSN 1932-4537, E-ISSN 1932-4537, Vol. 13, no 3, p. 504-517Article in journal (Refereed)
    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.

    Download full text (pdf)
    fulltext
  • 7.
    Khademi, Naeem
    et al.
    University of Oslo, Norway.
    Bozakov, Zdravko
    Dell EMC.
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Dale, Øystein
    University of Oslo, Norway.
    Damjanovic, Dragana
    Mozilla.
    Riktor Evensen, Kristian
    Celerway.
    Fairhurst, Gorry
    University of Aberdeen, UK..
    Fischer, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Grinnemo, Karl-Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Jones, Tom
    University of Aberdeen, UK.
    Mangiante, Simone
    Dell EMC.
    Petlund, Andreas
    Simula.
    Ros, David
    Simula.
    Rüngeler, Irene
    FH Münster, Germany.
    Stenberg, Daniel
    Mozilla.
    Tüxen, Michael
    FH Münster, Germany.
    Weinrank, Felix
    FH Münster, Germany.
    Welzl, Michael
    University of Oslo, Norway.
    Deliverable D2.3 - Final Version of Core Transport System2017Report (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.

    Download full text (pdf)
    fulltext
  • 8.
    Rubio-Loyola, Javier
    et al.
    CINVESTAV Tamaulipas.
    Astorga, Antonio
    Universitat Politècnica de Catalunya.
    Serrat, Joan
    Universitat Politècnica de Catalunya.
    Lefevre, Laurent
    INRIA Lyon.
    Cheniour, Abderhaman
    INRIA Lyon.
    Muldowney, David
    Waterford Institute of Technology.
    Davy, Steven
    Waterford Institute of Technology1.
    Galis, Alex
    University College London.
    Mamatas, Lefteris
    University College London.
    Clayman, Stuart
    University College London.
    Macedo, Daniel
    LIP6.
    Movahedi, Zeinab
    LIP6.
    Pujolle, Guy
    LIP6.
    Fischer, Andreas
    University of Passau.
    De Meer, Hermann
    University of Passau.
    Managability of Future Internet Networks from a Practical Viewpoint2010In: 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.

1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf