aboutsummaryrefslogtreecommitdiff
path: root/content/en/docs/Overview/_index.md
blob: 019e8397f76fee2467dabe00850a0100ae1da1a3 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
---
title: "Overview"
linkTitle: "Overview"
date: 2019-10-21
weight: 10
description: >
   A bird's eye view of Ouroboros.
---

Ouroboros is a prototype **distributed system** for packetized network
communications. It is a redesign _ab initio_ of the current packet
networking model -- from the programming API ("Layer 7") almost to the
_wire_ ("Layer 1") -- without compromises. This means it's not
directly compatible with anything currently available. It can't simply
be "plugged into" the current network stack. Instead it has some
interfaces into inter-operate with common technologies: run Ouroboros
over Ethernet or UDP, or create tunnels over Ouroboros using tap or
tun devices.

Why? Because we think there are fundamental problems with the current
model (referred to as the 4-Layer, 5-Layer or 7-Layer model --
depending on who you ask). This problem is self-evident: a crippling
lack of abstraction and a complete disregard for elegance that results
in a technology that _works_ but can at best be described as an overly
complicated mess.

From an application perspective, Ouroboros network operates as a "black
box" with a
[very simple interface](https://ouroboros.rocks/man/man3/flow_alloc.3.html).
Either it provides a _flow_, a bidirectional channel that delivers data
within some requested operational parameters such as delay and
bandwidth and reliability and security; or it provides a broadcast
channel.

From an administrative perspective, an Ouroboros network is a bunch of
_daemons_ that can be thought of as **software routers** (unicast) or
**software _hubs_** (broadcast) that can be connected to each other;
again through
[a simple API](https://ouroboros.rocks/man/man8/ouroboros.8.html).
Each daemon has an address, and they forward packets among each other.
The daemons also implement their own internal name-to-address resolution.

Some of the main _features_ are:

* Ouroboros is minimal: it only sends what it needs to send to operate.

* Ouroboros adheres to the _end-to-end_ principle. Packet headers are
  immutable between the program components (state machines) that
  operate on their state. Only two protocol fields change on a
  hop-by-hop (as viewed within a network layer) basis:
  [TTL and ECN](/docs/concepts/protocols/).

* Ouroboros can establish an encrypted flow in a _single RTT_ (not
  including name-to-address resolution). The flow allocation API is a
  2-way handshake (request-response) that agrees on endpoint IDs and
  performs an ECDHE key exchange. The end-to-end protocol
  [doesn't need a handshake](/docs/concepts/protocols/#operation-of-frcp).

* The Ouroboros end-to-end protocol performs flow control, error
  control and reliable transfer and is implemented as part of the
  _application library_. Sequence numbers, acknowledgments, flow control
  windows... The last thing the application does (or should do) is
  encrypt everything before it hands it to the network layer for
  delivery. With this functionality in the library, it's easy to force
  encryption on _every_ flow that is created from your machine over
  Ouroboros regardless of what the application programmer has
  requested.

* The flow allocation API works as an interface to the network. An
  Ouroboros network layer is therefore "aware" of all traffic that it
  is offered. This allows the layer to shape and police traffic, but
  only based on quantity and QoS, not on the contents of the packets,
  to ensure _net neutrality_.

For a lot more depth, our article on the design of Ouroboros is
accessible on [arXiv](https://arxiv.org/pdf/2001.09707.pdf).

The best place to start understanding a bit what Ouroboros aims to do
and how it differs from other packet networks is to first watch this
presentation at [FOSDEM
2018](https://archive.fosdem.org/2018/schedule/event/ipc/) (it's over
two years old, so not entirely up-to-date anymore), and have a quick
read of the [flow allocation](/docs/concepts/fa/) and [data
path](/docs/concepts/datapath/) sections.

{{< youtube 6fH23l45984 >}}