Changes for page Networks

Summary

• Page properties (1 modified, 0 added, 0 removed)

Details

Page properties

Content

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