<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE rfc [
  <!ENTITY nbsp  "&#160;">
  <!ENTITY zwsp  "&#8203;">
  <!ENTITY nbhy  "&#8209;">
  <!ENTITY wj    "&#8288;">
]>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude"
     version="3"
     submissionType="IETF"
     docName="draft-kolomytsev-pshmp-core-00"
     category="info"
     ipr="trust200902"
     xml:lang="en"
     symRefs="true"
     sortRefs="true"
     tocInclude="true"
     tocDepth="3">

  <front>
    <title abbrev="PSHMP Core">PSHMP Core: Decentralized L4 Overlay for Resilient Data Delivery and Proactive Self-Healing Networks</title>
    <seriesInfo name="Internet-Draft" value="draft-kolomytsev-pshmp-core-00"/>
    <author initials="A." surname="Kolomytsev" fullname="Alexander Kolomytsev">
      <organization>Independent Researcher</organization>
      <address>
        <email>kolomytsev@example.com</email>
      </address>
    </author>
    <date year="2026" month="August" day="30"/>
    <abstract>
      <t>PSHMP Core is a decentralized data delivery and proactive self-healing network core designed for distributed systems operating over existing IP infrastructure.  PSHMP Core provides an intelligent network layer above the existing IP network and enables distributed nodes to participate in dynamic multi-hop data delivery without requiring changes to the underlying Layer 3 routing infrastructure.</t>
      <t>The architecture is designed around decentralized path selection, continuous node and path assessment, dynamic relay chains, proactive recovery, and diversity-aware reconstruction of delivery paths.  The system can detect degradation of network participants and reconstruct affected delivery paths before or during service degradation.  This approach is intended to reduce recovery time, improve resilience, and maintain reliable data delivery in environments where individual nodes, paths, or network segments may become unstable.</t>
      <t>This document provides a high-level architectural overview of PSHMP Core, its primary components, operating principles, and potential application areas.  This document intentionally does not disclose implementation-specific algorithms, internal scoring details, proprietary optimization techniques, or other information that may be required for commercial implementation.</t>
    </abstract>
  </front>

  <middle>
    <section numbered="true" toc="default">
      <name>Introduction</name>
      <t>Modern distributed systems increasingly depend on network connectivity between geographically distributed nodes. Cloud infrastructure, edge computing, distributed databases, telecommunications systems, real-time applications, autonomous systems, and other network-intensive platforms may operate across networks where connectivity characteristics are not constant. Packet loss, latency variation, jitter, node failures, overloaded links, local network disruptions, and partial connectivity can significantly affect the reliability of distributed applications. Traditional network recovery mechanisms generally operate within the boundaries of the underlying network infrastructure. PSHMP Core approaches the problem from a different architectural layer. Instead of replacing the existing IP infrastructure, PSHMP Core introduces an overlay network layer capable of:</t>
      <ul spacing="normal">
        <li>evaluating the condition of participating nodes and paths;</li>
        <li>constructing dynamic multi-hop delivery chains;</li>
        <li>monitoring changes in network conditions;</li>
        <li>identifying degradation before complete failure;</li>
        <li>proactively rebuilding affected delivery paths;</li>
        <li>using alternative nodes when existing paths become unreliable;</li>
        <li>distributing network state through decentralized mechanisms;</li>
        <li>operating without requiring modifications to the underlying Layer 3 routing architecture.</li>
      </ul>
      <t>The primary objective is to provide a resilient network foundation for distributed systems rather than a standalone end-user networking product.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Scope</name>
      <t>PSHMP Core is intended as a technology foundation that can be integrated into larger distributed platforms. Potential application areas include:</t>
      <ul spacing="normal">
        <li>distributed computing platforms;</li>
        <li>edge computing;</li>
        <li>telecommunications infrastructure;</li>
        <li>resilient data delivery systems;</li>
        <li>distributed storage;</li>
        <li>real-time communication systems;</li>
        <li>IoT infrastructure;</li>
        <li>industrial and infrastructure networks;</li>
        <li>geographically distributed services;</li>
        <li>decentralized network architectures;</li>
        <li>high-availability overlay networks.</li>
      </ul>
      <t>PSHMP Core is not intended to replace the Internet Protocol or conventional IP routing. Instead, it operates above the existing IP infrastructure and provides additional mechanisms for resilient data delivery between participating nodes.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Architectural Position</name>
      <t>PSHMP Core operates as an overlay network layer above existing IP connectivity. A simplified architecture can be represented as:</t>
      <figure>
        <artwork><![CDATA[
+------------------------------------------------------+
|                  Distributed Application             |
+------------------------------------------------------+
|                     PSHMP Core                       |
|                                                      |
|  Path Selection | Chain Relay | Self-Healing        |
|  Node Evaluation | Diversity | Failure Tracking     |
+------------------------------------------------------+
|                    Existing IP Network               |
+------------------------------------------------------+
|              Physical / Virtual Infrastructure       |
+------------------------------------------------------+
]]></artwork>
      </figure>
      <t>Figure 1: PSHMP Core Architectural Position</t>
      <t>The underlying IP network remains responsible for basic connectivity. PSHMP Core uses this connectivity as a substrate for establishing logical delivery paths between participating nodes. This separation allows PSHMP Core to be introduced without requiring fundamental changes to existing Layer 3 routing.</t>
    </section>
    <section numbered="true" toc="default">
      <name>L4-Oriented Data Delivery</name>
      <t>PSHMP Core is designed as an intelligent network layer operating at the transport-oriented level of the architecture. The system does not require modification of the underlying Layer 3 routing domain in order to construct its logical delivery paths. This allows a PSHMP-enabled system to operate over different IP environments while maintaining its own logic for:</t>
      <ul spacing="normal">
        <li>path selection;</li>
        <li>relay selection;</li>
        <li>delivery-chain construction;</li>
        <li>node evaluation;</li>
        <li>failure detection;</li>
        <li>recovery;</li>
        <li>traffic adaptation.</li>
      </ul>
      <t>The resulting architecture can be described as: Application</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>PSHMP Core</t>
      <figure>
        <artwork><![CDATA[
|
]]></artwork>
      </figure>
      <t>| Dynamic logical delivery path</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Existing IP Infrastructure</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Network / Internet This model is particularly relevant for distributed systems where the application requires additional resilience beyond what can be provided by a single conventional network path.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Decentralized Data Delivery</name>
      <t>A fundamental characteristic of PSHMP Core is decentralized participation in data delivery. A conventional architecture may rely on a relatively fixed path: Source -&gt; Gateway -&gt; Server -&gt; Destination A PSHMP-based architecture can construct a logical multi-hop delivery path: Source</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay A</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay B</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay C</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Destination The participating nodes can be selected dynamically according to current network conditions. The objective is not simply to create additional hops. The objective is to create a delivery path that can adapt when the quality or availability of individual participants changes. This enables the network to treat participating nodes as a distributed pool of potential relay resources.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Dynamic Chain Relay</name>
      <t>PSHMP Core uses dynamic relay chains to construct logical multi-hop delivery paths. A relay chain consists of a sequence of participating nodes through which data can be delivered. The chain can be reconstructed when:</t>
      <ul spacing="normal">
        <li>a relay becomes unavailable;</li>
        <li>packet loss increases;</li>
        <li>latency becomes excessive;</li>
        <li>jitter increases;</li>
        <li>node quality decreases;</li>
        <li>a local network segment becomes unstable;</li>
        <li>multiple nodes within the same delivery path degrade simultaneously.</li>
      </ul>
      <t>The system can therefore move from: Source -&gt; A -&gt; B -&gt; C -&gt; Destination to: Source -&gt; A -&gt; D -&gt; E -&gt; Destination without requiring the underlying IP routing infrastructure to be redesigned. The exact path construction and optimization algorithms are implementation-specific.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Node and Path Evaluation</name>
      <t>Reliable dynamic routing requires continuous information about the condition of participating nodes. PSHMP Core includes a node evaluation mechanism based on multiple network and node characteristics. The evaluation can take into account parameters such as:</t>
      <ul spacing="normal">
        <li>packet loss;</li>
        <li>latency;</li>
        <li>jitter;</li>
        <li>node availability;</li>
        <li>recent failures;</li>
        <li>path quality;</li>
        <li>historical behavior;</li>
        <li>local network conditions.</li>
      </ul>
      <t>The resulting assessment can be used by the routing subsystem when selecting candidates for delivery paths. The purpose is to avoid treating all available nodes as equivalent. A node that is technically reachable but currently experiencing significant degradation can therefore be considered less suitable for a delivery path than a stable alternative.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Node Quality Metric (K-Factor)</name>
      <t>PSHMP Core uses a composite quality metric (referred to as K-Factor) for evaluating the condition of participating nodes. The K-Factor is an aggregate evaluation rather than a single network measurement. Conceptually:</t>
      <t>Node condition</t>
      <figure>
        <artwork><![CDATA[
|
*-- Packet loss
*-- Latency
*-- Jitter
*-- Availability
*-- Failure history
|
v
]]></artwork>
      </figure>
      <t>K-Factor</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Routing decision</t>
      <t>The K-Factor can be used to distinguish between:</t>
      <ul spacing="normal">
        <li>healthy nodes;</li>
        <li>degraded nodes;</li>
        <li>unstable nodes;</li>
        <li>nodes that should temporarily be excluded from new delivery paths.</li>
      </ul>
      <t>The exact weighting, thresholds, and internal evaluation logic are implementation-specific and are not defined by this document.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Proactive Self-Healing</name>
      <t>A central design principle of PSHMP Core is proactive recovery. Traditional recovery often follows this sequence: Failure</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Detection</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Decision</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Route reconstruction</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Recovery PSHMP Core attempts to reduce the impact of this sequence by continuously monitoring network conditions and preparing alternative delivery paths when degradation becomes apparent. The conceptual model is: Degradation detected</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Condition evaluated</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Alternative path selected</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Delivery chain reconstructed</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Traffic continues This allows the system to react not only to complete node failures but also to progressive degradation. In the current implementation, internal testing has demonstrated recovery behavior in the approximate hundreds-of-milliseconds range under the tested scenarios. Specific recovery time depends on network topology, node count, network conditions, configuration, and workload.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Local Mesh Recovery</name>
      <t>PSHMP Core includes a local mesh recovery mode designed for situations where multiple nodes within the same relay chain degrade simultaneously. The mechanism can activate locally for an affected chain instead of forcing a complete reconstruction of the surrounding network. The local mesh mode can:</t>
      <ul spacing="normal">
        <li>identify multiple degraded nodes within a chain;</li>
        <li>obtain additional relay candidates;</li>
        <li>exclude recently failed or quarantined nodes;</li>
        <li>prefer candidates from different groups;</li>
        <li>construct an alternative relay chain;</li>
        <li>validate the resulting chain;</li>
        <li>replace the affected chain atomically.</li>
      </ul>
      <t>Conceptually: Original chain: A -&gt; B -&gt; C -&gt; D -&gt; E -&gt; F B C D</t>
      <figure>
        <artwork><![CDATA[
|   |   |
+---+---+
]]></artwork>
      </figure>
      <t>degraded Local recovery: A -&gt; G -&gt; H -&gt; I -&gt; E -&gt; F G H I</t>
      <figure>
        <artwork><![CDATA[
|     |     |
]]></artwork>
      </figure>
      <t>different failure domains The purpose of diversity-aware selection is to reduce the probability that multiple relays in the newly constructed chain are affected by the same local failure condition. The internal candidate scoring and selection mechanisms are implementation-specific.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Diversity-Aware Recovery</name>
      <t>Network failures are not always independent. Several nodes may become unavailable because they share:</t>
      <ul spacing="normal">
        <li>the same physical location;</li>
        <li>the same network segment;</li>
        <li>the same infrastructure provider;</li>
        <li>the same failure domain;</li>
        <li>the same local connectivity problem.</li>
      </ul>
      <t>For this reason, simply selecting the highest-scoring available nodes may not provide sufficient resilience. PSHMP Core can apply diversity constraints during recovery. A simplified representation is: Group A Group B Group C A1 B1 C1 A2 B2 C2 A3 B3 C3</t>
      <figure>
        <artwork><![CDATA[
\       |       /
 \      |      /
  \     |     /
]]></artwork>
      </figure>
      <t>New Chain The objective is to reduce concentration of relay nodes within a single potential failure domain.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Failure Tracking</name>
      <t>PSHMP Core maintains information about recent node failures and degradation events. Repeatedly unstable nodes that are immediately reused can cause persistent recovery failures. Failure tracking reduces this risk by temporarily excluding recently failed nodes from new path construction. Failure tracking can be used to:</t>
      <ul spacing="normal">
        <li>identify repeatedly unstable nodes;</li>
        <li>temporarily exclude problematic nodes;</li>
        <li>prevent immediate reinsertion after failure;</li>
        <li>gradually rehabilitate nodes after stable operation;</li>
        <li>improve future path selection.</li>
      </ul>
      <t>A quarantine mechanism can temporarily prevent a recently failed node from immediately becoming part of a newly reconstructed path. The precise timing and failure scoring policies are implementation- specific.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Distributed Network State</name>
      <t>A decentralized network requires mechanisms for distributing information about participating nodes and network conditions. PSHMP Core incorporates decentralized state-distribution mechanisms including Gossip and DHT-oriented components. At a high level: Node A / \ / \ Node B ---- Node C</t>
      <figure>
        <artwork><![CDATA[
|             |
|             |
]]></artwork>
      </figure>
      <t>Node D ---- Node E Information about node availability and network state can propagate between participating nodes without requiring every decision to depend on a single centralized component. DHT-based candidate discovery can provide additional mechanisms for locating suitable relay candidates.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Gossip-Based Information Exchange</name>
      <t>Gossip-based information exchange can be used to distribute network state between participating nodes. The general model is: Node A</t>
      <figure>
        <artwork><![CDATA[
|
+----> Node B
|        |
]]></artwork>
      </figure>
      <t>| +----&gt; Node D</t>
      <figure>
        <artwork><![CDATA[
|
+----> Node C
         |
         +----> Node E
]]></artwork>
      </figure>
      <t>This allows information to propagate through the network without requiring a single central distribution point. Gossip can complement other discovery and coordination mechanisms within PSHMP Core.</t>
    </section>
    <section numbered="true" toc="default">
      <name>DHT-Based Candidate Discovery</name>
      <t>PSHMP Core includes DHT-oriented mechanisms for discovering potential relay candidates. The DHT layer can provide candidate information to the chain construction subsystem. Candidate selection can consider:</t>
      <ul spacing="normal">
        <li>node availability;</li>
        <li>node quality;</li>
        <li>group membership;</li>
        <li>recent failures;</li>
        <li>diversity requirements;</li>
        <li>current recovery conditions.</li>
      </ul>
      <t>The DHT layer is therefore used as a candidate discovery mechanism rather than simply as a generic distributed key-value store.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Failure-Domain Awareness</name>
      <t>PSHMP Core can associate participating nodes with logical groups. A group may represent a potential failure domain such as:</t>
      <ul spacing="normal">
        <li>geographic region;</li>
        <li>infrastructure segment;</li>
        <li>logical cluster;</li>
        <li>provider;</li>
        <li>availability zone;</li>
        <li>deployment group.</li>
      </ul>
      <t>During ordinary routing, group diversity may not be required. During recovery, however, the system can increase the importance of selecting nodes from different groups. This allows the routing system to adapt its selection policy according to the severity of network degradation.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Adaptive Recovery Policies</name>
      <t>PSHMP Core does not require a single fixed recovery policy for all network conditions. Different network conditions may require different levels of routing constraints. The recovery subsystem can therefore operate using a fallback sequence. Conceptually: Strict recovery policy</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relaxed quality requirements</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relaxed diversity requirements</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Emergency recovery The objective is to preserve connectivity whenever possible while maintaining quality constraints whenever sufficient resources are available. This approach allows the system to distinguish between:</t>
      <ul spacing="normal">
        <li>normal operation;</li>
        <li>degraded operation;</li>
        <li>multi-node failure;</li>
        <li>emergency recovery.</li>
      </ul>
    </section>
    <section numbered="true" toc="default">
      <name>Batch Acknowledgement and Gap Recovery</name>
      <t>PSHMP Core includes mechanisms designed to reduce control traffic associated with data delivery. Instead of requiring an individual acknowledgement for every transmitted unit, the receiver can report delivery state in batches and identify missing ranges. A conceptual representation is: Received: 1 2 3 4 5 7 8 9 10 Gap: 6 The receiver can communicate the missing sequence information as a gap rather than generating a separate acknowledgement exchange for every unit. This approach can reduce protocol overhead in environments where control traffic represents a significant portion of total network traffic. Internal testing has demonstrated control-traffic reductions of up to approximately 75% under specific tested conditions. Actual savings depend on traffic patterns, loss rates, packet sizes, and configuration.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Transport and Connectivity</name>
      <t>PSHMP Core is designed to operate over existing IP connectivity. The implementation includes support for transport and connectivity mechanisms suitable for distributed environments. Depending on deployment requirements, the system can integrate with:</t>
      <ul spacing="normal">
        <li>UDP-based communication;</li>
        <li>TCP-based communication;</li>
        <li>TLS/DTLS-protected channels;</li>
        <li>WebRTC DataChannel;</li>
        <li>TURN-assisted connectivity.</li>
      </ul>
      <t>The purpose of these mechanisms is to provide transport flexibility while preserving the higher-level PSHMP routing and recovery model.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Security Considerations</name>
      <t>A decentralized network architecture must account for malicious or unstable participants. PSHMP Core includes mechanisms intended to mitigate several classes of network abuse. These mechanisms include:</t>
      <ul spacing="normal">
        <li>rate limiting;</li>
        <li>connection controls;</li>
        <li>Proof-of-Work mechanisms;</li>
        <li>authenticated and encrypted transport options;</li>
        <li>failure tracking;</li>
        <li>temporary node quarantine.</li>
      </ul>
      <t>PSHMP Core is not intended to replace conventional cryptographic security mechanisms. Deployments should use authentication, encryption, and identity management appropriate to their environment. The exact security model depends on the deployment architecture and trust model. PSHMP Core should not be considered a complete security system by itself. Applications integrating PSHMP Core should implement additional authentication, authorization, identity management, and operational security controls appropriate to their environment.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Scalability</name>
      <t>PSHMP Core is designed with distributed deployment in mind. The architecture includes components intended to support larger node populations through:</t>
      <ul spacing="normal">
        <li>distributed state propagation;</li>
        <li>DHT-based discovery;</li>
        <li>sharding;</li>
        <li>decentralized candidate selection;</li>
        <li>optional coordinated cluster mechanisms.</li>
      </ul>
      <t>The current implementation has been tested using network simulations involving thousands of nodes. Internal testing has included configurations exceeding 5,000 simulated or emulated nodes. Performance and scalability characteristics depend heavily on topology, workload, network conditions, and implementation configuration. The numbers described in this document should therefore be interpreted as implementation test results rather than protocol guarantees.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Current Implementation</name>
      <t>PSHMP Core is currently implemented in Go. The current implementation includes approximately:</t>
      <ul spacing="normal">
        <li>15,900+ lines of Go code;</li>
        <li>90+ Go source files;</li>
        <li>dynamic chain relay;</li>
        <li>DHT-based candidate selection;</li>
        <li>Gossip integration;</li>
        <li>K-Factor node evaluation;</li>
        <li>Self-Healing Engine;</li>
        <li>local mesh recovery;</li>
        <li>diversity-aware candidate selection;</li>
        <li>failure tracking;</li>
        <li>quarantine and rehabilitation;</li>
        <li>adaptive recovery policies;</li>
        <li>sharding support;</li>
        <li>optional Raft-based coordination;</li>
        <li>WebRTC connectivity;</li>
        <li>Prometheus metrics;</li>
        <li>Docker-based deployment support.</li>
      </ul>
      <t>The implementation is currently positioned as a Pilot-Ready MVP and technology foundation rather than a finished mass-market product.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Implementation Architecture</name>
      <t>A simplified implementation view is:</t>
      <figure>
        <artwork><![CDATA[
       +----------------------+
       |   Application Layer  |
       +----------+-----------+
                  |
                  v
       +----------------------+
       |      PSHMP Core      |
       |                      |
       |  Chain Relay         |
       |  Path Selection      |
       |  Self-Healing        |
       |  K-Factor            |
       |  Local Mesh          |
       +----------+-----------+
                  |
+-----------------+-----------------+
|                 |                 |
]]></artwork>
      </figure>
      <t>v v v</t>
      <figure>
        <artwork><![CDATA[
+---------+       +---------+       +---------+
|   DHT   |       | Gossip  |       | Failure |
| Discovery|      |  State  |       | Tracker |
+---------+       +---------+       +---------+
     |                 |                 |
     +-----------------+-----------------+
                       |
                       v
            +----------------------+
            | Existing IP Network  |
            +----------------------+
]]></artwork>
      </figure>
      <t>This diagram represents the conceptual architecture only. Implementation details and internal module interfaces are intentionally omitted.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Example Operational Scenario</name>
      <t>Consider a distributed system using six relay nodes: Source</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay A</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay B</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay C</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay D</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay E</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Destination Suppose Relay B, Relay C, and Relay D begin experiencing degradation. The PSHMP Core can detect the degradation through node and path evaluation. Instead of continuing to use the affected chain indefinitely, the recovery subsystem can:</t>
      <ul spacing="normal">
        <li>identify the degraded nodes;</li>
        <li>activate local mesh recovery;</li>
        <li>obtain alternative candidates through decentralized discovery;</li>
        <li>exclude recently failed or quarantined candidates;</li>
        <li>apply diversity-aware selection;</li>
        <li>construct a replacement chain;</li>
        <li>validate the resulting chain;</li>
        <li>replace the affected path.</li>
      </ul>
      <t>The resulting path may become: Source</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay A</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay F</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay G</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay H</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Relay E</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Destination The underlying IP network remains unchanged. Only the logical delivery path maintained by PSHMP Core changes.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Performance Characteristics</name>
      <t>Internal testing of the current implementation has produced the following representative results:</t>
      <figure>
        <artwork><![CDATA[
+----------------------------+----------------------------------+
| Characteristic             | Observed result                  |
+----------------------------+----------------------------------+
| Tested node population     | 5,000+ nodes                     |
| Packet loss scenario       | up to 25%                        |
| Delivery in tested scenario| 100%                             |
| Recovery behavior          | hundreds of milliseconds range   |
| Control-traffic reduction  | up to 75%                        |
| Local mesh recovery        | implemented                      |
| Diversity-aware recovery   | implemented                      |
| DHT candidate discovery    | implemented                      |
| Failure tracking           | implemented                      |
+----------------------------+----------------------------------+
]]></artwork>
      </figure>
      <t>These values represent internal implementation testing. They are not protocol-level guarantees and should not be interpreted as universal performance benchmarks. Independent validation under production network conditions is required before making deployment-specific performance claims.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Potential Benefits</name>
      <t>Integration of PSHMP Core into a distributed platform can provide several potential operational benefits.</t>
      <section numbered="true" toc="default">
        <name>Reduced Recovery Time</name>
        <t>Proactive path reconstruction can reduce the period during which degraded nodes affect data delivery.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Improved Network Resilience</name>
        <t>Dynamic multi-hop paths provide additional options when individual nodes or network segments become unavailable.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Reduced Dependence on Individual Components</name>
        <t>Decentralized candidate discovery and dynamic relay selection can reduce dependence on fixed network paths or individual infrastructure components.</t>
      </section>
      <section numbered="true" toc="default">
        <name>More Efficient Control Traffic</name>
        <t>Batch acknowledgement and gap-based reporting can reduce protocol overhead in appropriate traffic scenarios.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Infrastructure Reuse</name>
        <t>Because PSHMP Core operates over existing IP connectivity, it can potentially be integrated without replacing the underlying network infrastructure.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Adaptive Recovery</name>
        <t>Local mesh recovery and fallback policies allow the system to adapt its behavior to the severity of network degradation.</t>
      </section>
    </section>
    <section numbered="true" toc="default">
      <name>Integration Model</name>
      <t>PSHMP Core is intended to be integrated into an existing distributed platform rather than deployed as an isolated consumer application. A potential integration model is: Existing Platform</t>
      <figure>
        <artwork><![CDATA[
|
+----------------------+
|                      |
]]></artwork>
      </figure>
      <t>v v Application Logic PSHMP Core</t>
      <figure>
        <artwork><![CDATA[
|
v
]]></artwork>
      </figure>
      <t>Existing Network The integrating company can retain ownership of:</t>
      <ul spacing="normal">
        <li>application logic;</li>
        <li>user-facing services;</li>
        <li>infrastructure;</li>
        <li>identity systems;</li>
        <li>deployment model;</li>
        <li>commercial product.</li>
      </ul>
      <t>PSHMP Core provides the underlying network resilience layer.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Deployment Considerations</name>
      <t>A production deployment should evaluate:</t>
      <ul spacing="normal">
        <li>network topology;</li>
        <li>node density;</li>
        <li>expected packet loss;</li>
        <li>latency characteristics;</li>
        <li>failure domains;</li>
        <li>security requirements;</li>
        <li>node identity;</li>
        <li>discovery mechanisms;</li>
        <li>operational monitoring;</li>
        <li>capacity requirements.</li>
      </ul>
      <t>PSHMP Core should be evaluated through controlled pilot deployments before production-wide adoption.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Monitoring and Observability</name>
      <t>The current implementation includes operational observability mechanisms. Relevant metrics can include:</t>
      <ul spacing="normal">
        <li>node condition;</li>
        <li>path condition;</li>
        <li>recovery events;</li>
        <li>chain reconstruction;</li>
        <li>mesh activation;</li>
        <li>candidate selection;</li>
        <li>failure events;</li>
        <li>network traffic;</li>
        <li>protocol-level statistics.</li>
      </ul>
      <t>Prometheus-compatible metrics are supported by the current implementation. Example conceptual events: [MESH] enabled [MESH] rebuild [MESH] disabled The exact logging and metric schema is implementation-specific.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Interoperability</name>
      <t>PSHMP Core is designed to operate over conventional IP networks. Its overlay-oriented architecture allows it to coexist with existing:</t>
      <ul spacing="normal">
        <li>routers;</li>
        <li>switches;</li>
        <li>cloud networks;</li>
        <li>virtual networks;</li>
        <li>data centers;</li>
        <li>edge infrastructure;</li>
        <li>telecommunications infrastructure.</li>
      </ul>
      <t>The system does not require the underlying network to implement PSHMP-specific Layer 3 routing.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Design Principles</name>
      <t>The architecture is based on several principles.</t>
      <section numbered="true" toc="default">
        <name>Decentralization</name>
        <t>Network state and candidate discovery should not depend exclusively on a single centralized component.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Proactive Recovery</name>
        <t>Network degradation should be treated as a signal for recovery rather than waiting exclusively for complete failure.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Dynamic Paths</name>
        <t>Delivery paths should adapt to changing network conditions.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Diversity</name>
        <t>Recovery should consider potential shared failure domains rather than only individual node quality.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Layer Independence</name>
        <t>The overlay should operate above existing IP infrastructure without requiring changes to the underlying routing domain.</t>
      </section>
      <section numbered="true" toc="default">
        <name>Graceful Degradation</name>
        <t>When ideal candidates are unavailable, the system should progressively relax recovery constraints while attempting to preserve connectivity.</t>
      </section>
    </section>
    <section numbered="true" toc="default">
      <name>Limitations</name>
      <t>PSHMP Core does not eliminate all network failures. The system cannot guarantee connectivity when insufficient network resources are available or when the underlying network becomes completely disconnected. Performance depends on:</t>
      <ul spacing="normal">
        <li>topology;</li>
        <li>available relay nodes;</li>
        <li>network quality;</li>
        <li>node distribution;</li>
        <li>workload;</li>
        <li>configuration;</li>
        <li>implementation environment.</li>
      </ul>
      <t>The recovery times and traffic reductions presented in this document are based on internal testing and should be independently validated for production environments.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Security and Trust Model</name>
      <t>A deployment must define how participating nodes are authenticated and trusted. Possible deployment models include:</t>
      <ul spacing="normal">
        <li>trusted private networks;</li>
        <li>controlled infrastructure;</li>
        <li>federated environments;</li>
        <li>authenticated distributed networks.</li>
      </ul>
      <t>For untrusted environments, additional mechanisms may be required for:</t>
      <ul spacing="normal">
        <li>node identity;</li>
        <li>authorization;</li>
        <li>cryptographic authentication;</li>
        <li>key management;</li>
        <li>abuse prevention;</li>
        <li>isolation of malicious participants.</li>
      </ul>
      <t>The current document does not define a universal trust model.</t>
    </section>
    <section numbered="true" toc="default">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Terminology</name>
      <t>The following terms are used throughout this document. PSHMP Core The network core described by this document. Overlay A logical network operating over an existing underlying network. Relay A participating node that forwards data between other nodes. Relay Chain A dynamically constructed sequence of relay nodes used for data delivery. K-Factor An aggregate composite metric representing node quality and stability. Self-Healing Automatic reconstruction or replacement of degraded delivery paths. Local Mesh A recovery mode operating on an affected relay chain using alternative relay candidates. Diversity Selection of nodes from different logical groups or potential failure domains. Failure Tracker A subsystem maintaining information about recent node failures and degradation. DHT A distributed mechanism for discovering participating nodes and candidate resources. Gossip A distributed state propagation mechanism between participating nodes.</t>
    </section>
    <section numbered="true" toc="default">
      <name>Conclusion</name>
      <t>PSHMP Core is a decentralized data delivery and proactive self- healing network core designed for distributed systems operating over existing IP infrastructure. Its architecture combines:</t>
      <ul spacing="normal">
        <li>decentralized data delivery;</li>
        <li>L4-oriented overlay networking;</li>
        <li>dynamic relay chains;</li>
        <li>continuous node evaluation;</li>
        <li>K-Factor-based routing decisions;</li>
        <li>proactive self-healing;</li>
        <li>local mesh recovery;</li>
        <li>diversity-aware path reconstruction;</li>
        <li>failure tracking;</li>
        <li>DHT-based candidate discovery;</li>
        <li>Gossip-based state propagation;</li>
        <li>adaptive recovery policies.</li>
      </ul>
      <t>The core objective is to provide distributed platforms with an additional network resilience layer without requiring replacement of the underlying IP infrastructure. The current implementation demonstrates the feasibility of the architecture through internal testing and a working Go implementation. PSHMP Core is intended to serve as a technology foundation that can be integrated into larger distributed systems, telecommunications platforms, edge infrastructure, and other network-intensive environments. The implementation is available for technical evaluation, pilot integration, and further development.</t>
    </section>
  </middle>

  <back>
    <references>
      <name>References</name>
      <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119">
        <front>
          <title>Key words for use in RFCs to Indicate Requirement Levels</title>
          <author fullname="S. Bradner" initials="S." surname="Bradner"/>
          <date month="March" year="1997"/>
        </front>
        <seriesInfo name="BCP" value="14"/>
        <seriesInfo name="RFC" value="2119"/>
        <seriesInfo name="DOI" value="10.17487/RFC2119"/>
      </reference>
      <reference anchor="RFC768" target="https://www.rfc-editor.org/info/rfc768">
        <front>
          <title>User Datagram Protocol</title>
          <author fullname="J. Postel" initials="J." surname="Postel"/>
          <date month="August" year="1980"/>
        </front>
        <seriesInfo name="STD" value="6"/>
        <seriesInfo name="RFC" value="768"/>
        <seriesInfo name="DOI" value="10.17487/RFC768"/>
      </reference>
      <reference anchor="RFC8446" target="https://www.rfc-editor.org/info/rfc8446">
        <front>
          <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
          <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
          <date month="August" year="2018"/>
        </front>
        <seriesInfo name="RFC" value="8446"/>
        <seriesInfo name="DOI" value="10.17487/RFC8446"/>
      </reference>
    </references>
  </back>
</rfc>
