Skip to Content

Changes for page Networks

Last modified by Zenna Elfen on 2026/01/05 21:51
From version 34.1
edited by Zenna Elfen
on 2026/01/05 19:50
Change comment: There is no comment for this version
To version 15.1
edited by Zenna Elfen
on 2025/11/24 11:56
Change comment: There is no comment for this version

Summary

Details

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