# Data transmission

The transfer of data in computer communication systems, including connectionless transmission within the OSI architecture.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Disaggregated LLM Inference in Space: A Communication Feasibility Study

DevFeed: [Disaggregated LLM Inference in Space: A Communication Feasibility Study](<https://devfeed.tech/articles/disaggregated-llm-inference-in-space-a-communication-feasibility-study-137034.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.20893>)

Author: Arno Troch, Roger Sanchez-Vital, Seyyidahmed Lahmer, Bartek Kozicki, Jeroen Famaey, Michael Peeters

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [LLM optimization](<https://devfeed.tech/topics/llm-optimization.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [communications](<https://devfeed.tech/topics/communications.md>), [Latency](<https://devfeed.tech/topics/latency.md>), [AI Architecture](<https://devfeed.tech/topics/ai-architecture.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [Mixture of Experts (MoE)](<https://devfeed.tech/topics/mixture-of-experts-moe.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [ai-inference](<https://devfeed.tech/tags/ai-inference.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [attention](<https://devfeed.tech/tags/attention.md>), [cache](<https://devfeed.tech/tags/cache.md>), [capacity](<https://devfeed.tech/tags/capacity.md>), [communication](<https://devfeed.tech/tags/communication.md>), [compute](<https://devfeed.tech/tags/compute.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [data-centers](<https://devfeed.tech/tags/data-centers.md>), [decode](<https://devfeed.tech/tags/decode.md>), [delay](<https://devfeed.tech/tags/delay.md>), [disaggregation](<https://devfeed.tech/tags/disaggregation.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [experts](<https://devfeed.tech/tags/experts.md>), [fast](<https://devfeed.tech/tags/fast.md>), [frontier](<https://devfeed.tech/tags/frontier.md>), [inference](<https://devfeed.tech/tags/inference.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llm-inference](<https://devfeed.tech/tags/llm-inference.md>), [space](<https://devfeed.tech/tags/space.md>)

### AI overview

The abstract finds that orbital disaggregated LLM inference depends on the serving method's communication pattern. Prefill-decode disaggregation (PDD) transfers a large KV cache once per request, so link capacity is its main constraint; with fast enough links, it can tolerate satellite separations up to 1,000 km. Attention-FFN disaggregation (AFD) exchanges small activations at every mixture-of-experts layer for every generated token, so propagation delay accumulates layer by layer and requires attention and expert instances to remain within about 1 km. The study proposes a hierarchical orbital inference architecture and network design guidelines that also account for ground access latency.

### Source excerpt

arXiv:2611.20893v1 Announce Type: new Abstract: Orbital data centers could enable large-scale AI inference, but efficiently serving a frontier language model to many users may require several compute satellites to cooperate over optical links. While disaggregated inference, which splits large language model (LLM) serving across machines, is well established in terrestrial data centers, its viability under the unique constraints of orbital deployments remains an open question. This article investigates how link capacity and satellite separation affect two types of disaggregated LLM serving, in both compact satellite formations and distributed constellations. Prefill-decode disaggregation (PDD) migrates a large KV cache once per request, while attention-FFN disaggregation (AFD) exchanges small activations at every mixture-of-experts layer for every generated token. The two respond to distance in different ways. PDD is limited mainly by link capacity and, with fast enough links, tolerates separations of up to a thousand kilometers. AFD is limited mainly by propagation delay, which accumulates layer by layer and forces attention and expert instances within about a kilometer of each other. Based on these results, we propose a hierarchical orbital inference architecture and provide network design guidelines for future orbital data centers, including the role of ground access latency.

## Fundamental Tradeoffs in Sampling, Transmission and Information Freshness: Instantaneous Feedback

DevFeed: [Fundamental Tradeoffs in Sampling, Transmission and Information Freshness: Instantaneous Feedback](<https://devfeed.tech/articles/fundamental-tradeoffs-in-sampling-transmission-and-information-freshness-instantaneous-feedback-137039.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.21547>)

Author: Subhankar Banerjee, Sennur Ulukus

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [communications](<https://devfeed.tech/topics/communications.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [approximation](<https://devfeed.tech/tags/approximation.md>), [channel](<https://devfeed.tech/tags/channel.md>), [constraint](<https://devfeed.tech/tags/constraint.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [feedback](<https://devfeed.tech/tags/feedback.md>), [lower-bounds](<https://devfeed.tech/tags/lower-bounds.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [policies](<https://devfeed.tech/tags/policies.md>), [probability](<https://devfeed.tech/tags/probability.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [tradeoffs](<https://devfeed.tech/tags/tradeoffs.md>), [transmission](<https://devfeed.tech/tags/transmission.md>)

### AI overview

In a time-slotted status-update system with erasures, the sampler-transmitter chooses whether to idle, retransmit a stale packet, or take a fresh sample, subject to average sampling and transmission limits. The authors derive a universal lower bound on average age and analyze stationary randomized policies. When the sampling rate is at most q times the transmission rate, the problem reduces to the sampling-constrained case; when it is at least the transmission rate, it reduces to the transmission-constrained case. In the intermediate regime, they model the problem as a constrained Markov decision process and show that randomized mixtures of threshold policies--where W sets a waiting threshold and R a replacement threshold--can achieve an optimal policy via a linear program, with at most three policies needed in one optimal mixture. A finite policy subset gives an ε-optimal solution, and a separate construction using four threshold policies provides a 2-approximation guarantee.

### Source excerpt

arXiv:2611.21547v1 Announce Type: cross Abstract: We study a time-slotted generate-at-will status-update system over an erasure channel with transmission success probability $q$, subject to average sampling- and transmission-rate constraints $f_s$ and $f_r$, respectively. The sampler-transmitter pair jointly decides whether to idle, retransmit a stale packet, or replace it with a fresh sample. We derive a universal lower bound on the optimal average age of information, analyze a class of stationary randomized policies, and obtain an optimal policy within this class that provides a $4$-approximation guarantee. The joint problem reduces to the sampling-constrained problem when $f_s\leq qf_r$ and the transmission-constrained problem when $f_s\geq f_r$. For $qf_r0$ we construct a finite subset $\bar{\Pi}_{\epsilon}\subset\bar{\Pi}$ and show that the LP restricted to this set yields an $\epsilon$-optimal policy. Finally, we derive a stronger pair of lower bounds by considering systems with only the sampling-rate or transmission-rate constraint. Using these bounds, we construct a policy randomizing among four $(W,R)$ policies with a $2$-approximation guarantee for $qf_r

## Authenticated Approximate Nearest Neighbor Search in Outsourced Vector Databases

DevFeed: [Authenticated Approximate Nearest Neighbor Search in Outsourced Vector Databases](<https://devfeed.tech/articles/authenticated-approximate-nearest-neighbor-search-in-outsourced-vector-databases-132702.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.16516>)

Author: Yuanhang Zhou, Xinyi Zhang, Cheng Xu, Jianliang Xu

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [ann](<https://devfeed.tech/topics/ann.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [Database](<https://devfeed.tech/topics/database.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [ann](<https://devfeed.tech/tags/ann.md>), [approximate-nearest-neighbor](<https://devfeed.tech/tags/approximate-nearest-neighbor.md>), [approximate-nearest-neighbor-search](<https://devfeed.tech/tags/approximate-nearest-neighbor-search.md>), [authenticated-data-structure](<https://devfeed.tech/tags/authenticated-data-structure.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [database-management](<https://devfeed.tech/tags/database-management.md>), [databases](<https://devfeed.tech/tags/databases.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [exploits](<https://devfeed.tech/tags/exploits.md>), [graph](<https://devfeed.tech/tags/graph.md>), [inner-product](<https://devfeed.tech/tags/inner-product.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [latency](<https://devfeed.tech/tags/latency.md>), [nearest-neighbor](<https://devfeed.tech/tags/nearest-neighbor.md>), [overhead](<https://devfeed.tech/tags/overhead.md>), [search](<https://devfeed.tech/tags/search.md>), [vector](<https://devfeed.tech/tags/vector.md>), [vector-databases](<https://devfeed.tech/tags/vector-databases.md>)

### AI overview

VIDA aims to make outsourced graph-based approximate nearest neighbor search verifiable with less communication and proof overhead. It replaces transmission of raw vectors with compact vector commitments, uses an aggregated Inner Product Argument to verify multiple distance computations, and introduces MeST, whose authentication paths follow graph traversal. A quantization-aware strategy uses distance bounds to prune candidates and reduce exact distances needing cryptographic authentication. The abstract reports up to 6.6x faster end-to-end latency and up to 99.2% less data transfer than state-of-the-art methods; it provides no experimental details in this excerpt.

### Source excerpt

arXiv:2611.16516v1 Announce Type: new Abstract: Approximate Nearest Neighbor (ANN) search has become a fundamental query primitive in modern vector databases for managing large-scale embedding data. To support growing vector collections, organizations increasingly outsource database management and query processing to third-party clouds. However, untrusted service providers may return suboptimal or fabricated results, posing a serious threat to ANN search integrity. Existing authenticated ANN approaches face substantial scalability challenges. They typically require transmitting high-dimensional vectors for distance verification and rely on topology-agnostic authentication structures, resulting in excessive communication and verification overhead. In this paper, we propose VIDA, a novel and efficient scheme for authenticated graph-based ANN search. VIDA replaces raw vector transmission with compact vector commitments and employs an aggregated Inner Product Argument to efficiently verify multiple distance computations. Furthermore, we introduce MeST, a topology-aware authenticated data structure that aligns authentication paths with graph traversal, significantly reducing structural proof overhead. Additionally, we design a quantization-aware authentication strategy that exploits distance bounds for pruning, reducing the number of exact distances requiring cryptographic authentication. Extensive experiments demonstrate that the proposed schemes substantially improve the efficiency of authenticated ANN search, achieving up to a $6.6\times$ speedup in end-to-end latency and reducing data transfer time by up to 99.2% compared with state-of-the-art methods.

## From Isolated Protocols to Integrated Pipelines: Benchmarking IoT Communication in the MASA Living Lab

DevFeed: [From Isolated Protocols to Integrated Pipelines: Benchmarking IoT Communication in the MASA Living Lab](<https://devfeed.tech/articles/from-isolated-protocols-to-integrated-pipelines-benchmarking-iot-communication-in-the-masa-living-lab-131581.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15595>)

Author: Antonio Solida, Enrico Rossini, Marcello Pietri, Marco Picone, Carlo Augusto Grazia

Published: 2026-11-13T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [performance-engineering](<https://devfeed.tech/topics/performance-engineering.md>), [Internet of things](<https://devfeed.tech/topics/iot.md>), [protocols](<https://devfeed.tech/topics/protocols.md>), [Serialization protocols](<https://devfeed.tech/topics/serialization-protocols.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [middleware](<https://devfeed.tech/topics/middleware.md>)

Tags: [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [communication](<https://devfeed.tech/tags/communication.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [iot](<https://devfeed.tech/tags/iot.md>), [jitter](<https://devfeed.tech/tags/jitter.md>), [latency](<https://devfeed.tech/tags/latency.md>), [performance](<https://devfeed.tech/tags/performance.md>), [pipelines](<https://devfeed.tech/tags/pipelines.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [throughput](<https://devfeed.tech/tags/throughput.md>), [transport](<https://devfeed.tech/tags/transport.md>)

### AI overview

The MASA living-lab benchmark finds that isolated component costs do not reliably predict integrated IoT pipeline performance. It evaluates local processing overhead, end-to-end latency, jitter, throughput, and delivery reliability across combinations of transport, messaging, serialization, and compression. Serialization or compression differences of tens of microseconds can coexist with end-to-end latency differences of several milliseconds, with middleware buffering and transport behavior substantially affecting timing. The authors conclude that stacks should be assessed as integrated pipelines under representative loads, with selection guided by application needs such as network conditions, communication patterns, and reliability requirements.

### Source excerpt

arXiv:2611.15595v1 Announce Type: new Abstract: The performance of real-time IoT communication systems depends not only on individual transport protocols, serialization formats, and data-processing stages, but also on how these components interact within the complete communication pipeline. Selecting an appropriate communication stack is therefore application-dependent and requires considering processing capabilities, network characteristics, communication patterns, and reliability requirements. This paper provides an experimental, evidence-based analysis of these interactions through a controlled benchmark of integrated communication pipelines deployed in the MASA living lab. We jointly evaluate local processing overhead, end-to-end latency, jitter, throughput, and delivery reliability across different combinations of transport, messaging, serialization, and compression mechanisms. Results show that component-level processing costs do not directly predict end-to-end performance. In particular, differences of only tens of microseconds in serialization or compression costs can coexist with several-millisecond differences in end-to-end latency, while middleware buffering and transport behavior substantially affect timing performance. The results demonstrate that communication-stack components should be evaluated as integrated pipelines and under representative operating loads rather than ranked independently.

## Communication-Efficient Federated Multi-View Clustering via View-Aware Quantization

DevFeed: [Communication-Efficient Federated Multi-View Clustering via View-Aware Quantization](<https://devfeed.tech/articles/communication-efficient-federated-multi-view-clustering-via-view-aware-quantization-132980.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15270>)

Author: Khadija Ardif, Meryeme Ayache, Nidal Nasser, Ouiame Marnissi

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>), [quantization](<https://devfeed.tech/topics/quantization.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [bits](<https://devfeed.tech/tags/bits.md>), [budget](<https://devfeed.tech/tags/budget.md>), [clients](<https://devfeed.tech/tags/clients.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [communication](<https://devfeed.tech/tags/communication.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data-privacy](<https://devfeed.tech/tags/data-privacy.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [federated](<https://devfeed.tech/tags/federated.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [overhead](<https://devfeed.tech/tags/overhead.md>), [performance](<https://devfeed.tech/tags/performance.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [quantization](<https://devfeed.tech/tags/quantization.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [scalability](<https://devfeed.tech/tags/scalability.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [strategies](<https://devfeed.tech/tags/strategies.md>), [systems](<https://devfeed.tech/tags/systems.md>), [view](<https://devfeed.tech/tags/view.md>)

### AI overview

View-aware quantization reduces communication overhead in federated multi-view clustering by dynamically allocating quantization bits according to iteratively updated view-importance scores, subject to a global bit budget. The authors integrate the method into four existing FedMVC approaches. On multiple benchmark datasets, they report up to 6.59x lower communication while maintaining or sometimes surpassing baseline clustering performance. The evidence is limited to the abstract and does not specify the datasets, baselines, or experimental conditions.

### Source excerpt

arXiv:2611.15270v1 Announce Type: cross Abstract: Federated multi-view clustering (FedMVC) has recently attracted increasing attention for its ability to exploit complementary clustering structures across multiple clients while preserving data privacy. However, existing FedMVC methods often suffer from high communication overhead due to the repeated transmission of high-dimensional representations, which limits their scalability in practical federated systems. Moreover, different views may contribute unequally to the clustering performance, calling for adaptive communication strategies. In this paper, we propose a view-aware quantization algorithm for communication-efficient FedMVC. By dynamically assigning quantization bits based on iteratively updated view importance scores, the proposed algorithm effectively balances clustering performance and communication efficiency under a global bit budget constraint. To validate its generality, we integrate our approach into four state-of-the-art FedMVC methods. Extensive experiments on multiple benchmark datasets demonstrate that view-aware quantization achieves up to 6.59x communication reduction while maintaining and in some cases surpassing baseline clustering performance, confirming the effectiveness and scalability of the proposed approach.

## Token Importance-Aware Semantic Communication Enabled Robust Video Transmission

DevFeed: [Token Importance-Aware Semantic Communication Enabled Robust Video Transmission](<https://devfeed.tech/articles/token-importance-aware-semantic-communication-enabled-robust-video-transmission-128201.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.12928>)

Author: Xiwen Zhang, Yubo Peng, Luping Xiang, Kun Yang

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [caviar](<https://devfeed.tech/tags/caviar.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-mm](<https://devfeed.tech/tags/cs-mm.md>), [data](<https://devfeed.tech/tags/data.md>), [data-volume](<https://devfeed.tech/tags/data-volume.md>), [dependency](<https://devfeed.tech/tags/dependency.md>), [eess-iv](<https://devfeed.tech/tags/eess-iv.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [framework](<https://devfeed.tech/tags/framework.md>), [information](<https://devfeed.tech/tags/information.md>), [motion](<https://devfeed.tech/tags/motion.md>), [object](<https://devfeed.tech/tags/object.md>), [quality](<https://devfeed.tech/tags/quality.md>), [receiver](<https://devfeed.tech/tags/receiver.md>), [reduce](<https://devfeed.tech/tags/reduce.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [robust](<https://devfeed.tech/tags/robust.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [token](<https://devfeed.tech/tags/token.md>), [transmission](<https://devfeed.tech/tags/transmission.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

Ti-SemCom reduces video communication cost by sending semantically important content according to available bandwidth. It jointly extracts object and motion information to identify relevant regions, hierarchically maps them to tokens by importance, and dynamically selects which tokens to transmit. At the receiver, regions not transmitted reuse recently reconstructed references to reduce redundant transmission. Experiments on the CAVIAR dataset report an 88.3% reduction in communication cost while maintaining competitive reconstruction quality; the excerpt does not specify the quality metric or evaluation conditions.

### Source excerpt

arXiv:2611.12928v1 Announce Type: cross Abstract: Video applications are increasingly prevalent, yet their high data volume and temporal dependency make robust wireless transmission challenging under limited communication resources. To address this issue, we propose a token importance-aware semantic communication (Ti-SemCom) framework for bandwidth-efficient video transmission. Specifically, object and motion information is jointly extracted to identify communication-relevant regions, which are hierarchically associated with semantic tokens according to their importance. The transmitted tokens are then dynamically selected based on both token importance and the available bandwidth, prioritizing more informative video content under resource constraints. At the receiver, untransmitted regions reuse recently reconstructed references to further reduce redundant transmission. Experiments on the CAVIAR dataset show that Ti-SemCom can achieve an 88.3\% reduction in communication cost while maintaining competitive reconstruction quality.

## How Do I Transfer Data Into My Runpod?

DevFeed: [How Do I Transfer Data Into My Runpod?](<https://devfeed.tech/articles/how-do-i-transfer-data-into-my-runpod-127619.md>)

Original publisher: [Read original article](<https://www.runpod.io/blog/transfer-data-into-runpod>)

Author: Brendan McKeag

Published: 2026-11-10T22:57:50Z

Content type: tutorial

Language: en

Sources: [Runpod Blog.](<https://devfeed.tech/sources/runpod-blog.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [rsync](<https://devfeed.tech/topics/rsync.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [about](<https://devfeed.tech/tags/about.md>), [account](<https://devfeed.tech/tags/account.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agent-skills](<https://devfeed.tech/tags/agent-skills.md>), [agents](<https://devfeed.tech/tags/agents.md>), [api](<https://devfeed.tech/tags/api.md>), [api-key](<https://devfeed.tech/tags/api-key.md>), [arguments](<https://devfeed.tech/tags/arguments.md>), [based](<https://devfeed.tech/tags/based.md>), [data](<https://devfeed.tech/tags/data.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [files](<https://devfeed.tech/tags/files.md>), [guide](<https://devfeed.tech/tags/guide.md>), [large](<https://devfeed.tech/tags/large.md>), [large-datasets](<https://devfeed.tech/tags/large-datasets.md>), [local](<https://devfeed.tech/tags/local.md>), [need](<https://devfeed.tech/tags/need.md>), [pod](<https://devfeed.tech/tags/pod.md>), [this](<https://devfeed.tech/tags/this.md>)

### AI overview

For large datasets, the guide recommends hosting files online and pulling them into a pod, since uploads from a local computer are limited by its internet connection. Options include Runpod's runpodctl for transfers between a local machine and pods or directly between pods; it needs terminal access but no HTTP or TCP ports. You can also drag files into supported browser editors, use wget for internet-hosted files (some sites require an API key or special downloader), or clone Git and Hugging Face repositories; install and initialize Git LFS for files over 100 MB. SCP and rsync are additional options that use the pod's external IP and TCP port. The excerpt says Runpod charges no ingress or egress fees; storage charges depend on where data lands.

### Source excerpt

Need to move files into your Runpod? This guide explains the fastest, most reliable ways to transfer large datasets into your pod, whether local or.

## Confidence-driven adaptive semantic transmission for task-oriented communication

DevFeed: [Confidence-driven adaptive semantic transmission for task-oriented communication](<https://devfeed.tech/articles/confidence-driven-adaptive-semantic-transmission-for-task-oriented-communication-126792.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.11132>)

Author: Suman Das, Prajnyajit Mohanty, Siddhartha S. Borkotoky

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [communications](<https://devfeed.tech/topics/communications.md>), [Image](<https://devfeed.tech/topics/image.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [classification](<https://devfeed.tech/tags/classification.md>), [classifiers](<https://devfeed.tech/tags/classifiers.md>), [communication](<https://devfeed.tech/tags/communication.md>), [confidence](<https://devfeed.tech/tags/confidence.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [device](<https://devfeed.tech/tags/device.md>), [edge](<https://devfeed.tech/tags/edge.md>), [evaluations](<https://devfeed.tech/tags/evaluations.md>), [image](<https://devfeed.tech/tags/image.md>), [images](<https://devfeed.tech/tags/images.md>), [information](<https://devfeed.tech/tags/information.md>), [latency](<https://devfeed.tech/tags/latency.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [links](<https://devfeed.tech/tags/links.md>), [monitoring](<https://devfeed.tech/tags/monitoring.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [transmission](<https://devfeed.tech/tags/transmission.md>)

### AI overview

Confidence-Driven Adaptation (CDA) adjusts image transmission to the edge classifier's confidence: it sends a predicted-class text string at high confidence, a compressed region of interest (ROI) at intermediate confidence, and an uncompressed ROI at low confidence. The remote server accepts the text prediction directly or classifies either ROI with a more powerful model. Numerical evaluations under bandwidth-limited, lossy, and latency-constrained conditions report high receiver task accuracy compared with fixed baselines that send only the edge prediction or an uncompressed ROI.

### Source excerpt

arXiv:2611.11132v1 Announce Type: new Abstract: Image-based remote monitoring over wireless networks faces a trade-off between communication cost and classification reliability. Transmitting complete images is communication-intensive, whereas relying solely on lightweight edge classifiers may compromise accuracy. To address this challenge, we propose Confidence-Driven Adaptation (CDA) for image transmission and classification. An edge device (ED) captures images and applies a lightweight classifier before transmission to a remote server. Based on its classification confidence, the ED selects among three transmission modes with varying levels of information: a short text string reporting its predicted class when confidence is high, a compressed Region of Interest (ROI) at intermediate confidence levels, or an uncompressed ROI when confidence is low. The server accepts the predicted class directly in the first case and performs classification using a more powerful classifier in the other two cases. Numerical evaluations under bandwidth-limited, lossy links and latency-constrained settings demonstrate that CDA achieves high task accuracy at the receiver compared with non-adaptive baselines that transmit only the edge-classifier outcome or the uncompressed ROI.

## Bluetooth's new HDT technology delivers nearly four times the data transfer speed

DevFeed: [Bluetooth's new HDT technology delivers nearly four times the data transfer speed](<https://devfeed.tech/articles/bluetooth-s-new-hdt-technology-delivers-nearly-four-times-the-data-transfer-speed-119420.md>)

Original publisher: [Read original article](<https://www.techspot.com/news/114448-bluetooth-new-hdt-technology-delivers-nearly-four-times.html>)

Author: Alfonso Maruccia

Published: 2026-11-05T18:38:00Z

Content type: news

Language: en

Sources: [TechSpot](<https://devfeed.tech/sources/techspot.md>)

Topics: [Bluetooth](<https://devfeed.tech/topics/bluetooth.md>), [Bluetooth LE](<https://devfeed.tech/topics/bluetooth-le.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [adoption](<https://devfeed.tech/tags/adoption.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-powered](<https://devfeed.tech/tags/ai-powered.md>), [applications](<https://devfeed.tech/tags/applications.md>), [bluetooth](<https://devfeed.tech/tags/bluetooth.md>), [data](<https://devfeed.tech/tags/data.md>), [development](<https://devfeed.tech/tags/development.md>), [devices](<https://devfeed.tech/tags/devices.md>), [electronics](<https://devfeed.tech/tags/electronics.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [faster](<https://devfeed.tech/tags/faster.md>), [feature](<https://devfeed.tech/tags/feature.md>), [milestone](<https://devfeed.tech/tags/milestone.md>), [mobile](<https://devfeed.tech/tags/mobile.md>), [organization](<https://devfeed.tech/tags/organization.md>), [performance](<https://devfeed.tech/tags/performance.md>), [popular](<https://devfeed.tech/tags/popular.md>), [solution](<https://devfeed.tech/tags/solution.md>), [speed](<https://devfeed.tech/tags/speed.md>), [technology](<https://devfeed.tech/tags/technology.md>), [throughput](<https://devfeed.tech/tags/throughput.md>), [times](<https://devfeed.tech/tags/times.md>), [wireless](<https://devfeed.tech/tags/wireless.md>)

### AI overview

Bluetooth Core 7.0 makes High Data Throughput (HDT) an optional feature that raises the maximum supported bit rate to 7.5 Mbps, nearly four times the rate of Bluetooth LE 2M PHY. HDT adds a physical layer intended to carry more data efficiently over existing Bluetooth links. The Bluetooth SIG also expects gains in spectral capacity, energy efficiency from transmitting more data in less time, and connection reliability, though these are described as expected benefits. First HDT-enabled products are anticipated in 2027, with premium wireless audio among the likely early uses; broader adoption is still expected to take time.

### Source excerpt

The Bluetooth Special Interest Group (SIG) recently unveiled the High Data Throughput (HDT) feature, describing the new solution as a significant milestone in the evolution of the popular wireless technology. The organization overseeing Bluetooth development said that HDT will introduce faster data transfer rates on newer Bluetooth devices. In turn,... Read Entire Article

## Learning to Decode Linear Codes with Generalized Belief Propagation Network

DevFeed: [Learning to Decode Linear Codes with Generalized Belief Propagation Network](<https://devfeed.tech/articles/learning-to-decode-linear-codes-with-generalized-belief-propagation-network-118518.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.06874>)

Author: Samira Malek

Published: 2026-11-05T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [communications](<https://devfeed.tech/topics/communications.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [decode](<https://devfeed.tech/tags/decode.md>), [learning](<https://devfeed.tech/tags/learning.md>), [linear-codes](<https://devfeed.tech/tags/linear-codes.md>), [network](<https://devfeed.tech/tags/network.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

GBPNet is a neural decoder for linear codes that retains the Tanner graph structure and message-passing symmetry while adding cascaded variable-node updates and learned element-wise message scaling. The paper also presents progressive training and high-SNR training to improve decoding accuracy. Experiments on several linear codes report lower bit error rates than conventional belief propagation and the state-of-the-art neural decoders evaluated. The supplied text does not provide quantitative results or details about the codes and experimental setup.

### Source excerpt

arXiv:2611.06874v1 Announce Type: new Abstract: Error correcting codes are a fundamental component of communication systems, enabling reliable data transmission over noisy channels. Recently, neural decoders have demonstrated notable performance gains over classical iterative algorithms. In this paper, we propose a Generalized Belief Propagation Network (GBPNet) that preserves message-passing symmetry while enhancing the decoder's learning capability. The architecture uses cascaded variable-node updates and learned element-wise message scaling while retaining the Tanner graph structure. We also introduce two training strategies, progressive training and high-SNR training, that improve decoding accuracy. Experimental results on several linear codes show that GBPNet achieves lower bit error rates than conventional belief propagation and the evaluated state-of-the-art neural decoders.

## Fortra says AI could save file transfer admins up to 160 hours a year

DevFeed: [Fortra says AI could save file transfer admins up to 160 hours a year](<https://devfeed.tech/articles/fortra-says-ai-could-save-file-transfer-admins-up-to-160-hours-a-year-117678.md>)

Original publisher: [Read original article](<https://thenewstack.io/failed-file-transfer-ai-troubleshooting/>)

Author: Matthew Burns

Published: 2026-11-04T17:53:47Z

Content type: news

Language: en

Sources: [The New Stack](<https://devfeed.tech/sources/the-new-stack.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-operations](<https://devfeed.tech/tags/ai-operations.md>), [devops](<https://devfeed.tech/tags/devops.md>), [diagnostics](<https://devfeed.tech/tags/diagnostics.md>), [file-transfer](<https://devfeed.tech/tags/file-transfer.md>), [fortra](<https://devfeed.tech/tags/fortra.md>), [observability](<https://devfeed.tech/tags/observability.md>), [operations](<https://devfeed.tech/tags/operations.md>), [sponsor-fortra](<https://devfeed.tech/tags/sponsor-fortra.md>), [sponsored-webinar](<https://devfeed.tech/tags/sponsored-webinar.md>), [webinar](<https://devfeed.tech/tags/webinar.md>)

### AI overview

Fortra estimates that troubleshooting accounts for up to 160 of the 571 hours per user per year its AI features could save on routine managed file transfer tasks. In one example, an admin spent 40 of 50 minutes investigating a failed settlement-file transfer caused by a trading partner rotating SSH keys; the repair took 5 to 10 minutes. Guided Diagnostics, available in GoAnywhere MFT, reads a failed job and ranks likely causes and next steps, leaving diagnosis and any changes to the admin. Fortra expects the most help with recurring errors that leave clear messages. The feature is less useful for intermittent network drops, partner-side problems, complex workflow failures, performance bottlenecks, and custom integrations. The estimate excludes time waiting for a partner response, and the article does not provide the underlying customer survey details.

### Source excerpt

Fortra makes software that moves files between companies on a schedule and says AI could give admins back up to The post Fortra says AI could save file transfer admins up to 160 hours a year appeared first on The New Stack.

## When Music Needs Meaning: Semantic Communication as a Transformative Enabler for the Musical Metaverse

DevFeed: [When Music Needs Meaning: Semantic Communication as a Transformative Enabler for the Musical Metaverse](<https://devfeed.tech/articles/when-music-needs-meaning-semantic-communication-as-a-transformative-enabler-for-the-musical-metaverse-117406.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.03995>)

Author: Ali Al Housseini, Jaime Llorca, Cristina Rottondi, Luca Turchet, Tiziano Leidi, Omran Ayoub

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [synchronization](<https://devfeed.tech/topics/synchronization.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [agent to agent communication](<https://devfeed.tech/topics/agent-to-agent-communication.md>)

Tags: [6g](<https://devfeed.tech/tags/6g.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [audio](<https://devfeed.tech/tags/audio.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [communication](<https://devfeed.tech/tags/communication.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [edge](<https://devfeed.tech/tags/edge.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [framework](<https://devfeed.tech/tags/framework.md>), [latency](<https://devfeed.tech/tags/latency.md>), [music](<https://devfeed.tech/tags/music.md>), [orchestration](<https://devfeed.tech/tags/orchestration.md>), [requirements](<https://devfeed.tech/tags/requirements.md>), [routers](<https://devfeed.tech/tags/routers.md>), [scalability](<https://devfeed.tech/tags/scalability.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [semantics](<https://devfeed.tech/tags/semantics.md>), [streams](<https://devfeed.tech/tags/streams.md>), [synchronization](<https://devfeed.tech/tags/synchronization.md>)

### AI overview

The paper argues that musical metaverse interactions--synchronized audio, visual, kinematic, and haptic streams--create latency, synchronization, bandwidth, and scaling demands that conventional bit-level communication struggles to meet. It frames semantic communication as transmitting musically meaningful information instead of raw samples, and proposes three pillars: semantics extraction, semantic-aware orchestration, and cross-modal semantic synchronization. Its proposed semantic-first architecture uses device-side semantic encoders, edge semantic routers, and cross-modal synchronization. The paper also surveys related work and identifies gaps to integration; the abstract presents this framework as a demanding use case for 6G semantic communication.

### Source excerpt

arXiv:2611.03995v1 Announce Type: cross Abstract: The Musical Metaverse (MM) enables geographically distributed musicians, audiences, sound engineers, and AI agents to interact through synchronized audio, visual, kinematic, and haptic streams, imposing latency, synchronization, bandwidth, and scalability requirements that are difficult to satisfy with conventional bit-level communication. This paper argues that semantic communication, understood here as the transmission of musically meaningful information rather than raw audio-visual-haptic samples, provides a principled communication paradigm for the MM. We define the MM from a communication perspective and derive modality-specific require ments; propose a three-pillar framework for musical semantic communication comprising semantics extraction, semantic-aware orchestration, and cross-modal semantic synchronization; survey representative work across semantic communication, music AI and edge orchestration, identifying the gaps that prevent their integration; and propose a semantic-first reference architecture based on device-side semantic encoders, edge semantic routers, and cross-modal semantic synchronization. The resulting framework positions the MM as a concrete and demanding use case for 6G semantic communication.

## Communication-Efficient Model-Distributed Inference for CBRS Radar Detection at the Edge

DevFeed: [Communication-Efficient Model-Distributed Inference for CBRS Radar Detection at the Edge](<https://devfeed.tech/articles/communication-efficient-model-distributed-inference-for-cbrs-radar-detection-at-the-edge-113779.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.00625>)

Author: Teng Li, Hulya Seferoglu

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [AI Infrastructure](<https://devfeed.tech/topics/ai-infrastructure.md>), [Local AI](<https://devfeed.tech/topics/local-ai.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [Jetson Orin](<https://devfeed.tech/topics/jetson-orin.md>), [communications](<https://devfeed.tech/topics/communications.md>)

Tags: [5g](<https://devfeed.tech/tags/5g.md>), [cbrs](<https://devfeed.tech/tags/cbrs.md>), [communication](<https://devfeed.tech/tags/communication.md>), [compression](<https://devfeed.tech/tags/compression.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [data](<https://devfeed.tech/tags/data.md>), [detection](<https://devfeed.tech/tags/detection.md>), [device](<https://devfeed.tech/tags/device.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [distributed-inference](<https://devfeed.tech/tags/distributed-inference.md>), [edge](<https://devfeed.tech/tags/edge.md>), [eess-sp](<https://devfeed.tech/tags/eess-sp.md>), [i-q](<https://devfeed.tech/tags/i-q.md>), [inference](<https://devfeed.tech/tags/inference.md>), [jetson](<https://devfeed.tech/tags/jetson.md>), [jetson-orin](<https://devfeed.tech/tags/jetson-orin.md>), [jetson-orin-nano](<https://devfeed.tech/tags/jetson-orin-nano.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [quality](<https://devfeed.tech/tags/quality.md>), [radar](<https://devfeed.tech/tags/radar.md>), [radio](<https://devfeed.tech/tags/radio.md>), [raw](<https://devfeed.tech/tags/raw.md>)

### AI overview

CEDAR reduces communication costs in edge-distributed CBRS radar detection by redesigning both the detector and model partitioning. CEDAR-YOLO removes YOLO's multi-scale neck and two detection scales, using a single-scale path with independently configured frequency and time resolutions. CEDAR-MDI adds lightweight activation compressors and chooses each compressor's partition to minimize the pipeline bottleneck. On an NVIDIA Jetson Orin Nano with real-world over-the-air data, CEDAR-YOLO reduced parameters by 35-57% and inference time by 16-33%; CEDAR-MDI achieved up to 3.27x the throughput of single-device inference. The abstract reports preserved detection quality for both, but provides no further evaluation details.

### Source excerpt

arXiv:2611.00625v1 Announce Type: new Abstract: The Citizens Broadband Radio Service (CBRS) shares the 3550-3700 MHz band between incumbent radar systems and commercial LTE/5G users, so radar activity must be detected accurately and promptly. Spectrogram-based YOLO detectors can localize coexisting radar and cellular signals, but running them on resource-constrained edge devices is challenging. Model-distributed inference (MDI) can increase throughput by partitioning a model across edge devices. Using an end-to-end pipeline from raw I/Q samples to on-device detection, we show that partitioning recent YOLO generations incurs high activation-transfer costs due to their multi-scale structures. To reduce these costs, we propose CEDAR, a communication-efficient, edge-distributed architecture for radar detection. Its RF-aware detector, CEDAR-YOLO, removes YOLO's multi-scale neck and two of its three detection scales, leaving a single-scale path with independently configured frequency and time resolutions, which lowers the communication cost of partitioning. Its compression-aware MDI framework, CEDAR-MDI, integrates lightweight activation compressors and selects, for each compressor, the partition that minimizes the pipeline bottleneck. On an NVIDIA Jetson Orin Nano testbed with real-world over-the-air data, CEDAR-YOLO reduces the parameter count by 35-57% and model inference time by 16-33%, and CEDAR-MDI achieves up to $3.27\times$ the throughput of single-device inference, with detection quality preserved in both cases.

## Band-Separated Redundant Communication for a Mars-Analog Rover

DevFeed: [Band-Separated Redundant Communication for a Mars-Analog Rover](<https://devfeed.tech/articles/band-separated-redundant-communication-for-a-mars-analog-rover-113872.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.02131>)

Author: Zamiul Rashid, Akid Anis, Tanzim Ahmed, Md. Golam Rabiul Alam, Md. Khalilur Rhaman

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [mesh networking](<https://devfeed.tech/topics/mesh-networking.md>)

Tags: [babel](<https://devfeed.tech/tags/babel.md>), [backhaul](<https://devfeed.tech/tags/backhaul.md>), [backup](<https://devfeed.tech/tags/backup.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [bench](<https://devfeed.tech/tags/bench.md>), [bridge](<https://devfeed.tech/tags/bridge.md>), [camera](<https://devfeed.tech/tags/camera.md>), [capacity](<https://devfeed.tech/tags/capacity.md>), [challenge](<https://devfeed.tech/tags/challenge.md>), [command](<https://devfeed.tech/tags/command.md>), [communication](<https://devfeed.tech/tags/communication.md>), [control](<https://devfeed.tech/tags/control.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [drive](<https://devfeed.tech/tags/drive.md>), [edge](<https://devfeed.tech/tags/edge.md>), [failed](<https://devfeed.tech/tags/failed.md>), [failure](<https://devfeed.tech/tags/failure.md>), [field](<https://devfeed.tech/tags/field.md>), [limit](<https://devfeed.tech/tags/limit.md>), [link](<https://devfeed.tech/tags/link.md>), [mars](<https://devfeed.tech/tags/mars.md>)

### AI overview

The BRACU Mongol-Tori rover separates video and RTK corrections from command traffic to maintain bandwidth and control redundancy. Video and corrections use a 5.2 GHz bridge with a 2.4 GHz backup selected by Babel; commands are sent simultaneously over two sub-gigahertz radios, with the backup copy used when the primary falls silent. Bench tests switched traffic to backup within seconds, while a metric offset kept Babel on a primary losing 10% of packets. In a drive exceeding 1 km, the primary failed at 771 m and the backup carried video and corrections just beyond 1 km, despite line of sight ending about halfway. The field test also revealed that Babel's lost-Hello-based link judgment can retain a primary with a faulty receiver despite the backup reporting twice its capacity, and can flap near range limits. The abstract identifies antenna aiming, link metrics, and logging as lessons from the tests.

### Source excerpt

arXiv:2611.02131v1 Announce Type: new Abstract: Teams in the University Rover Challenge (URC) drive their rovers remotely and often out of sight. The organizers name communication failure as the most common reason a team falls short. A rover therefore needs bandwidth for several camera views and a command path that survives the loss of one radio. We describe and field test the communication stack of the BRACU Mongol-Tori rover, which keeps vision and control on separate radios and bands. Video and RTK corrections travel over a 5.2 GHz bridge with a 2.4 GHz backup, and the Babel routing protocol chooses between them. Every command goes out on two sub-gigahertz radios at once, and the rover uses the backup copy only when the primary falls silent. We tested the backhaul on the bench with a power cut and injected packet loss. We also drove the rover more than a kilometer from the base, and line of sight ended about halfway. On the bench, traffic reached the backup within a few seconds. A metric offset kept it on a primary that lost one packet in ten. In the field, the primary failed at 771 m and the backup carried video and corrections to just over a kilometer. The drive also exposed a limit of Babel, which judges a link only by lost Hello messages. It kept traffic on a primary with a faulty receiver, although the backup reported twice the capacity, and it flapped at the edge of range. We close with lessons on antenna aiming, link metrics and logging.

## NLP-based Message Prioritisation for Opportunistic Routing: A Case Study of Nepal Earthquake Emergency Communication

DevFeed: [NLP-based Message Prioritisation for Opportunistic Routing: A Case Study of Nepal Earthquake Emergency Communication](<https://devfeed.tech/articles/nlp-based-message-prioritisation-for-opportunistic-routing-a-case-study-of-nepal-earthquake-emergency-communication-107610.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.37933>)

Author: Yihang Cao, Milena Radenkovic

Published: 2026-10-30T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [IP routing](<https://devfeed.tech/topics/ip-routing.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [2015](<https://devfeed.tech/tags/2015.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [bert](<https://devfeed.tech/tags/bert.md>), [buffer](<https://devfeed.tech/tags/buffer.md>), [can](<https://devfeed.tech/tags/can.md>), [case-study](<https://devfeed.tech/tags/case-study.md>), [categories](<https://devfeed.tech/tags/categories.md>), [communication](<https://devfeed.tech/tags/communication.md>), [condition](<https://devfeed.tech/tags/condition.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [delivery](<https://devfeed.tech/tags/delivery.md>), [disaster](<https://devfeed.tech/tags/disaster.md>), [emergency](<https://devfeed.tech/tags/emergency.md>), [errors](<https://devfeed.tech/tags/errors.md>), [message](<https://devfeed.tech/tags/message.md>), [nepal](<https://devfeed.tech/tags/nepal.md>), [nlp](<https://devfeed.tech/tags/nlp.md>), [routing](<https://devfeed.tech/tags/routing.md>), [study](<https://devfeed.tech/tags/study.md>)

### AI overview

In a controlled Kathmandu earthquake simulation using the ONE simulator and a modified Binary Spray and Wait router, semantic priorities derived from message classification were most useful under buffer pressure. TF-IDF with Logistic Regression and BERT classified messages into nine humanitarian categories mapped to four priorities (P1-P4). BERT had higher priority accuracy and P1 recall and fewer under-prioritisation and severe priority errors. Network gains were limited: P1 delivery probability was high and similar across conditions, latency did not improve consistently, and BERT showed fewer observed ground-truth P1 buffer losses than Logistic Regression. Prioritisation could not overcome mobility and contact constraints.

### Source excerpt

arXiv:2610.37933v1 Announce Type: new Abstract: This dissertation investigates whether Natural Language Processing (NLP) based semantic message prioritisation can improve the treatment of urgent disaster messages in opportunistic emergency communication, using the 2015 Nepal earthquake as a case study. TF IDF with Logistic Regression and BERT are used to classify social media messages into nine humanitarian categories, which are mapped to four routing priorities from P1 to P4. These priorities are integrated into the ONE simulator within a controlled Kathmandu earthquake scenario using a modified Binary Spray and Wait router. BERT achieves higher priority accuracy and P1 recall than Logistic Regression, while reducing under prioritisation and severe priority errors. However, improved NLP performance does not produce uniform network gains. P1 delivery probability remains high and similar across routing conditions, and no consistent latency reduction is observed. The clearest difference appears under buffer pressure, where the BERT condition shows fewer observed ground truth P1 buffer losses than Logistic Regression. The results indicate that semantic prioritisation is most valuable when limited transmission and storage resources are contested, although it cannot overcome mobility and contact constraints in opportunistic networks.

## Agent Transfer Protocol: Server-Mediated Agent-to-Agent Communication Architecture for the Agentic Web

DevFeed: [Agent Transfer Protocol: Server-Mediated Agent-to-Agent Communication Architecture for the Agentic Web](<https://devfeed.tech/articles/agent-transfer-protocol-server-mediated-agent-to-agent-communication-architecture-for-the-agentic-web-108072.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.38398>)

Author: Yuqi Qiu, Zuyao Xu, Lu Sun, Xiang Li, Fasheng Miao, Fubin Wu, Haixin Duan, Zheli Liu

Published: 2026-10-30T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [agent to agent communication](<https://devfeed.tech/topics/agent-to-agent-communication.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agent-communication](<https://devfeed.tech/tags/agent-communication.md>), [agent-to-agent-communication](<https://devfeed.tech/tags/agent-to-agent-communication.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [building](<https://devfeed.tech/tags/building.md>), [collaboration](<https://devfeed.tech/tags/collaboration.md>), [communication](<https://devfeed.tech/tags/communication.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ma](<https://devfeed.tech/tags/cs-ma.md>), [domain](<https://devfeed.tech/tags/domain.md>), [domains](<https://devfeed.tech/tags/domains.md>), [execution](<https://devfeed.tech/tags/execution.md>), [independent](<https://devfeed.tech/tags/independent.md>), [infrastructure](<https://devfeed.tech/tags/infrastructure.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [server](<https://devfeed.tech/tags/server.md>), [web](<https://devfeed.tech/tags/web.md>)

### AI overview

ATP proposes server-mediated communication for cross-organization agents: each administrative domain maintains stable addresses and receiving entries for logical agents, while domain servers handle ongoing message transmission. The receiving domain verifies and stores messages for later retrieval, and the sending domain signs the full message envelope. A receiving instance can recheck the sender domain and message integrity after the original connection ends, provided the verification key remains trusted and obtainable. In a controlled LLM workflow, subsequent processing continued after agent instances went offline or were replaced, and an independent verifier validated saved messages. The evaluation also measured the communication and processing overhead of continuous server mediation; the excerpt gives no numerical latency results.

### Source excerpt

arXiv:2610.38398v1 Announce Type: new Abstract: The Agentic Web needs to support continuous collaboration among agents from different organizations. These collaborative relationships may span multiple tasks, network connections and execution instances. Such interactions require stable communication entries, message reception when instances are offline, and source verification after delayed reading. How to organize these responsibilities so that cross domain communication does not depend on specific execution instances being continuously online is a key issue for building long term agent interaction infrastructure. We propose ATP (Agent Transfer Protocol), a cross organization agent communication protocol adopting a domain mediated architecture. In this architecture, administrative domains maintain stable addresses and receiving entries for logical agents. The domain servers of both parties continuously undertake cross domain transmission. The receiving domain verifies and saves messages for execution instances to read later. The sending domain signs the complete message envelope. This allows the receiving instance to independently reverify the domain source and content integrity after the original connection ends, provided the original verification public key is still trusted and obtainable. We implemented an ATP prototype and evaluated it through a controlled cross organization LLM agent workflow, mechanism checks and latency measurements. The workflow completed subsequent business processing after instances went offline or were replaced. The independent verifier successfully verified the domain source and content integrity of saved messages. Latency measurements further quantified the communication and processing overhead introduced by the continuous mediation of domain servers.

## Mobile Backscatter Communication for the Battery-less Internet of Things

DevFeed: [Mobile Backscatter Communication for the Battery-less Internet of Things](<https://devfeed.tech/articles/mobile-backscatter-communication-for-the-battery-less-internet-of-things-101654.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.01465>)

Author: Weining Song, Thiemo Voigt, Stefanos Kaxiras, Yuan Yao, Luca Mottola

Published: 2026-10-27T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [communications](<https://devfeed.tech/topics/communications.md>), [Internet of things](<https://devfeed.tech/topics/iot.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [availability](<https://devfeed.tech/tags/availability.md>), [channel](<https://devfeed.tech/tags/channel.md>), [communication](<https://devfeed.tech/tags/communication.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [data](<https://devfeed.tech/tags/data.md>), [design](<https://devfeed.tech/tags/design.md>), [designs](<https://devfeed.tech/tags/designs.md>), [device](<https://devfeed.tech/tags/device.md>), [devices](<https://devfeed.tech/tags/devices.md>), [energy](<https://devfeed.tech/tags/energy.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [internet](<https://devfeed.tech/tags/internet.md>), [internet-of-things](<https://devfeed.tech/tags/internet-of-things.md>), [internet-of-things-iot](<https://devfeed.tech/tags/internet-of-things-iot.md>), [iot](<https://devfeed.tech/tags/iot.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [memory](<https://devfeed.tech/tags/memory.md>), [mobile](<https://devfeed.tech/tags/mobile.md>), [mobility](<https://devfeed.tech/tags/mobility.md>)

### AI overview

The proposed system helps battery-less mobile IoT devices avoid transmitting during poor channel conditions or energy shortfalls. It uses short-term signal-strength trends to decide when to transmit and non-volatile memory to preserve packets through unfavorable channels and energy failures. In prototype experiments using real-world mobility and power traces, it outperformed a baseline that adapts only to instantaneous channel conditions: throughput improved by up to 5.16x and transmission energy use fell by up to 47.3%, with 0.23%-7.3% additional energy overhead.

### Source excerpt

arXiv:2609.01465v2 Announce Type: replace Abstract: We enable backscatter communication in the battery-less mobile Internet of Things (IoT). Backscatter communication is extensively studied in static settings. Existing designs are, however, fundamentally mismatched with mobility and time-varying energy patterns. Channel conditions rapidly fluctuate, impacting the achievable data rates and thus transmission costs. Energy availability varies unpredictably, possibly forcing devices to remain quiescent to recharge energy buffers. The two issues compound each other: while recharging, a battery-less mobile IoT device may miss more favorable channel conditions. We design a lightweight decision system that dynamically determines when to transmit by checking short-term trends in signal strength, while using Non-volatile Memory (NVM) to retain packets in unfavorable channel conditions and across energy failures. Using a prototype we built and real-world mobility and power traces, we compare our design against a rate-adaptive baseline that only considers the instantaneous channel conditions. Experimental results show that our system improves throughput by up to 5.16x while reducing transmission energy consumption by up to 47.3%, with only 0.23% - 7.3% additional energy overhead.

## VergeOS 26.2 Demo: Complete the VMware Exit, Watch the Transfer

DevFeed: [VergeOS 26.2 Demo: Complete the VMware Exit, Watch the Transfer](<https://devfeed.tech/articles/vergeos-26-2-demo-complete-the-vmware-exit-watch-the-transfer-95883.md>)

Original publisher: [Read original article](<https://www.verge.io/videos/vmware-migration-demo-vergeos-26-2/>)

Author: George Crump

Published: 2026-10-22T15:30:12Z

Content type: article

Language: en

Sources: [VergeIO](<https://devfeed.tech/sources/vergeio.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [VMware Cloud Foundation](<https://devfeed.tech/topics/vcf-9-1.md>)

Tags: [2-2](<https://devfeed.tech/tags/2-2.md>), [asynchronous](<https://devfeed.tech/tags/asynchronous.md>), [backup](<https://devfeed.tech/tags/backup.md>), [blocks](<https://devfeed.tech/tags/blocks.md>), [categories](<https://devfeed.tech/tags/categories.md>), [change](<https://devfeed.tech/tags/change.md>), [demo](<https://devfeed.tech/tags/demo.md>), [environment](<https://devfeed.tech/tags/environment.md>), [faster](<https://devfeed.tech/tags/faster.md>), [full](<https://devfeed.tech/tags/full.md>), [i-o](<https://devfeed.tech/tags/i-o.md>), [import](<https://devfeed.tech/tags/import.md>), [io](<https://devfeed.tech/tags/io.md>), [job](<https://devfeed.tech/tags/job.md>), [vergeos](<https://devfeed.tech/tags/vergeos.md>), [vergeos-26-2](<https://devfeed.tech/tags/vergeos-26-2.md>), [videos](<https://devfeed.tech/tags/videos.md>), [vm](<https://devfeed.tech/tags/vm.md>), [vmware](<https://devfeed.tech/tags/vmware.md>), [vmware-exit](<https://devfeed.tech/tags/vmware-exit.md>), [workflow](<https://devfeed.tech/tags/workflow.md>)

### AI overview

VergeOS 26.2 keeps the VMware import workflow unchanged while adding asynchronous I/O buffers for NBD transfers and faster VM list retrieval. VergeIO reports that NBD transfers in its lab ran 120% faster than on VergeOS 26.1.8 (2.2 times the speed). Changed block tracking still limits the final transfer to modified blocks, and VM tags, categories, and a unique serial number carry over. Actual speed depends on network and storage, so the text recommends upgrading a test system from 26.1.6 or later and timing a pilot VM before and after.

### Source excerpt

Watch a VMware VM transfer into VergeOS 26.2. Same import workflow, with asynchronous I/O on NBD transfers underneath. The post VergeOS 26.2 Demo: Complete the VMware Exit, Watch the Transfer appeared first on VergeIO.

## HAWK: Heterogeneity-Aware KV Cache Transfer for Efficient GPU-NPU Phase-Disaggregated LLM Inference

DevFeed: [HAWK: Heterogeneity-Aware KV Cache Transfer for Efficient GPU-NPU Phase-Disaggregated LLM Inference](<https://devfeed.tech/articles/hawk-heterogeneity-aware-kv-cache-transfer-for-efficient-gpu-npu-phase-disaggregated-llm-inference-95170.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.29873>)

Author: Junhyeok Park, Jungeun Yoon, Kyungmin Kim, Hunsoon Lee, Shinyoung Ahn, Kangho Kim

Published: 2026-10-22T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [LLM optimization](<https://devfeed.tech/topics/llm-optimization.md>), [rdma](<https://devfeed.tech/topics/rdma.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>)

Tags: [ai-accelerators](<https://devfeed.tech/tags/ai-accelerators.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [buffer](<https://devfeed.tech/tags/buffer.md>), [cache](<https://devfeed.tech/tags/cache.md>), [communication](<https://devfeed.tech/tags/communication.md>), [compute-resources](<https://devfeed.tech/tags/compute-resources.md>), [cost-efficiency](<https://devfeed.tech/tags/cost-efficiency.md>), [cs-ar](<https://devfeed.tech/tags/cs-ar.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [disaggregation](<https://devfeed.tech/tags/disaggregation.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [heterogeneous-integration](<https://devfeed.tech/tags/heterogeneous-integration.md>), [high-performance](<https://devfeed.tech/tags/high-performance.md>), [inference](<https://devfeed.tech/tags/inference.md>), [kv-cache](<https://devfeed.tech/tags/kv-cache.md>), [large-language-model](<https://devfeed.tech/tags/large-language-model.md>), [layouts](<https://devfeed.tech/tags/layouts.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llm-inference](<https://devfeed.tech/tags/llm-inference.md>), [memory](<https://devfeed.tech/tags/memory.md>), [npu](<https://devfeed.tech/tags/npu.md>), [power](<https://devfeed.tech/tags/power.md>)

### AI overview

HAWK enables GPU-to-NPU KV cache transfer for phase-disaggregated LLM inference, where GPUs handle compute-intensive prefill and NPUs handle more memory-bound decode. It establishes a direct RDMA path and allocates layout-aware RDMA buffers on the NPU side, so data sent from a conventional contiguous GPU buffer matches the target layout and can be consumed without additional rearrangement. On a system with commercially available GPUs and NPUs, the authors report performance within 7.88% of a GPU-only system under the same SLO constraints, with up to 1.26x higher power efficiency and 1.72x higher cost efficiency.

### Source excerpt

arXiv:2610.29873v1 Announce Type: cross Abstract: Large language model (LLM) inference exhibits distinct computational characteristics across its two phases: prefill is compute-intensive, whereas decode is more memory-bound. As a result, AI accelerators achieve varying levels of efficiency across the two phases. GPUs are well suited to prefill, but are often underutilized during decode. By contrast, NPUs can utilize their compute resources more effectively during decode. Motivated by this observation, we explore a heterogeneous architecture that integrates GPUs and NPUs, mapping prefill to GPUs and decode to NPUs to achieve high performance and efficiency. However, realizing such heterogeneous integration is challenging because LLM phase disaggregation requires KV cache transfer from prefill to decode (that is, from GPUs to NPUs), which is complicated by differences in inter-device communication mechanisms and KV cache tensor layouts. To address this, we propose HAWK, a transfer mechanism that enables rapid KV cache transfer across heterogeneous devices. HAWK establishes a remote direct memory access (RDMA) path for direct cross-device transfers while handling inter-device tensor layout discrepancies as part of the transfer process. In particular, HAWK allocates tensor-layout-aware RDMA buffers on the NPU side to match the target tensor layout. Leveraging these buffers, HAWK orchestrates data transfer from a conventional contiguous GPU RDMA buffer to the corresponding NPU buffers, allowing transferred tensors to be consumed directly without additional data rearrangement while maintaining transfer efficiency. We implement and evaluate HAWK on a system built with commercially available GPUs and NPUs, demonstrating performance within 7.88% of a GPU-only system under the same SLO constraints while achieving up to 1.26$\times$ higher power efficiency and 1.72$\times$ higher cost efficiency.

## Communication-Efficient Federated Domain Generalization in Edge Networks via Dynamic Prototype Regulation

DevFeed: [Communication-Efficient Federated Domain Generalization in Edge Networks via Dynamic Prototype Regulation](<https://devfeed.tech/articles/communication-efficient-federated-domain-generalization-in-edge-networks-via-dynamic-prototype-regulation-93552.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.25810>)

Author: Yuankun Xia, Hui Wang, Ling Yuan, Ziyu Hong, Di Yin, Yufeng Zhou

Published: 2026-10-21T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [peft](<https://devfeed.tech/topics/peft.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [Internet of things](<https://devfeed.tech/topics/iot.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [alignment](<https://devfeed.tech/tags/alignment.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [challenges](<https://devfeed.tech/tags/challenges.md>), [channel](<https://devfeed.tech/tags/channel.md>), [client](<https://devfeed.tech/tags/client.md>), [communication](<https://devfeed.tech/tags/communication.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [delay](<https://devfeed.tech/tags/delay.md>), [design](<https://devfeed.tech/tags/design.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [domain](<https://devfeed.tech/tags/domain.md>), [edge](<https://devfeed.tech/tags/edge.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [feature](<https://devfeed.tech/tags/feature.md>), [federated](<https://devfeed.tech/tags/federated.md>), [networks](<https://devfeed.tech/tags/networks.md>)

### AI overview

DPGR-GCAM targets slow uplinks and client drift when federated Vision-Language Models run over fading wireless edge networks with non-IID data. Its dual-parameter-efficient fine-tuning architecture uses channel-aware tiered transmission to adaptively truncate payloads, while Gradient-Conflict Aware Modulation resolves optimization conflicts in a low-dimensional feature manifold with minimal edge computation latency. The abstract reports improved cross-domain generalization and sustained convergence under fading with 10% client participation; it provides no quantitative comparison or further experimental details.

### Source excerpt

arXiv:2610.25810v1 Announce Type: new Abstract: Federated learning (FL) is a distributed paradigm for Internet of Things (IoT) edge networks. However, deploying Vision-Language Models (VLMs) over wireless edge networks presents distinct challenges: large model parameters increase uplink transmission latency over bandwidth-constrained fading channels, and non-independent and identically distributed (Non-IID) data exacerbates client drift. Existing feature alignment solutions often introduce auxiliary computations that consume time slots allocated for wireless parameter transmission, increasing the likelihood of straggler dropouts under system delay constraints. To address these issues, we propose DPGR-GCAM, a communication-efficient federated domain generalization framework. By employing a dual-parameter-efficient fine-tuning (PEFT) architecture, we design a channel-aware tiered transmission mechanism that adaptively truncates payloads to maximize node survival rates under fading conditions. To mitigate client drift, we introduce the Gradient-Conflict Aware Modulation (GCAM) mechanism. GCAM operates within the low-dimensional feature manifold to dynamically resolve multi-objective optimization conflicts with minimal edge computation latency, thereby reducing computation-induced network outages. Experiments demonstrate that DPGR-GCAM improves cross-domain generalization and sustains convergence under network fading scenarios with a 10\% client participation rate.

## Connecting Chiplets Isn't Enough - Solving the Data Movement Challenge in Multi-Die Systems

DevFeed: [Connecting Chiplets Isn't Enough - Solving the Data Movement Challenge in Multi-Die Systems](<https://devfeed.tech/articles/connecting-chiplets-isn-t-enough-solving-the-data-movement-challenge-in-multi-die-systems-84024.md>)

Original publisher: [Read original article](<https://www.eetimes.com/connecting-chiplets-isnt-enough-solving-the-data-movement-challenge-in-multi-die-systems/>)

Author: Arteris

Published: 2026-10-09T14:21:07Z

Content type: release

Language: en

Sources: [EE Times](<https://devfeed.tech/sources/ee-times.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [NVLink](<https://devfeed.tech/topics/nvlink.md>), [Cache Coherence](<https://devfeed.tech/topics/cache-coherence.md>), [performance-engineering](<https://devfeed.tech/topics/performance-engineering.md>)

Tags: [analog](<https://devfeed.tech/tags/analog.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [architectures](<https://devfeed.tech/tags/architectures.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [bits](<https://devfeed.tech/tags/bits.md>), [business](<https://devfeed.tech/tags/business.md>), [chiplets](<https://devfeed.tech/tags/chiplets.md>), [coherence](<https://devfeed.tech/tags/coherence.md>), [community](<https://devfeed.tech/tags/community.md>), [compute](<https://devfeed.tech/tags/compute.md>), [data](<https://devfeed.tech/tags/data.md>), [data-movement](<https://devfeed.tech/tags/data-movement.md>), [designline](<https://devfeed.tech/tags/designline.md>), [digital](<https://devfeed.tech/tags/digital.md>), [education](<https://devfeed.tech/tags/education.md>), [ee-times](<https://devfeed.tech/tags/ee-times.md>), [ee-times-university](<https://devfeed.tech/tags/ee-times-university.md>), [eelife](<https://devfeed.tech/tags/eelife.md>), [eelive-electronic-design](<https://devfeed.tech/tags/eelive-electronic-design.md>), [eet](<https://devfeed.tech/tags/eet.md>), [electrical-engineering](<https://devfeed.tech/tags/electrical-engineering.md>), [electronic-components](<https://devfeed.tech/tags/electronic-components.md>), [electronic-engineering-times](<https://devfeed.tech/tags/electronic-engineering-times.md>), [electronics](<https://devfeed.tech/tags/electronics.md>), [embedded-systems](<https://devfeed.tech/tags/embedded-systems.md>), [fundamentals-courses](<https://devfeed.tech/tags/fundamentals-courses.md>), [interoperability](<https://devfeed.tech/tags/interoperability.md>), [learning](<https://devfeed.tech/tags/learning.md>), [mixed-signal](<https://devfeed.tech/tags/mixed-signal.md>), [news](<https://devfeed.tech/tags/news.md>), [opinion](<https://devfeed.tech/tags/opinion.md>), [part-search](<https://devfeed.tech/tags/part-search.md>), [product-search](<https://devfeed.tech/tags/product-search.md>), [qos](<https://devfeed.tech/tags/qos.md>), [scale](<https://devfeed.tech/tags/scale.md>), [security](<https://devfeed.tech/tags/security.md>), [semiconductors](<https://devfeed.tech/tags/semiconductors.md>), [software](<https://devfeed.tech/tags/software.md>), [system](<https://devfeed.tech/tags/system.md>), [tech-papers](<https://devfeed.tech/tags/tech-papers.md>), [technology](<https://devfeed.tech/tags/technology.md>), [video](<https://devfeed.tech/tags/video.md>), [webinars-plus-bitcasts](<https://devfeed.tech/tags/webinars-plus-bitcasts.md>)

### AI overview

This BitCast announcement describes a session on data movement in multi-die systems. It covers extending network-on-chip connectivity across die boundaries to maintain traffic behavior, bandwidth efficiency, and quality of service, along with coherent and non-coherent architectures and design partitioning considerations.

### Source excerpt

Join this BitCast and explore how extending NoC connectivity across die boundaries enables engineering teams to scale from monolithic SoCs to multi-die architectures. The post Connecting Chiplets Isn't Enough - Solving the Data Movement Challenge in Multi-Die Systems appeared first on EE Times.

## TCP vs UDP - Which Is Better for Streaming?

DevFeed: [TCP vs UDP - Which Is Better for Streaming?](<https://devfeed.tech/articles/tcp-vs-udp-which-is-better-for-streaming-58860.md>)

Original publisher: [Read original article](<https://www.dacast.com/blog/tcp-vs-udp/>)

Author: Jon Whitehead

Published: 2026-09-15T08:30:29Z

Content type: article

Language: en

Sources: [DaCast](<https://devfeed.tech/sources/dacast.md>)

Topics: [Streaming](<https://devfeed.tech/topics/streaming.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [real-time](<https://devfeed.tech/topics/real-time.md>), [Latency](<https://devfeed.tech/topics/latency.md>), [Internet](<https://devfeed.tech/topics/internet.md>)

Tags: [latency](<https://devfeed.tech/tags/latency.md>), [live-streaming](<https://devfeed.tech/tags/live-streaming.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [quality](<https://devfeed.tech/tags/quality.md>), [speed](<https://devfeed.tech/tags/speed.md>), [streaming](<https://devfeed.tech/tags/streaming.md>), [tcp](<https://devfeed.tech/tags/tcp.md>), [the-video-experts-blog](<https://devfeed.tech/tags/the-video-experts-blog.md>), [udp](<https://devfeed.tech/tags/udp.md>), [vs](<https://devfeed.tech/tags/vs.md>)

### AI overview

This article explains how TCP and UDP affect video streaming, comparing their trade-offs in speed, reliability, latency, and delivery order. It presents UDP as generally better suited to live and real-time video, while TCP is better suited to on-demand video requiring complete, ordered delivery.

### Source excerpt

By Dacast Editorial Team | Reviewed by Jon Whitehead, COO at Dacast | Updated September 2026 Streaming is an innovative way to connect with your audience, especially as video is one of the most effective, preferred mediums for online consumers. It is an essential part of of digital communication, whether for entertainment, education, or business. [...] The post TCP vs UDP - Which Is Better for Streaming? appeared first on Dacast.

## When data is all you need: An overview of IoT communication with the cloud

DevFeed: [When data is all you need: An overview of IoT communication with the cloud](<https://devfeed.tech/articles/when-data-is-all-you-need-an-overview-of-iot-communication-with-the-cloud-49965.md>)

Original publisher: [Read original article](<https://aws.amazon.com/blogs/iot/when-data-is-all-you-need-an-overview-of-iot-communication-with-the-cloud/>)

Author: Alfonso Torres Soto

Published: 2025-12-22T19:17:55Z

Content type: article

Language: en

Sources: [The Internet of Things on AWS](<https://devfeed.tech/sources/the-internet-of-things-on-aws-official-blog.md>)

Topics: [Internet of things](<https://devfeed.tech/topics/iot.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [Cloud](<https://devfeed.tech/topics/cloud.md>), [protocols](<https://devfeed.tech/topics/protocols.md>), [data](<https://devfeed.tech/topics/data.md>)

Tags: [aws-iot](<https://devfeed.tech/tags/aws-iot.md>), [aws-iot-best-practices](<https://devfeed.tech/tags/aws-iot-best-practices.md>), [aws-iot-core](<https://devfeed.tech/tags/aws-iot-core.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [communication](<https://devfeed.tech/tags/communication.md>), [data](<https://devfeed.tech/tags/data.md>), [data-transmission](<https://devfeed.tech/tags/data-transmission.md>), [devices](<https://devfeed.tech/tags/devices.md>), [fleet](<https://devfeed.tech/tags/fleet.md>), [intermediate-200](<https://devfeed.tech/tags/intermediate-200.md>), [internet-of-things](<https://devfeed.tech/tags/internet-of-things.md>), [iot](<https://devfeed.tech/tags/iot.md>), [optimize](<https://devfeed.tech/tags/optimize.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [technical-how-to](<https://devfeed.tech/tags/technical-how-to.md>)

### AI overview

This article explains how IoT projects move data between fleets of devices and the cloud. It discusses choosing communication methods and protocols according to device, data, cost, and project constraints, while highlighting ways to avoid mistakes that affect cost, scope, and schedule.

### Source excerpt

Technical and marketing teams working on internet of things (IoT) programs, sooner or later, manage a project that requires data flow between a fleet of devices and the cloud. This data is critical because marketing wants to provide more features to the users, business teams require data driven decisions, and technical teams work to optimize [...]

## Building Ultra Long Range TOSLINK

DevFeed: [Building Ultra Long Range TOSLINK](<https://devfeed.tech/articles/building-ultra-long-range-toslink-41633.md>)

Original publisher: [Read original article](<https://blog.benjojo.co.uk/post/sfp-experiment-ultra-long-range-toslink>)

Author: ben@benjojo.co.uk

Published: 2025-01-07T12:24:27Z

Content type: article

Language: en

Sources: [Benjojo](<https://devfeed.tech/sources/benjojo-blog.md>)

Topics: [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [data centers](<https://devfeed.tech/topics/data-centers.md>), [Encoding](<https://devfeed.tech/topics/encoding.md>)

Tags: [computer](<https://devfeed.tech/tags/computer.md>), [data-transmission](<https://devfeed.tech/tags/data-transmission.md>), [datacenter](<https://devfeed.tech/tags/datacenter.md>), [encoding](<https://devfeed.tech/tags/encoding.md>)

### AI overview

A textual version of a talk exploring how optical data transmission works through SFP and QSFP modules, including their lanes, laser drivers, EEPROMs, microcontrollers, and advanced processing chips for higher-speed and longer-range links.

### Source excerpt

Building Ultra Long Range TOSLINK This post is a textual version of a talk I gave at The 38th Chaos Computer Congress at the end of 2024

[Next page](<https://devfeed.tech/topics/data-transmission.md?cursor=WyIyMDI1LTAxLTA3VDEyOjI0OjI3KzAwOjAwIiwgIjE2OWJlMjg2LTI1Y2YtNDgzOS1iNzhkLTA4NGE1NzgyMWUzZSJd>)