Skip to Content

Changes for page Networks

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