Changes for page Networks
Last modified by Zenna Elfen on 2026/01/05 21:51
From version 27.1
edited by Zenna Elfen
on 2026/01/05 19:45
on 2026/01/05 19:45
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,30 +1,15 @@ 1 -(% class=" jumbotron" %)1 +(% class="box" %) 2 2 ((( 3 -(% class="container" %) 4 -((( 5 -= Peer-for-Peer Networks = 3 +This page contains an overview of all P4P Networks in this wiki and their building blocks. 6 6 7 - P4P, shortfor Peer-4-Peer (which inturn isshortforPeer-for-Peer)area family of networks which buildon principles of local-first, peer-2-peer,open-source, routing agnostic (offline-first) and mutual-aid principles.Theaboveis a lot of termswhich inand of themselvescarryalotofmeaning, yetwhen combinedtheyenablecensorship-resistant, resilient andadaptive, sustainable and energy-efficient communicationinfrastructures.5 +You can also [[add a P4P Network>>doc:Projects.WebHome]] or have a look at the [[P4P Applications>>doc:P4P.Applications.WebHome]]. 8 8 ))) 9 -))) 10 10 11 11 12 -(% class="col-xs-12 col-sm-4" %) 13 -((( 14 -{{box title="==== Contents ==== 15 15 16 -====== ======"}} 17 -{{toc depth="3"/}} 18 -{{/box}} 19 -))) 20 20 21 21 22 -(% class="box" %) 23 -((( 24 -This page contains an overview of all P4P Networks in this wiki and their building blocks. 25 25 26 -You can also [[add a P4P Network>>doc:Projects.WebHome]] or have a look at the [[P4P Applications>>doc:P4P.Applications.WebHome]]. 27 -))) 28 28 29 29 30 30 ... ... @@ -31,7 +31,6 @@ 31 31 32 32 33 33 34 -((( 35 35 == Building Blocks of P4P Networks == 36 36 37 37 ... ... @@ -88,92 +88,77 @@ 88 88 * Examples: PKI, Distributed Identities (DIDs), Web-of-Trust, TOFU (SSH-style), Verifiable Credentials (VCs), Peer key fingerprints (libp2p PeerIDs), Key transparency logs 89 89 90 90 91 - 92 92 ==== **6. Transport Layer** ==== 93 93 94 94 > This layer provides logical connections and flow control. QUIC and WebRTC bring modern congestion control and encryption defaults; Interpeer explores transport beyond IP assumptions. 95 95 96 -* //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? 97 97 * Examples: TCP, UDP, QUIC, SCTP, WebRTC DataChannels, Interpeer transport stack 98 98 99 99 100 - 101 101 ==== **7. Underlying Transport (Physical/Link Layer)** ==== 102 102 103 103 > Highly relevant for **offline-first / edge networks**, device-to-device communication, and mesh networks and relates to the hardware which facilitates connections. 104 104 105 -* //How does data move across the medium?//87 +* How does data move across the medium? 106 106 * Examples: Ethernet, Wi-Fi Direct / Wi-Fi Aware (post-AWDL), Bluetooth Mesh, LoRa, NFC, Cellular, CSMA/CA, TDMA, FHSS 107 107 108 - 109 - 110 110 ==== **8. Session & Connection Management** ==== 111 111 112 112 > Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation—especially important in lossy or mobile networks. 113 113 114 -* //How are connections initiated, authenticated, resumed, and kept alive?//94 +* How are connections initiated, authenticated, resumed, and kept alive? 115 115 * Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets 116 116 117 117 118 - 119 119 ==== **9. Content Addressing** ==== 120 120 121 121 > Content addressing ensures **immutability, verifiability, and deduplication**. Identity of data = cryptographic hash, enabling offline-first and tamper-evident systems. 122 122 123 -* //How is data addressed and verified by content, not location?//102 +* How is data addressed and verified by content, not location? 124 124 * Examples: IPFS CIDs, BitTorrent infohashes, Git hashes, SHA-256 addressing, Named Data Networking (NDN) 125 125 126 - 127 - 128 128 ==== **10. P2P Connectivity** ==== 129 129 130 -> Connectivity ensures peers bypass NATs/firewalls to reach each other. 107 +> Connectivity ensures peers bypass NATs/firewalls to reach each other. 131 131 132 -* //How can two peers connect directly across networks, firewalls, and NATs?//109 +* How can two peers connect directly across networks, firewalls, and NATs? 133 133 * Examples: IPv6 direct, NAT Traversal, STUN, TURN, ICE (used in WebRTC), UDP hole punching, UPnP 134 134 135 - 136 - 137 137 ==== **11. Session & Connection Management** ==== 138 138 139 139 > Manages **connection lifecycle**, including authentication handshakes, reconnection after drops, and session continuation. 140 140 141 -* //How are connections initiated, authenticated, resumed, and kept alive?//116 +* How are connections initiated, authenticated, resumed, and kept alive? 142 142 * Examples: TLS handshake semantics, Noise IK/XX patterns, session tokens, keep-alive heartbeats, reconnection strategies, session resumption tickets 143 143 144 - 145 - 146 146 ==== **12. Message Format & Serialization** ==== 147 147 148 148 > Serialization ensures **portable data representation**, forward-compatible schemas, and efficient messaging. IPLD provides content-addressed structuring for P2P graph data. 149 149 150 -* //How is data encoded, structured, and made interoperable between peers?//123 +* How is data encoded, structured, and made interoperable between peers? 151 151 * Examples: CBOR, Protocol Buffers, Cap’n Proto, JSON, ASN.1, IPLD schemas, Flatbuffers 152 152 153 - 154 - 155 155 ==== **13. File / Blob Synchronization** ==== 156 156 157 157 > 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. 158 158 159 - //How are large objects transferred and deduplicated efficiently across peers?//130 +How are large objects transferred and deduplicated efficiently across peers? 160 160 Examples: BitTorrent chunking, IPFS block-store, NDN segments, rsync-style delta sync, ZFS send-receive, streaming blob transfers 161 161 162 - 163 163 ==== **14. Local Storage & Processing Primitives** ==== 164 164 165 165 > Provides durable on-device state and local computation (event sourcing, materialization, compaction). Enables offline-first writes and deterministic replay. 166 166 167 -* //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? 168 168 * Examples: RocksDB, LevelDB, SQLite, LMDB, local WALs/append-only logs, embedded stream processors (NATS Core JetStream mode, Actyx-like edge runtimes), Kafka-like libraries 169 169 170 170 171 - 172 172 ==== **15. Crash Resilience & Abortability** ==== 173 173 174 174 > 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. 175 175 176 -* //How do nodes recover and maintain correctness under failure?//145 +* How do nodes recover and maintain correctness under failure? 177 177 * Examples: WALs, idempotent ops, partial log replay, transactional journaling, write fences 178 178 179 179 ... ... @@ -185,14 +185,7 @@ 185 185 [[Flowchart depicting distributed network variants, under development. Building on work from Z. Elfen, 2024: ~[~[https:~~~~/~~~~/doi.org/10.17613/naj7d-6g984~>~>https://doi.org/10.17613/naj7d-6g984~]~]>>image:P4P_Typology.png||alt="Flowchart depicting typologies of distributed networks, such as Friend-2-Friend, Grassroots Networks, Federated Networks, Local-First, P2P and P4P Networks" data-xwiki-image-style-alignment="center" height="649" width="639"]] 186 186 187 187 188 - 189 -))) 190 190 191 - 192 -((( 193 193 == Overview of P4P Networks == 194 194 195 195 {{include reference="Projects.WebHome"/}} 196 -))) 197 - 198 -