Network Links Research Articles

Optical turbulence profiling at the Table Mountain Facility with the Laser Communication Relay Demonstration GEO downlink

We report the first measurement of the atmospheric optical turbulence profile using the transmitted beam from a satellite laser communication terminal. A ring image next generation scintillation sensor (RINGSS) instrument for turbulence profiling, as described in Tokovinin [MNRAS 502, 747 (2021)10.1093/mnras/staa4049], was deployed at the NASA/Jet Propulsion Laboratory’s Table Mountain Facility (TMF) in California. The optical turbulence profile was measured with the downlink optical beam from the Laser Communication Relay Demonstration (LCRD) geostationary satellite. LCRD conducts links with the Optical Communication Telescope Laboratory ground station and the RINGSS instrument was co-located at TMF to conduct measurements. Turbulence profiles were measured at day and night and atmospheric coherence lengths were compared with other turbulence monitors such as a solar scintillometer and Polaris motion monitor. RINGSS sensitivity to boundary layer turbulence, a feature not provided by many profilers, is also shown to agree with a boundary layer scintillometer at TMF (R = 0.85). Diurnal evolution of optical turbulence and measured profiles are presented. The correlation of RINGSS with other turbulence monitors (R = 0.75 − 0.86) demonstrates the concept of free-space optical communications turbulence profiling, which could be adopted as a way to support optical ground stations in a future Geostationary feeder link network. These results also provide further evidence that RINGSS, a relatively new instrument concept, correlates well with other instruments in daytime and nighttime turbulence.

Hardware Compression Method for On-Chip and Interprocessor Networks with Wide Channels and Wormhole Flow Control Policy

Increasing the number of processing cores is currently a common way to boost processor performance. However, the load on the memory subsystem consequently increases as the number of its agents grows. Hardware data compression is an unconventional approach to improving memory subsystem performance by reducing, firstly, the main memory access rate by increasing the cache capacity and, secondly, data traffic by packing the data more densely. The paper describes the implementation of hardware data compression in the on-chip network and interprocessor links of a configuration with wide data transmission channels and a wormhole flow control policy. The existing solutions cannot be applied to such configurations because they are essentially based on using narrow data channels and flow control policies implying uninterrupted packet transmission, which is not maintained with the wormhole flow control. The method proposed in this paper enables the use of hardware compression in the aforementioned configuration by moving data compression and decompression from networks to the connected devices, as well as by using a number of optimizations to hide the data processing delays. Optimizations of some specific cases, such as the transmission of large data packets with several cache lines or the transmission of zero data, are considered. Special attention is given to data transmission via interprocessor links, where, due to their lower bandwidth compared to the on-chip network, data compression can be the most beneficial. The increase in memory subsystem bandwidth from using hardware data compression was confirmed in the experiments showing the relative IPC increase in SPEC CPU2017 benchmarks up to 14 percent.

Links between the actors and mining activities related to the implementation of sustainable development principles

AbstractThe uninterrupted supply of raw materials is essential to implement low‐carbon technologies. Therefore, the sustainable extraction of these materials is crucial. One of its important aspects is the analysis of the interaction between the actors as well as the actions undertaken by them. This study explores the characteristics of the network of links between social actors and the supporting and inhibitory actions related to sustainable development that the mining industry and its possible implications with collaboration and conflict between actors. Our methodological approach consisted in building two bipartite networks based on actor‐action interaction, identified thanks to the literature review of sustainability initiatives of mining companies. Applying network analysis, we examine the structural characteristics of the networks and the strength of links between social actors. The results highlighted that “Government,” “Local society,” and “Indigenous peoples” have a critical position in the network of “Supporting” and “Inhibitory” actions. They are those who could articulate with other social actors to create collaborative processes in the implementation of actions that contribute to sustainable development by the mining industry. However, from the analysis of the structure of the network of “Inhibitory” actions, these three actors are the ones who could be relevant in the dynamics of the development of conflicts with the mining industry. This study presents, from the dual perspective (“Supporting” and “Inhibitory” actions), the characteristics of the systems of relationships between social actors and their possible implications for the design, as well as implementation of sustainable strategies in the mining sector.

AIGO-DTI: Predicting Drug-Target Interactions Based on Improved Drug Properties Combined with Adaptive Iterative Algorithms.

Artificial intelligence-based methods for predicting drug-target interactions (DTIs) aim to explore reliable drug candidate targets rapidly and cost-effectively to accelerate the drug development process. However, current methods are often limited by the topological regularities of drug molecules, making them difficult to generalize to a broader chemical space. Additionally, the use of similarity to measure DTI network links often introduces noise, leading to false DTI relationships and affecting the prediction accuracy. To address these issues, this study proposes an Adaptive Iterative Graph Optimization (AIGO)-DTI prediction framework. This framework integrates atomic cluster information and enhances molecular features through the design of functional group prompts and graph encoders, optimizing the construction of DTI association networks. Furthermore, the optimization of graph structure is transformed into a node similarity learning problem, utilizing multihead similarity metric functions to iteratively update the network structure to improve the quality of DTI information. Experimental results demonstrate the outstanding performance of AIGO-DTI on multiple public data sets and label reversal data sets. Case studies, molecular docking, and existing research validate its effectiveness and reliability. Overall, the method proposed in this study can construct comprehensive and reliable DTI association network information, providing new graphing and optimization strategies for DTI prediction, which contribute to efficient drug development and reduce target discovery costs.

RDCSAE-RKRVFLN: A unified deep learning framework for robust and accurate DOA estimation

This paper introduces an innovative unified deep learning (DL) model, “reduced deep convolutional stack autoencoder (RDCSAE)-robust kernel-based random vector functional link network (RKRVFLN)” (RDCSAE-RKRVFLN), for addressing practical challenges like phase and gain uncertainty, mutual coupling effects, and element position errors in direction of arrival (DOA) estimation. The RDCSAE utilizes deep convolutional neural network (DCNN) and stack autoencoder (SAE) for robust feature extraction. The RKRVFLN integrates a concise SAE output with kernel-based learning. Thus, the integration of RDCSAE (suitable for unsupervised feature extraction) and RKRVFLN (for supervised learning) in the developed model results in efficient use of limited training data. Performance metrics of this method include among others the accuracy (separation between sources), root mean square error (RMSE), signal-to-noise ratio (SNR), etc. The method performs better than existing data driven methods in terms of computational efficiency, faster learning speed, enhanced model generalization, higher accuracy, and shorter event regression time and empirical methods. In the presence of above mentioned four perturbations, this method successfully resolves multiple sources with a resolution of 0.3° with a RMSE of 0.00376. For real time application, the paper implements RDCSAE-RKRVFLN on a high-speed reconfigurable Xilinx Virtex-5 field-programmable gate array (FPGA) realizing a digital DOA estimator for one source. The hardware estimates the DOA with a maximum error of 0.01953125 which follows closely the simulation results indicating the efficiency and feasibility of the method.

Improved performance of a shunt hybrid active power filter by a robust exponential functional link network-based nonlinear adaptive filter control to enhance power quality

This research article details the design and implementation of a nonlinear adaptive filtering (NAF) technique using an exponential functional link network (EFLN) for a shunt hybrid active power filter (SHAPF) control to solve the current-associated power quality issues on the utility side at the distribution level of electrical power systems. Separation of the fundamental component from the harmonics, achieving unity power factor operation, reducing the reactive power drawn from the source, balancing the currents during transients, and reduction of total harmonic distortion (THD) of the source current are the issues considered to resolve. The proposed technique solves these issues by generating the sinusoidal reference current and separating the fundamental current from the harmonics. When compared to conventional and existing adaptive filtering techniques such as least mean square (LMS), least mean fourth (LMF), and variable step size LMS (VSS-LMS), the proposed EFLN-NAF method excels in terms of speedy convergence, adaptability in noise-specific environments and reduced steady-state coefficient error. MATLAB/Simulink software is utilized to perform the simulations to examine the suggested strategy for the chosen SHAPF topology both in static and dynamic scenarios. For a 15 kW and 3kVAr requirement of the nonlinear load, simulation results proved that the designed PPF for 2kVAr is able to share the reactive power with the APF, thereby reducing its rating and cost. The proposed method of filtering has been proven to be fast converging with 0.049 s, and the THD in steady state is brought to 1.32 % in steady-state and to 3.77 % during transient conditions, which are under standard limits. A hardware prototype of the experimental setup is constructed at the laboratory scale with OPAL-RT (OP4510) as the controller. With an active and reactive power demand of 1.1 kW and 210VAr, the designed PPF supplies 110 VAr, whereas the rest is supplied by the APF. The practical THD in source current is observed to be 2.081 %, which meets the standards. The results from both simulations and experiments are validated, and the efficacy of the proposed technique in mitigating the aforementioned power quality issues is proved.

Link Prediction in Complex Networks Using Average Centrality-Based Similarity Score.

Link prediction plays a crucial role in identifying future connections within complex networks, facilitating the analysis of network evolution across various domains such as biological networks, social networks, recommender systems, and more. Researchers have proposed various centrality measures, such as degree, clustering coefficient, betweenness, and closeness centralities, to compute similarity scores for predicting links in these networks. These centrality measures leverage both the local and global information of nodes within the network. In this study, we present a novel approach to link prediction using similarity score by utilizing average centrality measures based on local and global centralities, namely Similarity based on Average Degree (SACD), Similarity based on Average Betweenness (SACB), Similarity based on Average Closeness (SACC), and Similarity based on Average Clustering Coefficient (SACCC). Our approach involved determining centrality scores for each node, calculating the average centrality for the entire graph, and deriving similarity scores through common neighbors. We then applied centrality scores to these common neighbors and identified nodes with above average centrality. To evaluate our approach, we compared proposed measures with existing local similarity-based link prediction measures, including common neighbors, the Jaccard coefficient, Adamic-Adar, resource allocation, preferential attachment, as well as recent measures like common neighbor and the Centrality-based Parameterized Algorithm (CCPA), and keyword network link prediction (KNLP). We conducted experiments on four real-world datasets. The proposed similarity scores based on average centralities demonstrate significant improvements. We observed an average enhancement of 24% in terms of Area Under the Receiver Operating Characteristic (AUROC) compared to existing local similarity measures, and a 31% improvement over recent measures. Furthermore, we witnessed an average improvement of 49% and 51% in the Area Under Precision-Recall (AUPR) compared to existing and recent measures. Our comprehensive experiments highlight the superior performance of the proposed method.

Multicore embedded sensing system based on lightweight neural network

ABSTRACT To the complexity of networks and the diversity of circuits, multicore embedded sensing systems suffer from low accuracy and efficiency in measuring temperature. To improve the measurement accuracy and efficiency of multicore embedded sensing systems, this paper utilised knowledge distillation, model pruning and parameter quantisation to lightweight neural networks. Meanwhile, the lightweight neural network was applied to multicore embedded sensing systems and the layout of multicore embedded sensing systems based on it was analysed from the perspectives of processor layout, storage design and link network, providing a reference and theoretical basis for further application of multicore embedded sensing systems.

Assessing the Association Between Trade and Regional Trade Agreements: A Network Approach

Over the years, the global economy has become increasingly integrated due to globalisation, resulting in an increase in international trade flows and a complex network of trade links. The establishment of regional trade agreements (RTAs) has created an intricate network of connections and overlapping agreements among multiple members. The study traces the evolution of trade and RTA networks using tools of network analysis for the periods 1995-2021. We find that the importance of countries in the trade network has changed, with developing countries replacing the previously dominant players. China, in particular, has emerged as a key player during this period. We find that connectivity in the trade network is n ot s trongly associated w ith t he RTA network. We a lso identify t hree m ajor c ommunities w ithin t he trade network, with the United States, Germany, and Japan (later China) as the core countries in these communities. Furthermore, we compare the community structures of the trade network and the RTA network using Normalised Mutual Information. Our analysis suggests that the community structure of trade has limited overlap with the community structure of RTAs. Furthermore, correlations based on the quadratic assignment procedure indicate a weak association, if any, between the two networks over the years.

Whale Optimization for Cloud-Edge-Offloading Decision-Making for Smart Grid Services.

As IoT metering devices become increasingly prevalent, the smart energy grid encounters challenges associated with the transmission of large volumes of data affecting the latency of control services and the secure delivery of energy. Offloading computational work towards the edge is a viable option; however, effectively coordinating service execution on edge nodes presents significant challenges due to the vast search space making it difficult to identify optimal decisions within a limited timeframe. In this research paper, we utilize the whale optimization algorithm to decide and select the optimal edge nodes for executing services' computational tasks. We employ a directed acyclic graph to model dependencies among computational nodes, data network links, smart grid energy assets, and energy network organization, thereby facilitating more efficient navigation within the decision space to identify the optimal solution. The offloading decision variables are represented as a binary vector, which is evaluated using a fitness function considering round-trip time and the correlation between edge-task computational resources. To effectively explore offloading strategies and prevent convergence to suboptimal solutions, we adapt the feedback mechanisms, an inertia weight coefficient, and a nonlinear convergence factor. The evaluation results are promising, demonstrating that the proposed solution can effectively consider both energy and data network constraints while enduring faster decision-making for optimization, with notable improvements in response time and a low average execution time of approximately 0.03 s per iteration. Additionally, on complex computational infrastructures modeled, our solution shows strong features in terms of diversity, fitness evolution, and execution time.

Study on applicable coverage extension of theory-based generalization errors bounds to the variants of RVFL network and ELM

This study investigates the coverage extendibility of generalized prediction error estimation for the random vector functional link (RVFL) network and generalized extreme learning machine (GELM). GELM is an ELM applying the limiting behavior of Moore–Penrose generalized inverse (M–P GI) to the output matrix of the last hidden layer of ELM. The RVFL network, the ELM, and their variants are currently employed in various areas due to their fast learning and are expected to be adopted in more applications. Additionally, obtaining prediction error bounds quickly for these networks could greatly increase their utilities. Therefore, exploring the error bounds of the variants is crucial. Recently, the upper and lower bounds of generalized prediction error and their associated tail probabilities for the RVFL network and GELM were analyzed. This study aims to extend the coverage of the existing error bounds to variants of RVFL and ELM. To this end, we investigate each solution of the objective functions for the existing RVFL and ELM variants, compare it with the solution obtained by using the limiting behavior of M–P GI, and then discuss the applicability of the probability inequalities for the prediction error to the variant. Specifically, we conceptualize a restricted solution vector and prove that the restricted solution of a variant of RVFL is identical to that of GELM, with an appropriately selected regularization parameter. The mechanism used in the proof can be applied to other variants, which have different objective functions but have similar forms of solution. Experiments are performed with the CAIDA (Center for Applied Internet Data Analysis) dataset. Numerical results verify the analysis, showing that the generalization prediction error bounds and their associated tail probabilities for ELM (RVFL) variants in applicability coverage are almost identical to those of the GELM (RVFL). In addition, performance-based network similarity is introduced and computed with the obtained results. Based on this analysis, we can conclude that the probability inequalities for prediction error derived can be directly applied to some variants of the RVFL network and ELM, such as robust regularized RVFL and ridge regression ELM. However, it cannot apply directly to the networks that use information obtained during the learning process in its learning, such as RVFL+ and its variants. The significance of this study is that it enables us to figure out the relationship between the size-restricted final weight vector of RVFL and the final weight vectors of ELM, the effect of the relationship on generalized prediction error estimation, and the performance-based similarity between networks. This study provides a theoretical basis for the generalized prediction error's upper and lower bounds and their associated tail probabilities for ELM (RVFL) variants.

Recurrent ensemble random vector functional link neural network for financial time series forecasting

Financial time series forecasting is crucial in empowering investors to make well-informed decisions, manage risks effectively, and strategically plan their investment activities. However, the non-stationary and non-linear characteristics inherent in time series data pose significant challenges when accurately predicting future forecasts. This paper proposes a novel Recurrent ensemble deep Random Vector Functional Link (RedRVFL) network for financial time series forecasting. The proposed model leverages randomly initialized and fixed weights for the recurrent hidden layers, ensuring stability during training. Furthermore, incorporating stacked hidden layers enables deep representation learning, facilitating the extraction of complex patterns from the data. The proposed model generates the forecast by combining the outputs of each layer through an ensemble approach. A comparative analysis was conducted against several state-of-the-art models over financial time-series datasets, and the results demonstrated the superior performance of our proposed model in terms of forecasting accuracy and predictive capability.

Comparing distance-based and stress-based centralities to rank priority locations for cycling infrastructure investments in small-sized cities

The lack of technical guidelines to define investment priority locations is one of the barriers to cycling in emerging countries, limiting the preparation of urban mobility plans even when legally required. The objective of this paper is to propose and compare two approaches, with and without considering the cyclists’ perception of stress (assessed with the LTS, or Level of Traffic Stress), to determine the relative importance of road segments in the network and to rank priority locations for investments in cycling infrastructure. A case study was conducted in the city of Bariri (Brazil), for which the overall contribution of each network link to the identified cycling routes was mapped and ranked according to both criteria. The spatial distribution of differences between homologous ranks (i.e., ranks of the same network link according to different criteria) was also mapped, and the spatial autocorrelation between these differences was assessed by the Local Moran’s Index, allowing the identification of road segments of greater similarity and dissimilarity between the proposed approaches for resource allocation.

QUIC on the Fast Lane: Extending Performance Evaluations on High-rate Links

QUIC is a new protocol standardized in 2021 designed to improve on the widely used TCP/TLS stack. The main goal is to speed up web traffic via HTTP, but it is also used in other areas like tunneling. Based on UDP, it offers features like reliable in-order delivery, flow and congestion control, stream-based multiplexing, and always-on encryption using TLS 1.3.Unlike TCP, QUIC integrates these capabilities in user space, relying on kernel interaction solely for UDP. Operating in user space allows more flexibility but sacrifices some kernel-level efficiency and optimization that TCP benefits from. Various QUIC implementations exist, each distinct in programming language, architecture, and design.QUIC is already widely deployed on the Internet and has been evaluated, focussing on low latency, interoperability, and standard compliance. However, benchmarks on high-speed network links are still scarce.This paper presents an extension to the QUIC Interop Runner, a framework for testing the interoperability of QUIC implementations. Our contribution enables reproducible QUIC benchmarks on dedicated hardware and high-speed links. We provide results on 10G links, including multiple implementations, evaluate how OS features like buffer sizes and NIC offloading impact QUIC performance, and show which data rates can be achieved with QUIC compared to TCP. Moreover, we analyze different CPUs and CPU architectures influence reproducible and comparable performance measurements. Furthermore, our framework can be applied to evaluate the effects of future improvements to the protocol or the OS.Our results show that QUIC performance varies widely between client and server implementations from around 50Mbit/s to over 6000Mbit/s. We show that the OS generally sets the default buffer size too small. Based on our findings, the buffer size should be increased by at least an order of magnitude. Our profiling analysis identifies Packet I/O as the most expensive task for QUIC implementations. Furthermore, QUIC benefits less from AES NI hardware acceleration while both features improve the goodput of TCP to around 8000Mbit/s. The lack of support for NIC offloading from QUIC implementations results in missed opportunities for performance improvement.The assessment of CPUs from different vendors and generations revealed significant performance variations. We employed core pinning to examine if the performance of QUIC implementations is affected by the allocation to specific CPU cores. The results indicated an increased goodput of up to 20% when running on a specifically chosen core compared to a randomly assigned core. This outcome highlights the impact of CPU core selection on the performance of QUIC implementations but also for reproducible measurements.

Exploring scale-free networks: Survey on autonomous system dynamics and connectivity analysis

The global Internet is continuously developing; however, it is becoming more complex with time owing to the introduction of new nodes and links among autonomous systems (ASes). The network links among ASes appear and disappear, especially when the shortest path is required or a low-cost upstream Internet service provider (ISP) is a prerequisite. Understanding the Internet dynamics is critical for improving Internet characteristic analysis. In this work, we reviewed the existing studies from the last two decades on AS network topology as well as relations and routing among ASes. Similarly, we measured the link value differences within Russia and Central Asian ASes using the Barabasi–Albert (BA) model. Our analysis results show that in the last two years, the number of newly added links among 5377 ASes is 65,782. Further, the results show that the ASes with a high network degree in terms of high connectivity or preferential attachment approach are those used by the largest telecom companies in Russia and Central Asian regions. This survey paper aimed to determine whether the Internet AS graphs in these regions adhere to scale-free network properties, and we further examined the growth patterns of node connectivity within these regions.

Building hybrids between higher education and society

In this study, the changed context for higher education institutions is analysed through the lens of various approaches to collaboration between higher education institutions and society. Three different approaches are discussed: the ivory tower, the factory, and the network. Although these approaches differ, higher education institutions are complex organisations and can embrace a mix of approaches. Nevertheless, depending on the approach applied, this impacts how collaboration between higher education institutions and organisations in society plays out. The study contextualised these approaches in a joint higher education-industry project focusing on developing work-integrated learning (WIL) in a Business Administration program. WIL should embrace practice-based pedagogical methods and strategies by integrating theoretical knowledge in the workplace. To achieve WIL, a network of stakeholders needs to be engaged actively in practice-based activities. The study aimed to report preliminary results from a higher education work-integrated learning project. The following research question was posed: How can higher education institutions, together with organisations in society, apply a networked approach to work-integrated learning? Thus, this paper contributes to knowledge regarding the networked aspects of the design and development of a preliminary framework, including the following themes: Exchanges of experiences and knowledge, Guest lecturers and Bring-Your-Own-Data (BYOD) assignments. These themes manifest a networked WIL framework as a hybrid between higher education and society. First, the networks of experiences and knowledge within academia merge with those of experiences and knowledge in society. Between these two, a hybrid networked work-integrated framework links higher education and society. Second, the same can be said to be true for guest lecturers. Here, guest lecturers became a link between higher education and society and therefore merge the two networks of learning through information and knowledge exchange. Third, BYOD assignments provided further manifestations of a networked WIL framework. Authentic data from the workplace meet the theories of higher education and a hybrid is created. When practice meets theory, they, too, become a link between higher education and society.

Information and immigrant settlement

We study a randomly-assigned program providing information on U.S. settlement for new Filipino immigrants. The intervention, a 2.5-hour pre-departure training and an accompanying paper handbook, has no effect on employment, settlement, and subjective wellbeing, but leads immigrants to acquire substantially fewer social network connections. We rationalize these findings with a simple model, showing that information and social network links are substitutes under reasonable assumptions. Consistent with the model, the treatment reduces social network links more when costs of acquiring network links are lower. Offsetting reductions in the acquisition of social network connections can hence reduce the effectiveness of information interventions.

Soil data augmentation and model construction based on spectral difference and content difference

Soil analysis makes for developing precision agriculture and monitoring land quality, while the models available for spectroscopy-based chemometrics are constrained by limited samples from small areas. The paper proposed sample expansion and model construction based on spectral difference and content difference, realizing data augmentation and deep learning applied to original samples with limited numbers. The spectral subtraction based on maximum or minimum values exploited the maximum or minimum values to acquire the spectral difference and content difference, which provided a new data form for model construction. Keeping enhanced samples whose spectral difference and content difference were all zero was useful for improving model performance. Augmentation of all data or training data based on maximum or minimum values-based spectral subtraction, which sorted the contents and made them the maximum or minimum values in sequence, achieved sample expansion by the spectral difference and content difference. The model utilized the random vector functional link (RVFL) network, extreme learning machine (ELM), and one-dimensional convolutional neural network (1D CNN), which could predict the content of new samples through ensemble averaging when predicting content difference. The experimental result showed the model of the spectral subtraction based on maximum or minimum values had a similar performance to that of the original samples. Augmentation of all data improved model performance by only RVFL and ELM. Augmentation of training data verified 1D CNN was better than RVFL and ELM. The paper implements a new data augmentation method and applies CNN to original samples with inadequate numbers, which lays the foundation for an improved model and applying spectral preprocessing.

Cost-Efficient Method for Detecting and Mitigating the CrossPath Attack via Shared Links in SDN-Based IoT Network

Cost-Efficient Method for Detecting and Mitigating the CrossPath Attack via Shared Links in SDN-Based IoT Network

Application of commercial microwave links (CMLs) attenuation for quantitative estimation of precipitation

AbstractPrecipitation estimation models are typically sourced by rain gauges, weather radars and satellite observations. A relatively new technique of precipitation estimation relies on the network of Commercial Microwave Links (CMLs) employed for cellular communication networks: the rain‐inducted attenuation in the links enables the precipitation estimation. In the paper, it is analysed to what extent the precipitation derived from CML attenuation data is useful in estimation of the precipitation field with the high temporal and spatial resolution required in nowcasting models. Two methods of determination of precipitation along CMLs from attenuation of signal with several frequencies were proposed. Then, in order to generate precipitation field, three approaches for assigning appropriate precipitation values to a specific point or set of pixels along the link are developed and tested. The CML‐based estimates are compared with point observations from manual rain gauges and multi‐source precipitation fields using daily and half‐hourly accumulations. It was found that the CML‐based precipitation fields are much worse than radar‐derived estimates. At the same time, they had slightly poorer reliability than spatially interpolated telemetric rain gauge data and significantly higher reliability than satellite estimates. Furthermore, the impact of link characteristics, such as length and frequency, on the reliability of CML‐based precipitation estimates is analysed.