Michael Welzl

Michael Welzl

Auto-generated profile, based on publicly available information

Michael Welzl

University of Oslo, Oslo, Norway

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 August 2024 in IEEE Internet Computing
Verified
Journal Article
Closed access
TMTobias Meuser
Tobias Meuser
Lauri LovénLauri Lovén
Lauri Lovén
MBMonowar H. Bhuyan
Monowar H. Bhuyan
SPShishir G. Patil
Shishir G. Patil
Schahram DustdarSchahram Dustdar
Schahram Dustdar
MWMichael Welzl
Michael Welzl
Edge artificial intelligence (AI) is an innovative computing paradigm that aims to shift the training and inference of machine learning models to the edge of the network. This paradigm offers the opportunity to significantly impact our everyday lives with new services such as autonomous driving and ubiquitous personalized health care. Nevertheless, bringing intelligence to the edge involves several major challenges, which include the need to constrain model architecture designs, the secure distribution and execution of the trained models, and the substantial network load required to distribute the models and data collected for training. In this article, we highlight key aspects in the development of edge AI in the past and connect them to current challenges. This article aims to identify research opportunities for edge AI, relevant to bring together the research in the fields of artificial intelligence and edge computing.

12 June 2017 in IEEE Communications Magazine
Verified
Journal Article
Closed access
NKNaeem Khademi
Naeem Khademi
DRDavid Ros
David Ros
MWMichael Welzl
Michael Welzl
ZBZdravko Bozakov
Zdravko Bozakov
Anna BrunstromAnna Brunstrom
Anna Brunstrom
FWFelix Weinrank
Felix Weinrank
The sockets API has become the standard way that applications access the transport services offered by the IP stack. This article presents NEAT, a user space library that can provide an alternate transport API. NEAT allows applications to request the service they need using a new design that is agnostic to the specific choice of transport protocol underneath. This not only allows applications to take advantage of common protocol machinery, but also eases introduction of new network mechanisms and transport protocols. The article describes the components of the NEAT library and illustrates the important benefits that can be gained from this new approach. NEAT is a software platform for developing advanced network applications that was designed in accordance with the standardization efforts on transport services in the IETF, but its features exceed the envisioned functionality of a TAPS system.

15 February 2006
Verified
Conference Paper
Open access
MAM. Ali
M. Ali
MWM. Welzl
M. Welzl
MZM. Zwicknagl
M. Zwicknagl
SHS. Hellebrand
S. Hellebrand
According to International Technology Roadmap for Semiconductors (ITRS), before the end of this decade we will be entering the era of a billion transistors on a single chip. However, it has been observed that as the system grows, so does the complexity of integrating various components on a chip. The major threat toward the achievement of a billion transistor chip is poor scalability of current interconnect structure of today's SoCs as presented by Benini and De Michelli (2002). In order to cope with growing interconnect infrastructure, the "network on chip (NoC)" concept was introduced. With network methodologies coming on-chip, various characteristics of traditional networks come into play. So far, failures that are common in regular networks were hardly considered on-chip; this paper introduces ideas of dynamic routing and congestion control in the context of NoCs and explains how they could be applied to cope with adverse physical effects of deep sub-micron technology.

6 August 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
DHDavid A. Hayes
David A. Hayes
MWMichael Welzl
Michael Welzl
SFSimone Ferlin
Simone Ferlin
DRDavid Ros
David Ros
SISafiqul Islam
Safiqul Islam
Most Internet hosts today support multiple access technologies and network interfaces. Multipath transport protocols, like MPTCP, are being deployed (e.g., in smartphones), allowing transparent simultaneous use of multiple links. Besides providing increased resilience to link failures, multipath transports may better exploit available (aggregate) capacity across all interfaces. The safest way to ensure fairness is to assume that any subflows of a multipath end-to-end connection may share bottleneck links, but knowledge of non-shared bottlenecks could allow multipath senders to exploit more capacity without being unfair to other flows. The problem of reliably detecting the existence of (non)-shared bottlenecks is not trivial and is compounded by the fact that bottlenecks may change due to traffic dynamics. In this paper we focus on practical methods to reliably group flows that share, possibly dynamic, bottlenecks online and in a passive manner (i.e., without injecting measurement traffic). We introduce a novel dynamic clustering algorithm that we apply to update our previous shared bottleneck flow grouping (SBFG) method standardized by the IETF, based on delay statistics. We also adapt an offline SBFG method based on wavelet filters to enable it for online operation. These SBFG methods are evaluated by a simple testbed, rigorous simulation and real-world Internet experiments in a testbed comprised of multihomed hosts. Our results suggest that there is no clear winner, and selection of the ``best'' SBFG method will have to consider tradeoffs regarding accuracy, lag, and application requirements.

1 June 2011
Verified
Report
Open access
PDF file
MWM. Welzl
M. Welzl
DRD. Ros
D. Ros
This document provides a survey of transport protocols that are designed to have a smaller bandwidth and/or delay impact on standard TCP than standard TCP itself when they share a bottleneck with it. Such protocols could be used for delay-insensitive "background" traffic, as they provide what is sometimes called a "less than" (or "lower than") best-effort service.

6 December 2011 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
MSMichael Schier
Michael Schier
MWMichael Welzl
Michael Welzl
This work proposes a quality-oriented, real-time capable prioritization technique for media units of H.264/AVC video streams. The derivation of estimates is based on the analysis of the macroblock partitioning, the spatial extents of temporal dependencies, and the length and strength of prediction chains existing among macroblocks, thus incorporating the expected impact of error propagation. It is demonstrated how the prioritization scheme can be beneficially integrated into live streaming systems which are characterized by tight timing constraints, with the focus on content-aware selective automatic repeat request mechanisms. Additionally, it is shown how potentially limited feedback can be used to adapt the estimation process to leverage prediction preciseness. The approach is compared against existing techniques in terms of practicability and efficiency, and tested under independent and bursty loss conditions in a wired and a wireless test setup. Moreover, the performance is examined when low-latency and constant bitrate video settings are enforced by using x264's novel encoding feature periodic-intra-refresh. Results of both experiments and simulations indicate that the proposed technique outperforms all reference techniques in nearly all test cases, and that the video quality can be further improved by incorporating receiver feedback.