<?xml version='1.0' encoding='utf-8'?>
<rfc version="3" category="info" docName="draft-zhao-rtgwg-agentic-systems-00" ipr="trust200902" submissionType="IETF" consensus="false" tocInclude="true" symRefs="true" sortRefs="true">
  <front>
    <title abbrev="Cross-Domain Agentic Systems">A Framework for Network- and Compute-Aware Cross-Domain Agentic Systems</title>
    <author fullname="Dan Zhao" surname="Zhao">
      <organization>Pengcheng Laboratory</organization>
	    <address>
    <postal>
      <country>China</country>
    </postal>
    <email>zhaod01@pcl.ac.cn</email>
  </address>
    </author>
	<author fullname="Qing Li" surname="Li">
      <organization>Pengcheng Laboratory</organization>
	  	    <address>
    <postal>
      <country>China</country>
    </postal>
    <email>liq@pcl.ac.cn</email>
  </address>
    </author>
	<author fullname="Yu Wang" surname="Wang">
      <organization>Pengcheng Laboratory</organization>
	  	    <address>
    <postal>
      <country>China</country>
    </postal>
    <email>wangy17@pcl.ac.cn</email>
  </address>
    </author>
	<author fullname="Changlin Jiang" surname="Jiang">
      <organization>Pengcheng Laboratory</organization>
	  	    <address>
    <postal>
      <country>China</country>
    </postal>
    <email>jiangchl@pcl.ac.cn</email>
  </address>
    </author>
    <date day="21" month="October" year="2026"/>
    <workgroup>Routing Area Working Group</workgroup>
    <keyword>agentic systems</keyword>
    <keyword>network and computing awareness</keyword>
    <abstract>
      <t>Agentic systems can carry out tasks using agents, model services, data services, tools, and computing environments distributed across sites and administrative domains. Dependencies among these components create communication and computing requirements that may evolve during execution. Whether a proposed collaboration can satisfy those requirements depends on network connectivity and performance, computing capacity and readiness, data and model locality, and the policies governing resource use and data movement.</t>
      <t>This document describes a framework for cross-domain agentic collaboration that accounts for task dependencies and the network and computing conditions affecting communication and execution. It outlines the roles and interactions of agents and their runtimes, infrastructure information functions, and resource-management functions. The framework relates task dependencies to communication and computing requirements, with consideration of execution locations, data movement, and constraints spanning dependent activities. It discusses the use of appropriately scoped domain information to assess alternative combinations of agents, services, and tools, together with the abstraction and updating of that information under partial visibility and independent domain policies. The framework also addresses adaptation to evolving dependencies and infrastructure conditions, including information overhead and the stability of decisions in large agent populations.</t>
    </abstract>
  </front>
  <middle>
    <section anchor="introduction">
      <name>Introduction</name>
      <t>An agentic system pursues a goal through reasoning, delegation, retrieval, and tool use. An agent may invoke a model service, obtain data, or delegate part of its work to another agent. These operations can involve resources at multiple sites and in different administrative domains. Intermediate results may introduce further dependencies or change the work that remains to be done.</t>
      <t>Functional capability alone does not establish whether these activities can be completed together. For example, selecting a remote agent for analysis can also require access to a particular model, transfer of input data, and permission to process that data at the destination. Each component may be available while the proposed collaboration cannot meet its connectivity, completion-time, or data-handling requirements. Selection therefore needs to consider the dependencies introduced by an agent, service, or tool and the interactions required to satisfy them.</t>
      <t>These dependencies create distinct network demands, ranging from latency-sensitive exchanges to bulk data transfers and streamed model output. Their execution also requires suitable computing resources, model readiness, and capacity at the relevant locations. Changes in either the communication paths or execution conditions can alter which arrangements remain suitable.</t>
      <t>Administrative boundaries affect what can be known about these conditions. A domain determines how resources are used and which information is exposed to other parties. Agents and their runtimes therefore make decisions using information that may be abstracted, incomplete, and valid for a limited period. For systems with large agent populations or activities that persist over extended periods, information exchange and reassessment need to remain scoped to relevant dependencies.</t>
      <t>This document describes a framework for deriving communication and computing requirements from evolving task dependencies, obtaining relevant information across domains, and using that information to select and adapt execution arrangements. It addresses data and model locality and restrictions on data movement and execution alongside network and computing conditions. The logical functions can be realized by agent runtimes, service platforms, gateways, information services, and resource-management systems. Their interactions provide a basis for deployment-specific selection and resource-control mechanisms.</t>
    </section>
    <section anchor="terminology">
      <name>Terminology</name>
      <t>The following terms are used in this document:</t>
      <t><strong>Agent:</strong> A software entity that selects actions toward a goal using task context and available capabilities, and can revise those actions in response to results or changes in its environment.</t>
      <t><strong>Agent runtime:</strong> Software that supports an agent's execution through functions such as maintaining task context, invoking services and tools, and managing interactions with other agents and infrastructure.</t>
      <t><strong>Agentic system:</strong> A system comprising one or more agents together with the model services, data services, tools, and computing resources used to pursue goals. The required capabilities and interactions may change during execution.</t>
      <t><strong>Service:</strong> Functionality made available through a defined interface for use by another software component. Model inference, data access, and remotely invoked operations are examples.</t>
      <t><strong>Model service:</strong> A service that provides model inference, accepting input and returning or streaming the resulting output.</t>
      <t><strong>Data service:</strong> A service that provides access to data through operations such as queries, retrieval, or streaming.</t>
      <t><strong>Tool:</strong> A callable function used to perform a specific operation, such as computation, interaction with an external system, or control of a device. A tool may be implemented locally or exposed through a service interface.</t>
      <t><strong>Computing environment:</strong> The hardware and software resources that host and execute agents, services, or tools, including processing, memory, execution software, and isolation facilities.</t>
      <t><strong>Administrative domain:</strong> An administrative scope governed by an organization or other authority that determines resource use and information disclosure. A domain may include any combination of agents, model services, data, tools, computing resources, and network infrastructure.</t>
      <t><strong>Site:</strong> A deployment location relevant to communication, execution, or policy. A domain may contain several sites, and several domains may operate resources at one site.</t>
      <t><strong>Endpoint:</strong> A network-accessible interface through which an agent or service can be reached. An agent or service may be accessible through multiple endpoints.</t>
      <t><strong>Dependency:</strong> A relationship through which an activity requires an agent, service, tool, resource, or result. A dependency may become active only when a particular result or execution condition occurs.</t>
      <t><strong>Alternative:</strong> A proposed way to perform an activity, including the agents, services, and tools involved, their relevant dependencies, and the arrangement of execution and data movement. An alternative may include choices that are resolved later.</t>
      <t>Agent, model service, data service, and tool describe functional roles that can overlap in a deployment. An agent can expose its capabilities through a service interface, and a service can provide access to multiple tools. An agent runtime uses the resources of a computing environment to support the agent's execution.</t>
    </section>
    <section anchor="illustrative-scenario">
      <name>Illustrative Scenario</name>
      <t>Agent A in Domain 1 delegates an analysis task to agent B in Domain 2. B uses model service M, also in Domain 2, to perform the analysis. The initial exchange contains an event description and a small amount of context. Both agents can meet the initial communication and execution requirements.</t>
      <t>During analysis, B identifies a need for detailed records held by data service D in Domain 1. B can obtain the information needed for its analysis in two ways:</t>
      <ol spacing="normal">
        <li>Retrieve the relevant records from D and process them using resources in Domain 2.</li>
        <li>Invoke processing tool P in computing environment E, located near D in Domain 1, and transfer the resulting features to B.</li>
      </ol>
      <t>The first alternative depends on the bulk-transfer performance between D and Domain 2, together with computing capacity at the receiving site. The second depends on P's execution capability, its access to D, available capacity in E, and the size and usefulness of its output. Both alternatives remain subject to the domains' access and data-handling policies.</t>
      <t>Data policy can constrain this choice. For example, if raw records must remain within an approved region, the second alternative is eligible only when E is in that region and release of the resulting features to B is permitted.</t>
      <artwork type="ascii-art">    Domain 1                           Domain 2
    +-----------------------------+    +-----------------------+
    | Agent A                     |    | Agent B               |
    | Data service D              |    | Model service M       |
    |                             |    +-----------------------+
    | +-------------------------+ |
    | | Computing environment E | |    Domain 3
    | | Tool P                  | |    +-----------------------+
    | +-------------------------+ |    | Tool T                |
    +-----------------------------+    +-----------------------+

    Logical exchanges (request / response):
    A &lt;-&gt; B : delegation / analysis result
    B &lt;-&gt; M : inference request / output
    B &lt;-&gt; D : retrieval request / records     (alternative 1)
    B &lt;-&gt; P : processing request / features  (alternative 2)
    P &lt;-&gt; D : data access / records          (alternative 2)
    B &lt;-&gt; T : simulation request / result    (later dependency)</artwork>
      <t>Each outer box denotes an administrative domain. The nested box places P in computing environment E within Domain 1. The exchanges below the boxes identify the endpoints of each interaction. Alternatives 1 and 2 are the two data-access options; invocation of T arises later. Request and return traffic may follow different network paths. B may select the data-access option itself or coordinate it with A, according to the scope of the delegated task.</t>
      <t>Acceptable latency for the initial agent exchange says little about the time required to transfer the records. Conversely, proximity to D does not make P the preferred choice if E has a long execution queue or lacks required execution software. To choose between these alternatives, B or its runtime uses information about both the relevant network relationships and the corresponding execution capabilities.</t>
      <t>A subsequent result may lead B to invoke simulation tool T in Domain 3. Using T adds requirements for input transfer, simulation execution, and result delivery. The example illustrates how a task's infrastructure requirements can develop over time, even while A, B, M, D, and P remain available.</t>
    </section>
    <section anchor="problem-statement">
      <name>Problem Statement</name>
      <section anchor="requirements-arising-from-collaboration">
        <name>Requirements Arising from Collaboration</name>
        <t>Selecting an agent, service, or tool independently provides an incomplete view when its use introduces additional dependencies. Reachability between A and B does not establish reachability between B and D or between B and T. Similarly, spare compute capacity at B's site does not establish that a required model is ready or that necessary data can be delivered in time.</t>
        <t>The relevant unit of consideration is the alternative and its associated interactions. End-to-end completion can depend on several communication and processing stages, while concurrent activities may contend for the same network or computing resources. Information about individual components needs to be related to these dependencies before it can guide the choice of an alternative.</t>
      </section>
      <section anchor="requirements-that-change-during-execution">
        <name>Requirements That Change During Execution</name>
        <t>Reasoning, retrieval, and delegated work can reveal new dependencies, change input sizes, or make previously considered branches unnecessary. Communication requirements consequently include both current exchanges and additional exchanges that become relevant as execution progresses. The relationships may include iteration, streaming, parallel activity, and feedback.</t>
        <t>Agents and their runtimes therefore need to refine infrastructure requirements incrementally. Early decisions may use operation classes or demand ranges; later decisions can use actual data sizes, selected endpoints, and observed execution behavior. The same process also identifies which existing information remains applicable after a change.</t>
      </section>
      <section anchor="information-across-administrative-boundaries">
        <name>Information Across Administrative Boundaries</name>
        <t>An organization, such as a research institution, university, hospital, company, or service provider, can operate one or more administrative domains. Each domain may manage a combination of agents, models, data, tools, computing resources, and network infrastructure. The relevant boundaries follow administrative responsibility and policy.</t>
        <t>Each domain determines what information it exposes, to which requesting parties, at what granularity, and under what conditions. The information available to an external agent or runtime may therefore be partial even when the domain has a comprehensive internal view. An alternative can depend on resources governed by several domains with different disclosure and access policies. Agents and their runtimes use the information made available by those domains to evaluate the relevant interactions.</t>
        <t>Large agent populations amplify this problem. A global view of raw network and device state would be expensive to distribute, quickly outdated, and frequently irrelevant to a given activity. Information exposure needs to follow the dependencies and decisions for which the information is useful.</t>
      </section>
    </section>
    <section anchor="framework-architecture">
      <name>Framework Architecture</name>
      <section anchor="agent-and-infrastructure-functions">
        <name>Agent and Infrastructure Functions</name>
        <t>The framework relates three sets of existing functions:</t>
        <ul spacing="normal">
          <li><strong>Agent and runtime functions</strong> maintain task context, identify dependencies, obtain candidate agents, services, or tools, and choose or revise an alternative. These functions may be distributed among participating agents and their runtimes.</li>
          <li><strong>Infrastructure information functions</strong> collect or derive network, computing, service-readiness, and locality information. They expose selected information or answer operation-specific queries under the relevant domain policy.</li>
          <li><strong>Resource-management functions</strong> authorize and admit operations, provision resources where needed, and manage their execution. Observed outcomes and resource changes provide feedback to agents, their runtimes, and information functions.</li>
        </ul>
        <t>A gateway can perform some of these functions for local agents. A service platform can integrate them into its existing control and execution components. The placement of the functions follows ownership, trust relationships, and the information already available within a deployment.</t>
        <artwork type="ascii-art">    +-----------------------------------------------------------+
    | Agents and their runtimes                                  |
    | Dependencies -&gt; requirements -&gt; selection and adaptation   |
    +-----------------------------------------------------------+
         | requirements    ^ information       | invocations
         v                 |                   v
    +----------------------------+    +-------------------------+
    | Infrastructure information |    | Resource management     |
    | Network and computing      |    | Admission and execution |
    | capabilities and conditions|    | within each domain      |
    +----------------------------+    +-------------------------+
             ^                                  |
             +---- measurements and feedback ---+</artwork>
        <t>The lower functions operate within the participating domains; their interfaces follow the domains' disclosure and access policies. Communication with remote agents, services, and tools uses the selected endpoints and network services. Infrastructure information can be obtained through service interfaces, management systems, or dedicated information services, independently of that traffic.</t>
      </section>
      <section anchor="deriving-and-exchanging-requirements">
        <name>Deriving and Exchanging Requirements</name>
        <t>An agent or its runtime derives requirements from the intended operations. Input and output descriptions, service profiles, task deadlines, and expected concurrency provide initial values. Measurements from completed or ongoing operations can refine them. The agent runtime associates requirements with the dependencies that produced them, so that changes in the selected agent, service, tool, or input can trigger updates to the affected requirements.</t>
        <t>A request for information can concern one service, a set of endpoint pairs, or several activities that share resources. For the scenario above, B or its runtime may request network information for D-to-B transfer and execution information for P, then compare the resulting alternatives. The request can use a workload class or a bounded demand description when exact demand is unavailable.</t>
        <t>Providers can return capabilities, constraints, performance estimates, or a direct indication of whether the described operation is supportable. These forms accommodate different levels of requester knowledge and provider disclosure. Useful exchanges identify the subject, workload assumptions, and period to which the information applies.</t>
      </section>
      <section anchor="delegation-and-domain-responsibility">
        <name>Delegation and Domain Responsibility</name>
        <t>A delegated agent can manage its own internal dependencies. In the scenario, Domain 2 may expose a completion estimate for B's analysis that includes its use of M, while Domain 1 exposes P's execution behavior without identifying E's individual devices. The caller can use these estimates without needing details of the internal execution.</t>
        <t>External dependencies that affect data recipients, required connectivity, or the caller's objectives are reflected in the information exchanged with the caller. When B introduces T, B or its runtime updates the transfer requirements and completion estimate and obtains any additional authorization from the responsible domain. Changes affecting A's requirements are reported through the existing delegation relationship.</t>
        <t>Network ownership may differ from service ownership. End-to-end information therefore identifies the endpoints or attachment points it covers, and agents or their runtimes account for any remaining access or inter-domain segments. Each authority supplies information and controls resources within its own responsibility; the requesting agent or runtime combines the parts relevant to the proposed activity.</t>
      </section>
    </section>
    <section anchor="from-dependencies-to-infrastructure-requirements">
      <name>From Dependencies to Infrastructure Requirements</name>
      <section anchor="communication-requirements">
        <name>Communication Requirements</name>
        <t>Dependencies give rise to different communication patterns:</t>
        <ul spacing="normal">
          <li>Agent-to-agent interactions may carry task descriptions, context, intermediate results, and completion notifications. Repeated exchanges make round-trip latency relevant; parallel delegation introduces aggregate traffic and synchronization at result collection.</li>
          <li>Agent interactions with model services may upload substantial text or multimodal input and receive streamed output. Input delivery time, time to first output, output delivery rate, and interruption behavior can affect different stages of execution.</li>
          <li>Agent interactions with data services include queries, selective retrieval, bulk transfer, and continuous streams. Data volume, transfer direction, source locality, and access method influence the required throughput and completion time.</li>
          <li>Agent-to-tool interactions range from short calls to asynchronous jobs with callbacks and artifact transfers. Ordering, timeliness, and reliable result delivery depend on the operation, especially when the tool changes external state.</li>
        </ul>
        <t>One logical dependency may produce several flows, and a result may travel directly between services rather than through the initiating agent. Requirement derivation identifies the actual senders, receivers, directions, and relevant concurrency. Request, response, callback, and state-transfer paths are included where the selected interaction uses them.</t>
        <t>Network requirements may express reachability for the required protocol and security context, delay, delay variation, throughput, loss tolerance, continuity, or transfer completion objectives. They can be expressed as ranges or service classes when precise values are unavailable. Existing path-property vocabulary supports consistent descriptions <xref target="RFC9473"/>.</t>
        <t>In the illustrative scenario, changing from records to features changes the communication demand even if B's endpoint remains the same. Adding T creates another relationship whose conditions cannot be inferred solely from the quality of the original A-to-B exchange.</t>
      </section>
      <section anchor="computing-and-service-readiness">
        <name>Computing and Service Readiness</name>
        <t>Computing requirements describe the capability needed to execute an operation and the capacity needed for the intended workload. Relevant properties include compatibility with required software and models, accelerator capability, memory, supported input or context size, concurrent execution, and isolation.</t>
        <t>Service readiness connects those capabilities to actual use. A model may already be loaded, require initialization, or need transfer to an eligible environment. A tool may have an available execution slot or a substantial queue. Startup, state restoration, and execution waiting can dominate processing time and influence service selection.</t>
        <t>Agents and their runtimes can use service-level information such as supported operation profiles, expected waiting and execution times, or current admission conditions. These descriptions relate more directly to a request than raw utilization of individual devices. They also allow a provider to account for internal resources without exposing their arrangement.</t>
        <t>For the data-local alternative, P's availability and E's readiness are considered together with D access and the result-transfer requirements. For remote processing, the receiving environment's memory and processing capacity are considered together with the record transfer. Network and computing conditions thus influence the same choice of execution and data movement.</t>
      </section>
      <section anchor="data-location-and-movement">
        <name>Data Location and Movement</name>
        <t>Data location describes where the input or state needed for an operation is available, at the site, domain, or region granularity relevant to the decision. A data-service endpoint can front remote storage or several replicas, so its location alone may be insufficient to estimate transfer requirements.</t>
        <t>Policy can separately constrain where data may be stored or processed, which recipients may receive it, and whether it may be copied, cached, or forwarded. These constraints apply to the transfers and processing required by an alternative, including remote reads that return data to a caller.</t>
        <t>Location and movement constraints determine the candidate data sources and eligible computing environments. When transfer is allowed, the runtime can compare transferring data for remote processing with processing near its source, accounting for network performance and compute readiness in both arrangements. Where transfer is restricted, a permitted local operation may produce an output suitable for release.</t>
      </section>
      <section anchor="locality-and-combined-requirements">
        <name>Locality and Combined Requirements</name>
        <t>Locality also concerns model artifacts, execution state, and tools. Moving an operation may require transferring or reconstructing state, and an eligible computing environment needs access to the required artifacts.</t>
        <t>Some requirements apply to the combination: a deadline spanning retrieval, inference, and a tool call; aggregate demand from parallel invocations; or a policy restricting every recipient of a data object. Shared bottlenecks and compute pools affect simultaneous execution even when each operation is supportable alone.</t>
        <t>Task requirements distinguish mandatory constraints from preferences. Agents or their runtimes can compare expected performance among permitted alternatives, with suitable treatment of serial and parallel stages. Estimates identify whether they include communication, queueing, initialization, or processing, avoiding double counting when stages are combined. Statistical measures retain their meanings; independently reported percentile delays are not generally additive.</t>
      </section>
    </section>
    <section anchor="cross-domain-information-exposure">
      <name>Cross-Domain Information Exposure</name>
      <section anchor="information-relevant-to-an-activity">
        <name>Information Relevant to an Activity</name>
        <t>A domain can expose information about a service, a site, an endpoint pair, or a group of resources. The appropriate granularity depends on the proposed activity. Selecting an initial service may need only a supported workload class and a broad latency estimate. Comparing the two data-processing alternatives may require transfer estimates for specific attachment points and execution estimates for a specified input size.</t>
        <t>Network information describes the relevant source-to-destination relationship. Useful information includes permitted connectivity, expected delay, achievable throughput, and availability of a requested network service. Its scope includes the direction and traffic class, where these affect the result. A site's general connectivity advertisement can help identify candidates; information about the intended data path supports a more specific choice.</t>
        <t>Computing information describes supported operations and their current execution conditions. A domain may expose model readiness, a waiting-time range, expected execution time for an operation profile, or an admission response for a proposed workload. A service estimate can incorporate shared capacity and local contention. When several requested operations use the same resource pool, the provider can evaluate the combined demand.</t>
        <t>Data information can describe available source regions, permitted processing locations, and allowed transfers for the requesting principal and intended operation. A domain can expose a region label or an answer about a proposed transfer without revealing the underlying storage location. These constraints help construct acceptable alternatives before more detailed network and computing estimates are requested.</t>
      </section>
      <section anchor="abstraction-and-administrative-control">
        <name>Abstraction and Administrative Control</name>
        <t>Providers choose how to represent their resources. A domain may identify an eligible service region instead of a physical device, expose a transfer class instead of a path, or answer a bounded workload query without disclosing internal utilization. The abstraction needs to preserve distinctions that affect the request: for example, whether an estimate includes a remote data transfer or whether two advertised services share limited execution capacity.</t>
        <t>Each response has an identifiable source and subject. Units, workload assumptions, and observation or validity information allow recipients to interpret and combine it. Aggregated information retains the scope of the contributing domains and any conditions needed to interpret the result. These properties can be carried by existing information models and service interfaces.</t>
        <t>A domain controls disclosure and admission independently. Information that an operation appears supportable can guide selection; any resource commitment follows the responsible domain's admission procedure. If a remote service obtains further resources internally, its external estimate can cover that work under the service's own terms.</t>
      </section>
      <section anchor="queries-summaries-and-updates">
        <name>Queries, Summaries, and Updates</name>
        <t>Stable capability summaries support initial discovery and can be cached. Queries refine information for the alternatives currently under consideration. Notifications or subscriptions can then track conditions affecting selected services and active dependencies. This sequence limits both disclosure and the amount of information that each agent or runtime must process.</t>
        <t>Update rates follow the property's role in the decision. Supported software or deployment eligibility often changes less frequently than queueing delay, available throughput, or endpoint health. Policy changes may require prompt invalidation even when the underlying policy is usually stable. A provider can publish a change in an advertised range or service condition rather than distribute every underlying measurement.</t>
      </section>
    </section>
    <section anchor="selection-and-runtime-adaptation">
      <name>Selection and Runtime Adaptation</name>
      <section anchor="choosing-an-alternative">
        <name>Choosing an Alternative</name>
        <t>Agents and their runtimes relate the available information to the proposed arrangement of work. They consider the senders and receivers of each data exchange, where processing occurs, and which constraints span several stages. Candidates obtained through discovery can be refined as their dependencies become known.</t>
        <t>In the illustrative scenario, an available model in Domain 2 favors remote processing only if the record transfer and receiving resources meet the task requirements. Processing near D may reduce inter-domain traffic, but queueing in E can consume the time saved by that reduction. B or its runtime compares these combined effects using the objectives and tradeoffs appropriate to the delegated task.</t>
        <t>The information used for a choice needs to describe a compatible arrangement. A network estimate for one data source cannot be combined with a computing estimate that assumes another source without accounting for the change. Similarly, independently acceptable requests may exceed a shared limit when issued together. A combined query to the responsible provider, or sufficiently informative resource constraints, can resolve such dependencies.</t>
        <t>The required depth of evaluation depends on the activity. Best-effort work may proceed using coarse estimates and execution feedback. A time-bounded or policy-constrained activity may need more specific information or admission before a consequential step. When information is missing, the responsible agent or runtime can request clarification, choose an alternative with known properties, or defer the affected operation according to the task requirements.</t>
      </section>
      <section anchor="responding-to-new-dependencies">
        <name>Responding to New Dependencies</name>
        <t>Execution results can reveal additional work to the agent performing a task. Adding T introduces requirements for its invocation, inputs, execution, and result delivery, including permission to provide the intended input to T. A change in the expected output volume of P can instead modify an existing transfer requirement. Completed activities and abandoned branches remove demands that are no longer relevant.</t>
        <t>An agent runtime can associate information with the dependencies it supports and revisit the affected part of an alternative when those dependencies change. Independent portions of the activity can continue. A delegated agent can perform this refinement locally and report changes that affect its caller's objectives or permissions.</t>
        <t>Possible responses include selecting another service, processing data nearer its source, changing permitted concurrency, adjusting an input representation, or waiting for capacity. Task semantics determine which substitutions and transformations are acceptable. For example, a smaller feature representation is useful only if it preserves the information needed for the analysis.</t>
      </section>
      <section anchor="responding-to-infrastructure-changes">
        <name>Responding to Infrastructure Changes</name>
        <t>Network degradation, compute contention, service failure, and changes in data availability or deployment eligibility can affect active or pending work. Updates identify the affected services, data dependencies, or communication relationships. A change in the data source or in permitted processing locations can require new transfer estimates and a revised execution arrangement.</t>
        <t>In the scenario, reduced throughput on the D-to-B path may favor processing near D. A failure of E may favor remote processing or another eligible environment. If a network operator restores the required performance through local resource management, the selected arrangement may remain suitable. Adaptation occurs at the level where the change can be handled while meeting the activity's requirements.</t>
        <t>The cost of changing an active arrangement also matters. Model startup, state transfer, repeated data retrieval, and partially completed tool operations can outweigh an expected performance improvement. Agents and their runtimes account for these costs and use appropriate damping to avoid repeated changes in response to short-lived fluctuations.</t>
        <t>Information age affects the confidence of a decision. Execution-time admission and observed behavior close the gap between earlier estimates and actual conditions. Feedback can refine later demand estimates and reveal which changes warrant revisiting the selected alternative.</t>
      </section>
    </section>
    <section anchor="operational-considerations">
      <name>Operational Considerations</name>
      <t>The amount of information exchanged should follow the number of relevant dependencies and alternatives. Shared summaries, cached capability information, and subscriptions scoped to active services reduce repeated queries from large agent populations. Gateways and platforms can aggregate requests when their authorization and workload contexts are compatible.</t>
      <t>Many agents may react to the same favorable estimate by selecting the same resources. Local admission, updated availability information, and retry behavior in agent runtimes help manage the resulting contention. Information services also need query limits and update coalescing so that a resource event does not trigger excessive reassessment traffic.</t>
      <t>Operational records can relate a selected arrangement and its estimated requirements to admission results, measured transfer and execution times, and subsequent adaptations. This supports diagnosis when an apparently suitable combination performs poorly. Evaluation can examine task completion, adaptation cost, information overhead, and the effect of delayed or partial information across domains.</t>
      <t>Interoperability work can build on this framework by identifying common operation profiles, network and computing information semantics, and ways to associate updates with affected dependencies. Experience with existing discovery, management, and information-service interfaces can establish which additional protocol elements, if any, are needed.</t>
    </section>
    <section anchor="relationship-to-existing-work">
      <name>Relationship to Existing Work</name>
      <t>Agent discovery and invocation mechanisms provide candidates and service descriptions used by agents and their runtimes. DAWN use cases <xref target="DAWN-UC"/>, its discovery framework <xref target="DAWN-FW"/>, and AIDIP <xref target="AIDIP"/> address aspects of this exchange and federation. AIN <xref target="AIN"/> describes intent-oriented agent networking, including capability information and dynamic runtime information. These mechanisms can supply initial candidates and context as dependencies develop.</t>
      <t>CATS <xref target="CATS"/> describes traffic steering using computing and network conditions, with metrics developed in <xref target="CATS-METRICS"/>. Service chains are within its service model. The task-segmentation framework <xref target="CATS-SEG"/> considers dependent subtasks, while CATPTS <xref target="CATPTS"/> addresses coordinated source, compute, destination, and path choices. Metric semantics <xref target="CATS-SEM"/> address the interpretation and operational use of resource information. These mechanisms and descriptions are relevant to realizing the communication and computing requirements of a selected arrangement.</t>
      <t>Distributed inference requirements <xref target="DIN"/>, IDN <xref target="IDN"/>, and the open distributed-inference framework <xref target="ODSI"/> examine the dependencies and resource coordination of inference execution. An agentic system can consume an inference service that encapsulates this work, or use exposed information when inference dependencies affect its wider activity. Retrieval, delegated analysis, and tool interactions place that inference activity within the dependencies of a broader task.</t>
      <t>The Application-Responsive Network framework <xref target="ARN"/> and AI Agent Policy-Aware Network <xref target="APAN"/> connect application needs and policy to network behavior. The Agent Gateway Intercommunication Framework <xref target="AGW"/> includes agent-combination and path selection under service, network, and security requirements. Such gateways can provide the infrastructure information and support the agent and runtime functions described here; the dependencies involved in a task determine which information those functions require.</t>
      <t>ALTO <xref target="RFC7285"/> provides abstractions of network information for applications. ALTO path vectors <xref target="RFC9275"/> support exposure of abstract path and shared-resource information, and TIPS <xref target="RFC9569"/> supports incremental information updates. The multi-domain analytics draft <xref target="ALTO-MDA"/> considers dependent computation across domains with limited information disclosure. ACTN <xref target="RFC8453"/> provides an architecture for network abstraction and coordination across administrative boundaries. These approaches support information exposure and underlying resource management within this framework.</t>
      <t>This document brings these functions together around the evolving dependencies of an agentic activity: deriving the relevant requirements, relating domain information to the proposed collaboration, and revisiting the selected alternative as execution and infrastructure conditions change.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>Dependency and infrastructure information can reveal task objectives, sensitive data locations, workload characteristics, and operational conditions. Requests as well as responses require access control. Domain abstractions, bounded queries, and limited retention reduce unnecessary disclosure, including inference from repeated observations.</t>
      <t>Information used for selection needs integrity and an authenticated source. Misleading reachability, capacity, or readiness information can divert work, expose data to an unintended recipient, or cause denial of service. Recipients apply source and freshness checks appropriate to the decision and distinguish resource estimates from authorization to use those resources.</t>
      <t>Agent-generated plans and service responses can lead to calls to additional agents, services, or tools, or to new data transfers. Authorization is evaluated in the context of the actual operation, principal, and recipient. A delegated agent's ability to propose a dependency does not itself authorize that dependency. Domain enforcement remains with the relevant access-control and resource-management functions.</t>
      <t>Local processing may reduce data movement, but derived features and model outputs can still contain sensitive information. Data-handling policy applies to those outputs according to their content and permitted use. Adaptation preserves these restrictions when changing a service, execution location, or transfer arrangement.</t>
      <t>Recursive delegation, repeated queries, retries, and subscriptions can amplify load across domains. Quotas, cancellation propagation, bounded delegation, and authenticated update delivery help contain such effects. Diagnostic records also require protection because they may retain the dependency and resource information that exposure policies are intended to limit.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>Informative References</name>
      <reference anchor="AGW" target="https://datatracker.ietf.org/doc/html/draft-han-rtgwg-agent-gateway-intercomm-framework-02">
  <front>
    <title>Agent Gateway Intercommunication Framework</title>
    <author fullname="Zhengxin Han" initials="Z." surname="Han" role="editor">
      <organization>China Unicom</organization>
    </author>
    <author fullname="Zheng Ruan" initials="Z." surname="Ruan" role="editor">
      <organization>China Unicom</organization>
    </author>
    <author fullname="Mengyao Han" initials="M." surname="Han">
      <organization>China Unicom</organization>
    </author>
    <author fullname="Jinjie Yan" initials="J." surname="Yan">
      <organization>ZTE Corporation</organization>
    </author>
    <author fullname="Bing Liu" initials="B." surname="Liu">
      <organization>Huawei</organization>
    </author>
    <author fullname="Tao He" initials="T." surname="He">
      <organization>China Unicom</organization>
    </author>
    <author fullname="Ran Pang" initials="R." surname="Pang">
      <organization>China Unicom</organization>
    </author>
    <date month="July" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-han-rtgwg-agent-gateway-intercomm-framework-02"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="AIDIP" target="https://datatracker.ietf.org/doc/html/draft-cui-ai-agent-discovery-invocation-02">
  <front>
    <title>AI Agent Discovery and Invocation Protocol</title>
    <author fullname="Yong Cui" initials="Y." surname="Cui">
      <organization>Tsinghua University</organization>
    </author>
    <author fullname="Yihan Chao" initials="Y." surname="Chao">
      <organization>Zhongguancun Laboratory</organization>
    </author>
    <author fullname="Chenguang Du" initials="C." surname="Du">
      <organization>Zhongguancun Laboratory</organization>
    </author>
    <date month="July" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-cui-ai-agent-discovery-invocation-02"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="AIN" target="https://datatracker.ietf.org/doc/html/draft-feng-nmrg-ain-architecture-01">
  <front>
    <title>Agentic Intent Network (AIN): A Routing-Based Architecture for AI Agent Coordination at Scale</title>
    <author fullname="Chong Feng" initials="C." surname="Feng"/>
    <date month="July" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-feng-nmrg-ain-architecture-01"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="ALTO-MDA" target="https://datatracker.ietf.org/doc/html/draft-xiang-alto-multidomain-analytics-06">
  <front>
    <title>Resource Orchestration for Multi-Domain, Exascale, Geo-Distributed Data Analytics</title>
    <author fullname="Qiao Xiang" initials="Q." surname="Xiang">
      <organization>Xiamen University</organization>
    </author>
    <author fullname="Jensen Zhang" initials="J." surname="Zhang">
      <organization>Tongji/Yale University</organization>
    </author>
    <author fullname="Franck Le" initials="F." surname="Le">
      <organization>IBM</organization>
    </author>
    <author fullname="Y. Richard Yang" initials="Y. R." surname="Yang">
      <organization>Yale University</organization>
    </author>
    <author fullname="Harvey Newman" initials="H." surname="Newman">
      <organization>California Institute of Technology</organization>
    </author>
    <date month="July" year="2021"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-xiang-alto-multidomain-analytics-06"/>
<refcontent>Work in Progress</refcontent><annotation>Expired Internet-Draft; cited as prior work.</annotation></reference>
      <reference anchor="APAN" target="https://datatracker.ietf.org/doc/html/draft-zhang-rtgwg-agent-policy-aware-network-01">
  <front>
    <title>Use Cases and Requirements for AI Agent Policy-Aware Network</title>
    <author fullname="Xiaoqiu Zhang" initials="X." surname="Zhang">
      <organization>China Mobile</organization>
    </author>
    <date month="July" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-zhang-rtgwg-agent-policy-aware-network-01"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="ARN" target="https://datatracker.ietf.org/doc/html/draft-yang-rtgwg-arn-framework-08">
  <front>
    <title>Application-Responsive Network Framework</title>
    <author fullname="Feng Yang" initials="F." surname="Yang">
      <organization>China Mobile</organization>
    </author>
    <author fullname="Changwang Lin" initials="C." surname="Lin">
      <organization>New H3C Technologies</organization>
    </author>
    <date month="June" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-yang-rtgwg-arn-framework-08"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="CATPTS" target="https://datatracker.ietf.org/doc/html/draft-luan-cats-catpts-01">
  <front>
    <title>A Timescale-Aware Framework for Compute-Aware Task Placement and Traffic Steering in Heterogeneous Geo-Distributed Computing Networks</title>
    <author fullname="Qing Li" initials="Q." surname="Li">
      <organization>Pengcheng Laboratory</organization>
    </author>
    <author fullname="Zeyu Luan" initials="Z." surname="Luan">
      <organization>Pengcheng Laboratory</organization>
    </author>
    <author fullname="Zhuochen Fan" initials="Z." surname="Fan">
      <organization>Pengcheng Laboratory</organization>
    </author>
    <author fullname="Yong Jiang" initials="Y." surname="Jiang">
      <organization>Tsinghua SIGS / Pengcheng Laboratory</organization>
    </author>
    <date month="August" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-luan-cats-catpts-01"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="CATS" target="https://www.rfc-editor.org/info/rfc10053">
  <front>
    <title>A Framework for Computing-Aware Traffic Steering (CATS)</title>
    <author fullname="C. Li" initials="C." role="editor" surname="Li"/>
    <author fullname="Z. Du" initials="Z." surname="Du"/>
    <author fullname="M. Boucadair" initials="M." role="editor" surname="Boucadair"/>
    <author fullname="L. M. Contreras" initials="L. M." surname="Contreras"/>
    <author fullname="J. Drake" initials="J." surname="Drake"/>
    <date month="October" year="2026"/>
    </front>
  <seriesInfo name="RFC" value="10053"/>
  <seriesInfo name="DOI" value="10.17487/RFC10053"/>
</reference>
      <reference anchor="CATS-METRICS" target="https://datatracker.ietf.org/doc/html/draft-ietf-cats-metric-definition-14">
  <front>
    <title>CATS Metrics Definition</title>
    <author fullname="Kehan Yao" initials="K." surname="Yao"/>
    <author fullname="Cheng Li" initials="C." surname="Li"/>
    <author fullname="L. M. Contreras" initials="L. M." surname="Contreras"/>
    <author fullname="Jordi Ros-Giralt" initials="J." surname="Ros-Giralt"/>
    <author fullname="Guanming Zeng" initials="G." surname="Zeng"/>
    <date month="October" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-ietf-cats-metric-definition-14"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="CATS-SEG" target="https://datatracker.ietf.org/doc/html/draft-li-cats-task-segmentation-framework-02">
  <front>
    <title>A Task Segmentation Framework for Computing-Aware Traffic Steering</title>
    <author fullname="Chuanhuang Li" initials="C." surname="Li">
      <organization>Zhejiang Gongshang University</organization>
    </author>
    <author fullname="Junhao Wan" initials="J." surname="Wan">
      <organization>Zhejiang Gongshang University</organization>
    </author>
    <author fullname="Huaqing Tu" initials="H." surname="Tu">
      <organization>Zhejiang Gongshang University</organization>
    </author>
    <author fullname="Chuanyang Miao" initials="C." surname="Miao">
      <organization>ZTE Corporation</organization>
    </author>
    <author fullname="Yingjie Yu" initials="Y." surname="Yu">
      <organization>Zhejiang Gongshang University</organization>
    </author>
    <author fullname="Shicong Zhang" initials="S." surname="Zhang">
      <organization>China Mobile</organization>
    </author>
    <author fullname="Bo Ma" initials="B." surname="Ma">
      <organization>Zhejiang Gongshang University</organization>
    </author>
    <date month="July" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-li-cats-task-segmentation-framework-02"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="CATS-SEM" target="https://datatracker.ietf.org/doc/html/draft-zhu-cats-metric-semantics-01">
  <front>
    <title>Operational Semantics for CATS Metric Consumption</title>
    <author fullname="Mengfei Zhu" initials="M." surname="Zhu">
      <organization>China mobile</organization>
    </author>
    <date month="August" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-zhu-cats-metric-semantics-01"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="DAWN-FW" target="https://datatracker.ietf.org/doc/html/draft-zhang-dawn-agent-discovery-framework-09">
  <front>
    <title>A Framework for Agent Discovery in DAWN</title>
    <author fullname="Bin Zhang" initials="B." surname="Zhang" role="editor"/>
    <author fullname="Linda Dunbar" initials="L." surname="Dunbar"/>
    <author fullname="Yixuan Yang" initials="Y." surname="Yang" role="editor"/>
    <date month="October" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-zhang-dawn-agent-discovery-framework-09"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="DAWN-UC" target="https://datatracker.ietf.org/doc/html/draft-kay-dawn-use-cases-01">
  <front>
    <title>Use Cases and Applicability for Discovery of Agents With Names</title>
    <author fullname="Daniel King" initials="D." surname="King">
      <organization>Lancaster University</organization>
    </author>
    <author fullname="Kehan Yao" initials="K." surname="Yao">
      <organization>China Mobile</organization>
    </author>
    <author fullname="Ken Adler" initials="K." surname="Adler">
      <organization>Indeed</organization>
    </author>
    <author fullname="Rajiv Ramdhany" initials="R." surname="Ramdhany">
      <organization>BBC</organization>
    </author>
    <date month="September" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-kay-dawn-use-cases-01"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="DIN" target="https://datatracker.ietf.org/doc/html/draft-song-rtgwg-din-usecases-requirements-02">
  <front>
    <title>Distributed Inference Network (DIN) Problem Statement, Use Cases, and Requirements</title>
    <author fullname="Jian Song" initials="J." surname="Song">
      <organization>China Mobile</organization>
    </author>
    <author fullname="Weiqiang Cheng" initials="W." surname="Cheng">
      <organization>China Mobile</organization>
    </author>
    <date month="July" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-song-rtgwg-din-usecases-requirements-02"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="IDN" target="https://datatracker.ietf.org/doc/html/draft-li-cats-idn-01">
  <front>
    <title>A Framework of Intelligence Delivery Network (IDN) for Deep Learning Inference</title>
    <author fullname="Qing Li" initials="Q." surname="Li">
      <organization>Pengcheng Laboratory</organization>
    </author>
    <author fullname="Hanling Wang" initials="H." surname="Wang">
      <organization>Pengcheng Laboratory</organization>
    </author>
    <author fullname="Yong Jiang" initials="Y." surname="Jiang">
      <organization>Tsinghua Shenzhen International Graduate School &amp; Pengcheng Laboratory</organization>
    </author>
    <author fullname="Mingwei Xu" initials="M." surname="Xu">
      <organization>Tsinghua University</organization>
    </author>
    <author fullname="Gabriel-Miro Muntean" initials="G." surname="Muntean">
      <organization>Dublin City University</organization>
    </author>
    <date month="August" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-li-cats-idn-01"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="ODSI" target="https://datatracker.ietf.org/doc/html/draft-wang-cats-odsi-01">
  <front>
    <title>An Architecture for Open, Decentralized, and Scalable Large Language Model Inference</title>
    <author fullname="Hanling Wang" initials="H." surname="Wang">
      <organization>Pengcheng Laboratory</organization>
    </author>
    <author fullname="Qing Li" initials="Q." surname="Li">
      <organization>Pengcheng Laboratory</organization>
    </author>
    <author fullname="Yong Jiang" initials="Y." surname="Jiang">
      <organization>Tsinghua Shenzhen International Graduate School &amp; Pengcheng Laboratory</organization>
    </author>
    <author fullname="Mingwei Xu" initials="M." surname="Xu">
      <organization>Tsinghua University</organization>
    </author>
    <author fullname="Gabriel-Miro Muntean" initials="G." surname="Muntean">
      <organization>Dublin City University</organization>
    </author>
    <date month="August" year="2026"/>
    </front>
  <seriesInfo name="Internet-Draft" value="draft-wang-cats-odsi-01"/>
<refcontent>Work in Progress</refcontent></reference>
      <reference anchor="RFC7285" target="https://www.rfc-editor.org/info/rfc7285">
  <front>
    <title>Application-Layer Traffic Optimization (ALTO) Protocol</title>
    <author fullname="R. Alimi" initials="R." role="editor" surname="Alimi"/>
    <author fullname="R. Penno" initials="R." role="editor" surname="Penno"/>
    <author fullname="Y. Yang" initials="Y." role="editor" surname="Yang"/>
    <author fullname="S. Kiesel" initials="S." surname="Kiesel"/>
    <author fullname="S. Previdi" initials="S." surname="Previdi"/>
    <author fullname="W. Roome" initials="W." surname="Roome"/>
    <author fullname="S. Shalunov" initials="S." surname="Shalunov"/>
    <author fullname="R. Woundy" initials="R." surname="Woundy"/>
    <date month="September" year="2014"/>
    </front>
  <seriesInfo name="RFC" value="7285"/>
  <seriesInfo name="DOI" value="10.17487/RFC7285"/>
</reference>
      <reference anchor="RFC8453" target="https://www.rfc-editor.org/info/rfc8453">
  <front>
    <title>Framework for Abstraction and Control of TE Networks (ACTN)</title>
    <author fullname="D. Ceccarelli" initials="D." role="editor" surname="Ceccarelli"/>
    <author fullname="Y. Lee" initials="Y." role="editor" surname="Lee"/>
    <date month="August" year="2018"/>
    </front>
  <seriesInfo name="RFC" value="8453"/>
  <seriesInfo name="DOI" value="10.17487/RFC8453"/>
</reference>
      <reference anchor="RFC9275" target="https://www.rfc-editor.org/info/rfc9275">
  <front>
    <title>An Extension for Application-Layer Traffic Optimization (ALTO): Path Vector</title>
    <author fullname="K. Gao" initials="K." surname="Gao"/>
    <author fullname="Y. Lee" initials="Y." surname="Lee"/>
    <author fullname="S. Randriamasy" initials="S." surname="Randriamasy"/>
    <author fullname="Y. Yang" initials="Y." surname="Yang"/>
    <author fullname="J. Zhang" initials="J." surname="Zhang"/>
    <date month="September" year="2022"/>
    </front>
  <seriesInfo name="RFC" value="9275"/>
  <seriesInfo name="DOI" value="10.17487/RFC9275"/>
</reference>
      <reference anchor="RFC9473" target="https://www.rfc-editor.org/info/rfc9473">
  <front>
    <title>A Vocabulary of Path Properties</title>
    <author fullname="R. Enghardt" initials="R." surname="Enghardt"/>
    <author fullname="C. Kr&#228;henb&#252;hl" initials="C." surname="Kr&#228;henb&#252;hl"/>
    <date month="September" year="2023"/>
    </front>
  <seriesInfo name="RFC" value="9473"/>
  <seriesInfo name="DOI" value="10.17487/RFC9473"/>
</reference>
      <reference anchor="RFC9569" target="https://www.rfc-editor.org/info/rfc9569">
  <front>
    <title>The Application-Layer Traffic Optimization (ALTO) Transport Information Publication Service (TIPS)</title>
    <author fullname="K. Gao" initials="K." surname="Gao"/>
    <author fullname="R. Schott" initials="R." surname="Schott"/>
    <author fullname="Y. R. Yang" initials="Y. R." surname="Yang"/>
    <author fullname="L. Delwiche" initials="L." surname="Delwiche"/>
    <author fullname="L. Keller" initials="L." surname="Keller"/>
    <date month="September" year="2024"/>
    </front>
  <seriesInfo name="RFC" value="9569"/>
  <seriesInfo name="DOI" value="10.17487/RFC9569"/>
</reference>
    </references>
  </back>
</rfc>
