Efficient and reliable data transmission over networks is crucial for businesses, governments, and individuals in today's interconnected world, particularly for time-sensitive applications requiring reliable and timely data transmission. In modern networks, Quality of Service (QoS) switches are used to manage traffic flow and ensure that critical traffic is prioritized over non-critical traffic. The Buffer Management in QoS Switches problem aims to develop effective algorithms to ensure critical traffic is not lost while minimizing the impact on non-critical traffic. The goal of the algorithm is to control which packets are discarded and which are transmitted at each step. Online algorithms are often evaluated based on competitive analysis; (i.e., the ratio of the optimal offline cost to the cost achieved by online algorithms over worst-case instances).

Over the past few decades, Industrial Control Systems (ICSs) have been targeted by cyberattacks and are becoming increasingly vulnerable as more ICSs are connected to the internet. Using Machine Learning (ML) for Intrusion Detection Systems (IDS) is a promising approach for ICS cyber protection, but the lack of suitable datasets for evaluating ML algorithms is a challenge. Although there are a few commonly used datasets, they may not reflect realistic ICS network data, lack necessary features for effective anomaly detection, or be outdated. This paper presents the 'ICS-Flow' dataset, which offers network data and process state variables logs for supervised and unsupervised ML-based IDS assessment. The network data includes normal and anomalous network packets and flows captured from simulated ICS components and emulated networks. The anomalies were injected into the system through various attack techniques commonly used by hackers to modify network traffic and compromise ICSs. We also proposed open-source tools, `ICSFlowGenerator' for generating network flow parameters from Raw network packets. The final dataset comprises over 25,000,000 raw network packets, network flow records, and process variable logs. The paper describes the methodology used to collect and label the dataset and provides a detailed data analysis. Finally, we implement several ML models, including the decision tree, random forest, and artificial neural network to detect anomalies and attacks, demonstrating that our dataset can be used effectively for training intrusion detection ML models.

The steady evolution of the Open RAN concept sheds light on xApps and their potential use cases in O-RANcompliant deployments. There are several areas where xApps can be used that are being widely investigated, but the issue of mitigating conflicts between xApp decisions requires further in-depth investigation. This article defines a conflict mitigation framework (CMF) built into the existing O-RAN architecture; it enables the Conflict Mitigation component in O-RAN's Near- Real-Time RAN Intelligent Controller (Near-RT RIC) to detect and resolve all conflict types defined in the O-RAN Alliance's technical specifications. Methods for detecting each type of conflict are defined, including message flows between Near-RT RIC components. The suitability of the proposed CMF is proven with a simulation of an O-RAN network. Results of the simulation show that enabling the CMF allows balancing the network control capabilities of conflicting xApps to significantly improve network performance, with a small negative impact on its reliability. It is concluded that defining a unified CMF in Near-RT RIC is the first step towards providing a standardized method of conflict detection and resolution in O-RAN environments.

However, due to the limited recording capabilities Learning causal structure among event types from and storage capacities, retaining event's occurred times discrete-time event sequences is a particularly important with high-resolution is expensive or practically impossible in but challenging task. Existing methods, such many real-world applications, and we usually only can access as the multivariate Hawkes processes based methods, the corresponding discrete-time event sequences. For example, mostly boil down to learning the so-called in large wireless networks, the event sequences are usually Granger causality which assumes that the cause logged at a certain frequency by different devices whose event happens strictly prior to its effect event. Such time might not be accurately synchronized. As a result, lowresolution an assumption is often untenable beyond applications, discrete-time event sequences are obtained and the especially when dealing with discrete-time temporal precedence assumption will be frequently violated event sequences in low-resolution; and typical discrete in discrete-time event sequences, which raises a serious identifiability Hawkes processes mainly suffer from identifiability issue of causal discovery. For example, as shown issues raised by the instantaneous effect, in Figure 1, there are three event sequences produced by three i.e., the causal relationship that occurred simultaneously event types v

Federated Learning (FL) is a widely embraced paradigm for distilling artificial intelligence from distributed mobile data. However, the deployment of FL in mobile networks can be compromised by exposure to interference from neighboring cells or jammers. Existing interference mitigation techniques require multi-cell cooperation or at least interference channel state information, which is expensive in practice. On the other hand, power control that treats interference as noise may not be effective due to limited power budgets, and also that this mechanism can trigger countermeasures by interference sources. As a practical approach for protecting FL against interference, we propose Spectrum Breathing, which cascades stochastic-gradient pruning and spread spectrum to suppress interference without bandwidth expansion. The cost is higher learning latency by exploiting the graceful degradation of learning speed due to pruning. We synchronize the two operations such that their levels are controlled by the same parameter, Breathing Depth. To optimally control the parameter, we develop a martingale-based approach to convergence analysis of Over-the-Air FL with spectrum breathing, termed AirBreathing FL. We show a performance tradeoff between gradient-pruning and interference-induced error as regulated by the breathing depth. Given receive SIR and model size, the optimization of the tradeoff yields two schemes for controlling the breathing depth that can be either fixed or adaptive to channels and the learning process. As shown by experiments, in scenarios where traditional Over-the-Air FL fails to converge in the presence of strong interference, AirBreahing FL with either fixed or adaptive breathing depth can ensure convergence where the adaptive scheme achieves close-to-ideal performance.

Cloud native technology has revolutionized 5G beyond and 6G communication networks, offering unprecedented levels of operational automation, flexibility, and adaptability. However, the vast array of cloud native services and applications presents a new challenge in resource allocation for dynamic cloud computing environments. To tackle this challenge, we investigate a cloud native wireless architecture that employs container-based virtualization to enable flexible service deployment. We then study two representative use cases: network slicing and Multi-Access Edge Computing. To optimize resource allocation in these scenarios, we leverage deep reinforcement learning techniques and introduce two model-free algorithms capable of monitoring the network state and dynamically training allocation policies. We validate the effectiveness of our algorithms in a testbed developed using Free5gc. Our findings demonstrate significant improvements in network efficiency, underscoring the potential of our proposed techniques in unlocking the full potential of cloud native wireless networks.

Gaps, dropouts and short clips of corrupted audio are a common problem and particularly annoying when they occur in speech. This paper uses machine learning to regenerate gaps of up to 320ms in an audio speech signal. Audio regeneration is translated into image regeneration by transforming audio into a Mel-spectrogram and using image in-painting to regenerate the gaps. The full Mel-spectrogram is then transferred back to audio using the Parallel-WaveGAN vocoder and integrated into the audio stream. Using a sample of 1300 spoken audio clips of between 1 and 10 seconds taken from the publicly-available LJSpeech dataset our results show regeneration of audio gaps in close to real time using GANs with a GPU equipped system. As expected, the smaller the gap in the audio, the better the quality of the filled gaps. On a gap of 240ms the average mean opinion score (MOS) for the best performing models was 3.737, on a scale of 1 (worst) to 5 (best) which is sufficient for a human to perceive as close to uninterrupted human speech.

Qualcomm has agreed to acquire an Israeli fabless chipmaker called Autotalks, and according to TechCrunch, the deal will cost the company around $350 to $400 million. Autotalks creates chips and vehicle-to-everything (V2X) communication technologies dedicated towards boosting road safety for both ordinary and driverless vehicles. In its announcement, Qualcomm said that Autotalks' "production-ready, dual mode, standalone safety solutions" will be incorporated into the Snapdragon Digital Chassis, its set of cloud-connected assisted and autonomous driving technologies. Nakul Duggal, senior VP of automotive for Qualcomm Technologies, Inc., said in a statement: "We have been investing in V2X research, development and deployment since 2017 and believe that as the automotive market matures, a standalone V2X safety architecture will be needed for enhanced road user safety, as well as smart transportation system... We share Autotalks' decades-long experience and commitment to build V2X technologies and products with a focus on solving real-world road user safety challenges. We look forward to working together to deliver global V2X solutions that will help accelerate time-to-market and enable mass market adoption of this very important safety technology."

In this paper, we develop a deep learning (DL)-guided hybrid beam and power allocation approach for multiuser millimeter-wave (mmWave) networks, which facilitates swift beamforming at the base station (BS). The following persisting challenges motivated our research: (i) User and vehicular mobility, as well as redundant beam-reselections in mmWave networks, degrade the efficiency; (ii) Due to the large beamforming dimension at the BS, the beamforming weights predicted by the cutting-edge DL-based methods often do not suit the channel distributions; (iii) Co-located user devices may cause a severe beam conflict, thus deteriorating system performance. To address the aforementioned challenges, we exploit the synergy of supervised learning and super-resolution technology to enable low-overhead beam- and power allocation. In the first step, we propose a method for beam-quality prediction. It is based on deep learning and explores the relationship between high- and low-resolution beam images (energy). Afterward, we develop a DL-based allocation approach, which enables high-accuracy beam and power allocation with only a portion of the available time-sequential low-resolution images. Theoretical and numerical results verify the effectiveness of our proposed

This paper proposes regenerative particle Thompson sampling (RPTS), a flexible variation of Thompson sampling. Thompson sampling itself is a Bayesian heuristic for solving stochastic bandit problems, but it is hard to implement in practice due to the intractability of maintaining a continuous posterior distribution. Particle Thompson sampling (PTS) is an approximation of Thompson sampling obtained by simply replacing the continuous distribution by a discrete distribution supported at a set of weighted static particles. We observe that in PTS, the weights of all but a few fit particles converge to zero. RPTS is based on the heuristic: delete the decaying unfit particles and regenerate new particles in the vicinity of fit surviving particles. Empirical evidence shows uniform improvement from PTS to RPTS and flexibility and efficacy of RPTS across a set of representative bandit problems, including an application to 5G network slicing.