Changes for page Networks
Last modified by Zenna Elfen on 2026/01/05 21:51
From version 53.1
edited by Zenna Elfen
on 2026/01/05 20:27
on 2026/01/05 20:27
Change comment:
There is no comment for this version
To version 15.1
edited by Zenna Elfen
on 2025/11/24 11:56
on 2025/11/24 11:56
Change comment:
There is no comment for this version
Summary
-
Page properties (1 modified, 0 added, 0 removed)
Details
- Page properties
-
- Content
-
... ... @@ -1,14 +1,9 @@ 1 -(% class=" jumbotron" %)1 +(% class="box" %) 2 2 ((( 3 -(% class="container" %) 4 -((( 5 -= Building Blocks of P4P Networks = 3 +This page contains an overview of all P4P Networks in this wiki and their building blocks. 6 6 7 -Making a P4P network is a bit different than traditional communication networks, namely because we side-step the traditional confinement of the internet layers and connect in a variety of means, from bluetooth to sneakernet and beyond. This is of course very nice in a variety of circumstances and to read more about the principles and capabilities of P4P networks, see the about page. 8 - 9 -To fully assemble a P4P network one needs a few different building blocks, below is an overview of 15 of those building blocks. This outline of 15 building blocks has been collaboratively developed. If you see something missing or would like to give feedback, please reach out to Zenna. Now, let's dive into the building-blocks which make P4P protocols. 5 +You can also [[add a P4P Network>>doc:Projects.WebHome]] or have a look at the [[P4P Applications>>doc:P4P.Applications.WebHome]]. 10 10 ))) 11 -))) 12 12 13 13 14 14 ... ... @@ -17,11 +17,17 @@ 17 17 18 18 19 19 20 -(% class="row" %) 15 + 16 + 17 + 18 + 19 +== Building Blocks of P4P Networks == 20 + 21 + 22 +(% class="box" %) 21 21 ((( 22 -(% class="col-xs-12 col-sm-8" %) 23 -((( 24 -== 15 Building Blocks of P4P Networks == 24 +To fully assemble a P4P network one needs a few different building blocks, below is an overview of 15 of those building blocks. Lost in translation? Take a look at the [[terminology>>doc:P4P.Definitions.WebHome]]. 25 +))) 25 25 26 26 27 27 ==== **1. Data Synchronization** ==== ... ... @@ -71,115 +71,82 @@ 71 71 * Examples: PKI, Distributed Identities (DIDs), Web-of-Trust, TOFU (SSH-style), Verifiable Credentials (VCs), Peer key fingerprints (libp2p PeerIDs), Key transparency logs 72 72 73 73 74 - 75 75 ==== **6. Transport Layer** ==== 76 76 77 77 > This layer provides logical connections and flow control. QUIC and WebRTC bring modern congestion control and encryption defaults; Interpeer explores transport beyond IP assumptions. 78 78 79 -* //How do peers establish end-to-end byte streams and reliable delivery?//79 +* How do peers establish end-to-end byte streams and reliable delivery? 80 80 * Examples: TCP, UDP, QUIC, SCTP, WebRTC DataChannels, Interpeer transport stack 81 81 82 82 83 - 84 84 ==== **7. Underlying Transport (Physical/Link Layer)** ==== 85 85 86 86 > Highly relevant for **offline-first / edge networks**, device-to-device communication, and mesh networks and relates to the hardware which facilitates connections. 87 87 88 -* //How does data move across the medium?//87 +* How does data move across the medium? 89 89 * Examples: Ethernet, Wi-Fi Direct / Wi-Fi Aware (post-AWDL), Bluetooth Mesh, LoRa, NFC, Cellular, CSMA/CA, TDMA, FHSS 90 90 91 - 92 - 93 93 ==== **8. Session & Connection Management** ==== 94 94 95 95 > Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation—especially important in lossy or mobile networks. 96 96 97 -* //How are connections initiated, authenticated, resumed, and kept alive?//94 +* How are connections initiated, authenticated, resumed, and kept alive? 98 98 * Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets 99 99 100 100 101 - 102 102 ==== **9. Content Addressing** ==== 103 103 104 104 > Content addressing ensures **immutability, verifiability, and deduplication**. Identity of data = cryptographic hash, enabling offline-first and tamper-evident systems. 105 105 106 -* //How is data addressed and verified by content, not location?//102 +* How is data addressed and verified by content, not location? 107 107 * Examples: IPFS CIDs, BitTorrent infohashes, Git hashes, SHA-256 addressing, Named Data Networking (NDN) 108 108 109 - 110 - 111 111 ==== **10. P2P Connectivity** ==== 112 112 113 -> Connectivity ensures peers bypass NATs/firewalls to reach each other. 107 +> Connectivity ensures peers bypass NATs/firewalls to reach each other. 114 114 115 -* //How can two peers connect directly across networks, firewalls, and NATs?//109 +* How can two peers connect directly across networks, firewalls, and NATs? 116 116 * Examples: IPv6 direct, NAT Traversal, STUN, TURN, ICE (used in WebRTC), UDP hole punching, UPnP 117 117 118 - 119 - 120 120 ==== **11. Session & Connection Management** ==== 121 121 122 122 > Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation. 123 123 124 -* //How are connections initiated, authenticated, resumed, and kept alive?//116 +* How are connections initiated, authenticated, resumed, and kept alive? 125 125 * Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets 126 126 127 - 128 - 129 129 ==== **12. Message Format & Serialization** ==== 130 130 131 131 > Serialization ensures **portable data representation**, forward-compatible schemas, and efficient messaging. IPLD provides content-addressed structuring for P2P graph data. 132 132 133 -* //How is data encoded, structured, and made interoperable between peers?//123 +* How is data encoded, structured, and made interoperable between peers? 134 134 * Examples: CBOR, Protocol Buffers, Cap’n Proto, JSON, ASN.1, IPLD schemas, Flatbuffers 135 135 136 - 137 - 138 138 ==== **13. File / Blob Synchronization** ==== 139 139 140 140 > Bulk data syncing has **different trade-offs** than small collaborative state (chunking, deduplication, partial transfer, resume logic). Critical for media and archival P2P use-cases. 141 141 142 - //How are large objects transferred and deduplicated efficiently across peers?//130 +How are large objects transferred and deduplicated efficiently across peers? 143 143 Examples: BitTorrent chunking, IPFS block-store, NDN segments, rsync-style delta sync, ZFS send-receive, streaming blob transfers 144 144 145 - 146 146 ==== **14. Local Storage & Processing Primitives** ==== 147 147 148 148 > Provides durable on-device state and local computation (event sourcing, materialization, compaction). Enables offline-first writes and deterministic replay. 149 149 150 -* //How do nodes persist, index, and process data locally—without external servers?//137 +* How do nodes persist, index, and process data locally—without external servers? 151 151 * Examples: RocksDB, LevelDB, SQLite, LMDB, local WALs/append-only logs, embedded stream processors (NATS Core JetStream mode, Actyx-like edge runtimes), Kafka-like libraries 152 152 153 153 154 - 155 155 ==== **15. Crash Resilience & Abortability** ==== 156 156 157 157 > Ensures P2P apps don’t corrupt state on crashes. Tied to **local storage & stream-processing**, and critical in offline-first and distributed update pipelines. Abortability is the updated term for Atomicity as part of the ACID abbreviation. 158 158 159 -* //How do nodes recover and maintain correctness under failure?//145 +* How do nodes recover and maintain correctness under failure? 160 160 * Examples: WALs, idempotent ops, partial log replay, transactional journaling, write fences 161 161 162 162 163 163 164 - 165 -))) 166 166 167 - 168 - 169 - 170 - 171 - 172 - 173 -(% class="col-xs-12 col-sm-4" %) 174 -((( 175 -{{box title=" **Contents**"}} 176 -{{toc depth="5"/}} 177 -{{/box}} 178 -))) 179 - 180 - 181 -(% class="col-xs-12 col-sm-12" %) 182 -((( 183 183 == Distributed Network Types == 184 184 185 185 ... ... @@ -190,12 +190,3 @@ 190 190 == Overview of P4P Networks == 191 191 192 192 {{include reference="Projects.WebHome"/}} 193 -))) 194 - 195 - 196 - 197 - 198 - 199 - 200 - 201 -)))