DigitalAngewandte InformatikAngewandte WirtschaftswissenschaftenZeitschriftenartikel
Marco Kretschmann, Andreas Fischer, Benedikt Elser
Extracting Keywords from Publication Abstracts for an Automated Researcher Recommendation System
Digitale Welt (Proceedings of the First International Symposium on Applied Artificial Intelligence in Conjunction with DIGICON), vol. 4, no. 1, pp. 20-25
2020
DOI: 10.1007/s42354-019-0227-2
Abstract anzeigen
This paper presents an automated keyword assignment system for scientific abstracts. That system is applied to paper abstracts collected in a local publication database and used to drive a researcher recommendation system. Problems like low data volume and missing keywords are discussed. For remediation, training is performed on an extended data set based on large online publication databases. Additionally a closer look at label imbalance in the dataset is taken. Ten multi-label classification algorithms for assigning keywords from a given catalogue to a scientific abstract are compared. The usage of binary relevance as transformation method with LightGBM as classifier yields the best results. Random oversampling before the training phase additionally increases the F1-Score by around 5-6%.
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
Andreas Fischer, A. Paler
On the analogy between quantum circuit design automation and virtual network embedding
Proceedings of 34th ACM/SIGAPP Symposium on Applied Computing (SAC'19) [April 8-12, 2019; Limassol, Cyprus], New York, NY, USA
2019
DOI: 10.1145/3297280.3297419
Abstract anzeigen
Quantum computing and network virtualisation share more similarities than it would seem on first thought: both reach their potential by using the underlying hardware as efficiently as possible - a classical computer science problem. Quantum computing research has already been focusing on key problems related to the scarcity of the quantum hardware, hoping that once scalable quantum computers will be available, quantum circuit design automation methods (QCDA) are mature. Consequently, a significant methodological apparatus exists for a technology envisioned to scale in the future. Likewise, the optimisation of resource assignment for virtual networks has received much attention in the literature. As such, any scalability improvement of virtual network embedding (VNE) would be of high practical importance in the present. There is an interesting and promising relationship between VNE and QCDA. This work introduces the possibility to use QCDA methodology for VNE, and vice versa. VNE problem instances can be modeled using the quantum circuit formalism, and we offer some basic examples. To the best of our knowledge, this is the first work that highlights this analogy.
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
Andreas Fischer, D. Bhamare, A. Kassler
On the Construction of Optimal Embedding Problems for Delay-Sensitive Sercice Function Chains
[Accepted for publication]
Proceedings of the 28th International Conference on Computer Communications and Networks (ICCCN 2019) [July 29-August 1, 2019; Valencia, Spain]
2019
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
Andreas Fischer
Generating Random Service Function Chain Embedding Problems
IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN’17) [Berlin; November 6-8, 2017]
2017
DOI: 10.1109/NFV-SDN.2017.8169834
Abstract anzeigen
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.
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
Andreas Fischer
Performance Evaluation for Service Function Chains through Automated Model Building
Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools (ValueTools2017) [Venice, Italy; December 5-7, 2017]
2017
DigitalElektrotechnik und MedientechnikHochschulschrift
Andreas Fischer
An Evaluation Methodology for Virtual Network Embedding
2017
Abstract anzeigen
The increasing scale and complexity of computer networks imposes a need for highly flexible management mechanisms. The concept of network virtualization promises to provide this flexibility. Multiple arbitrary virtual networks can be constructed on top of a single substrate network. This allows network operators and service providers to tailor their network topologies to the specific needs of any offered service.
However, the assignment of resources proves to be a problem. Each newly defined virtual network must be realized by assigning appropriate physical resources. For a given set of virtual networks, two questions arise: Can all virtual networks be accommodated in the given substrate network? And how should the respective resources be assigned? The underlying problem is commonly known as the Virtual Network Embedding problem.
A multitude of algorithms has already been proposed, aiming to provide solutions to that problem under various constraints. For the evaluation of these algorithms typically an empirical approach is adopted, using artificially created random problem instances. However, due to complex effects of random problem generation the obtained results can be hard to interpret correctly. A structured evaluation methodology that can avoid these effects is currently missing.
This thesis aims to fill that gap. Based on a thorough understanding of the problem itself, the effects of random problem generation are highlighted. A new simulation architecture is defined, increasing the flexibility for experimentation with embedding algorithms. A novel way of generating embedding problems is presented which migitates the effects of conventional problem generation approaches. An evaluation using these newly defined concepts demonstrates how new insights on algorithm behavior can be gained. The proposed concepts support experimenters in obtaining more precise and tangible evaluation data for embedding algorithms.
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
Andreas Fischer, R. Kühn, W. Mandarawi, H. Meer
Modeling Security Requirements for VNE algorithms
Proceedings of VALUETOOLS 2016/10th EAI International Conference on Performance Evaluation Methodologies and Tools (Taormina, Italy; October 25-28, 2016)
2016
Abstract anzeigen
Public and private Infrastructure as a Service (IaaS) clouds are widely used by individuals and organizations to provision flexible virtual computing resources on demand. Virtual Network Embedding (VNE) algorithms are employed in this context to provide an automated resource assignment. With multiple involved parties security-aware Virtual Machine (VM) placement becomes highly relevant for production environments. Moreover, VNE algorithms should also consider the security requirements of the interconnections between VMs, thereby extending the problem to networks. This paper discusses security requirements of Virtual Networks (VNs) and shows how they can be modeled in VNE to map them to the provided security mechanisms in the physical network. The paper also presents an implementation of this security-aware VNE model in the public simulation platform ALEVIN, demonstrating the applicability with a realistic use case of such a model.
DigitalElektrotechnik und MedientechnikZeitschriftenartikel
Andreas Fischer, H. Meer
Generating Virtual Network Embedding Problems with Guaranteed Solutions
IEEE Transactions on Network and Service Management, vol. 13, no. 3, pp. 1-14
2016
DOI: 10.1109/TNSM.2016.2596802
Abstract anzeigen
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.
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
Andreas Fischer, T. Kittel, B. Kolosnjaji, T. Lengyel, W. Mandarawi, H. Reiser, B. Taubmann, E. Weishäupl, H. Meer, T. Müller, M. Protsenko
CloudIDEA: A Malware Defense Architecture for Cloud Data Centers
Proceedings of the 5th International Symposium on Cloud Computing, Trusted Computing and Secure Virtual Infrastructures (C&TC 2015) [Rhodes, Greece; October 26-28, 2015]
2015
DigitalMobilElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
A. Cervero, M. Chincoli, L. Dittmann, Andreas Fischer, A. Garcia, J. Galan-Jimenez, L. Lefevre, H. Meer, T. Monteil, P. Monti, A.-C. Orgerie, L.-F. Pau, C. Phillips, S. Ricciardi, R. Sharrock, P. Stolf, T. Trinh, L. Valcarenghi
Green Wired Networks
Large-Scale Distributed Systems and Energy Efficiency: A Holistic View
2015
ISBN: 978-1-118-86463-0
DigitalElektrotechnik und MedientechnikZeitschriftenartikel
M. Beck, Andreas Fischer, J. Botero, C. Linnhoff-Popien, H. Meer
Distributed and scalable embedding of virtual networks
Journal of Network and Computer Applications, vol. 56, no. October, pp. 124-136
2015
DOI: 10.1016/j.jnca.2015.06.012
Abstract anzeigen
Abstract Network virtualization is widely regarded as a key technology for the Future Internet, enabling the deployment of new network protocols without changing dissimilar hardware devices. This leads to the problem of mapping virtual demands to physical resources, known as Virtual Network Embedding (VNE). Current VNE algorithms do not scale with respect to the substrate network size. Therefore, these algorithms are not applicable in large-scale scenarios where virtual networks have to be embedded in a timely manner. This paper discusses DPVNE, a Distributed and Generic VNE framework: It runs cost-oriented centralized embedding algorithms in a distributed way, spreading workload across the substrate network instead of concentrating it on one single node (as centralized algorithms do). Several state-of-the-art algorithms were evaluated running inside the DPVNE framework. Results show that DPVNE leads to runtime improvements in large-scale scenarios and embedding results are kept comparable.
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
M. Beck, Andreas Fischer, F. Kokot, C. Linnhoff-Popien, H. Meer
A Simulation Framework for Virtual Network Embedding Algorithms
Proceedings of the 16th International Telecommunications Network Strategy and Planning Symposium (Networks 2014) [Funchal, Madeira Island, Portugal; September 17-19, 2014]
2014
DOI: 10.1109/NETWKS.2014.6959238
Abstract anzeigen
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.
Elektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
J. Benze, Andreas Berl, K. Daniel, G. Eibl, D. Engel, Andreas Fischer, U. Hofmann, A. Kießling, S. Köpsell, L. Langer, H. Meer, C. Neureiter, M. Niedermeier, T. Pfeiffenberger, M. Pietsch, A. Veichtlbauer
VDE-Positionspapier Energieinformationsnetze und -systeme (Smart Grid Security)
VDE-Kongress 2014 Smart Cities (Intelligente Lösungen für das Leben in der Zukunft, Kongressbeiträge 20./21.10.2014, Frankfurt/Main, Messe), Berlin
2014
ISBN: 978-3-8007-3641-6
DigitalElektrotechnik und MedientechnikBeitrag (Sammelband oder Tagungsband)
Andreas Fischer, M. Beck, H. Meer
An Approach to Energy-efficient Virtual Network Embeddings
2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013) [Ghent, Belgium; May 27-31, 2013]
2013
ISBN: 978-1-4673-5229-1
Abstract anzeigen
Network Virtualization is recognized as a key technology for the Future Internet. Energy-efficiency is one of the main challenges in future networking environments. Most algorithms for mapping virtual resources to substrate resources however do not consider energy as a factor for the mapping. In order to evaluate the energy-efficiency of such a mapping, an energy model and appropriate energy-aware metrics are needed. This paper discusses how an algorithm can be modified to take energy-efficiency into account. The modified algorithm is then evaluated, showing that energy-efficiency can be increased with only a minor impact on embedding quality regarding other metrics.
Version: 2.1.2-qf2