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