Annals of Telecommunications最新文献

SBRC 2024 special issue—cross-layer advances for resilient and intelligent communication systems SBRC 2024专题——弹性和智能通信系统的跨层进展

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-09-26 DOI: 10.1007/s12243-025-01116-x

Célio Albuquerque, Katia Obraczka, Diogo Menezes Ferrazani Mattos

引用次数: 0

EWMAX and NDIST: RSSI filtering mechanisms for handoff algorithms in dense networks EWMAX和NDIST：密集网络中切换算法的RSSI过滤机制

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-08-01 DOI: 10.1007/s12243-025-01112-1

Helga D. Balbi, Eduardo C. A. dos Santos, Diego Passos, Luiz C. S. Magalhães, Célio Albuquerque

引用次数: 0

Resource management for multi-service coexistence in 5 G/6 G NFV-MEC networks 5g / 6g NFV-MEC网络中多业务共存的资源管理

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-06-28 DOI: 10.1007/s12243-025-01105-0

Caio Bruno B. de Souza, Marcos Rocha de M. Falcão, Maria G. Lima Damasceno, Renata K. Gomes Dos Reis, Andson M. Balieiro

{"title":"Resource management for multi-service coexistence in 5 G/6 G NFV-MEC networks","authors":"Caio Bruno B. de Souza, Marcos Rocha de M. Falcão, Maria G. Lima Damasceno, Renata K. Gomes Dos Reis, Andson M. Balieiro","doi":"10.1007/s12243-025-01105-0","DOIUrl":"10.1007/s12243-025-01105-0","url":null,"abstract":"<div><p>Enabling the coexistence of multiple services on the same NFV-MEC network is challenging due to conflicting resource requirements, virtualization overhead, and potential processing failures, all within the strict resource constraints of the NFV-MEC node. Additionally, the critical nature of URLLC services often necessitates service prioritization, which can adversely impact the performance of eMBB applications. This paper addresses these challenges by designing a continuous-time Markov chain (CTMC)-based model that incorporates these features to analyze resource allocation for multiple coexisting services in an NFV-MEC system. Extensive analyses of energy consumption, availability, response time, and memory consumption are conducted across various system configurations. Results reveal that higher loads of URLLC services decrease system availability and increase response times for both service types. The study also finds that an increase in the number of containers does not necessarily lead to a proportional increase in energy consumption, and energy and memory consumption exhibit similar patterns due to their common usage during setup and active processing states. While increasing buffer size slightly improves service availability with minimal impact on energy consumption (as buffered requests do not use resources while in the queue), it negatively affects service response times.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"835 - 850"},"PeriodicalIF":2.2,"publicationDate":"2025-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On the quality of WebRTC-based videoconferencing under adverse and mobility scenarios 不利和移动场景下基于webbrtc的视频会议质量研究

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-06-20 DOI: 10.1007/s12243-025-01102-3

Arthur Böckmann Grossi, Roberto Irajá Tavares da Costa Filho, Luciano Paschoal Gaspary

引用次数: 0

Inferring change points in unlabelled time series data collected from the network diagnosis tool 推断从网络诊断工具收集的未标记时间序列数据中的变化点

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-06-18 DOI: 10.1007/s12243-025-01103-2

Cleiton M. de Almeida, Rosa M. M. Leão, Edmundo de Souza e Silva

{"title":"Inferring change points in unlabelled time series data collected from the network diagnosis tool","authors":"Cleiton M. de Almeida, Rosa M. M. Leão, Edmundo de Souza e Silva","doi":"10.1007/s12243-025-01103-2","DOIUrl":"10.1007/s12243-025-01103-2","url":null,"abstract":"<div><p>Detecting significant statistical changes in time series data, such as change points and anomalies, is crucial for various applications, including computer network performance monitoring. Despite the availability of many detection algorithms, applying these techniques to real-world data remains a challenging topic due to their distinct effectiveness in different domains. This study focuses on identifying change points and anomalies in throughput and latency time series data from residential networks, emphasizing online methods. We evaluate well-established methods like Shewhart, EWMA, and CUSUM, which are simple to implement, and identify their limitations in real-world scenarios. We propose simple modifications to these classical methods to enhance their effectiveness when applied to data from network measurements. Furthermore, we introduce a new and flexible method, based on the concept of weighted voting. It is designed to detect change points while providing useful information to assess confidence in the results. Our methods were evaluated on two datasets: one we collected using the NDT protocol in Brazil and another from the publicly available Shao Dataset, which includes labeled time series of latency. We discuss the limitations of traditional methods, the effectiveness of our proposed approaches, and how to apply those for real-time network quality monitoring.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"775 - 792"},"PeriodicalIF":2.2,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

ISIVC 2024 special issue—signal and audio processing, digital communications, and networking ISIVC 2024特刊-信号和音频处理，数字通信和网络

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-05-24 DOI: 10.1007/s12243-025-01099-9

Abdellah Adib, Sofia Ben Jebara, Raja Elassali, Khalid Minaoui, Samir Saoudi

引用次数: 0

End-to-end trusted computing architecture for vehicular over-the-air updates 车载无线更新的端到端可信计算架构

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-05-06 DOI: 10.1007/s12243-025-01096-y

Guilherme A. Thomaz, Thierno Barry, Matteo Sammarco, Miguel Elias M. Campista

{"title":"End-to-end trusted computing architecture for vehicular over-the-air updates","authors":"Guilherme A. Thomaz, Thierno Barry, Matteo Sammarco, Miguel Elias M. Campista","doi":"10.1007/s12243-025-01096-y","DOIUrl":"10.1007/s12243-025-01096-y","url":null,"abstract":"<div><p>Connected vehicles have software that must be updated to fix vulnerabilities or add new functionalities. While over-the-air updates prevent car owners from bringing their vehicles to a service center, they introduce significant security risks. This paper proposes a vehicular over-the-air update architecture combining the two most adopted trusted execution environment solutions: Intel SGX at the server and ARM TrustZone at the client. The main contribution is the protection of software updates from attackers that manipulate the entire operating system at both ends aiming to reverse engineering the software or introducing a malicious behavior. The implementation uses a device with OP-TEE and a software repository implemented with CACIC-DevKit. The paper also extends our previous work by evaluating an alternative server implementation using Gramine-SGX. Our experiments reveal that the impact of the TEE is negligible, even for small software block transfers. Compared with CACIC-DevKit, Gramine-SGX doubles the latency, despite the development simplification. This indicates that CACIC-DevKit better suits a high mobility scenario, such as vehicular networks, where the connection with the server may be short term.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"823 - 834"},"PeriodicalIF":2.2,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reducing communication overhead through one-shot model pruning in federated learning 通过联邦学习中的一次性模型修剪减少通信开销

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-05-05 DOI: 10.1007/s12243-025-01097-x

Rómulo Bustincio, Allan M. de Souza, Joahannes B. D. da Costa, Luis F. G. Gonzalez, Luiz F. Bittencourt

{"title":"Reducing communication overhead through one-shot model pruning in federated learning","authors":"Rómulo Bustincio, Allan M. de Souza, Joahannes B. D. da Costa, Luis F. G. Gonzalez, Luiz F. Bittencourt","doi":"10.1007/s12243-025-01097-x","DOIUrl":"10.1007/s12243-025-01097-x","url":null,"abstract":"<div><p>In the realm of federated learning, a collaborative yet decentralized approach to machine learning, communication efficiency is a critical concern, particularly under constraints of limited bandwidth and resources. This paper evaluates FedSNIP, a novel method that leverages the SNIP (Single-shot Network Pruning based on Connection Sensitivity) technique within this context. By utilizing SNIP, FedSNIP effectively prunes neural networks, converting numerous weights to zero and resulting in sparser weight representations. This substantial reduction in weight density significantly decreases the volume of parameters that need to be communicated to the server, thereby reducing the communication overhead. Our experiments on the CIFAR-10 and UCI-HAR dataset demonstrate that FedSNIP not only lowers the data transmission between clients and the server but also maintains competitive model accuracy, comparable to conventional federated learning models. Additionally, we analyze various compression algorithms applied after pruning, specifically evaluating the compressed sparse row, coordinate list, and compressed sparse column formats to identify the most efficient approach. Our results show that compressed sparse row not only compresses the data more effectively and quickly but also achieves the highest reduction in data size, making it the most suitable format for enhancing the efficiency of federated learning, particularly in scenarios with restricted communication capabilities.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"901 - 913"},"PeriodicalIF":2.2,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Transport efficiency for data-intensive science: deployment experiences and bottleneck analysis 数据密集型科学的传输效率：部署经验和瓶颈分析

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-04-24 DOI: 10.1007/s12243-025-01094-0

Vitor F. Zanotelli, Edgard C. Pontes, Magnos Martinello, Jordi Ros-Giralt, Everson S. Borges, Giovanni Comarela, Moisés R. N. Ribeiro, Harvey Newman

{"title":"Transport efficiency for data-intensive science: deployment experiences and bottleneck analysis","authors":"Vitor F. Zanotelli, Edgard C. Pontes, Magnos Martinello, Jordi Ros-Giralt, Everson S. Borges, Giovanni Comarela, Moisés R. N. Ribeiro, Harvey Newman","doi":"10.1007/s12243-025-01094-0","DOIUrl":"10.1007/s12243-025-01094-0","url":null,"abstract":"<div><p>Transferring massive datasets in data-intensive science (DIS) systems often relies on physical WAN infrastructure for network connectivity. This infrastructure is typically provided by various National Research and Education Networks (NRENs), including ESnet, GÉANT, Internet2, and RNP. Studying these systems presents significant challenge due to their complexity, scale, and the numerous factors influencing data transport. Traditionally, network performance studies focus on a single bottleneck. In contrast, the Quantitative Theory of Bottlenecks Structures (QTBS) provides a mathematical framework that analyzes performance through the network’s entire bottleneck structure, offering valuable insights for optimizing and understanding overall network performance. This paper tackles such challenges by employing QTBS and by deploying and evaluating a virtual infrastructure for data transport within a national-scale WAN. Our approach focuses on three key aspects: (i) assessing flow completion times related to bandwidth allocation for interdependent transfers within a network slice, (ii) evaluating the performance of TCP congestion control algorithms (BBR versus Cubic) for data transport, and (iii) conducting QTBS analysis to compute flow allocation shares, ultimately aiming for an optimal design. Results show BBR outperforming Cubic in scenarios with high number of threads and data volume and the high influence of the number of threads.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"793 - 805"},"PeriodicalIF":2.2,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Analyzing the stability, efficiency, and cost of a dynamic data replica balancing architecture for HDFS 分析HDFS动态数据副本均衡架构的稳定性、效率和成本

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-04-23 DOI: 10.1007/s12243-025-01093-1

Rhauani Weber Aita Fazul, Odorico Machado Mendizabal, Patrícia Pitthan Barcelos

{"title":"Analyzing the stability, efficiency, and cost of a dynamic data replica balancing architecture for HDFS","authors":"Rhauani Weber Aita Fazul, Odorico Machado Mendizabal, Patrícia Pitthan Barcelos","doi":"10.1007/s12243-025-01093-1","DOIUrl":"10.1007/s12243-025-01093-1","url":null,"abstract":"<div><p>Hadoop Distributed File System (HDFS) is known for its specialized strategies and policies tailored to enhance replica placement. This capability is critical for ensuring efficient and reliable access to data replicas, particularly as HDFS operates best when data are evenly distributed within the cluster. In this paper, we build upon earlier practical evaluations and conduct a thorough analysis of the replica balancing process in HDFS, focusing on two critical performance metrics: stability and efficiency. We evaluated these aspects alongside balancing operational cost by contrasting them with conventional HDFS solutions and employing a novel dynamic architecture for data replica balancing. On top of that, we delve into the optimizations in data locality brought about by effective replica balancing and their benefits for data-intensive applications, including enhanced read performance. Our findings reveal the extent to which data imbalance in HDFS directly affects the file system and highlight the struggles of the default replica placement policy in maintaining cluster balance. We examined the real but intricate and temporary effectiveness of on-demand balancing, underscoring the importance of regular and adaptable balancing interventions. This reaffirms the significance of context-aware replica balancing, as provided by the proposed dynamic architecture, not only for maintaining data equilibrium but also for ensuring efficient system performance.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"867 - 883"},"PeriodicalIF":2.2,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0