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