Browse the ITC publications of previous conferences below or visit our grouppage at bibsonomy.org
2025
Diletta Olliaro, Michela Meo, Matteo Sereno, Andrea Marin, Marco Ajmone Marsan
Energy/Performance Trade-Off in RANs with Dynamic Management of Frequency Bands
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Energy/Performance Trade-Off in RANs with Dynamic Management of Frequency Bands },
year = { 2025 },
address = { Trondheim, Norway },
author = { Diletta Olliaro, Michela Meo, Matteo Sereno, Andrea Marin, Marco Ajmone Marsan },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9 }
}
Abstract: The on-demand activation of frequency bands in radio access networks can lead to a significant reduction of power consumption, but risks to adversely impact performance. This approach to frequency band management can be applied either to a group of colocated base stations whose operators adopt a network sharing approach or to a single base station that uses multiple frequency bands. We develop a stochastic model based on the Matrix Geometric Method for the quantification of system performance and power consumption in the case of coexisting streaming and elastic services. By computing numerical results in a specific setting, we show that the on-demand (de)activation succeeds in greatly reducing power consumption with respect to the case in which frequency bands are always active, with limited impact on the performance experienced by users. We also show that the introduction of a hysteresis in the frequency band activation/deactivation process allows the optimization of the trade-off between performance and power consumption. Finally, we show that performance is not drastically altered by the burstyness of the elastic service request arrival process, and we prove that the separate analysis of streaming and elastic services provides quite optimistic results with respect to the joint analysis made possible by our model.
Mert Yildiz, Alexey Rolich, Andrea Baiocchi
Dispatching Odyssey: Exploring Performance in Computing Clusters under Real-World Workloads
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Dispatching Odyssey: Exploring Performance in Computing Clusters under Real-World Workloads },
year = { 2025 },
address = { Trondheim, Norway },
author = { Mert Yildiz, Alexey Rolich, Andrea Baiocchi },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: Recent workload measurements in Google data centers provide an opportunity to challenge existing models and, more broadly, to enhance the understanding of dispatching policies in computing clusters. Through extensive data-driven simulations, we aim to highlight the key features of workload traffic traces that influence response time performance under simple yet representative dispatching policies. For a given computational power budget, we vary the cluster size, i.e., the number of available servers. A job-level analysis reveals that Join Idle Queue (JIQ) and Least Work Left (LWL) exhibit an optimal working point for a fixed utilization coefficient as the number of servers is varied, whereas Round Robin (RR) demonstrates monotonously worsening performance. Additionally, we explore the accuracy of simple G/G queue approximations. When decomposing jobs into tasks, interesting results emerge. The simpler, non-size-based policy JIQ appears to outperform the more "powerful" size-based LWL policy. We provide insights into these results and suggest promising directions for fully explaining the observed phenomena.
Thu Le-Anh , Tuan Phung-Duc
A Fast Algorithm for Multiserver Queueing Systems with Setup Times and Power-saving Modes
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { A Fast Algorithm for Multiserver Queueing Systems with Setup Times and Power-saving Modes },
year = { 2025 },
address = { Trondheim, Norway },
author = { Thu Le-Anh , Tuan Phung-Duc },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: Multi-server queueing models with setup times have been extensively investigated due to their applications in data centers, which have rapidly expanded in recent years. These models employ an ON-OFF policy to reduce energy consumption for idle servers, though this can increase delay due to setup processes. To minimize the drawback of the ON-OFF policy, a setup queueing model with a power-saving policy was recently proposed in [9], enabling servers in a power-saving mode to process incoming jobs while simultaneously setting up to a normal mode. Our paper considers the same model but adopts a generating function approach rather than the matrix geometric method as in [9]. Our approach provides exact expressions for the joint stationary queue length distribution, generating functions, and factorial moments of any order. By exploiting the special structure of the Markov chain, the generating function approach achieves significant reductions in computational complexity compared to existing methods. In addition, this paper presents numerical experiments to evaluate the performance-energy trade-off using an existing speed-based cost function.
Tim Neubert, Rolf Winter, Jonas Winkler
On The Evolution of Home Gateways
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { On The Evolution of Home Gateways },
year = { 2025 },
address = { Trondheim, Norway },
author = { Tim Neubert, Rolf Winter, Jonas Winkler},
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: Most commonly, residential broadband customers connect to the internet via a home gateway. These devices are often quite capable and feature-rich, implementing essential functions such as Network Address Translation (NAT), but they also feature a WiFi access point, they come with a number of switch ports and offer a host of upper-layer functionalities such as parental control or a built-in media server. Since we are all behind such a device most of the time, they really shape the way we experience the internet. And for that, the most basic services, such as DNS forwarding or Network Address Translation must work well. But do they? About 15 years ago, a measurement study characterized a large number of such devices at the time. But in the last 15 years a lot has happened. This paper has another look at home gateway characteristics and reproduces those findings to see whether things have improved since. It relies on a diverse router population with devices released over the course of the last 20 years and also includes devices that are still included as part of residential broadband packages of ISPs today.
Leonardo Badia, Paolo Castagno, Vincenzo Mancuso, Matteo Sereno, Marco Ajmone Marsa
Server Selection and Inference Rate Optimization in AoI-Driven Distributed Systems
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Server Selection and Inference Rate Optimization in AoI-Driven Distributed Systems },
year = { 2025 },
address = { Trondheim, Norway },
author = { Leonardo Badia, Paolo Castagno, Vincenzo Mancuso, Matteo Sereno, Marco Ajmone Marsa},
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: Many of today's user applications are both time-critical and computationally intensive. A typical example is provided by assisted- and self-driving systems, where the data collected by onboard sensors must be fused over network computing elements, possibly using artificial intelligence (AI) tools, to accurately reconstruct a vehicle's environment in a sufficiently short time to guarantee safe operations. Our study considers this example, but also covers more general cases, and extends to any system in which independent sources generate time-critical queries for networked services. Obtaining good performance in these cases requires the careful engineering of both communication networks and computing facilities. In addition, when multiple computation facilities are available to run AI processes (in the fog, edge or cloud, or even on the device itself), users running those time-critical and computationally intensive applications experience the dilemma of which remote resource to use so as to obtain results within the limited available time budget. This does not necessarily imply the choice of the fastest servers, as they may end up getting congested by multiple requests. In this paper, we use optimization and game theory to analyze the balance of user updates among remote AI engines, as well as the choice of the intensity of user traffic, trying to optimize the age of information (AoI) that users experience on their time-critical AI-assisted processes. We show that targeting the minimization of AoI leads to non-trivial server selection and data injection policies, and that the unavoidable price of anarchy of systems that enforce a distributed AI server selection can be low, as long as autonomous adaptation of the individual injection rate of the users is properly kept under control.
Daniela Renga, Michela Meo, Loutfi Nuaymi
Network Sharing: a pathway to Sustainability and Carbon Footprint Mitigation in Radio Access Networks
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Network Sharing: a pathway to Sustainability and Carbon Footprint Mitigation in Radio Access Networks },
year = { 2025 },
address = { Trondheim, Norway },
author = { Daniela Renga, Michela Meo, Loutfi Nuaymi },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: The extensive densification of radio access networks (RANs) aims to cope with the staggering increase in mobile traffic demand. However, this process raises remarkable concerns due to the resulting growth in RAN energy consumption and the associated carbon footprint. This paper examines the potential of network sharing (NS) among mobile network operators (MNOs) as a sustainable alternative to network densification, addressing energy and environmental challenges in RAN operation. By enabling the recurrent deactivation of base stations (BSs) during periods of low traffic demand, NS offers a promising approach to reduce energy consumption. We investigate the energy savings achievable under two NS strategies across various area types, analyzing the impact of dynamically adjusting NS parameters over time. Additionally, the interplay between BS sleep mode duration and the frequency of BS switching operations reveals conflicting effects on BS degradation. Our study evaluates these effects, demonstrating how the proposed NS strategies can effectively extend BS lifetimes. In addition to energy savings, our results highlight the significant benefits of NS in mitigating the RAN carbon footprint, achieved through reductions in both operational and embodied carbon emissions.
Lukas Prause, Mark Akselrod
Sender-Based Approach to Reducing the Bufferbloat in Heterogeneous 5G Networks
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Sender-Based Approach to Reducing the Bufferbloat in Heterogeneous 5G Networks },
year = { 2025 },
address = { Trondheim, Norway },
author = { Lukas Prause, Mark Akselrod },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 5}
}
Abstract: The current 5G networks are demonstrably capable of delivering very high data rates. To maintain high data rates even under variable network conditions, they usually rely on very large network buffers that can store the data in poor channel conditions and output it again when conditions improve. In such cases, a TCP sender using loss-based congestion control will usually only experience increased latency. However, while the channel conditions are poor, the sender does not adjust its send rate and continues to fill up the buffer, which leads to bufferbloat.
In this paper, we address the bufferbloat problem caused by loss-based TCP congestion control in networks with variable link capacities, especially in heterogeneous 5G environments. Drawing inspiration from CoDel, we propose a method that discards packets at the TCP sender when the RTT exceeds a predefined upper bound for a fixed time interval. Our approach can be deployed on the TCP sender side, eliminating the need for changes by network providers. We developed our method by identifying optimal parameters using link emulation and validated its performance with both stationary and mobile measurements in a commercial 5G NSA-NR network in Hannover, Germany.
Daniel Kopp, Oliver Hohlfeld
DDoS on Repeat: Measuring Pulse-Wave DDoS in the Wild
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { DDoS on Repeat: Measuring Pulse-Wave DDoS in the Wild },
year = { 2025 },
address = { Trondheim, Norway },
author = { Daniel Kopp, Oliver Hohlfeld },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: DDoS cyberattacks continue to be a significant threat, leading to substantial financial and reputational losses for their victims. Despite extensive research, certain aspects of the DDoS landscape, such as phenomenon of pulse-wave attacks, remain insufficiently addressed. This paper aims to fill this gap by investigating the character- istics and prevalence of pulsed DDoS attacks in the wild. Despite historical and recent references, no study quantified these attacks on the Internet. The scarcity of measurement studies could be attributed to uncertainty and the inherent challenge of identifying pulsed DDoS attacks or lack of awareness of the extent of these attacks, as they can be easily monitored. Leveraging a dataset captured at a major IXP over four months, we identify pulse- wave attacks from sampled flow-traces, providing insight into 10,000 DDoS attacks. Surprisingly, we observe that 27% of all observed DDoS attacks can be attributed to pulse-wave DDoS events. This shows that pulsed DDoS attacks have emerged as a significant attack tactic and should be considered in future work.
Florian Wiedner, Dominik Kreutzer, Jonas Andre, Georg Carle
Continuous Integration for Networks Supporting Low-Latency Using Hybrid Network Emulation
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Continuous Integration for Networks Supporting Low-Latency Using Hybrid Network Emulation },
year = { 2025 },
address = { Trondheim, Norway },
author = { Florian Wiedner, Dominik Kreutzer, Jonas Andre, Georg Carle },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: Enabling continuous integration (CI) cycles for network protocols and services poses a significant challenge due to the necessity of building complete and complex networks for testing and verification. This process demands robust simulation, emulation, or a variety of hardware resources.
For non-latency, throughput-sensitive services that deal with best-effort traffic, tools like Mininet or ns3 can be utilized effectively. However, latency-sensitive applications require verification in circumstances that closely resemble real-world environments. Tools such as ns3 operate at an abstraction level that is too high to accurately reflect reality, while original Mininet, by relying on virtual Ethernet pairs, tends to lack realistic latency.
To address this challenge, we propose using Mininet as a standard and reproducible API, enhanced with Single-Root-IO-Virtualization (SR-IOV)-based connections when stability and lower latencies are paramount. This approach enables us to test and verify working configurations in a straightforward, non-hardware-supported environment, allowing the final stages of our CI process to progress towards more stable products without the necessity to adapt scripts or configurations due to reusing the same API for different underlying technologies. Our findings demonstrate that incorporating SR-IOV into network emulation can potentially double the usable bandwidth and significantly enhance both stability and latency.
Fidan Mehmeti, Wolfgang Kellerer
Providing Throughput Guarantees in Multi-Domain Networks in 6G
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Continuous Integration for Networks Supporting Low-Latency Using Hybrid Network Emulation },
year = { 2025 },
address = { Trondheim, Norway },
author = { Florian Wiedner, Dominik Kreutzer, Jonas Andre, Georg Carle },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: While the deployment of 5G networks is going on at a high pace, the research and industrial community have already started looking into the next generation of cellular networks, 6G. One of the main features envisioned in 6G are multi-domain networks, where both public networks (owned by cellular network operators) and private networks (owned by different users/institutions) will be deployed and would need to inter-operate in order to provide a satisfying level of service to the users. However, as these networks are operated by different entities, it is very challenging to provide end-to-end guarantees to a user whose data traverse multiple networks before reaching the destination, either in terms of the maximum latency, minimum throughput, or reliability. In this work, we focus on soft throughput guarantees. The approach we follow here is to use statistical knowledge from the activity of users or their data rate if the latter is constant, which can be obtained by the corresponding networks, in other network domains to determine the throughput range. We provide an analytical approach that determines this range, depending on how narrow the range needs to be. The evaluation is performed on input data from a publicly-available dataset. Results show that the soft guarantees lead to unchanged low-variability end-to-end throughput with more efficient resource utilization (an improvement of 18%) than to focus on strict rates and/or policies oblivious to other networks, such as Round-robin.
Rim Sayegh, Hela Marouane, Sahar Hoteit, Abdulhalim Dandoush
Mobility Aware Task Migration in Vehicular Edge Computing Networks
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = {Mobility Aware Task Migration in Vehicular Edge Computing Networks },
year = { 2025 },
address = { Trondheim, Norway },
author = { Rim Sayegh, Hela Marouane, Sahar Hoteit, Abdulhalim Dandoush },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract: With the emergence of autonomous vehicles and the ever-increasing data reported, providing the required latency and computational capabilities is becoming challenging. To address this issue, multi-access edge computing (MEC) for 3GPP 5G Cellular vehicles to everything (C-V2X) has been proposed recently. In this paper, we propose the Mobility Aware Task Migration (MATM) algorithm that strives the limitations of the benchmark algorithms that the MEC orchestrator utilizes for offloading tasks from vehicles. We provide a detailed simulation-based study for End-to-End (E2E) delay by serving the safety application as a function of different network densities. Firstly, we propose an extension to the location service defined in the ETSI MEC reference architecture; this extension enables the MEC service to send a migration notification to the MEC orchestrator to start the migration. Secondly, we introduce an enhancement to the MEC orchestrator module to enable task migration during vehicle mobility by selecting the most suitable MEC host with the closest proximity to the vehicle. Additionally, we use the Simu5G simulator to implement our scenario and conduct an evaluation of task offloading algorithms, and a detailed E2E delay analysis. Simulation results highlight the ability of our proposed algorithm to minimize E2E delay while ensuring fairness in resource allocation.
Simon Raffeck, Sebastian Gilje Grøsvik, Laura Becker, Stanislav Lange, Stefan Geissler, Thomas Zinner, Wolfgang Kellerer, Tobias Hoßfeld
A Discrete-Time Model of the 5G New Radio Uplink Channels
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { A Discrete-Time Model of the 5G New Radio Uplink Channel },
year = { 2025 },
address = { Trondheim, Norway },
author = { Simon Raffeck, Sebastian Gilje Grøsvik, Laura Becker, Stanislav Lange, Stefan Geissler, Thomas Zinner, Wolfgang Kellerer, Tobias Hoßfeld },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 9}
}
Abstract:The introduction of 5G comes with significant advancements over LTE in both core and radio domains, with a shift to microservices in the core and enhanced flexibility in the radio access network. While these changes boost performance, it comes at the cost of increased complexity in the radio access and core configuration, particularly in the radio domain. This complexity is heightened by use case-specific 5G deployments in campus and industrial networks, making the selection of optimal configuration parameters a challenging task. To address this, we present a discrete-time queueing model for the 5G New Radio uplink channel, capable of predicting key performance indicators (KPIs) such as the one-way delay as well as analyzing the channel's impact on traffic streams. The model is validated through simulations and comparisons with 5G campus network measurements.
Youcef Magnouche, Sebastien Martin, Jeremie Leguay, Cong Mei
Scalable Verification of Routing Loops in Multi-Protocol Multi-Instance IP Networks
In 36th International Teletraffic Congress (ITC-36). Trondheim, Norway 2025
[BibTeX]
[Abstract]
[Download]
[BibSonomy]
@inproceedings{ ,
title = { Scalable Verification of Routing Loops in Multi-Protocol Multi-Instance IP Networks },
year = { 2025 },
address = { Trondheim, Norway },
author = { Youcef Magnouche, Sebastien Martin, Jeremie Leguay, Cong Mei },
booktitle = { 36th International Teletraffic Congress (ITC-36) },
month = { June},
pages = { 1 -- 5}
}
Abstract:Routing loops in IGP networks (OSPF, IS-IS) can easily appear due to misconfigurations of routing policies as it is difficult for network administrators to define loop-free policies in large-scale multi-instance and multi-protocol environments. In this paper, we present a scalable verification solution analyzing routing configuration and policies. We first provide examples of common routing loop scenarios and analyze the most popular root causes. We then introduce efficient algorithms to detect loops indeed by preferences and route imports. As output, these algorithms automatically provide explanations so that end users can break them. We present a performance evaluation over a large IP RAN (Radio Access Network) and details about our implementation.
