Changes for page Networks

Last modified by Zenna Elfen on 2026/01/05 21:51

From version 15.1
edited by Zenna Elfen
on 2025/11/24 11:56
Change comment: There is no comment for this version
To version 55.1
edited by Zenna Elfen
on 2026/01/05 20:27
Change comment: There is no comment for this version

Summary

Details

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