Search arXivSearch

arXiv · 2603.11122

Initialization and Rate-Quality Functions for Generative Network Layer Protocols

Abstract

Generative AI (GenAI) creates full content based on compact encodings. While GenAI has been used for applications where the generated content is returned to the encoding sender, it can also extend the capacity of communication networks by transmitting compact encodings through capacity-limited links, then generating and forwarding approximations from the GenAI node to the destination. This poses the challenge of evaluating approximation quality as a function of the rate between the source and GenAI node, while accounting for the communication overhead of learning. We present a method- and modality-agnostic initialization protocol for learning rate-quality functions in GenAI-aided networks, defining three variants: source-, node-, and destination-oriented, each with different messaging flows based on where quality is measured. The protocol augments node discovery protocols (e.g., MCP, A2A) when sources lack confidence in advertised model performance. We illustrate operation via a minimum estimation budget calculated using a distribution-free tolerance limit , and validate using a case study on image transmission under quality constraints. Results confirm the calculated budget meets the target quality requirement, with positive gains over JPEG after around 20 post-learning transmissions for a perceptual metric and more than 100 for a goal-oriented metric, providing a practical foundation for GenAI-based network compression.

Explore related subjects

Keep this discovery

BibTeXRIS

Mathias Thorsager, Israel Leyva-Mayorga, Petar Popovski. 2026-09-03. Initialization and Rate-Quality Functions for Generative Network Layer Protocols. https://arxiv.org/abs/2603.11122

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

On the Delay-Constrained Maximum Concurrent Flow Problem

Real-time services, such as VoIP and large-scale neural network training, require strict transmission delay guarantees. While routing under hop constraints is tractable, real-world delays increase sharply with equipment load, typically modeled using the M/M/1 queuing function where delay is inversely proportional to available bandwidth. We investigate the resulting Delay-Constrained Maximum Concurrent Flow (DCMCF) problem, which seeks to maximize the minimum throughput across all commodities. The problem's complexity stems from the conditional and non-linear nature of the delay constraints, which are active only along the specific paths used by the flow. We prove that DCMCF is strongly NP-hard, even for single-source/single-destination instances. To address the inherent non-convexity of the problem, we introduce a new convex relaxation expressed through second-order cone constraints, obtained from the convex envelope of a function representing the conditional delay associated with a single arc of a given path. The relaxation is shown to outperform existing formulations based on disjunctive programming. Leveraging this result, we develop a polynomial-time approximation algorithm with a provable performance guarantee and present numerical experiments demonstrating the effectiveness of the proposed approach.

cs.NI

Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers

We study the optimal joint sampling and transmission policy for a transmitter communicating with two gossiping receivers that share information with each other, with the objective of tracking a source under the Version Age of Information (VAoI) metric. The transmitter can observe source-version changes, but it has to pay a sampling cost to get the current source information content. Similarly, it can communicate with a receiver by paying a transmission cost. Gossiping enables local information exchange and is able to reduce costly direct transmissions. With imperfect communication links, we formulate an infinite-horizon average-cost Markov Decision Process (MDP) to jointly minimize receiver VAoI, sampling cost, and transmission cost. Using Relative Value Iteration (RVI), we evaluate the optimal policy and establish several properties of its structure. We prove that sampling has a threshold structure in the transmitter VAoI. Among direct transmissions, it is optimal to serve the older receiver. We further characterize the transmit or idle decision through the receiver VAoI difference. Our analysis shows that link reliability and receiver VAoI imbalance have a significant effect on the optimal policy structure. Numerical results verify the structural properties and demonstrate the performance gains of the optimal policy over multiple baselines.

cs.IT

Route Based Map Matching via a Structured Codebook and Token Sequence Decoding

This study proposes an efficient and computationally light route based map matching method for GPS track data on urban expressway networks. The key idea is to exploit a symbolic structure of named lines and named junctions that link level map matching leaves unused. We represent each candidate route as a sequence of line and junction names, take the set of such sequences as a route codebook, and formulate map matching as scored alignment of a probe trajectory against members of the codebook. Probes become token sequences via a mesh quantizer, a precomputed grid mapping each coordinate to a line or junction token, and the decoder returns a member of the codebook by construction. The codebook is indexed by a DAFSA $\times$ Levenshtein automaton, a fuzzy lookup technique from approximate string matching and speech recognition; the per query decoding cost is orders of magnitude lower than a brute force scan. We evaluate the method on a deformed replica of the Tokyo Metropolitan Expressway topology. The method recovers the exact route at moderate GPS noise and continues to identify the line and junction sequence under heavy noise; a sensitivity analysis maps the mesh resolution operating range. Real probe evaluation, channel model calibration, and a head to head HMM comparison are left to a forthcoming version.

math.OC