Wolfgang John
Research Subjects
Research Interests
Wolfgang John has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
Pontus Skoldstrom
9 shared publications- Catalin Meirosu
Ericsson Research, Stockholm, Sweden
7 shared publications Tomas Olovsson
Chalmers University of Technology
5 shared publicationsBertrand Pechenot
4 shared publications- Felicián Németh
Budapest University of Technology and Economics
4 shared publications Mario Kind
Deutsche Telekom AG, Germany
4 shared publications
Latest Publications
- Open Access
Evolving 5G: ANIARA, an Edge-Cloud perspective
Emerging use-cases like smart manufacturing and smart cities pose challenges in terms of latency, which cannot be satisfied by traditional centralized networks. Edge networks, which bring computational capacity closer to the users/clients, are a promising solution for supporting these critical low latency services. Different from traditional centralized networks, the edge is distributed by nature and is usually equipped with limited connectivity and compute capacity. This creates a complex network to handle, subject to failures of different natures, that requires novel solutions to work in practice. To reduce complexity, more lightweight solutions are needed for containerization as well as smart monitoring strategies with reduced overhead. Orchestration strategies should provide reliable resource slicing with limited resources, and intelligent scaling while preserving data privacy in a distributed fashion. Power management is also critical, as providing and managing a large amount of power at the edge is unprecedented.
Open AccessEvolving 5G: ANIARA, an Edge-Cloud perspective
Emerging use-cases like smart manufacturing and smart cities pose challenges in terms of latency, which cannot be satisfied by traditional centralized networks. Edge networks, which bring computational capacity closer to the users/clients, are a promising solution for supporting these critical low latency services. Different from traditional centralized networks, the edge is distributed by nature and is usually equipped with limited connectivity and compute capacity. This creates a complex network to handle, subject to failures of different natures, that requires novel solutions to work in practice. To reduce complexity, more lightweight solutions are needed for containerization as well as smart monitoring strategies with reduced overhead. Orchestration strategies should provide reliable resource slicing with limited resources, and intelligent scaling while preserving data privacy in a distributed fashion. Power management is also critical, as providing and managing a large amount of power at the edge is unprecedented.
- 25 September 2017
- Published by Wiley in International Journal of Network Management
- Vol. 28 (2)
Automatic data aggregation for recursively modeled NFV services
Summary: Network function virtualization (NFV) allows to model network services as graphs interconnecting virtual network functions (VNFs), which may include nested VNFs, modeled as subgraphs of VNFs or end points. To query the performance data of network services modeled as abstract and high‐level graphs is challenging because of the recursivity of the NFV architecture and the elasticity and dynamicity provided by the NFV infrastructure. We propose to use Datalog, a declarative logic programming language, to build a framework that supports efficient data aggregation for performance metrics of recursively modeled network services. We present our recursive query language for automatic and flexible decomposition and aggregation of NFV performance metrics and describe example use cases for both compute and network metrics. We also describe the design and implementation of a proof‐of‐concept query engine using the language. Our performance evaluation shows that the total query latency is dominated by retrieval times of performance metrics from infrastructure databases, and the time for execution and automatic decomposition of high‐level queries by the query engine itself increases linearly with the size of the service graph up to 1000 nodes. Hence, our evaluations show that the query engine scales well, bounded mainly by the limited execution capabilities of our test environment. Furthermore, it can handle multiple concurrent queries up to the concurrency limits of the backend database in use. The proposed query language and engine are thus effective in recursively retrieving performance metrics of NFV environments supporting large‐scale service graphs and large numbers of query requests.
- 25 September 2017
- Published by Wiley in International Journal of Network Management
- Vol. 28 (2)
Automatic data aggregation for recursively modeled NFV services
Summary: Network function virtualization (NFV) allows to model network services as graphs interconnecting virtual network functions (VNFs), which may include nested VNFs, modeled as subgraphs of VNFs or end points. To query the performance data of network services modeled as abstract and high‐level graphs is challenging because of the recursivity of the NFV architecture and the elasticity and dynamicity provided by the NFV infrastructure. We propose to use Datalog, a declarative logic programming language, to build a framework that supports efficient data aggregation for performance metrics of recursively modeled network services. We present our recursive query language for automatic and flexible decomposition and aggregation of NFV performance metrics and describe example use cases for both compute and network metrics. We also describe the design and implementation of a proof‐of‐concept query engine using the language. Our performance evaluation shows that the total query latency is dominated by retrieval times of performance metrics from infrastructure databases, and the time for execution and automatic decomposition of high‐level queries by the query engine itself increases linearly with the size of the service graph up to 1000 nodes. Hence, our evaluations show that the query engine scales well, bounded mainly by the limited execution capabilities of our test environment. Furthermore, it can handle multiple concurrent queries up to the concurrency limits of the backend database in use. The proposed query language and engine are thus effective in recursively retrieving performance metrics of NFV environments supporting large‐scale service graphs and large numbers of query requests.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1127-1130
Meeting the observability challenges for VNFs in 5G systems
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1127-1130
Meeting the observability challenges for VNFs in 5G systems
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 865-866
NFV service dynamicity with a DevOps approach
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 865-866
NFV service dynamicity with a DevOps approach
- 19 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 55 (1) , 204-211
Service Provider DevOps
Although there is consensus that software defined networking and network functions virtualization overhaul service provisioning and deployment, the community still lacks a definite answer on how carrier-grade operations praxis needs to evolve. This article presents what lies beyond the first evolutionary steps in network management, identifies the challenges in service verification, observability, and troubleshooting, and explains how to address them using our Service Provider DevOps (SP-DevOps) framework. We compendiously cover the entire process from design goals to tool realization and employ an elastic version of an industry-standard use case to show how on-the-fly verification, software-defined monitoring, and automated troubleshooting of services reduce the cost of fault management actions. We assess SP-DevOps with respect to key attributes of software-defined telecommunication infrastructures both qualitatively and quantitatively, and demonstrate that SP-DevOps paves the way toward carrier-grade operations and management in the network virtualization era.
- 19 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 55 (1) , 204-211
Service Provider DevOps
Although there is consensus that software defined networking and network functions virtualization overhaul service provisioning and deployment, the community still lacks a definite answer on how carrier-grade operations praxis needs to evolve. This article presents what lies beyond the first evolutionary steps in network management, identifies the challenges in service verification, observability, and troubleshooting, and explains how to address them using our Service Provider DevOps (SP-DevOps) framework. We compendiously cover the entire process from design goals to tool realization and employ an elastic version of an industry-standard use case to show how on-the-fly verification, software-defined monitoring, and automated troubleshooting of services reduce the cost of fault management actions. We assess SP-DevOps with respect to key attributes of software-defined telecommunication infrastructures both qualitatively and quantitatively, and demonstrate that SP-DevOps paves the way toward carrier-grade operations and management in the network virtualization era.
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 192-198
EPLE: An Efficient Passive Lightweight Estimator for SDN packet loss measurement
As Software Defined Networks (SDN) deployments are reaching mainstream, network performance becomes a key concern for success. Service Providers (SPs) rely on network management capabilities, such as packet loss monitoring, to observe the network status and thereby facilitate service-level agreements. On one hand, SPs seek tools providing greater visibility into the status of their networks, but on the other hand, they are keen to limit the overhead of management capabilities in their operational networks. To meet these conflicting requirements, Efficient Passive Lightweight Estimator (EPLE) takes advantage of existing network traffic and SDN signaling, without the need of extra monitoring traffic or facilities. EPLE does not introduce any data plane overhead and the signaling overhead is reduced by locally creating microflow descriptors out of aggregated flow definitions. Our proof-of-concept prototype shows that EPLE can estimate packet loss rates accurately while keeping the processing and signaling overheads small compared to existing active measurement methods.
- 1 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 192-198
EPLE: An Efficient Passive Lightweight Estimator for SDN packet loss measurement
As Software Defined Networks (SDN) deployments are reaching mainstream, network performance becomes a key concern for success. Service Providers (SPs) rely on network management capabilities, such as packet loss monitoring, to observe the network status and thereby facilitate service-level agreements. On one hand, SPs seek tools providing greater visibility into the status of their networks, but on the other hand, they are keen to limit the overhead of management capabilities in their operational networks. To meet these conflicting requirements, Efficient Passive Lightweight Estimator (EPLE) takes advantage of existing network traffic and SDN signaling, without the need of extra monitoring traffic or facilities. EPLE does not introduce any data plane overhead and the signaling overhead is reduced by locally creating microflow descriptors out of aggregated flow definitions. Our proof-of-concept prototype shows that EPLE can estimate packet loss rates accurately while keeping the processing and signaling overheads small compared to existing active measurement methods.
- 1 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 251-259
Recursively querying monitoring data in NFV environments
In Network Function Virtualization (NFV), a network service is created by combining interconnected virtual network functions (VNF), which may include nested VNFs or end points. Querying the performance of a high-level, abstract network service is challenging due to the recursivity of the NFV architecture and the elasticity and dynamicity provided by the NFV infrastructure, typically realized by Cloud virtualization technologies. In this paper, we propose to use Datalog, a declarative logic programming language, to build a query engine which can provide recursive query capabilities on performance metrics of network services. We present the language and describe some example use cases for both compute and network metrics. We describe the design of a query engine utilizing the language, based on which we implemented a proof of concept system. The resulting experimental system has shown the effectiveness of the query language to recursively retrieve monitoring results of NFV environments.
- 1 June 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 251-259
Recursively querying monitoring data in NFV environments
In Network Function Virtualization (NFV), a network service is created by combining interconnected virtual network functions (VNF), which may include nested VNFs or end points. Querying the performance of a high-level, abstract network service is challenging due to the recursivity of the NFV architecture and the elasticity and dynamicity provided by the NFV infrastructure, typically realized by Cloud virtualization technologies. In this paper, we propose to use Datalog, a declarative logic programming language, to build a query engine which can provide recursive query capabilities on performance metrics of network services. We present the language and describe some example use cases for both compute and network metrics. We describe the design of a query engine utilizing the language, based on which we implemented a proof of concept system. The resulting experimental system has shown the effectiveness of the query language to recursively retrieve monitoring results of NFV environments.
- Open Access
- 23 September 2015
- Published by Springer Nature
- p. 253-262
Formal Verification of Virtual Network Function Graphs in an SP-DevOps Context
- 23 September 2015
- Published by Springer Nature
- p. 253-262
Open AccessFormal Verification of Virtual Network Function Graphs in an SP-DevOps Context
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 61-66
Scalable Software Defined Monitoring for Service Provider DevOps
Technology trends such as Cloud, SDN, and NFV are transforming the telecommunications business, promising higher service flexibility and faster deployment times. They also allow for increased programmability of the infrastructure layers. We propose to split selected monitoring control functionality onto node-local control planes, thereby taking advantage of processing capabilities on programmable nodes. Our software defined monitoring approach provides telecom operators with a way to handle the trade off between high-granular monitoring information versus network and computation loads at central control and management layers. To illustrate the concept, a link rate monitoring function is implemented using node-local control plane components. Furthermore, we introduce a messaging bus for simple and flexible communication between monitoring function components as well as control and management systems. We investigate scalability gains with a numerical analysis, demonstrating that our approach would generate thousand fold less monitoring traffic while providing similar information granularity as a naive SNMP implementation or an Open Flow approach.
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 61-66
Scalable Software Defined Monitoring for Service Provider DevOps
Technology trends such as Cloud, SDN, and NFV are transforming the telecommunications business, promising higher service flexibility and faster deployment times. They also allow for increased programmability of the infrastructure layers. We propose to split selected monitoring control functionality onto node-local control planes, thereby taking advantage of processing capabilities on programmable nodes. Our software defined monitoring approach provides telecom operators with a way to handle the trade off between high-granular monitoring information versus network and computation loads at central control and management layers. To illustrate the concept, a link rate monitoring function is implemented using node-local control plane components. Furthermore, we introduce a messaging bus for simple and flexible communication between monitoring function components as well as control and management systems. We investigate scalability gains with a numerical analysis, demonstrating that our approach would generate thousand fold less monitoring traffic while providing similar information granularity as a naive SNMP implementation or an Open Flow approach.